Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit form of the abcabcabc conjecture: c≤κ(ε) rad⁡(abc)1+εc \le \kappa(\varepsilon)\,\operatorname{rad}(abc)^{1+\varepsilon}c≤κ(ε)rad(abc)1+ε

Open
ABC.explicit_bound

by Zexuan Liu · Sep 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

abc-conjectureconjecturediophantinenumber-theory

This is the explicit (bounded) form of the abcabcabc conjecture of Oesterle and Masser.

For a natural number nnn write rad⁡(n)\operatorname{rad}(n)rad(n) for the radical of nnn, the product of the distinct primes dividing nnn. Call a triple (a,b,c)(a,b,c)(a,b,c) of positive integers an abcabcabc-triple when a+b=ca+b=ca+b=c and aaa, bbb, ccc are pairwise coprime. The assertion is:

for every ε>0 there is a constant κ(ε)>0 such that c  ≤  κ(ε) rad⁡(abc)1+ε for every abc-triple (a,b,c).\text{for every } \varepsilon>0 \text{ there is a constant } \kappa(\varepsilon)>0 \text{ such that } c \;\le\; \kappa(\varepsilon)\,\operatorname{rad}(abc)^{1+\varepsilon} \text{ for every } abc\text{-triple } (a,b,c).for every ε>0 there is a constant κ(ε)>0 such that c≤κ(ε)rad(abc)1+ε for every abc-triple (a,b,c).

Here ε\varepsilonε is an arbitrary positive real, the constant κ(ε)\kappa(\varepsilon)κ(ε) is allowed to depend on ε\varepsilonε but on nothing else, and the exponent 1+ε1+\varepsilon1+ε is a real exponent, so rad⁡(abc)1+ε\operatorname{rad}(abc)^{1+\varepsilon}rad(abc)1+ε is a real power. The inequality says that the largest member of an abcabcabc-triple cannot substantially exceed the radical of the product: the three numbers cannot all be built out of high powers of a few small primes at once.

Waldschmidt states the conjecture in the finiteness form — for each ε>0\varepsilon>0ε>0 only finitely many abcabcabc-triples satisfy c>rad⁡(abc)1+εc > \operatorname{rad}(abc)^{1+\varepsilon}c>rad(abc)1+ε — and then records that it is equivalent to the displayed bounded form. The two are interchangeable, but they are not interchangeable for a fixed ε\varepsilonε: the bounded form at ε\varepsilonε is what yields the finiteness statement at any strictly larger exponent, and conversely the finiteness statement at ε\varepsilonε produces a constant at that same ε\varepsilonε by taking a maximum over the exceptional set. The bounded form is the one in which quantitative work is carried out — the unconditional estimates of Stewart-Tijdeman (log⁡c≤κR15\log c \le \kappa R^{15}logc≤κR15) and Stewart-Yu (log⁡c≤κR1/3(log⁡R)3\log c \le \kappa R^{1/3}(\log R)^3logc≤κR1/3(logR)3, R=rad⁡(abc)R = \operatorname{rad}(abc)R=rad(abc)) are bounds of exactly this shape, as is Baker's explicit refinement — and it is the form from which the standard consequences (asymptotic Fermat, Fermat-Catalan, Roth, Szpiro) are usually derived, since they need a numerical bound rather than an unquantified finiteness.

Formalization Note. The coprimality hypothesis is written as Set.Pairwise on the set {a,b,c}\{a,b,c\}{a,b,c}, matching the platform statement ABC_Conjecture verbatim. The hypothesis c>0c>0c>0 is omitted because it follows from a>0a>0a>0 and a+b=ca+b=ca+b=c. The conclusion uses ≤\le≤ rather than the source's strict <<<; the two versions are equivalent, since a constant witnessing one witnesses the other after an arbitrarily small enlargement. The source normalises abcabcabc-triples by a<ba<ba<b; that restriction is dropped here because rad⁡(abc)\operatorname{rad}(abc)rad(abc) and the hypotheses are symmetric in aaa and bbb, so a constant valid for the normalised triples is valid for all of them.

Preamble
import Mathlib
import Definitions.Def_radicalDM

open scoped BigOperators
Formal statement
namespace ABC

theorem explicit_bound (ε : ℝ) (hε : 0 < ε) :
    ∃ K : ℝ, 0 < K ∧
      ∀ a b c : ℕ, 0 < a → 0 < b → a + b = c →
        ({a, b, c} : Set ℕ).Pairwise Nat.Coprime →
        (c : ℝ) ≤ K * (radicalDM (a * b * c) : ℝ) ^ (1 + ε) := by sorry

end ABC
Source
Michel Waldschmidt, Lecture on the abc conjecture and some of its consequences, Springer Proceedings in Mathematics and Statistics 98 (2015), 211-230; Section 2 'abc Conjecture', the bulleted statement immediately following Conjecture 2: 'For each eps > 0, there exists kappa(eps) such that, for any abc triple (a,b,c), c < kappa(eps) Rad(abc)^{1+eps}.' Author's preprint: https://webusers.imj-prg.fr/~michel.waldschmidt/articles/pdf/abcLahoreProceedings.pdf . Same statement as the second formulation in https://en.wikipedia.org/wiki/Abc_conjecture (section 'Formulations'). The finiteness form (Waldschmidt Conjecture 2) is the platform statement ABC_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