The abc Conjecture and IUT Theory

The abc conjecture is a deceptively simple statement relating the additive equation $a+b=c$ to the multiplicative structure (prime factorization) of the three integers involved. Its power lies in quantifying a tension between addition and multiplication: integers built from small repeated primes (large powers) almost never sum to one another. It matters because an enormous number of deep results — Fermat's Last Theorem (asymptotically), Mordell's conjecture (Faltings), Roth's theorem, and many others — follow as relatively easy corollaries. The surprising fact: a single inequality about three numbers would unify dozens of otherwise hard, independent theorems. Mochizuki's Inter-universal Teichmüller theory purports to prove it by deforming the multiplicative structure of a number field while controlling the deformation through anabelian (étale fundamental group) rigidity, but the community has not reached consensus on its correctness.

The Core Insight

Addition and multiplication of integers are "independent" in a precise sense: if you know the prime factorizations of $a$ and $b$, you learn almost nothing about the prime factorization of $a+b$. The abc conjecture turns this intuition into a quantitative law — the radical $\mathrm{rad}(abc)$, which strips out exponents, controls $c$ up to an arbitrarily small power. Equivalently, large prime powers ("highly multiplicative" numbers) are additively rigid: they cannot conspire to form an additive relation $a+b=c$ unless their radical is comparably large.

Formal Statement

Radical of an integer

For a nonzero integer $n$, the radical (or squarefree kernel) is the product of the distinct primes dividing $n$:

Here $p$ ranges over the distinct prime divisors of $n$. For example $\mathrm{rad}(72)=\mathrm{rad}(2^3\cdot 3^2)=2\cdot 3=6$.

abc triple and quality

An abc triple is an ordered triple $(a,b,c)$ of positive integers with

The quality (or merit) of the triple is

The abc Conjecture (Oesterlé–Masser, 1985)

For every real $\epsilon >0$ there exists a constant $K_{\epsilon }>0$ such that for every abc triple,

Equivalently, for each $\epsilon >0$ the set of abc triples with $q(a,b,c)>1+\epsilon$ is finite. The strong (effective) form would specify $K_{\epsilon }$ explicitly; the weak form merely asserts existence.

Equivalent radical-difference form

The conjecture is equivalent to: for all $\epsilon >0$,

Why It Holds (Heuristic and Conditional Derivations)

Probabilistic heuristic for finiteness

We sketch why triples of high quality should be rare. Let $R=\mathrm{rad}(abc)$.

1. Density of squarefree-radical-bounded numbers. The number of integers up to $x$ that are "products of primes from a fixed radical $R$" grows only polylogarithmically; integers with all prime factors $\le R^{1+\epsilon }$ and radical $\le R$ are sparse.

1. Counting solutions. Model $a$, $b$ as random integers with the constraint that $\mathrm{rad}(abc)\le R$. Heuristically the probability that a random pair near size $N$ sums to a third number while keeping the combined radical at most $N^{1/(1+\epsilon )}$ decays.

1. Borel–Cantelli style estimate. Summing the expected number of triples with $q>1+\epsilon$ over dyadic ranges of $c$ gives a convergent series:

1. Conclusion. Convergence implies only finitely many "successes," matching the conjecture's finiteness assertion. $■$ (heuristic only)

Conditional derivation: FLT asymptotically from abc

Suppose abc holds. Consider Fermat's equation $x^n+y^n=z^n$ with coprime $x,y,z$ and $n\ge 4$.

1. Set $a=x^n$, $b=y^n$, $c=z^n$. Then $a+b=c$ and the triple is coprime.

1. The radical satisfies

1. Apply [4] with $\epsilon =1$ (say): $z^n=c<K_1\mathrm{rad}(abc{)}^2\le K_1{z}^6$.

1. Hence $z^{n-6}<K_1$, which bounds $z$ for all $n>6$. So only finitely many solutions exist for each large $n$, and none for $n$ sufficiently large relative to $K_1$. $■$

Shinichi Mochizuki | 1969–

Born in Tokyo and raised partly in the United States, Mochizuki entered Princeton at 16, completing his PhD under Gerd Faltings. He became a leading figure in anabelian geometry, proving the Grothendieck Conjecture for hyperbolic curves over number fields and developing "$p$-adic Teichmüller theory." Over roughly two decades at the Research Institute for Mathematical Sciences (RIMS) in Kyoto, he constructed Inter-universal Teichmüller theory, releasing the four foundational papers in August 2012. The work claims a proof of the abc conjecture (in the Szpiro-inequality form) but is written in an idiosyncratic self-contained idiom. After an extended and contentious refereeing process, the papers appeared in Publications of RIMS (2021), with Mochizuki himself the journal's editor-in-chief — a fact that intensified controversy.

Building Intuition

Think of a number's "additive identity" (its size) versus its "multiplicative identity" (which primes, with what exponents, build it). A perfect power like $2^{30}$ is enormous but multiplicatively thin — its radical is just $2$. The abc conjecture says you cannot have $a+b=c$ where all three are simultaneously this thin. If $a=2^m$, $b=3^n$, then $c=a+b$ is forced to be multiplicatively "fat": it must drag in many new primes, keeping $\mathrm{rad}(abc)$ large. Additive combination generates new prime factors. The famous record triple

The abc inequality: $c$ vs. $\operatorname{rad}(abc)$ on a log-log plot

Worked Examples

Computing quality of a record triple

1. Check: $2+6,436,341=6,436,343=23^5$. ✓ Coprime since $a=2$, $b$ odd, $c$ odd.
2. Radical: $\mathrm{rad}(abc)=\mathrm{rad}(2\cdot 3^{10}\cdot 109\cdot 23^5)=2\cdot 3\cdot 109\cdot 23=15,042.$
3. Logarithms: $\log c=\log (6,436,343)\approx 15.677$; $\log \mathrm{rad}=\log (15,042)\approx 9.619$.
4. Quality:

