Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Explicit-Formula Weil Criterion

Abstract

Relative to supplied zero data and an explicit archimedean-integrability hypothesis, RH is equivalent to nonnegativity of the classical pole-minus-prime-plus-archimedean expression on every convolution square.

Theorem 1.1 (The explicit formula for a convolution square).

Proof. Machine-checked in Lean as D5/S3/Weil/Separator/ExplicitFormulaWeilCriterion.explicitFormula_weilSquare (✓ std3). ∎

Source. Repository-derived.

Commentary.

The frozen zeta explicit formula is applied to convolutionSquare(g). The supplied ZeroData gives its canonical symmetric-convergence witness, while hArch is exactly the assumed integrability of the displayed digamma integral; that integrability is not proved here.

The display expands the pole evaluations, the von Mangoldt series Lambda(n)/sqrt(n) times the two logarithmic samples, and the archimedean digamma integral term by term.

Theorem 1.2 (RH is equivalent to explicit-formula positivity).

Proof. Machine-checked in Lean as D5/S3/Weil/Separator/ExplicitFormulaWeilCriterion.rh_iff_explicitFormulaPositivity (✓ std3). ∎

Source. Repository-derived.

Commentary.

The frozen Weil-square positivity criterion and the preceding explicit formula rewrite each side of the equivalence. Proof irrelevance identifies an arbitrary symmetric-convergence witness with the canonical witness supplied by ZeroData.

The universal hArch premise is explicit: archimedean integrability of every convolution square is assumed, not established in this module. The theorem is relative to a supplied ZeroData; existence of such data is not asserted, and M1-b remains open.

WeilTestFunction here means this repository’s even, smooth, compactly supported test functions, not the wider classes used in parts of the literature. This conditional equivalence is not a proof of the Riemann hypothesis.

References