- The paper proves that, for every α > 1/2, primes failing Bernoulli non-divisibility through √p/(log p)^α number at most 10X/(log X)^{2α} up to X, a density-zero exceptional set.
- The paper derives partial Vandiver-type vanishing of even cyclotomic class-group eigenspaces and corresponding unit, zero-free Kubota–Leopoldt p-adic L-functions throughout the same index range.
- The paper also presents an autonomous Lean formalization of its analytic theorem, while clarifying that the result does not establish full regularity, Vandiver’s conjecture, or Siegel’s irregular-prime density conjecture.
Overview and main result
This paper establishes a density-one statement about the distribution of irregular primes, together with a corresponding "partial Vandiver" theorem. For an odd prime p, let Kp=Q(ζp) be the pth cyclotomic field with class group Cl(Kp) and p-Sylow subgroup Ap. The classical notion of regularity due to Kummer asserts that p is regular when p∤num(B2k) for every even index $2k$ in the full range 2≤2k≤p−3; equivalently (via Herbrand–Ribet) that all odd eigenspaces of Kp=Q(ζp)0 vanish.
The authors weaken this to partial regularity: for Kp=Q(ζp)1, a prime Kp=Q(ζp)2 is Kp=Q(ζp)3-regular if Kp=Q(ζp)4 for all Kp=Q(ζp)5, where
Kp=Q(ζp)6
The main theorem states that the set of primes failing this condition has density zero (2602.05090):
Kp=Q(ζp)7
Since Kp=Q(ζp)8 by the Prime Number Theorem, the exceptional set is negligible relative to all primes: almost every prime is partially regular in this sense. A notable refinement, verified by an additional Lean proof run, is that the constant can be taken to be Kp=Q(ζp)9 independently of p0 — a concrete, uniform numerical bound rather than merely existential.
The window p1 grows without bound but is far shorter than the full Kummer range p2; the theorem says nothing about indices beyond it, so this does not resolve Siegel's conjecture on the density p3 of irregular primes, nor prove any individual prime fully regular.
Consequences via Herbrand–Ribet and Leopoldt reflection
The arithmetic payoff comes from two standard structural results. First, the Herbrand–Ribet theorem identifies nonvanishing of odd eigenspaces with Bernoulli divisibility: p4 if and only if p5. Second, Leopoldt's Spiegelungssatz gives a one-way injection p6, linking even ("plus", Vandiver) components to odd components governed by Bernoulli numbers.
Combining these, the paper deduces a partial Vandiver theorem: for almost every prime p7,
p8
with the same p9 bound on exceptions. This is a density-one partial result toward the Kummer–Vandiver conjecture, which predicts vanishing of all even eigenspaces for every prime and remains open in general.
Analytic corollaries
Via cyclotomic Iwasawa theory, the vanishing of eigenspaces translates into statements about the Kubota–Leopoldt Cl(Kp)0-adic Cl(Kp)1-functions. Using the Mazur–Wiles main conjecture, the paper shows that for almost every prime Cl(Kp)2,
Cl(Kp)3
so these functions are units on all of Cl(Kp)4 and have no zeros at all on Cl(Kp)5. The authors emphasize that this is qualitatively different from, and in the Cl(Kp)6-adic sense stronger than, complex zero-free regions: it corresponds to the Iwasawa characteristic polynomial being a unit (degree zero). The argument proceeds through the standard control theorem identifying Cl(Kp)7-coinvariants of the unramified Iwasawa module eigenspace with Cl(Kp)8, Nakayama's lemma forcing triviality of the whole eigenspace, and the main conjecture equating vanishing of the module with invertibility of the Cl(Kp)9-function in p0.
Because Bernoulli numerators also control congruences between Eisenstein series and cusp forms (Swinnerton-Dyer theory, exemplified by Ramanujan's congruence p1 arising from p2) and torsion in algebraic p3-groups via the Quillen–Lichtenbaum/Borel picture, the main theorem yields a four-part corollary holding simultaneously for almost every prime throughout the range:
- The power-sum congruence p4 holds;
- p5 is a p6-adic unit;
- No level-one cuspidal Hecke eigenform of weight p7 is congruent mod p8 to the Eisenstein series p9;
- Ap0 has no Ap1-torsion.
The paper notes that analogous statements for generalized Bernoulli numbers Ap2 attached to Dirichlet characters follow mutatis mutandis.
Method of proof
The proof is elementary analytic number theory and occupies only a few pages. The strategy is:
- Reduction to a fixed range: since Ap3 is increasing for Ap4, every relevant prime Ap5 satisfies Ap6, so failures of partial regularity among such primes imply failures of Ap7-regularity.
- Counting by divisibility: if Ap8 is not Ap9-regular then p0, so the count of bad primes is at most p1, the number of distinct prime divisors.
- Growth bounds: combining Euler's formula for p2 with the von Staudt–Clausen theorem (which makes denominators square-free and bounded by p3) gives p4, hence p5. Conversely, Stirling's lower bound gives p6 for large p7, so p8.
- Prime divisor estimate: a Chebyshev/PNT argument bounds p9.
Chaining these, p∤num(B2k)0, which is the theorem after absorbing finite error terms. The threshold p∤num(B2k)1 appears exactly where the counting function drops below p∤num(B2k)2.
A distinctive feature of the paper is that Theorem 2.1 was proved autonomously by AxiomProver, an AI system under development at Axiom Math, from only a natural-language problem statement and a Lean version pin. The system produced both a Lean/Mathlib formalization of the statement (~3500 lines of verified code) and a complete proof, checked by Lean 4.26.0, with no human assistance; the human-readable exposition was written afterward by the authors from the formal artifact.
Two aspects of the case study are worth noting. The machine-found proof does not resemble the narrative exposition — Lean code makes explicit all bookkeeping, coercions, and case splits, so translating it required the human authors to reconstruct the conceptual argument. In particular, AxiomProver re-derived the von Staudt–Clausen theorem within its solution rather than citing it, spending over 1000 lines establishing the denominator consequence used in the numerator growth bound. In a separate experiment with additional resources supplied (including Kontorovich–Tao's PNT formalization, which ultimately went unused), the system discovered the uniform constant p∤num(B2k)3 and an alternative route avoiding von Staudt–Clausen entirely; both findings were incorporated into the paper. Deep external inputs — Herbrand–Ribet, Leopoldt reflection, Mazur–Wiles — were deliberately excluded from the automated task scope and cited from the literature.
This positions the work simultaneously as a number-theoretic result and as evidence about the current capability boundary of autonomous theorem proving: the successfully automated portion is a self-contained analytic estimate using standard techniques, while the structurally deep machinery connecting it to class groups remained a human-supplied citation layer.
Limitations and open questions
Several qualifications bear directly on the strength of the results. The density-one claim covers only indices up to p∤num(B2k)4; nothing is asserted about Bernoulli numerators or eigenspaces beyond p∤num(B2k)5, and the gap between this window and the full Kummer range is where irregular behavior may persist. Consequently the paper does not address Siegel's density conjecture, does not prove any single prime fully regular, and does not establish Vandiver's conjecture for any prime outright. The reflection principle used is one-directional (p∤num(B2k)6), so the partial Vandiver corollary cannot be reversed into new information about minus parts beyond what Herbrand–Ribet already provides. The constants in the growth lemmas are ineffective in the usual asymptotic sense until specific values are fixed, though Remark on p∤num(B2k)7 supplies one explicit value. Finally, the autonomous-proof claims are scoped precisely: they cover Theorem 2.1 alone and one guided experiment, leaving open whether systems like AxiomProver can autonomously handle proofs invoking deep cited theorems such as Herbrand–Ribet or the Iwasawa main conjecture, and whether the density-one method can be pushed to larger windows of the form p∤num(B2k)8 with p∤num(B2k)9.
Conclusion
The paper proves that a density-one set of primes satisfies Bernoulli non-divisibility up to index $2k$0, with explicit exceptional-set bound $2k$1 and a verified uniform constant of 10. Through Herbrand–Ribet and Leopoldt reflection this yields partial Vandiver-type vanishing of even class group eigenspaces for almost all primes, and through the Iwasawa main conjecture yields zero-free Kubota–Leopoldt $2k$2-adic $2k$3-functions, Eisenstein-cusp non-congruences, and $2k$4-torsion-freeness of $2k$5 across the same range. The mathematics itself uses only classical tools; its secondary significance lies in demonstrating that an AI prover could autonomously produce a fully Lean-verified proof of a new research-level estimate from its natural-language statement alone.