abc conjecture

Template:Short description Template:Infobox mathematical statement

The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.Template:Sfn Template:Sfn It is stated in terms of three positive integers <math>a, b</math> and <math>c</math> (hence the name) that are relatively prime and satisfy <math>a+b=c</math>. The conjecture essentially states that the product of the distinct prime factors of <math>abc</math> is usually not much smaller than <math>c</math>. A number of famous conjectures and theorems in number theory would follow immediately from the abc conjecture or its versions. Mathematician Dorian Goldfeld described the abc conjecture as "The most important unsolved problem in Diophantine analysis".Template:Sfn

The abc conjecture originated as the outcome of attempts by Oesterlé and Masser to understand the Szpiro conjecture about elliptic curves,<ref>Template:Cite journal</ref> which involves more geometric structures in its statement than the abc conjecture. The abc conjecture was shown to be equivalent to the modified Szpiro's conjecture.Template:Sfn

Various attempts to prove the abc conjecture have been made, but none have gained broad acceptance. Shinichi Mochizuki claimed to have a proof in 2012, but the conjecture is still regarded as unproven by the mainstream mathematical community.<ref name="Ball"> Template:Cite journal</ref><ref name="nature-2020">Template:Cite journal</ref><ref>Further comment by P. Scholze at Not Even Wrong math.columbia.eduTemplate:Self-published inline</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

FormulationsEdit

Before stating the conjecture, the notion of the radical of an integer must be introduced: for a positive integer <math>n</math>, the radical of <math>n</math>, denoted <math>\text{rad}(n)</math>, is the product of the distinct prime factors of <math>n</math>. For example,

<math>\text{rad}(18)=\text{rad}(2\cdot 3^2)=2\cdot3 =6</math>

<math>\text{rad}(1000000)=\text{rad}(2^6 \cdot 5^6)=2\cdot5=10</math>

If a, b, and c are coprime<ref group="notes">When a + b = c, any common factor of two of the values is necessarily shared by the third. Thus, coprimality of a, b, c implies pairwise coprimality of a, b, c. So in this case, it does not matter which concept we use.</ref> positive integers such that a + b = c, it turns out that "usually" <math>c<\text{rad}(abc)</math>. The abc conjecture deals with the exceptions. Specifically, it states that:

Template:Block indent

An equivalent formulation is:

Template:Block indent

Equivalently (using the little o notation):

Template:Block indent

A fourth equivalent formulation of the conjecture involves the quality q(a, b, c) of the triple (a, b, c), which is defined as

Template:Block indent

For example:

Template:Block indent

A typical triple (a, b, c) of coprime positive integers with a + b = c will have c < rad(abc), i.e. q(a, b, c) < 1. Triples with q > 1 such as in the second example are rather special, they consist of numbers divisible by high powers of small prime numbers. The fourth formulation is:

Template:Block indent

Whereas it is known that there are infinitely many triples (a, b, c) of coprime positive integers with a + b = c such that q(a, b, c) > 1, the conjecture predicts that only finitely many of those have q > 1.01 or q > 1.001 or even q > 1.0001, etc. In particular, if the conjecture is true, then there must exist a triple (a, b, c) that achieves the maximal possible quality q(a, b, c).

Examples of triples with small radicalEdit

The condition that ε > 0 is necessary as there exist infinitely many triples a, b, c with c > rad(abc). For example, let

Template:Block indent

The integer b is divisible by 9:

Template:Block indent

Using this fact, the following calculation is made:

Template:Block indent

By replacing the exponent 6n with other exponents forcing b to have larger square factors, the ratio between the radical and c can be made arbitrarily small. Specifically, let p > 2 be a prime and consider

Template:Block indent

Now it may be plausibly claimed that b is divisible by p²:

Template:Block indent

The last step uses the fact that p² divides 2^p(p−1) − 1. This follows from Fermat's little theorem, which shows that, for p > 2, 2^p−1 = pk + 1 for some integer k. Raising both sides to the power of p then shows that 2^p(p−1) = p²(...) + 1.

