High-Precision Approximation of Riemann Zeros via the Truncated Weil Form

Abstract

The Connes-van Suijlekom truncated Weil quadratic form, indexed by a cutoff parameter c that controls the primes p≤ c entering the operator, has a ground state whose Fourier-Mellin zeros provably lie on the critical line; whether they converge to the Riemann zeros as c∞ is open (Connes 2026; Connes-Consani-Moscovici 2025). We present, to our knowledge, the first public implementation of the CvS Galerkin matrix at sixteen cutoffs (c=13 through 67, plus c=100). Across c=13 through c=67 at N=100, the first-zero absolute error |γ1-γ1Riemann| shrinks monotonically from 2× 10-55 to 1.5× 10-168 -- a 113-OOM convergence across fifteen cutoffs. The smallest-positive even-sector eigenvalue λeven separately reaches 10-334 at c=100, N=250 (275-OOM span from c=13), and the same eigenvector recovers γ1,…,γ10 to 307-329 matching digits at N=250, dps=500. Under the unitary equivalence with CCM 2025 Lemma 5.1, each γk is (modulo a hypothesis-status caveat at c=100) an eigenvalue of the CCM rank-one operator D(λ,N) at λ= c. On the four-point N-sweep at c=100, Aitken-Δ2 on two consecutive triples gives 10|λ∞even|≈ -536.76 and ≈ -533.70, approaching the Connes 2026 Section 6.4 heuristic continuum prediction (≈ -530.38) monotonically with N. The empirical fit |10λ|≈ 13.24 c0.634 on c≤ 67, N=100 is shown to be a finite-N rate, falsified at c=100, N=200 by 49 OOM. The raw spectrum at c=100 carries 3, 5, 8, 11 negative-sign eigenvalues for N=100,150,200,250; continuum positivity of QWλ is RH-equivalent and we do not assume it at λ=100. We make no claim of proof.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…