Using abc to bound a Fermat-type equation

1. Set $a=x^5,b=y^5,c=z^5$.
2. $\mathrm{rad}(abc)=\mathrm{rad}(xyz)\le xyz\le z^3$ (since $x,y\le z$).
3. Apply assumed bound: $z^5=c<(\mathrm{rad}(abc){)}^2\le (z^3{)}^2=z^6$.
4. This gives $z^5<z^6$, always true — so $n=5$ is not ruled out by $\epsilon =1$. Retry with the asymptotic exponent: solving $z^n<z^{3(1+\epsilon )}$ forces $n<3(1+\epsilon )$.

Common Misconceptions

Why the exponent cannot be $1$ (no $\varepsilon$)

The inequality $c<K\cdot \mathrm{rad}(abc)$ (i.e. $\epsilon =0$) is false for any constant $K$. Consider $a=1$, $b=2^{2^n}-1$, $c=2^{2^n}$. One shows $2^n\mid \mathrm{rad}(abc)\cdot (\text{something})$ is too weak: in fact using $a=1,b=9^n-1,c=9^n$ one can produce triples with $\frac{c}{\mathrm{rad}(abc)}\to \infty$.

Connections

The abc conjecture sits at a crossroads of arithmetic geometry. It is essentially equivalent to Szpiro's conjecture on the conductor and discriminant of Elliptic Curves: for a minimal elliptic curve, $|\Delta |{\ll }_{\epsilon }{N}^{6+\epsilon }$, where $\Delta$ is the discriminant and $N$ the conductor — and IUT actually proves this Szpiro-type inequality directly. It implies the asymptotic Fermat's Last Theorem, generalizes the Mason–Stothers Theorem (the polynomial abc, which is proven elementarily), and tightly relates to the Mordell Conjecture (Faltings' theorem) through height bounds. IUT theory itself is built on Anabelian Geometry and the étale Fundamental Group, encoding arithmetic into the symmetries of Hodge–Arakelov Theory and theta functions.

Mason–Stothers: the polynomial analogue (proven)

For nonzero coprime polynomials $a(t),b(t),c(t)$ over a field of characteristic $0$ with $a+b=c$ and not all constant,

This is the exact analogue of abc with $\mathrm{rad}$ replaced by the squarefree part, and it is fully proven, lending strong credence to the number-theoretic conjecture.

Real-World Applications

While abc is foundational rather than industrial, its theoretical reach is enormous:

1. Fermat's Last Theorem (asymptotic): abc gives FLT for all sufficiently large exponents in a few lines (shown above).
2. Roth's theorem on Diophantine approximation: abc implies effective bounds on how well algebraic numbers are approximated by rationals.
3. Mordell / Faltings (uniform): abc implies uniform bounds on the number of rational points on curves of genus $\ge 2$ (Bombieri, Elkies).
4. Wieferich primes: abc implies there are infinitely many non-Wieferich primes in every residue class — relevant to cryptographic prime selection.
5. Erdős–Woods conjecture and Pillai's conjecture on consecutive perfect powers follow.
6. Squarefree values of polynomials: abc controls the density of $n$ for which $f(n)$ is squarefree (Granville).
7. Catalan / Tijdeman-type results: bounds on solutions to $x^p-y^q=1$ follow quantitatively.

Historical Development

• 1983 — Richard Mason (and independently A. Stothers, 1981) prove the polynomial abc theorem (Mason–Stothers), the function-field model.
• 1985 — Joseph Oesterlé, studying Szpiro's conjecture on elliptic curves, and David Masser, formulate the abc conjecture in its modern quantitative form.
• 1988 — Lucien Szpiro's conjecture is recognized as essentially equivalent to abc, tying it to the geometry of elliptic curves.
• 1991 — Noam Elkies shows abc implies an effective form of Mordell's conjecture (Faltings' theorem).
• 2006 — The ABC@Home distributed-computing project begins systematically cataloguing high-quality triples.
• August 2012 — Shinichi Mochizuki posts the four IUT papers claiming a proof via inter-universal Teichmüller theory.
• 2015 — Major workshops (Oxford, Kyoto/RIMS) attempt to disseminate IUT; experts report the core remains opaque.
• 2018 — Peter Scholze and Jakob Stix circulate a manuscript asserting a gap in Corollary 3.12; Mochizuki publishes detailed rebuttals.
• 2020–2021 — PRIMS accepts and publishes the IUT papers; the broader community remains unconvinced, and the abc conjecture is widely regarded as open.

Subtleties & Limits

The central open question is simply whether the abc conjecture is true and, if Mochizuki's framework is correct, whether it can be communicated and verified in conventional terms.

1. The Scholze–Stix objection targets the identification of certain copies of arithmetic objects ("theaters") under indeterminacies; whether the claimed inequality survives a fully rigorous accounting of these indeterminacies is disputed.
2. Effectivity. Even granting abc, producing an explicit $K_{\epsilon }$ remains a deep and largely open quantitative problem; IUT, if valid, yields an effective Szpiro inequality, but the constants are enormous.
3. The quality spectrum. Whether quality $q$ can equal or exceed specific thresholds (e.g. $q>1.7$) for some triple is unknown; the supremum of $q$ is conjectured to be exactly... unknown, with $q\to 1^{+}$ being the abc bound but no a priori upper cap below the record.
4. Independent proofs. No proof of abc independent of IUT exists, despite partial results (e.g. abc holds with the exponent weakened, via Stewart–Yu's bounds $c<\exp (\mathrm{rad}(abc{)}^{1/3+\epsilon })$ — far from polynomial).

See Also