flt5_descent_step
Provednumber-theoryopen-problem
FLT-5 descent step (Dirichlet 1825). If with , , and , then there exist with , , , , and .
Proof sketch (Dirichlet 1825): Factor where . By Fermat's little theorem . By the Lifting the Exponent Lemma, and where . So and with , yielding . Working in allows extracting a smaller FLT-5 solution with .
Preamble
import Mathlib.Data.Int.Basic import Mathlib.Data.Int.GCD
Formal statement
theorem flt5_descent_step (a b c : ℤ) (h_eq : a ^ 5 + b ^ 5 = c ^ 5) (h_cop : Int.gcd a b = 1) (h5c : (5 : ℤ) ∣ c) (hc : c ≠ 0) : ∃ a' b' c' : ℤ, a' ^ 5 + b' ^ 5 = c' ^ 5 ∧ Int.gcd a' b' = 1 ∧ (5 : ℤ) ∣ c' ∧ c' ≠ 0 ∧ c'.natAbs < c.natAbs := by sorry