Polyhedra, Moduli,
and Quantum Geometry

Web working edition

On this page
  1. 31.1 A transfer estimate with both inputs explicit
  2. 31.2 An unconditional sublinear consequence of the Dini condition
  3. 31.3 Fixed zero-free half-planes and the recent quasi-RH claims
  4. 31.4 Logarithmic geometric savings
  5. 31.5 Power-saving geometric discrepancies and established benchmarks
  6. 31.6 The remaining geometric obstruction

31 Arithmetic cancellation and the geometric remainder

31.1 A transfer estimate with both inputs explicit

Let B⊂ℝ2B\subset\mathbb R^2 be a fixed convex body containing the origin in its interior, and normalize its gauge so that the shortest nonzero integer vector has gauge one. Put AB(u)=#(uB∩(ℤ2\{0})),ΔB(u)=AB(u)−aBu2,aB=Area⁡(B),A_B(u)=\#\bigl(uB\cap(\mathbb Z^2\setminus\{0\})\bigr),\qquad \Delta_B(u)=A_B(u)-a_Bu^2,\qquad a_B=\operatorname{Area}(B), and write PB(L)=#(LB∩ℤprim2),EB(L)=PB(L)−aBζ(2)L2.P_B(L)=\#\bigl(LB\cap\mathbb Z^2_{\mathrm{prim}}\bigr),\qquad E_B(L)=P_B(L)-\frac{a_B}{\zeta(2)}L^2. All primitive vectors are counted with their signs; an unoriented count for a centrally symmetric body is half this count. The count ABA_B is A0A_0 of Section 30.1, and ΔB\Delta_B is its all-point discrepancy DBD_B. The earlier torus count AXA_X in Section 29.1 includes the origin and uses hyperbolic length units; the conversion to the unit-shortest-vector gauge is given at the end of this section.

There are two inputs in the primitive problem: the geometric discrepancy ΔB\Delta_B, and cancellation in the Möbius function. A quantitative bound for the second input does not by itself specify the first. The following elementary estimate keeps their roles separate.

Proposition 31.1 (A large-divisor transfer estimate). Suppose M(x):=∑n≤xμ(n),|M(x)|≤Cxη(x),M(x):=\sum_{n\le x}\mu(n),\qquad |M(x)|\le Cx\eta(x), where η\eta is nonnegative and nonincreasing on [1,∞)[1,\infty). Then, for every integer 1≤D≤L1\le D\le L, |EB(L)|≪B,C∑d≤D|ΔB(L/d)|+L2Dη(D).|E_B(L)|\ll_{B,C} \sum_{d\le D}|\Delta_B(L/d)| +\frac{L^2}{D}\eta(D).(31.1) In particular, M(x)≪xθM(x)\ll x^\theta, with 0≤θ<10\le\theta<1, gives |EB(L)|≪B,θ∑d≤D|ΔB(L/d)|+L2Dθ−2.|E_B(L)|\ll_{B,\theta} \sum_{d\le D}|\Delta_B(L/d)|+L^2D^{\theta-2}.(31.2)

Proof. Möbius inversion gives PB(L)=∑d≤Lμ(d)AB(L/d).P_B(L)=\sum_{d\le L}\mu(d)A_B(L/d). Set U=L/DU=L/D. Reversing the order of summation in its large-divisor part gives the exact identity ∑d>Dμ(d)AB(L/d)=∑m∈ℤ2\{0}∥m∥B≤U(M(L∥m∥B)−M(D)).\sum_{d>D}\mu(d)A_B(L/d) =\sum_{\substack{m\in\mathbb Z^2\setminus\{0\}\\\|m\|_B\le U}} \left(M\!\left(\frac{L}{\|m\|_B}\right)-M(D)\right). The summands with ⌊L/∥m∥B⌋=D\lfloor L/\|m\|_B\rfloor=D are zero. Since AB(u)≪Bu2A_B(u)\ll_B u^2 for u≥1u\ge1, partial summation gives ∑m≠0∥m∥B≤U∥m∥B−1≪BU.\sum_{\substack{m\ne0\\\|m\|_B\le U}}\|m\|_B^{-1}\ll_B U. Monotonicity of η\eta therefore bounds the large-divisor part by η(D)(L∑0<∥m∥B≤U∥m∥B−1+DAB(U))≪BL2Dη(D).\eta(D)\left(L\sum_{0<\|m\|_B\le U}\|m\|_B^{-1} +D A_B(U)\right) \ll_B\frac{L^2}{D}\eta(D). The area term has the same tail bound, because partial summation yields |∑d>Dμ(d)d2|≪η(D)D.\left|\sum_{d>D}\frac{\mu(d)}{d^2}\right| \ll\frac{\eta(D)}{D}. Subtract the area main term in the small-divisor sum and bound its remaining terms absolutely. This proves the first estimate; take η(x)=xθ−1\eta(x)=x^{\theta-1} for the second. ◻

