Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

fermat_catalan_conjecture

Disproved

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

diophantine-equationsfermatgeneralization-of-fltnumber-theoryproved

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Fermat–Catalan Conjecture: There are only finitely many solutions (a,b,c,p,q,r)(a, b, c, p, q, r)(a,b,c,p,q,r) with p,q,r≥2p, q, r \geq 2p,q,r≥2, 1p+1q+1r<1\frac{1}{p}+\frac{1}{q}+\frac{1}{r} < 1p1​+q1​+r1​<1, gcd⁡(a,b,c)=1\gcd(a,b,c) = 1gcd(a,b,c)=1, and ap+bq=cra^p + b^q = c^rap+bq=cr.

The condition 1p+1q+1r<1\frac{1}{p}+\frac{1}{q}+\frac{1}{r} < 1p1​+q1​+r1​<1 (i.e., qr+pr+pq<pqrqr + pr + pq < pqrqr+pr+pq<pqr) excludes trivial families. Known solutions include: 1m+23=321^m + 2^3 = 3^21m+23=32 (for any mmm), 25+72=342^5 + 7^2 = 3^425+72=34, 73+132=297^3 + 13^2 = 2^973+132=29, 214+173=7122^{14} + 17^3 = 71^2214+173=712, and a few others — only 10 families are known.

Conjectured by Darmon and Granville (1995), who also proved finitely many solutions exist for fixed exponents (p,q,r)(p,q,r)(p,q,r). Generalizes both FLT (which is the case p=q=r≥3p=q=r\geq 3p=q=r≥3) and the Catalan conjecture (proved by Mihailescu in 2002).

Why this node was retired

The posted statement is

theorem fermat_catalan_conjecture :
    Set.Finite {t : ℕ × ℕ × ℕ × ℕ × ℕ × ℕ |
      let (a, b, c, p, q, r) := t
      2 ≤ p ∧ 2 ≤ q ∧ 2 ≤ r ∧
      q * r + p * r + p * q < p * q * r ∧
      0 < a ∧ 0 < b ∧ 0 < c ∧
      Nat.Coprime a b ∧ Nat.Coprime b c ∧ Nat.Coprime a c ∧
      a ^ p + b ^ q = c ^ r} := by
  sorry

The set counts sextuples, retaining a free exponent on base1, rather than triples of power values.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

State finiteness of the image set of power-value triples(a^p,b^q,c^r) satisfying the original exponent and coprimality conditions, thereby identifying redundant exponents on1.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.

Preamble
import Mathlib
Formal statement
theorem fermat_catalan_conjecture :
    Set.Finite {t : ℕ × ℕ × ℕ × ℕ × ℕ × ℕ |
      let (a, b, c, p, q, r) := t
      2 ≤ p ∧ 2 ≤ q ∧ 2 ≤ r ∧
      q * r + p * r + p * q < p * q * r ∧
      0 < a ∧ 0 < b ∧ 0 < c ∧
      Nat.Coprime a b ∧ Nat.Coprime b c ∧ Nat.Coprime a c ∧
      a ^ p + b ^ q = c ^ r} := by
  sorry
Source
https://en.wikipedia.org/wiki/Fermat%E2%80%93Catalan_conjecture

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me