flt5_z_zeta5_core
Provedalgebracyclotomicdescentdirichlet-1825flt-n5number-theoryopen-problempidz-zeta5
FLT-5 core descent via Z[zeta_5] (Dirichlet 1825). Given a^5+b^5=c^5 with gcd(a,b)=1, 5|c=5c1, a+b=5^4r^5, Phi(a,b)=5s^5, gcd(r,s)=1, and rs=c1, produce a strictly smaller primitive solution. This is the algebraic core of Dirichlet's 1825 descent: in Z[zeta_5] (the ring of integers of Q(zeta_5), which is a PID with class number 1), the element a + bzeta_5 factors as a unit times a 5th power, and extracting the components via the norm map gives the new smaller triple. The key steps are: (1) Z[zeta_5] is a PID; (2) gcd(a+bzeta_5^k, a+bzeta_5^j) divides 5(1-zeta_5) for k≠j; (3) unique factorization gives a+bzeta_5 = ualpha^5; (4) taking norms and real parts extracts a',b' with c'.natAbs = |rs| = |c1| < |5c1| = |c|.
Preamble
import Mathlib.Data.Int.Basic import Mathlib.Data.Int.GCD
Formal statement
theorem flt5_z_zeta5_core (a b c r s c1 : ℤ) (h_eq : a ^ 5 + b ^ 5 = c ^ 5) (h_cop : Int.gcd a b = 1) (h5c : (5 : ℤ) ∣ c) (hc : c ≠ 0) (hc1 : c = 5 * c1) (hw : a + b = 5 ^ 4 * r ^ 5) (hPhi : a ^ 4 - a ^ 3 * b + a ^ 2 * b ^ 2 - a * b ^ 3 + b ^ 4 = 5 * s ^ 5) (hcop_rs : Int.gcd r s = 1) (hrs : r * s = c1) : ∃ a' b' c' : ℤ, a' ^ 5 + b' ^ 5 = c' ^ 5 ∧ Int.gcd a' b' = 1 ∧ (5 : ℤ) ∣ c' ∧ c' ≠ 0 ∧ c'.natAbs < c.natAbs := by sorry