31.2 An unconditional sublinear consequence of the Dini condition

Define the nonincreasing geometric modulus ωB(u)=supv≥u|ΔB(v)|v.\omega_B(u)=\sup_{v\ge u}\frac{|\Delta_B(v)|}{v}. For L/(D+1)≥1L/(D+1)\ge1, direct comparison on the intervals [L/(d+1),L/d][L/(d+1),L/d] gives ∑d≤D|ΔB(L/d)|≤2L∫L/(D+1)LωB(u)duu.\sum_{d\le D}|\Delta_B(L/d)| \le 2L\int_{L/(D+1)}^L\omega_B(u)\frac{du}{u}.(31.3) Consequently, ∫1∞ωB(u)duu<∞⇒EB(L)=oB(L).\int_1^\infty\omega_B(u)\frac{du}{u}<\infty \quad\Longrightarrow\quad E_B(L)=o_B(L).(31.4) Here the arithmetic input is only the prime number theorem, in the equivalent form M(x)=o(x)M(x)=o(x), not RH. Indeed, use the nonincreasing envelope η(x)=sup⁡y≥x|M(y)|/y\eta(x)=\sup_{y\ge x}|M(y)|/y, fix U≥2U\ge2, and choose D=⌊L/U⌋D=\lfloor L/U\rfloor. After division by LL, the large-divisor bound tends to zero for this fixed UU, whereas the small-divisor bound is at most 2∫U/2∞ωB(u)du/u2\int_{U/2}^{\infty}\omega_B(u)\,du/u for all sufficiently large LL. Let L→∞L\to\infty and then U→∞U\to\infty. This strengthens the earlier absolute-value Dini argument, which gave only OB(L)O_B(L).

31.3 Fixed zero-free half-planes and the recent quasi-RH claims

For the Riemann zeta function and 1/2≤θ0<11/2\le\theta_0<1, the standard zero-free-half-plane formulation is equivalent to ζ(s)≠0(ℜs>θ0)⇔M(x)=Oε(xθ0+ε)for every ε>0.\zeta(s)\ne0\quad(\Re s>\theta_0) \quad\Longleftrightarrow\quad M(x)=O_\varepsilon(x^{\theta_0+\varepsilon}) \quad\text{for every }\varepsilon>0.(31.5) Here nonvanishing excludes the pole at s=1s=1, where 1/ζ1/\zeta instead has a zero. We give the analytic step because a fixed zero-free half-plane and a height-dependent zero-free region are different inputs.

Suppose first that the left side of (31.5) holds. Fix 0<δ<(1−θ0)/20<\delta<(1-\theta_0)/2. At sufficiently large |t||t|, choose the branch of log⁡ζ\log\zeta on the disk centered at 2+it2+it of radius R2=2−θ0−δ/4R_2=2-\theta_0-\delta/4 that agrees with the Euler-product logarithm at its center. This disk contains neither zeros nor the pole. Polynomial growth of ζ\zeta in a fixed vertical strip gives ℜlog⁡ζ≪δlog⁡(2+|t|)\Re\log\zeta\ll_\delta\log(2+|t|) there. Borel–Carathéodory bounds |log⁡ζ||\log\zeta| by the same order on the smaller disk of radius R=2−θ0−δ/2R=2-\theta_0-\delta/2. On the disk of radius r0=1/2r_0=1/2 the absolutely convergent Euler-product logarithm is bounded. The three-circles theorem, with r=2−θ0−δ<Rr=2-\theta_0-\delta<R, now gives |log⁡ζ(σ+it)|≪δ(log⁡(2+|t|))λδ,θ0+δ≤σ≤2,λδ=log⁡(r/r0)log⁡(R/r0)<1.|\log\zeta(\sigma+it)|\ll_\delta(\log(2+|t|))^{\lambda_\delta}, \qquad \theta_0+\delta\le\sigma\le2,\qquad \lambda_\delta=\frac{\log(r/r_0)}{\log(R/r_0)}<1. Consequently, for every ε>0\varepsilon>0, 1/ζ(σ+it)≪δ,ε(1+|t|)ε1/\zeta(\sigma+it)\ll_{\delta,\varepsilon}(1+|t|)^\varepsilon on σ≥θ0+δ\sigma\ge\theta_0+\delta; bounded heights and σ≥2\sigma\ge2 are handled by analyticity of the reciprocal and the Euler product.

