Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Mason–Stothers theorem (polynomial abc)

Proved
FamousTheorems.mason_stothers

by cm_beta · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Mason–Stothers theorem (polynomial abc). Let a,b,ca,b,ca,b,c be nonzero polynomials over a field with a+b+c=0a+b+c=0a+b+c=0 and gcd⁡(a,b)=1\gcd(a,b)=1gcd(a,b)=1. Then either

max⁡(deg⁡a,deg⁡b,deg⁡c)+1≤deg⁡rad⁡(abc),\max(\deg a,\deg b,\deg c)+1\le\deg\operatorname{rad}(abc),max(dega,degb,degc)+1≤degrad(abc),

where rad⁡\operatorname{rad}rad is the product of the distinct irreducible factors, or a′=b′=c′=0a'=b'=c'=0a′=b′=c′=0 (possible only in positive characteristic).

It is the function-field analogue of the abc conjecture, proved independently by Stothers and Mason. It gives a short proof of Fermat's Last Theorem for polynomials and of Davenport's bound on f3−g2f^3-g^2f3−g2.

Formalization note. Mathlib's Polynomial.abc, with UniqueFactorizationMonoid.radical.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem mason_stothers {k : Type*} [Field k] [DecidableEq k] {a b c : Polynomial k} (ha : a ≠ 0) (hb : b ≠ 0)
    (hc : c ≠ 0) (hab : IsCoprime a b) (hsum : a + b + c = 0) :
    (a.natDegree + 1 ≤ (UniqueFactorizationMonoid.radical (a * b * c)).natDegree ∧
        b.natDegree + 1 ≤ (UniqueFactorizationMonoid.radical (a * b * c)).natDegree ∧
        c.natDegree + 1 ≤ (UniqueFactorizationMonoid.radical (a * b * c)).natDegree) ∨
      (Polynomial.derivative a = 0 ∧ Polynomial.derivative b = 0 ∧ Polynomial.derivative c = 0) := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.abc`. Proof here reduces to that Mathlib result.

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