Kummer's Criterion and Regular Primes in Lean

11.1. Background: irregular primes and Vandiver's Theorem III🔗

Kummer's criterion characterises regular primes: p is regular iff p does not divide the numerator of any of the Bernoulli numbers B_2, B_4, \ldots, B_{p-3}. Kummer showed in 1850 that \mathrm{FLT}_p holds for every regular prime p. This already proves \mathrm{FLT}_p for the vast majority of primes; the smallest irregular primes are 37, 59, 67, 101, 103, \ldots.

For irregular primes a more delicate argument is needed. Vandiver gave several supplementary criteria; the relevant one here is Vandiver's Theorem III: let p be an irregular prime with p \equiv 1 \pmod 4. If for every irregular Bernoulli index 2k of p (i.e. every k in [1, (p-3)/2] with p \mid \mathrm{num}(B_{2k})) the integer k itself is even, then \mathrm{FLT}_p holds.

For p = 37 the unique irregular index is 2k = 32, so k = 16, which is even, and 37 \equiv 1 \pmod 4. So Vandiver's Theorem III applies at 37, and proving \mathrm{FLT}_{37} reduces to formalising Vandiver III at \ell = 37.

Definition11.1.1
uses 0used by 1L∃∀N

An irregular index of \ell is a positive integer k with 1 \le k and 2k \le \ell - 3 such that \ell \mid \mathrm{num}(B_{2k}).

Lean code for Definition11.1.11 definition
  • defdefined in BernoulliRegular/FLT37/Final.lean
    complete
    def BernoulliRegular.FLT37.IsIrregularIndex ( k : ) : Prop
    def BernoulliRegular.FLT37.IsIrregularIndex
      ( k : ) : Prop
    An **irregular index** of `ℓ` is a positive integer `k` with
    `2k ≤ ℓ - 3` and `ℓ ∣ num(B_{2k})`. 
Definition11.1.2
uses 1
Used by 4
Reverse dependency previews
L∃∀N

The Vandiver III parity hypothesis for \ell asserts: \ell \equiv 1 \pmod 4, and every irregular index k of \ell is even.

Definition 11.1.1

Lean code for Definition11.1.21 definition
  • defdefined in BernoulliRegular/FLT37/Final.lean
    complete
    def BernoulliRegular.FLT37.VandiverIIIHypothesis ( : ) : Prop
    def BernoulliRegular.FLT37.VandiverIIIHypothesis
      ( : ) : Prop
    The hypothesis package used by Vandiver's Theorem III: the prime is
    `≡ 1 (mod 4)` and every irregular Bernoulli index in the relevant range has
    even `k`. 
Theorem11.1.3
uses 1
Used by 2
Reverse dependency previews
Preview
Theorem 11.2.5
Loading preview
Reverse dependency preview content is loaded from the Blueprint HTML cache.
L∃∀N

The prime \ell = 37 satisfies the Vandiver III parity hypothesis.

Definition 11.1.2

Lean code for Theorem11.1.31 theorem
  • theoremdefined in BernoulliRegular/FLT37/Final.lean
    complete
    theorem BernoulliRegular.FLT37.vandiverIIIHypothesis_thirtyseven :
      BernoulliRegular.FLT37.VandiverIIIHypothesis 37
    theorem BernoulliRegular.FLT37.vandiverIIIHypothesis_thirtyseven :
      BernoulliRegular.FLT37.VandiverIIIHypothesis
        37
    The hypothesis is verified for `ℓ = 37`. The two conjuncts come from a
    trivial `decide` and `irregular_index_even_thirtyseven` (FLT37a). 
Proof for Theorem 11.1.3
uses 0

By direct computation: 37 \equiv 1 \pmod 4, and the only irregular index of 37 in the range [1, 17] is k = 16, which is even.