2. The Frey package and the four-way contradiction
A Frey package (Definitions/Def_FLTPrelim_FreyPackage.lean, adapted from the Imperial College London FLT project)
is a structure bundling nonzero integers a,b,c, a prime p≥5, the equation ap+bp=cp, and the
normalisation gcd(a,b)=1, a≡3(mod4), 2∣b. The same file defines the Frey curve over ℚ,
EP:y2+xy=x3+4bp−1−apx2−16apbpx,
an integral model of y2=x(x−ap)(x+bp) (FreyPackage.freyCurve), and the same equation read over ℤ
(FreyPackage.freyCurveInt).
theorem Wiles_Frey (P : FreyPackage) :
¬ GaloisRepIsIrreducible (K := AlgebraicClosure ℚ) ℚ P.freyCurve P.p := fun hirr =>
let ⟨f, hf⟩ := level_lowering_to_two P (frey_isModular P) hirr
hf (ModularForm.S2_Gamma0_2_eq_zero f)
theorem solution (P : FreyPackage) : False :=
FreyPackage.Wiles_Frey P (FreyPackage.Mazur_Frey P)
So the contradiction rests on exactly four theorems — FreyPackage.Mazur_Frey (§3), FreyPackage.frey_isModular (§4),
FreyPackage.level_lowering_to_two (§5) and ModularForm.S2_Gamma0_2_eq_zero (§6).
← §1 From the elementary statement to a prime exponent p ≥ 5 · §3 Irreducibility of the mod-p representation of the Frey curve →
How the theorems of this step depend on each other
Green cards are the landmarks named in this section; dashed white cards are landmarks of neighbouring steps they connect to. Premises above conclusions; an arrow may pass through unnamed intermediate theorems. Click a card for its page.
Theorems named in this section (5; statement as in the tree, numbers from the import graph)
theorem FreyPackage.of_counterexample (a b c : ℤ) (ha : a ≠ 0) (hb : b ≠ 0) (hc : c ≠ 0) (p : ℕ) (pp : p.Prime) (hp5 : 5 ≤ p) (H : a ^ p + b ^ p = c ^ p) : Nonempty FreyPackage
0 theorems below · cites 0 · cited by 1 · depth 3 · proof 61 lines, 1 helpers
open WeierstrassCurve WeierstrassCurve.Affine WeierstrassCurve.Affine.Point
open CuspForm ModularFormClass UpperHalfPlane
theorem FreyPackage.Mazur_Frey (P : FreyPackage) : GaloisRepIsIrreducible (K := AlgebraicClosure ℚ) ℚ P.freyCurve P.p
5,435 theorems below · cites 5 · cited by 1 · depth 4 · proof 24 lines, 2 helpers
open WeierstrassCurve WeierstrassCurve.Affine WeierstrassCurve.Affine.Point
open CuspForm ModularFormClass UpperHalfPlane
theorem FreyPackage.frey_isModular (P : FreyPackage) : P.freyCurve.IsModular
27,797 theorems below · cites 1 · cited by 1 · depth 4 · proof 122 lines, 11 helpers
open WeierstrassCurve WeierstrassCurve.Affine WeierstrassCurve.Affine.Point
open CuspForm ModularFormClass UpperHalfPlane
theorem FreyPackage.level_lowering_to_two (P : FreyPackage) (hmod : P.freyCurve.IsModular) (hirr : GaloisRepIsIrreducible (K := AlgebraicClosure ℚ) ℚ P.freyCurve P.p) : ∃ f : CuspForm (CongruenceSubgroup.Gamma0 2) 2, f ≠ 0
27,851 theorems below · cites 2 · cited by 1 · depth 4 · proof 10 lines, 0 helpers
open WeierstrassCurve WeierstrassCurve.Affine WeierstrassCurve.Affine.Point
open CuspForm ModularFormClass UpperHalfPlane
theorem ModularForm.S2_Gamma0_2_eq_zero (f : CuspForm (CongruenceSubgroup.Gamma0 2) 2) : f = 0
0 theorems below · cites 0 · cited by 2 · depth 4 · proof 168 lines, 16 helpers
Definition modules named here
2 theorems of the tree are first reached through this step, in the sense that the first landmark met on a shortest citation path up to fermat_last_theorem is one named in this section. That is a reading aid, not a classification: the infrastructure below modularity and level lowering is largely shared.
← §1 From the elementary statement to a prime exponent p ≥ 5 · §3 Irreducibility of the mod-p representation of the Frey curve →