An average bound for simplicity and line membership
Statement
Let N_s(T) count simple zeros anywhere in the strip and N₀(T) count on-line zeros with multiplicity. Then liminf (N_s(T)+N₀(T))/(2N(T)) ≥ (1+k₀)/2 = 0.8362503518… .
The average does not say that each separate proportion is at least 83.625%. It is a different conclusion from the distinct-zero bound with the same constant.
Relationship not independently reviewed. This concerns its use in this problem.
The average does not say that each separate proportion is at least 83.625%. It is a different conclusion from the distinct-zero bound with the same constant.
Relationship not independently reviewed. This concerns its use in this problem.
The average of the simple-zero and critical-line proportions has liminf 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.