Kummer's Criterion and Regular Primes in Lean
This is the mathematical blueprint for the Lean 4 / Mathlib formalisation around Kummer's criterion for regular primes, the analytic class number formula for cyclotomic fields, and their consequences for Fermat's Last Theorem.
The development runs from the CM field and the splitting of its class number into
plus and minus parts, through characters of the cyclotomic Galois group,
generalised Bernoulli numbers, Gauss sums and Stickelberger's theorem, the
evaluation of L-values at non-positive integers, the relative class number
formula for \hminus, cyclotomic units and the plus class number, to the final
proof of Kummer's criterion. It then applies the criterion to obtain Fermat's Last
Theorem for the exponent 37 and the infinitude of irregular primes.
How to read this blueprint. Each node below is a definition or theorem with its
mathematical statement and a paragraph-level proof sketch. The dependency graph
records which results feed into which. A node is coloured green once the Lean
declaration it references (lean := …) is fully proved, blue while it is stated
but still contains sorry, and left uncoloured while it is roadmap-only. There is
no manual status to maintain: Verso reads it from the Lean side directly.
Contents
- 1. The CM field and the class number splitting
- 2. Characters of the cyclotomic Galois group
- 3. Generalised Bernoulli numbers
- 4. Gauss sums and Stickelberger
- 5. L-values at non-positive integers
- 6. The relative class number h-minus
- 7. Cyclotomic units and the plus class number
- 8. The final proof of Kummer's criterion
- 9. Infinitely many irregular primes
- 10. The abandoned reflection route
- 11. Fermat's Last Theorem for exponent 37
- 12. Dependency graph
- Dependency Graph
- 13. Progress summary
- Blueprint Summary
- 14. References
- Blueprint Bibliography