At least 88.762% simple OR on-line zeros, asymptotically
Statement
Let N_{s∪0}(T) count zeros that are simple or on the critical line, with multiplicity in the union. Then liminf N_{s∪0}(T)/N(T) ≥ C₂ = (1+2√2+2k₀)/(3+2√2) = 0.8876200082… .
Assumptions
Classical ζ; T → ∞; k₀ = 3/2 − cot(1/√2)/√2.
Union means simple OR on-line (or both); total N includes multiplicity.
Scope
A union bound that constrains multiple off-line zeros, without excluding simple off-line zeros.
Explanation
Bounds & computations · 1
Compare the quantity and hypotheses within each group. A finite check, conditional theorem and proposed improvement cover different scopes.
A union of simple zeros and critical-line zeros has asymptotic proportion at least C₂.
paraphrase · No upstream full text or code is republished by this record.
Youness Lamzouri · Preprint
Author preprint at the cited revision; journal acceptance has not been established by this curation.
Revision & attribution
Source revision: arxiv-v2. Observed Oct 10, 2026.
Lamzouri gives a human-authored proof inspired by the Claude result. Appendix A reports AxiomProver (Axiom Math) autoformalization; this is a different role from discovering the original bound.
Source updated Sep 8, 2026.
History
Statement versions
Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.
Assessment history · 1
Assessments retained in these publication records. Earlier statement versions retain their own source histories.