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 .
AI involvement
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.
- Discrete Beurling number systems with integer error below every power of x and no zero-free half-planeDiscrete Beurling number systems with integer error below every power of x and no zero-free half-plane
- Author’s disclosure and revision chronologyAuthor’s disclosure and revision chronology
Importance
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 .
Technical verification
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
- Pinned theorem, provenance and checking recordPinned theorem, provenance and checking record
Human understanding
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
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision