The vocabulary of the main results #
Every notion appearing in the statements of the headline theorems: the zero counts, the Hilbert-space objects of the key proposition, the pair-correlation apparatus, and the two classical analytic inputs.
These are kept in one module, in the order Challenge/Basic.lean repeats them, and should stay
that way. Elaboration lifts a nested proof out of a definition's body into an auxiliary theorem
named after whichever definition in the module first needed it, so splitting these across
modules gives them names a single self-contained file cannot reproduce.
The non-trivial zeros of the Riemann zeta function with imaginary part in (0, T]: the
zeros lying in the critical strip 0 < re s < 1, as a set, so without multiplicity.
Equations
Instances For
The multiplicity of ρ as a zero of the Riemann zeta function, i.e. its order of
vanishing there.
Equations
Instances For
The number of non-trivial zeros with imaginary part in (0, T], counted with multiplicity.
This is N T in the source.
Equations
- ZetaZeros.zeroCount T = ∑ᶠ (ρ : ℂ) (_ : ρ ∈ ZetaZeros.nontrivialZeros T), ZetaZeros.zeroMultiplicity ρ
Instances For
The number of non-trivial zeros with imaginary part in (0, T] that are simple and lie on
the critical line re s = 1/2. This is N₀ˢ T in the source.
Equations
Instances For
The number of distinct non-trivial zeros with imaginary part in (0, T]. This is N_d T
in the source.
Equations
Instances For
eta is lam-admissible: square-integrable, real-valued, even, supported in
(-lam, lam), and normalised so that its square has Fourier transform 1 at 0.
- memLp : MeasureTheory.MemLp eta 2 MeasureTheory.volume
etais square-integrable. etais even.etavanishes off(-lam, lam).etais normalised: its square has Fourier transform1at0.
Instances For
The kernel of a test function, K_eta = fourier transform of eta squared.
Equations
- ZetaZeros.testKernel eta = ZetaZeros.fourierC (eta ^ 2)
Instances For
The support Z with multiplicities m is conjugation-invariant: every multiplicity is at
least one, and conjugation permutes Z preserving multiplicity.
Every point of the support has multiplicity at least one.
- conj_mem (z : ℂ) : z ∈ Z → (starRingEnd ℂ) z ∈ Z
Conjugation maps the support to itself.
- mult_conj (z : ℂ) : z ∈ Z → m ((starRingEnd ℂ) z) = m z
Conjugation preserves multiplicity.
Instances For
The weight 4 / (4 - z²) carried by the unconditional pair-correlation formula.
Equations
- ZetaZeros.pairWeight z = 4 / (4 - z ^ 2)
Instances For
A test function admissible in the pair-correlation formula: even, integrable, supported in
[-1, 1], and Lipschitz at the origin.
The Lipschitz condition is imposed globally rather than only at 0. That makes this predicate
stronger, hence PairCorrelation weaker and safer to assume — and the cited lemma still supplies
it.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The two external inputs #
The classical analytic results cited rather than proved here: the Riemann--von Mangoldt formula
and the unconditional pair-correlation formula. Each is a Prop, carried as a hypothesis, so
every result depending on it names it in its own statement.
Unconditional pair correlation (lem_bgst, external input). For every admissible test
function the weighted pair-correlation sum is (T / 2π) log T times its main term, with an error
O(1 / √log T). Lemma 5 of Baluyot--Goldston--Suriajaya--Turnage-Butterbaugh, An unconditional
Montgomery theorem for pair correlation of zeros of the Riemann zeta-function, Acta Arith. 214
(2024), 357--376.
Equations
- One or more equations did not get rendered due to their size.