For a half-integer xx, truncated Perron inversion on c=1+1/log⁡xc=1+1/\log x, at height T=x2T=x^2, has error O(xlog⁡2x/T)O(x\log^2x/T) because |μ(n)|≤1|\mu(n)|\le1. Move the contour to σ0=θ0+δ\sigma_0=\theta_0+\delta. There are no poles of the reciprocal in the intervening strip. The new vertical integral is Oδ,ε(xσ0Tε)O_{\delta,\varepsilon}(x^{\sigma_0}T^\varepsilon) and the two horizontal integrals are Oδ,ε(xTε−1)O_{\delta,\varepsilon}(xT^{\varepsilon-1}). Choosing δ\delta and ε\varepsilon sufficiently small gives every exponent θ0+ε′\theta_0+\varepsilon' requested on the right side of (31.5). Half-integers suffice since MM is constant between consecutive integers.

Conversely, for each compact subset of ℜs>θ0\Re s>\theta_0, choose ε>0\varepsilon>0 smaller than its distance from the boundary. The bound for MM makes s∫1∞M(x)x−s−1dxs\int_1^\infty M(x)x^{-s-1}\,dx locally uniformly convergent and holomorphic there. Partial summation identifies it with 1/ζ(s)1/\zeta(s) on ℜs>1\Re s>1, so analytic continuation precludes a zero of ζ\zeta in ℜs>θ0\Re s>\theta_0. This equivalence uses the Euler product, meromorphic continuation and vertical growth of ζ\zeta; zero-freeness of an arbitrary Dirichlet series would not alone suffice.

The OpenAI manuscript dated 30 September 2026 claims the half-plane ℜs>7/8\Re s>7/8 for all finite-order Hecke LL-functions over ℚ(−3)\mathbb Q(\sqrt{-3}), and hence for Dirichlet LL-functions, including ζ\zeta [116, Theorem 1.1]. The manuscript dated 5 October 2026 gives a separate proof claiming ℜs>11/12\Re s>11/12 and describes it as a simpler intermediate result toward the September theorem [117, Theorem 1.1 and the following paragraph]. For both papers we use the theorem statements in the TeX sources at repository revision adc7f1241b42 (the initial release), as pinned in the claim ledger and bibliography. We checked those statements, not either complete proof or its formalization. All applications here are conditional on the explicit arithmetic hypothesis in Proposition 31.1. The corresponding Mertens exponents would be 7/8+ε7/8+\varepsilon, 11/12+ε11/12+\varepsilon, and, under full RH, 1/2+ε1/2+\varepsilon. The generalized assertions about other LL-functions are unnecessary for this primitive planar count.

31.4 Logarithmic geometric savings

The next comparison is conditional on an additional estimate for the all-point discrepancy: |ΔB(u)|≪Bu(log⁡u)β,u≥3,β>0.|\Delta_B(u)|\ll_B\frac{u}{(\log u)^\beta},\qquad u\ge3, \qquad\beta>0.(31.6) No such estimate is asserted here for a McShane–Rivin norm ball.

