Answers are grounded in this paper and cite their sources.
Weil's criterion states that the Riemann Hypothesis (RH) holds if and only if Weil's quadratic form W is nonnegative on all test functions. For μ > 1, the restriction of W to functions supported in (−½ log μ, ½ log μ) (the window μ) gives a weaker statement. Let PT(H) be the statement that every nontrivial zero ρ of the Riemann zeta function with |Im ρ| ≤ H lies on the critical line; simplicity of the zeros is not required. We prove that PT(H) implies the positivity of W on a range of windows which grows with H. For every real m ≥ e² we give an explicit height H_m and an explicit constant A_m > 0 such that PT(H) with H ≥ H_m implies W(u) ≥ ½A_m‖u‖² on every window μ ≤ m. With the choice of parameters made in the paper, the supremum of the admissible window parameters m is asymptotic to (4/9)(log H)², and an elementary version of the argument covers all μ ≤ ((1/12) log H)² as soon as log H ≥ 10⁶. The constant 4/9 cannot be improved within the comparison of error terms used in the proof. For the height H = 3·10¹², for which PT(H) is the result of the computer-assisted verification of Platt and Trudgian, a choice of parameters checked in interval arithmetic gives W(u) ≥ exp(−58237558)‖u‖² on every window 1 < μ ≤ 97.8474 for smooth test functions. The same lower bound holds for C² functions supported in [−½ log 97.8, ½ log 97.8]. At this height the comparison cannot succeed for μ ≥ 97.9; this is also checked in interval arithmetic. The proof splits the sum over zeros by an entire multiplier. The zeros up to height H contribute a nonnegative amount, and the rest of the form is evaluated on the geometric side, where the positive term comes from an explicit lower bound for the eigenvalue defect of time and frequency limiting. Finally we give a model of point sets, all of whose points up to height H are real, for which the analogous form is negative on the window μ = (2 log H)². The model is not a statement about the zeta function. No statement about the truth of RH is made. The computer-assisted parts (the weighted Schur bound, the error budgets for Theorem 1.4 and Example 6.1, and the exclusion for μ ≥ 97.9) can be rechecked with the interval-arithmetic code at doi:10.5281/zenodo.24346353, which runs without any AI system. The numerical case H = 3·10¹² depends on the computer-assisted verification of Platt and Trudgian (doi:10.1112/blms.12460). Not yet reviewed by independent human experts. Generative AI tools were used in this work under the author's direction; see the section "Use of generative AI" in the paper.
No takes yet. Share an insight, caveat, or question.
Ryota Mori (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: