31 Arithmetic cancellation and the geometric remainder
31.1 A transfer estimate with both inputs explicit
Let 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 and write All primitive vectors are counted with their signs; an unoriented count for a centrally symmetric body is half this count. The count is of Section 30.1, and is its all-point discrepancy . The earlier torus count 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 , 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 where is nonnegative and nonincreasing on . Then, for every integer , (31.1) In particular, , with , gives (31.2)
Proof. Möbius inversion gives Set . Reversing the order of summation in its large-divisor part gives the exact identity The summands with are zero. Since for , partial summation gives Monotonicity of therefore bounds the large-divisor part by The area term has the same tail bound, because partial summation yields Subtract the area main term in the small-divisor sum and bound its remaining terms absolutely. This proves the first estimate; take for the second. ◻
31.2 An unconditional sublinear consequence of the Dini condition
Define the nonincreasing geometric modulus For , direct comparison on the intervals gives (31.3) Consequently, (31.4) Here the arithmetic input is only the prime number theorem, in the equivalent form , not RH. Indeed, use the nonincreasing envelope , fix , and choose . After division by , the large-divisor bound tends to zero for this fixed , whereas the small-divisor bound is at most for all sufficiently large . Let and then . This strengthens the earlier absolute-value Dini argument, which gave only .
31.3 Fixed zero-free half-planes and the recent quasi-RH claims
For the Riemann zeta function and , the standard zero-free-half-plane formulation is equivalent to (31.5) Here nonvanishing excludes the pole at , where 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 . At sufficiently large , choose the branch of on the disk centered at of radius that agrees with the Euler-product logarithm at its center. This disk contains neither zeros nor the pole. Polynomial growth of in a fixed vertical strip gives there. Borel–Carathéodory bounds by the same order on the smaller disk of radius . On the disk of radius the absolutely convergent Euler-product logarithm is bounded. The three-circles theorem, with , now gives Consequently, for every , on ; bounded heights and are handled by analyticity of the reciprocal and the Euler product.
For a half-integer , truncated Perron inversion on , at height , has error because . Move the contour to . There are no poles of the reciprocal in the intervening strip. The new vertical integral is and the two horizontal integrals are . Choosing and sufficiently small gives every exponent requested on the right side of (31.5). Half-integers suffice since is constant between consecutive integers.
Conversely, for each compact subset of , choose smaller than its distance from the boundary. The bound for makes locally uniformly convergent and holomorphic there. Partial summation identifies it with on , so analytic continuation precludes a zero of in . This equivalence uses the Euler product, meromorphic continuation and vertical growth of ; zero-freeness of an arbitrary Dirichlet series would not alone suffice.
The OpenAI manuscript dated 30 September 2026 claims the half-plane for all finite-order Hecke -functions over , and hence for Dirichlet -functions, including [116, Theorem 1.1]. The manuscript dated 5 October 2026 gives a separate proof claiming 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 , , and, under full RH, . The generalized assertions about other -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: (31.6) No such estimate is asserted here for a McShane–Rivin norm ball.
First suppose for some fixed . Choose any fixed with , and take . The large-divisor contribution in (31.2) is , with exponent strictly smaller than one. The small-divisor contribution is Thus (31.7) In particular, the geometric threshold gives . Any fixed power saving for 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 Write and take with a sufficiently small fixed . Since , the large-divisor part is . The small-divisor part is bounded by The resulting elementary comparison is These are consequences of one elementary splitting argument, not assertions of optimality. The constants can depend on , , the arithmetic exponent, and the chosen cutoff exponent.
31.5 Power-saving geometric discrepancies and established benchmarks
If instead with , then Balancing this with gives (31.8) For example, and a Mertens exponent arbitrarily close to give . Exponents arbitrarily close to and give, respectively, and by this method. These examples concern a hypothetical or separately established geometric estimate with ; 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 for some , by choosing 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 , so his becomes here. The hypotheses include finite nonzero curvature throughout and a Gauss map. Those hypotheses do not hold for a McShane–Rivin ball.
Under RH, Baker [115, Theorem 1] proves for a specified class of piecewise domains whose arcs have nonzero curvature, with additional 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 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 and hence , but no specified rate for that convergence. Under any fixed arithmetic exponent , the preceding power cutoff yields a bound of the form It is again , 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 by the supremum of the weights . Abel summation also sees their variation. On a dyadic interval , the counting part of these weights can have total variation of order , 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 .
Equivalently, for the gauge zeta functions satisfy The estimate provides the representation A zero-free result for the denominator does not on its own continue the geometric numerator through the line , 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 along an unbounded sequence for every . This excludes a fixed sublinear power bound for that body even if RH holds. It does not exclude , or even : the quantitative lower bound is up to constants, and under strict convexity. A useful next geometric target is therefore a quantitative modulus. One possible target is , 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 and contributes all points at . The all-point main term changes by only , so There is no totient density factor in this all-point estimate, and it holds for every sufficiently large integer , without primality. Consequently the proposed target requires along these contact scales. Strict convexity and infinite flatness alone do not give that condition; the model 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 The dyadic inverse identity proves the equivalence (31.9) Indeed, the reverse implication follows from and . For a symmetric torus norm ball, let be the simple-geodesic length in the same normalization as the gauge of . The length list already used in Section 30.7, rescaled when imposing the unit-shortest-vector convention, gives the exact identity 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 without rescaling. If is the shortest hyperbolic length, the unit-shortest-vector gauge uses and hence . 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/.