First suppose M(x)≪xθM(x)\ll x^\theta for some fixed θ<1\theta<1. Choose any fixed dd with 1/(2−θ)<d<11/(2-\theta)<d<1, and take D=⌊Ld⌋D=\lfloor L^d\rfloor. The large-divisor contribution in (31.2) is O(L2−d(2−θ))O(L^{2-d(2-\theta)}), with exponent strictly smaller than one. The small-divisor contribution is ≪L∫L1−d/2Lduu(log⁡u)β≪β,dL(log⁡L)1−β.\ll L\int_{L^{1-d}/2}^L\frac{du}{u(\log u)^\beta} \ll_{\beta,d} L(\log L)^{1-\beta}. Thus M(x)≪xθ(θ<1),ΔB(u)≪u(log⁡u)−β⇒EB(L)≪L(log⁡L)1−β.M(x)\ll x^\theta\ (\theta<1),\quad \Delta_B(u)\ll u(\log u)^{-\beta} \quad\Longrightarrow\quad E_B(L)\ll L(\log L)^{1-\beta}.(31.7) In particular, the geometric threshold β=1\beta=1 gives OB(L)O_B(L). Any fixed power saving for MM suffices for this conclusion: full RH does not improve the logarithmic exponent in this elementary argument.

For comparison, the classical unconditional Vinogradov–Korobov estimate, recorded for example in Zhai [114, eq. (1.5)], has the form M(x)≪xexp⁡(−c(logx)3/5(loglogx)−1/5).M(x)\ll x\exp\!\left(-c(\log x)^{3/5} (\log\log x)^{-1/5}\right). Write F(L)=(log⁡L)3/5(log⁡log⁡L)−1/5F(L)=(\log L)^{3/5}(\log\log L)^{-1/5} and take D=⌊Lexp⁡(−aF(L))⌋D=\lfloor L\exp(-aF(L))\rfloor with a sufficiently small fixed a>0a>0. Since F(D)∼F(L)F(D)\sim F(L), the large-divisor part is O(Lexp⁡(−c′F(L)))O(L\exp(-c'F(L))). The small-divisor part is bounded by L∫exp⁡(aF(L))/2Lduu(log⁡u)β.L\int_{\exp(aF(L))/2}^L\frac{du}{u(\log u)^\beta}. The resulting elementary comparison is geometric exponent βunconditional VK inputM(x)≪xθ,θ<10<β<1O(L(logL)1−β)O(L(logL)1−β)β=1O(Llog⁡log⁡L)O(L)β>1O(LF(L)1−β)O(L(logL)1−β).\begin{array}{c|c|c} \text{geometric exponent }\beta &\text{unconditional VK input} &M(x)\ll x^\theta,\ \theta<1\\ \hline 0<\beta<1 &O\!\left(L(\log L)^{1-\beta}\right) &O\!\left(L(\log L)^{1-\beta}\right)\\[2pt] \beta=1 &O(L\log\log L) &O(L)\\[2pt] \beta>1 &O\!\left(LF(L)^{1-\beta}\right) &O\!\left(L(\log L)^{1-\beta}\right). \end{array} These are consequences of one elementary splitting argument, not assertions of optimality. The constants can depend on BB, β\beta, the arithmetic exponent, and the chosen cutoff exponent.

31.5 Power-saving geometric discrepancies and established benchmarks

If instead |ΔB(u)|≪uα|\Delta_B(u)|\ll u^\alpha with 0≤α<10\le\alpha<1, then ∑d≤D|ΔB(L/d)|≪LαD1−α.\sum_{d\le D}|\Delta_B(L/d)|\ll L^\alpha D^{1-\alpha}. Balancing this with L2Dθ−2L^2D^{\theta-2} gives D≍L(2−α)/(3−α−θ),EB(L)≪Lκ(α,θ),κ(α,θ)=2−αθ3−α−θ.D\asymp L^{(2-\alpha)/(3-\alpha-\theta)},\qquad E_B(L)\ll L^{\kappa(\alpha,\theta)},\qquad \kappa(\alpha,\theta)=\frac{2-\alpha\theta}{3-\alpha-\theta}.(31.8) For example, α=2/3\alpha=2/3 and a Mertens exponent arbitrarily close to 1/21/2 give Oε(L10/11+ε)O_\varepsilon(L^{10/11+\varepsilon}). Exponents arbitrarily close to 7/87/8 and 11/1211/12 give, respectively, Oε(L34/35+ε)O_\varepsilon(L^{34/35+\varepsilon}) and Oε(L50/51+ε)O_\varepsilon(L^{50/51+\varepsilon}) by this method. These examples concern a hypothetical or separately established geometric estimate with α=2/3\alpha=2/3; they do not assign that exponent to a McShane–Rivin ball. Stronger results for smooth curved domains use additional structure and should not be confused with this general transfer bound.

With the same power-saving geometric input, the unconditional VK estimate already gives EB(L)≪Lexp⁡(−cBF(L))E_B(L)\ll L\exp(-c_B F(L)) for some cB>0c_B>0, by choosing D=Lexp⁡(−aF(L))D=L\exp(-aF(L)) and balancing the two exponential factors. Thus sublinear primitive errors in suitable geometries do not require RH.

This unconditional sublinear conclusion is a classical one for sufficiently smooth, positively curved domains: Zhai records it in equation (1.4) of [114]. His parameter is the area scale x=L2x=L^2, so his O(x1/2exp⁡(−cF(x)))O(x^{1/2}\exp(-cF(x))) becomes O(Lexp⁡(−c′F(L)))O(L\exp(-c'F(L))) here. The hypotheses include finite nonzero curvature throughout and a C4C^4 Gauss map. Those hypotheses do not hold for a McShane–Rivin ball.

Under RH, Baker [115, Theorem 1] proves Oε(L10/13+ε)O_\varepsilon(L^{10/13+\varepsilon}) for a specified class of piecewise C4C^4 domains whose arcs have nonzero curvature, with additional C4C^4 reciprocal-curve regularity and rational endpoint tangents, as specified by hypotheses (H1)–(H4) on pages 267–268. This is an established comparison result, not a claim about the best current exponent or about the flat norm balls considered here. In the opposite direction, the unconditional polygon obstruction Ω±(Llog⁡log⁡L)\Omega_\pm(L\sqrt{\log\log L}) recalled in Section 30.2 persists regardless of RH. It belongs to rational polygons and is not a lower bound for strictly convex bodies. These examples show why the shape hypothesis must accompany any arithmetic hypothesis.

31.6 The remaining geometric obstruction

Strict convexity supplies ΔB(u)=o(u)\Delta_B(u)=o(u) and hence ωB(u)→0\omega_B(u)\to0, but no specified rate for that convergence. Under any fixed arithmetic exponent θ<1\theta<1, the preceding power cutoff yields a bound of the form |EB(L)|≪Llog⁡LωB(cL1−d)+L2−d(2−θ).|E_B(L)|\ll L\log L\,\omega_B(cL^{1-d}) +L^{2-d(2-\theta)}. It is again o(Llog⁡L)o(L\log L), without a universal logarithmic saving specified by this argument. This is a limitation of the stated inputs and this transfer estimate, not an impossibility theorem for more special convex bodies.

One cannot simply multiply a bound for MM by the supremum of the weights ΔB(L/d)\Delta_B(L/d). Abel summation also sees their variation. On a dyadic interval d≍Dd\asymp D, the counting part of these weights can have total variation of order (L/D)2(L/D)^2, despite a much smaller pointwise discrepancy. The large-divisor estimate above pays for that variation explicitly. Further cancellation would require additional information about the geometric weights or their correlation with μ(d)\mu(d).

Equivalently, for ℜs>2\Re s>2 the gauge zeta functions satisfy ZB(s)=∑m≠0∥m∥B−s,ZBprim(s)=ZB(s)ζ(s).Z_B(s)=\sum_{m\ne0}\|m\|_B^{-s},\qquad Z_B^{\mathrm{prim}}(s)=\frac{Z_B(s)}{\zeta(s)}. The estimate ΔB(u)=o(u)\Delta_B(u)=o(u) provides the representation ZB(s)=aBss−2+s∫1∞ΔB(u)u−s−1du,ℜs>1.Z_B(s)=\frac{a_Bs}{s-2} +s\int_1^\infty\Delta_B(u)u^{-s-1}\,du, \qquad \Re s>1. A zero-free result for the denominator does not on its own continue the geometric numerator through the line ℜs=1\Re s=1, nor provide the vertical growth bounds needed for a sharp counting inversion. This is the analytic reason to keep the arithmetic and geometric inputs separate.

For a body satisfying the infinite-flatness and rational-normal hypotheses of Proposition 29.1, the prime-row construction gives Ω(L1−ε)\Omega(L^{1-\varepsilon}) along an unbounded sequence for every ε>0\varepsilon>0. This excludes a fixed sublinear power bound for that body even if RH holds. It does not exclude O(L)O(L), or even o(L)o(L): the quantitative lower bound is LW(h/L2)L W(h/L^2) up to constants, and W(h/L2)→0W(h/L^2)\to0 under strict convexity. A useful next geometric target is therefore a quantitative modulus. One possible target is ΔB(u)=O(u/log⁡u)\Delta_B(u)=O(u/\log u), provided it is compatible with that body’s local widths. Under the same supporting-row, two-sided-graph and irrational-contact hypotheses, the row is empty at L=n/hL=n/h and contributes wn(L−1)+O(1)w_n(L^{-1})+O(1) all points at L+L−1L+L^{-1}. The all-point main term changes by only aB(2+L−2)a_B(2+L^{-2}), so max⁡{|ΔB(L)|,|ΔB(L+L−1)|}≥L2W(h/L2)−OB(1).\max\{|\Delta_B(L)|,|\Delta_B(L+L^{-1})|\} \ge \frac L2W(h/L^2)-O_B(1). There is no totient density factor in this all-point estimate, and it holds for every sufficiently large integer nn, without primality. Consequently the proposed target requires W(h/L2)=O(1/log⁡L)W(h/L^2)=O(1/\log L) along these contact scales. Strict convexity and infinite flatness alone do not give that condition; the model f(s)=exp⁡[−exp⁡(|s|−β)]f(s)=\exp[-\exp(|s|^{-\beta})] in Section 30.5 violates it. Establishing a compatible modulus for any specified McShane–Rivin ball remains a separate problem.

The all-point target has a numerical diagnostic independent of the area constant, just as in Section 30.3. Define 𝒟A(L)=AB(2L)−4AB(L).\mathcal D_A(L)=A_B(2L)-4A_B(L). The dyadic inverse identity proves the equivalence ΔB(L)=O(L/log⁡L)⇔𝒟A(L)=O(L/log⁡L).\Delta_B(L)=O(L/\log L) \quad\Longleftrightarrow\quad \mathcal D_A(L)=O(L/\log L).(31.9) Indeed, the reverse implication follows from ΔB(L)=−∑j≥04−j−1𝒟A(2jL)\Delta_B(L)=-\sum_{j\ge0}4^{-j-1}\mathcal D_A(2^jL) and log⁡(2jL)≥log⁡L\log(2^jL)\ge\log L. For a symmetric torus norm ball, let λγ\lambda_\gamma be the simple-geodesic length in the same normalization as the gauge of BB. The length list already used in Section 30.7, rescaled when imposing the unit-shortest-vector convention, gives the exact identity AB(L)=2∑γ unoriented simpleλγ≤L⌊Lλγ⌋.A_B(L)=2\sum_{\substack{\gamma\text{ unoriented simple}\\\lambda_\gamma\le L}} \left\lfloor\frac L{\lambda_\gamma}\right\rfloor. Thus the proposed geometric threshold can be investigated without estimating the norm-ball area or introducing a new enumeration of curve types. No finite numerical range proves the uniform bound in (31.9).

The full campaign experiments/torus_campaign/run.py implements this signed-multiple diagnostic at its dyadic cutoffs, with the all-point rows and differences in artifacts/torus_campaign/result.json. The floor comparisons use exact rational representations of the stored binary64 lengths. Membership for the true geodesic lengths remains numerical; the exact identity does not certify the required length or completeness assumptions. The campaign uses hyperbolic lengths ℓγ\ell_\gamma without rescaling. If sXs_X is the shortest hyperbolic length, the unit-shortest-vector gauge uses λγ=ℓγ/sX\lambda_\gamma=\ell_\gamma/s_X and hence AB(L)=Ahyp(sXL)A_B(L)=A_{\mathrm{hyp}}(s_XL). The campaign’s hyperbolic dyadic rows must be interpreted with that change of units; they do not establish a uniform logarithmic bound. The separate finite companion experiments/counting_mixing/run.py checks rational examples of Möbius inversion, signed multiples, row selectors, finite dyadic identities and conditional balance exponents. These finite checks do not supply either the required geometric modulus or an arithmetic hypothesis. Source, independent-review and generation records are in docs/execution/counting-mixing-review-2026-11-01/.