And now with a similar calculation as above, the following results:

Template:Block indent

A list of the highest-quality triples (triples with a particularly small radical relative to c) is given below; the highest quality, 1.6299, was found by Eric Reyssat Template:Harv for Template:Block indent Template:Block indent Template:Block indent Template:Block indent

Some consequencesEdit

The abc conjecture has a large number of consequences. These include both known results (some of which have been proven separately only since the conjecture has been stated) and conjectures for which it gives a conditional proof. The consequences include:

Roth's theorem on Diophantine approximation of algebraic numbers.Template:Sfnp Template:Sfn
The Mordell conjecture (already proven in general by Gerd Faltings).Template:Sfnp
As equivalent, Vojta's conjecture in dimension 1.Template:Sfnp
The Erdős–Woods conjecture allowing for a finite number of counterexamples.Template:Sfnp
The existence of infinitely many non-Wieferich primes in every base b > 1.Template:Sfnp
The weak form of Marshall Hall's conjecture on the separation between squares and cubes of integers.Template:Sfnp
Fermat's Last Theorem has a famously difficult proof by Andrew Wiles. However it follows easily, at least for <math>n \ge 6</math>, from an effective form of a weak version of the abc conjecture. The abc conjecture says the lim sup of the set of all qualities (defined above) is 1, which implies the much weaker assertion that there is a finite upper bound for qualities. The conjecture that 2 is such an upper bound suffices for a very short proof of Fermat's Last Theorem for <math>n \ge 6</math>.<ref>Template:Cite journal</ref>
The Fermat–Catalan conjecture, a generalization of Fermat's Last Theorem concerning powers that are sums of powers.Template:Sfnp
The L-function L(s, χ_d) formed with the Legendre symbol, has no Siegel zero, given a uniform version of the abc conjecture in number fields, not just the abc conjecture as formulated above for rational integers.Template:Sfnp
A polynomial P(x) has only finitely many perfect powers for all integers x if P has at least three simple zeros.<ref name="Ref_a">The ABC-conjecture, Frits Beukers, ABC-DAY, Leiden, Utrecht University, 9 September 2005.</ref>
A generalization of Tijdeman's theorem concerning the number of solutions of y^m = xⁿ + k (Tijdeman's theorem answers the case k = 1), and Pillai's conjecture (1931) concerning the number of solutions of Ay^m = Bxⁿ + k.
As equivalent, the Granville–Langevin conjecture, that if f is a square-free binary form of degree n > 2, then for every real β > 2 there is a constant C(f, β) such that for all coprime integers x, y, the radical of f(x, y) exceeds C · max{|x|, |y|}^n−β.<ref>Template:Harvtxt; Template:Harvtxt</ref>
all the polynominals (x^n-1)/(x-1) have an infinity of square-free values.<ref>Template:Harvtxt</ref>
As equivalent, the modified Szpiro conjecture, which would yield a bound of rad(abc)^1.2+ε.Template:Sfn
Template:Harvtxt has shown that the abc conjecture implies that the Diophantine equation n! + A = k² has only finitely many solutions for any given integer A.
There are ~c_fN positive integers n ≤ N for which f(n)/B' is square-free, with c_f > 0 a positive constant defined as:Template:Sfnp Template:Block indent \right ).</math>}}
The Beal conjecture, a generalization of Fermat's Last Theorem proposing that if A, B, C, x, y, and z are positive integers with A^x + B^y = C^z and x, y, z > 2, then A, B, and C have a common prime factor. The abc conjecture would imply that there are only finitely many counterexamples.
Lang's conjecture, a lower bound for the height of a non-torsion rational point of an elliptic curve.
A negative solution to the Erdős–Ulam problem on dense sets of Euclidean points with rational distances.<ref>

Template:Citation </ref>

An effective version of Siegel's theorem about integral points on algebraic curves.<ref>Template:Cite journal</ref>

Theoretical resultsEdit

The abc conjecture implies that c can be bounded above by a near-linear function of the radical of abc. Bounds are known that are exponential. Specifically, the following bounds have been proven:

