Submitted works

Advanced search

math.NT — Number Theory

The two-moment certificate is robust under Rudnick–Sarnak-range cubic augmentation with capacity control: An exact absorption certificate for the two-moment system at bandwidth one, with a hand-checkable witness

Contributed by Kunal Tyagi

Alpöge and Furman prove unconditionally that more than two thirds of the zeros of the Riemann zeta function are simple and lie on the critical line. Their argument rests on a two-moment certificate — the trace and the Frobenius norm of the Weil–Gabor compression, read against block structure and integrality — and that certificate is provably exhausted: within the data class (tr, Frobenius, positive-index count, integer atoms) an on-line double and a shallow off-line pair are indistinguishable, which pins the distinct-zeros optimum at Nd/N=5/6N_{d}/N = 5/6 and the simple fraction at 2/32/3. A natural proposal to break this degeneracy is to adjoin, at a second bandwidth λ′=1/2+o(1)\lambda' = 1/2 + o(1) inside the Rudnick–Sarnak range, the unconditionally computable signed third trace together with two spectral-capacity rows: an all-VV eigenvalue-count ladder and a garnish-capacity fuzz row. This paper proves, at the model level, and certifies computationally, that the augmentation adds exactly nothing. The marginal value of the entire cubic block over the two-moment baseline is δ0=0\delta_0 = 0 identically, an exact LP equality with an explicit, hand-checkable witness law. It holds over the full adversary grid for the distinct-zeros benchmark (940940 records, ∣δ0∣<10−12|\delta_0| < 10^{-12} everywhere, corner 5/65/6); for the simple-fraction benchmark (corner 2/32/3) at its two decision cells together with cross-checks, converged clean at the stopping criterion; and inside the near-CUE data class licensed by the unconditional pair-correlation theorem of Baluyot–Goldston–Suriajaya–Turnage-Butterbaugh, where the absorption is by strict slack: there the cubic row does not bind. The structural explanation is a set of exact identities proved here. On isolated blocks the signed cubic row is the affine function 3F−23F - 2 of the Frobenius row plus the second integrality level, hence blind to doubles-versus-pairs at every depth. On the ψ1\psi_1-zero grid the bandwidth-one Frobenius row degenerates exactly to the multiplicity count while the half-bandwidth kernel stays position-sensitive, so the cubic budget is met by arrangement at zero cost. Spectral escape is capped sharply at 22Cledεg N=o(N)2\sqrt{2}\sqrt{C_{\mathrm{led}} \varepsilon_g}\,N = o(N), and a scalar cubic tail row with any divergent cutoff is unconditionally vacuous. The pair-interference channel, the one gap in the atom-only model theorem, is closed by an integrality theorem throughout the admissible pair-depth family (w≤1w \le 1, plus deep probes at w∈{1.5,2}w \in \{1.5, 2\}): proved unconditionally for single-pair columns to w≤2.8w \le 2.8, which covers that whole family, and for multi-pair columns at w≤0.82w \le 0.82 (w≤0.98w \le 0.98 modulo one crowding cap whose ledger constant is interval-certified; on the deepest sliver w∈(0.98,1]w \in (0.98, 1] the coverage is adversarial-numerical with the unconditional 8/98/9 backstop), with an unconditional 8/98/9-strength spectral backstop at all depths. Mixed-depth multi-pair columns involving the deep probes w∈{1.5,2}w \in \{1.5, 2\} rest on that backstop together with converged adversarial pricing. The two-moment certificate, and with it the bandwidth-one ceiling, is robust under Rudnick–Sarnak-range cubic augmentation with capacity control.

Primarily AI-generated textHuman understanding: some parts

math.NT — Number Theory

A counterexample to Haglund's monotonic-zeros conjecture for the Riemann Ξ\Xi approximants

Contributed by Kunal Tyagi

Haglund introduced the partial sums ΞN=∑n≤NΦn\Xi_N = \sum_{n \le N} \Phi_n of Riemann's expansion of the Ξ\Xi-function in incomplete gamma functions and conjectured that for every NN the zeros of ΞN\Xi_N in the closed first quadrant, listed by increasing real part, have nondecreasing imaginary parts. The conjecture implies the Riemann hypothesis; Haglund's computations supported a weak form of it for N≤10N \le 10. We show that the conjecture is false for N=27N = 27: Ξ27\Xi_{27} has a real zero in (3144.8946,3144.8947)(3144.8946, 3144.8947) and a non-real zero z0=3143.2206824215…+0.3152587993… iz_0 = 3143.2206824215\ldots + 0.3152587993\ldots\, i in the first quadrant, whose real part is smaller. The weak form fails as well. Both facts are certified twice, independently, in interval arithmetic (Arb ball arithmetic; outward-rounded intervals with proved truncation bounds), and z0z_0 is enclosed in a square of half-width 10−4810^{-48}. The same violation occurs at N=24N = 24 for the companion approximants ξN=ΞN+cN\xi_N = \Xi_N + c_N. The failure has a mechanism: on the critical line ΞN<Ξ<ξN\Xi_N < \Xi < \xi_N, so the real zeros of ΞN\Xi_N lie in positive lobes of Ξ\Xi that rise above a positive level, and a low lobe followed by a higher one near the height 4(N+1)24(N+1)^2, where the approximant departs from Ξ\Xi, can leave a non-real zero below real zeros. The same structure shows that the number of positive real zeros of ΞN\Xi_N, counted with multiplicity, is odd, and that x2ΞN(x)x^2\Xi_N(x) tends to a negative limit on the real axis for every NN.

Primarily AI-generated textHuman understanding: some parts