Mertens square-root bounds for exponents at or below the verified record
Openmoebius_summatory_rpow_bound_below_recordLet denote the arithmetic Moebius function and let
The assertion is that for every real with
one has
This is the target statement Open RH criterion: Mertens square-root bounds with arbitrary positive epsilon restricted to at or below . The complementary range , that is, exponents lying strictly above the verified record , is already Proved at GRH.mobius_character_and_progression_bounds_above_record, so the two statements together cover all with no overlap and no gap. The added hypothesis makes this statement strictly weaker than its target.
Why the record is exactly . The Proved record supplies unconditionally for every . Substituting turns that threshold into the equivalent threshold on the parameter of the target statement. Everything with a larger exponent is therefore discharged onto Proved material, and only the exponents at or below the record remain open.
Where the content lives. The assertion is equivalent to the Riemann Hypothesis (Titchmarsh and Heath-Brown, Theorem 14.25(C)); it is not the disproved Mertens conjecture with constant one and exponent exactly one half. The hard range is precisely the small- range, and that is exactly the range this child retains: as the bound degenerates toward for all , which is the RH-strength statement. The reduction therefore isolates the open content rather than hiding it.
Formalization Note. The binders and the conclusion are verbatim the target statement, with the single addition of hcap : ε ≤ 0.3749570698, the literal complement of the hypothesis 0.8749570698 < 1 / 2 + ε used above, so that the two cases partition the parameter range exactly.
import Mathlib.NumberTheory.LSeries.Dirichlet import Mathlib.NumberTheory.LSeries.SumCoeff
theorem moebius_summatory_rpow_bound_below_record :
∀ ε : ℝ, 0 < ε → ε ≤ 0.3749570698 →
Asymptotics.IsBigO Filter.atTop
(fun N : ℕ => ∑ n ∈ Finset.Icc 1 N, (ArithmeticFunction.moebius n : ℂ))
(fun N : ℕ => (N : ℝ) ^ (1 / 2 + ε)) := by sorry