Template:Block indent Template:Block indent Template:Block indent\left(\log(\operatorname{rad}(abc)\right)^3\right) } </math> Template:Harv.}}

In these bounds, K₁ and K₃ are constants that do not depend on a, b, or c, and K₂ is a constant that depends on ε (in an effectively computable way) but not on a, b, or c. The bounds apply to any triple for which c > 2.

There are also theoretical results that provide a lower bound on the best possible form of the abc conjecture. In particular, Template:Harvtxt showed that there are infinitely many triples (a, b, c) of coprime integers with a + b = c and

Template:Block indent

for all k < 4. The constant k was improved to k = 6.068 by Template:Harvtxt.

Computational resultsEdit

In 2006, the Mathematics Department of Leiden University in the Netherlands, together with the Dutch Kennislink science institute, launched the ABC@Home project, a grid computing system, which aims to discover additional triples a, b, c with rad(abc) < c. Although no finite set of examples or counterexamples can resolve the abc conjecture, it is hoped that patterns in the triples discovered by this project will lead to insights about the conjecture and about number theory more generally.

Distribution of triples with q > 1<ref name="Ref_d">Template:Citation.</ref>
scope="col" Template:Diagonal split header	q > 1	q > 1.05	q > 1.1	q > 1.2	q > 1.3	q > 1.4
c < 10²	6	4	4	2	0	0
c < 10³	31	17	14	8	3	1
c < 10⁴	120	74	50	22	8	3
c < 10⁵	418	240	152	51	13	6
c < 10⁶	1,268	667	379	102	29	11
c < 10⁷	3,499	1,669	856	210	60	17
c < 10⁸	8,987	3,869	1,801	384	98	25
c < 10⁹	22,316	8,742	3,693	706	144	34
c < 10¹⁰	51,677	18,233	7,035	1,159	218	51
c < 10¹¹	116,978	37,612	13,266	1,947	327	64
c < 10¹²	252,856	73,714	23,773	3,028	455	74
c < 10¹³	528,275	139,762	41,438	4,519	599	84
c < 10¹⁴	1,075,319	258,168	70,047	6,665	769	98
c < 10¹⁵	2,131,671	463,446	115,041	9,497	998	112
c < 10¹⁶	4,119,410	812,499	184,727	13,118	1,232	126
c < 10¹⁷	7,801,334	1,396,909	290,965	17,890	1,530	143
c < 10¹⁸	14,482,065	2,352,105	449,194	24,013	1,843	160

As of May 2014, ABC@Home had found 23.8 million triples.<ref name="Ref_c">Template:Citation</ref>

Template:Visible anchor<ref>{{#invoke:citation/CS1|citation
Rank	q	a	b	c	Discovered by
CitationClass=web }}</ref>
1	1.6299	2	3¹⁰·109	23⁵	Eric Reyssat
2	1.6260	11²	3²·5⁶·7³	2²¹·23	Benne de Weger
3	1.6235	19·1307	7·29²·31⁸	2⁸·3²²·5⁴	Jerzy Browkin, Juliusz Brzezinski
4	1.5808	283	5¹¹·13²	2⁸·3⁸·17³	Jerzy Browkin, Juliusz Brzezinski, Abderrahmane Nitaj
5	1.5679	1	2·3⁷	5⁴·7	Benne de Weger

Note: the quality q(a, b, c) of the triple (a, b, c) is defined above.

Refined forms, generalizations and related statementsEdit

The abc conjecture is an integer analogue of the Mason–Stothers theorem for polynomials.

A strengthening, proposed by Template:Harvtxt, states that in the abc conjecture one can replace rad(abc) by

Template:Block indent

where ω is the total number of distinct primes dividing a, b and c.Template:Sfnp

Andrew Granville noticed that the minimum of the function <math>\big(\varepsilon^{-\omega}\operatorname{rad}(abc)\big)^{1+\varepsilon}</math> over <math>\varepsilon > 0</math> occurs when <math>\varepsilon = \frac{\omega}{\log\big(\operatorname{rad}(abc)\big)}.</math>

