Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Beal conjecture for ordered exponents 444 or odd primes

Open
Beal.primitive_reduced_exponents

by Wenqian Xing · Sep 6, 2026 · Mathlib c5ea003 (Lean v4.30.0)

beal-conjecturediophantinenumber-theory

Let a,b,ca,b,ca,b,c be positive, pairwise coprime integers. Let p,q,rp,q,rp,q,r each be either 444 or an odd prime. Suppose p≤qp\le qp≤q and at least one of p,q,rp,q,rp,q,r is prime. Then

ap+bq≠cr.a^p+b^q\ne c^r.ap+bq=cr.

This is the explicitly restricted open case of Beal's conjecture: the ordering removes the symmetry of the two summands, and the prime condition excludes the settled signature (4,4,4)(4,4,4)(4,4,4). An accompanying proved exponent-normalization lemma and a fourth-power argument reduce the full conjecture to this statement. No restriction is imposed on the sizes of the remaining odd primes.

Preamble
import Mathlib.Data.Nat.Factors
Formal statement
theorem Beal.primitive_reduced_exponents {a b c p q r : ℕ}
    (ha : a ≠ 0) (hb : b ≠ 0) (hc : c ≠ 0)
    (hp : p = 4 ∨ Nat.Prime p ∧ Odd p)
    (hq : q = 4 ∨ Nat.Prime q ∧ Odd q)
    (hr : r = 4 ∨ Nat.Prime r ∧ Odd r)
    (hpq : p ≤ q)
    (hprime : Nat.Prime p ∨ Nat.Prime q ∨ Nat.Prime r)
    (hab : a.Coprime b) (hac : a.Coprime c) (hbc : b.Coprime c) :
    a ^ p + b ^ q ≠ c ^ r := by sorry
Source
R. Daniel Mauldin, A Generalization of Fermat's Last Theorem: The Beal Conjecture and Prize Problem, Notices AMS 44(11), 1997, p. 1436, equation and primitive formulation, https://www.ams.org/notices/199711/beal.pdf; restricted exponent case and elementary normalization proved in the accompanying reduction, using Mathlib c5ea00351c28e24afc9f0f84379aa41082b1188f, Mathlib/Data/Nat/Factors.lean, Nat.four_dvd_or_exists_odd_prime_and_dvd_of_two_lt. This normalization is not claimed as a separately numbered result in Mauldin.

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