Discrete Beurling number systems with integer error below every power of x and no zero-free half-plane

Samuel Lavery

Assuming the specified short-interval prime estimate for ordinary primes, there is a discrete Beurling number system with generalized integer count x+O(xε)x + O(x^{\varepsilon }) for every ε>0\varepsilon > 0 whose zeta function has no zero-free half-plane of the form ℜs>1−δ\Re s > 1-\delta for any δ>0\delta > 0.

What was already known

Broucke, Debruyne and Révész study simultaneous power savings for prime and integer counts. Lavery’s construction asks how little error in the integer count can coexist with zeros approaching the line ℜs=1\Re s = 1.

AI involvement AI-led

Lavery set the problem, chose the targets and directed the project. Claude agents developed the construction and proofs, including the single-system extension using separate exponents for planted zeros. Aristotle started the Lean development, which Claude agents extended.

Importance Notable

A single discrete system shows that an integer-counting error smaller than every fixed positive power can coexist with zeros arbitrarily close to the line ℜs=1\Re s = 1.

Technical verification Formal (Lean)

The pinned project reports Lean kernel checking of the complete implication from its explicit short-interval premise, including exact finite certificates and BModel.one_zero_system_exists.

Formal checking

The pinned project reports Lean kernel checking of the complete implication from its explicit short-interval premise, including exact finite certificates and BModel.one_zero_system_exists.

Checker
Samuel Lavery, reporting Lean 4 verification
Scope
The pinned project reports Lean kernel checking of the complete implication from its explicit short-interval premise, including exact finite certificates and BModel.one_zero_system_exists.
Basis
Reported by the linked checker

Human understanding Few

The proof development and documented checking are attributed to agents. The source does not document a human explanation of the central construction.

Correction and publication history