This inspired Template:Harvtxt to propose a sharper form of the abc conjecture, namely: Template:Block indent with κ an absolute constant. After some computational experiments he found that a value of <math>6/5</math> was admissible for κ. This version is called the "explicit abc conjecture".

Template:Harvtxt also describes related conjectures of Andrew Granville that would give upper bounds on c of the form

Template:Block indent

where Ω(n) is the total number of prime factors of n, and

Template:Block indent

where Θ(n) is the number of integers up to n divisible only by primes dividing n.

Template:Harvtxt proposed a more precise inequality based on Template:Harvtxt. Let k = rad(abc). They conjectured there is a constant C₁ such that

Template:Block indent\left(1+\frac{\log\log\log k}{2\log\log k}+\frac{C_{1}}{\log\log k}\right)\right)</math>}}

holds whereas there is a constant C₂ such that

Template:Block indent\left(1+\frac{\log\log\log k}{2\log\log k}+\frac{C_{2}}{\log\log k}\right)\right)</math>}}

holds infinitely often.

Template:Harvtxt formulated the n conjecture—a version of the abc conjecture involving n > 2 integers.

Claimed proofsEdit

Lucien Szpiro proposed a solution in 2007, but it was found to be incorrect shortly afterwards.<ref>"Finiteness Theorems for Dynamical Systems", Lucien Szpiro, talk at Conference on L-functions and Automorphic Forms (on the occasion of Dorian Goldfeld's 60th Birthday), Columbia University, May 2007. See Template:Citation.</ref>

Since August 2012, Shinichi Mochizuki has claimed a proof of Szpiro's conjecture and therefore the abc conjecture.<ref name = "Ball"/> He released a series of four preprints developing a new theory he called inter-universal Teichmüller theory (IUTT), which is then applied to prove the abc conjecture.<ref name=Mochizukiweb>Template:Cite journal</ref> The papers have not been widely accepted by the mathematical community as providing a proof of abc.<ref> {{#invoke:citation/CS1|citation |CitationClass=web }}</ref> This is not only because of their length and the difficulty of understanding them,<ref>Template:Cite magazine</ref> but also because at least one specific point in the argument has been identified as a gap by some other experts.<ref name=stillConj/> Although a few mathematicians have vouched for the correctness of the proof<ref> Template:Cite journal</ref> and have attempted to communicate their understanding via workshops on IUTT, they have failed to convince the number theory community at large.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>Template:Cite journal</ref>

In March 2018, Peter Scholze and Jakob Stix visited Kyoto for discussions with Mochizuki.<ref> Template:Cite magazine</ref><ref> {{#invoke:citation/CS1|citation |CitationClass=web }} Web-page by Mochizuki describing discussions and linking consequent publications and supplementary material</ref> While they did not resolve the differences, they brought them into clearer focus. Scholze and Stix wrote a report asserting and explaining an error in the logic of the proof and claiming that the resulting gap was "so severe that ... small modifications will not rescue the proof strategy";<ref name=stillConj>{{#invoke:citation/CS1|citation |CitationClass=web }} (updated version of their May report Template:Webarchive)</ref> Mochizuki claimed that they misunderstood vital aspects of the theory and made invalid simplifications.<ref> {{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref> {{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref> {{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

On April 3, 2020, two mathematicians from the Kyoto research institute where Mochizuki works announced that his claimed proof would be published in Publications of the Research Institute for Mathematical Sciences, the institute's journal. Mochizuki is chief editor of the journal but recused himself from the review of the paper.<ref name="nature-2020"/> The announcement was received with skepticism by Kiran Kedlaya and Edward Frenkel, as well as being described by Nature as "unlikely to move many researchers over to Mochizuki's camp".<ref name="nature-2020"/> In March 2021, Mochizuki's proof was published in RIMS.<ref> {{#invoke:citation/CS1|citation |CitationClass=web }}</ref>