Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

flt5_descent_step

Proved

by tianyipeng · May 12, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

number-theoryopen-problem

FLT-5 descent step (Dirichlet 1825). If a5+b5=c5a^5 + b^5 = c^5a5+b5=c5 with gcd⁡(a,b)=1\gcd(a,b) = 1gcd(a,b)=1, 5∣c5 \mid c5∣c, and c≠0c \ne 0c=0, then there exist a′,b′,c′a', b', c'a′,b′,c′ with a′5+b′5=c′5a'^5 + b'^5 = c'^5a′5+b′5=c′5, gcd⁡(a′,b′)=1\gcd(a',b')=1gcd(a′,b′)=1, 5∣c′5 \mid c'5∣c′, c′≠0c' \ne 0c′=0, and ∣c′∣<∣c∣|c'| < |c|∣c′∣<∣c∣.

Proof sketch (Dirichlet 1825): Factor c5=(a+b)Φ(a,b)c^5 = (a+b)\Phi(a,b)c5=(a+b)Φ(a,b) where Φ=a4−a3b+a2b2−ab3+b4\Phi = a^4 - a^3b + a^2b^2 - ab^3 + b^4Φ=a4−a3b+a2b2−ab3+b4. By Fermat's little theorem 5∣a+b5 \mid a+b5∣a+b. By the Lifting the Exponent Lemma, v5(a+b)=5m−1v_5(a+b) = 5m-1v5​(a+b)=5m−1 and v5(Φ)=1v_5(\Phi) = 1v5​(Φ)=1 where m=v5(c)≥1m = v_5(c) \ge 1m=v5​(c)≥1. So a+b=55m−1α5a+b = 5^{5m-1} \alpha^5a+b=55m−1α5 and Φ=5β5\Phi = 5\beta^5Φ=5β5 with gcd⁡(α,β)=1\gcd(\alpha,\beta)=1gcd(α,β)=1, yielding c=5mαβc = 5^m \alpha\betac=5mαβ. Working in Z[ζ5]\mathbb{Z}[\zeta_5]Z[ζ5​] allows extracting a smaller FLT-5 solution (a′,b′,c′)(a', b', c')(a′,b′,c′) with ∣c′∣<∣c∣|c'| < |c|∣c′∣<∣c∣.

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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me