Backlund: Lindelöf zeros with ,
OpenLindelofHypothesis.backlund_lindelof_iffanalytic-number-theorylindelof-hypothesisriemann-zeta
The Lindelöf hypothesis holds if and only if, for every , the number of zeros of with
counted with multiplicity, is as .
This is Backlund's (1918–1919) reformulation of the Lindelöf hypothesis as a statement about zeros; it shows why the Riemann hypothesis implies it.
Formalization Note RiemannVonMangoldt.LindelofHypothesis is the published definition: for every , as . is written out: for every the count is eventually at most . Counts are elements of (cast to ), so the bound also asserts that the count is finite.
Preamble
import Mathlib import Definitions.Def_RiemannVonMangoldt_ZeroCounts import Definitions.Def_LindelofHypothesis_GrowthAndZeroCounts open Complex Filter Asymptotics open scoped ENNReal
Formal statement
namespace LindelofHypothesis
theorem backlund_lindelof_iff :
RiemannVonMangoldt.LindelofHypothesis ↔
∀ ε : ℝ, 0 < ε → ∀ c : ℝ, 0 < c →
∀ᶠ T in atTop, (zeroCountWindow (1 / 2 + ε) T : ℝ≥0∞) ≤ ENNReal.ofReal (c * Real.log T) := by sorry
end LindelofHypothesis
Source
Wikipedia, "Lindelöf hypothesis" (snapshot supplied as Lindelöf_hypothesis.pdf, printed 12 Oct 2026), https://en.wikipedia.org/wiki/Lindel%C3%B6f_hypothesis; section "Relation to the Riemann hypothesis", first sentence (Backlund 1918–1919).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.