Improving the Stewart–Yu bound for all abc triples
Abstract.
We prove that for coprime positive integers , where and is absolute and effectively computable. The proof combines estimates at maximal prime powers with a growing number of auxiliary primes in a rational logarithmic form.
Key words and phrases:
abc conjecture, radical, effective bounds, -adic logarithmic forms2020 Mathematics Subject Classification:
Primary 11D75; Secondary 11J86, 11D611. Introduction
For positive coprime integers , put . The conjecture predicts for every . It remains open. Stewart–Yu [5, p. 226] proved for . Their later bound [6, Theorem 1, p. 170] is , effectively. We prove the following.
Theorem 1.
There is an absolute effectively computable such that
| (1.1) |
for all positive integers with .
Equivalently, , where the exponent tends to from below as . Except for , one has and . In particular, effectively. For , Pasten [3, Theorem 1.4] bounds by . Here , is the largest prime factor and . For and fixed , he bounds it by , with an absolute . These improve the bound in restricted regions. Neither displayed estimate gives an improvement over the Stewart–Yu bound for all triples in terms of alone.
Put
| (1.2) |
Let be as in Section 3. Let be the effective constant in (3.5) and put , with defined in (4.1). On in (3.1), we use
| (1.3) |
The second holds for when . At this boundary both rates equal . Section 6 gives an effective common threshold. Stewart [4, Section 4, (4.13)–(4.14)] introduced the growing auxiliary-prime construction. Section 4 bounds the cofactors used in applying this construction to additive triples. For earlier -adic estimates, see [7]. The use of AI tools is described at the end of the paper.
2. Known estimates
All logarithms are natural. Write for the number of distinct prime divisors of , with , and for the number of primes at most . For reduced , put . Write for rational . The valuation satisfies and .
Fact F1 ([6, Theorem 1, p. 170, (5)]).
There is an absolute effectively computable such that
| (2.1) |
Fact F2 ([6, Lemma 2, p. 173, and (10), p. 172]).
For rational -units , integer exponents , , and ,
| (2.2) |
where is absolute and effectively computable.
In of [6, Section 2, (10)], the ramification index at is , including ; hence on agrees with . Independence is not required, and a base is allowed.
Fact F3 ([1, Proposition 5, p. 517], corrected in [2]).
Put . Let and let be generated by distinct primes and . The primes form a basis for . If and , then
| (2.3) | ||||
| (2.4) |
Lemma 2.1 (Specialisation of the group estimate).
Proof.
Apply Proposition 5 of [1], with the sign corrected in [2], with and the parameter in [1]. The group has positive rank, and . Its constant is for . For , the specialized coefficient is at most , since , and . The factor for the real place is at most . For , . For , ; both comparisons follow from . ∎
Fact F4 ([4, Lemma 3.1, pp. 301–302]; [8, Main theorem, (1.18), p. 321]).
Let , , and . For independent rational -units and integers , not all zero, put . If , then
| (2.5) |
Lemma 2.2 (Specialisation of the growing-rank estimate).
Proof.
Stewart’s derivation uses the constants and . Yu’s published rational case has and ; with these constants, the bound used here holds for . We derive this range directly from Yu [8]. Use [8, (1.9), (1.11), (1.13), (1.28), (1.30)–(1.31)] with and Yu’s parameters , . Relabel a minimum-valuation exponent last, as (1.17) requires. We retain throughout and use the upper bound . Put and . Then
The last inequality holds at , and its difference increases. Since and the auxiliary quantity in [8, (1.15)] equals , the first term of is at most
Yu’s additional term , where , satisfies . Hence . The saturated residue-group index is at least . Yu’s main theorem uses the heights of the original independent tuple in both Kummer cases; we only enlarge to . Yu’s first bound is consequently at most
Use Stirling’s inequality . Also and . Finally,
For this comparison one may use , , and . This gives (2.5) from the published constants for . ∎
Put . By (2.1), if and , then
| (2.6) |
since and . For fixed , define the effective constants
| (2.7) |
For every squarefree ,
| (2.8) |
For , and . Multiply over the primes dividing .
3. Maximal prime powers
Arrange . For each nonunit side , put
By definition, . On , all three sides exceed . Put
Consider the range
| (3.1) |
On this range,
| (3.2) | |||
| (3.3) |
We have and ; summing the three lower bounds gives . Maximality gives . Also , and . The actual ratios
| (3.4) |
have height at most and satisfy for .
4. Cofactors of the maximal prime powers
Assume the triple lies in . Put and . Choose an integer with . Define
| (4.1) |
Then , since . For squarefree with , one has . Integration gives . It follows that
The last expression is nonpositive for . The finite maximum handles , including . Consequently,
| (4.2) |
Let . Represent using , every prime dividing , and the sign. These bases are -units. Their coefficients are at most , with . Since , the two factors for in (2.2) have product at most . Each remaining prime contributes
The sign contributes . Apply (F2), (4.2) and :
| (4.3) |
Every residual exponent is included, also at . For distinct sides , this yields
| (4.4) |
If , and ; if , . Likewise for . Coprimality gives ; use for .
5. Auxiliary primes in the local estimate
Lemma 5.1.
Let be distinct primes, , and . Suppose . Let be coprime positive integers with and . For , , and a nonzero difference,
| (5.1) |
Proof.
Write for the valuation and . If , the result follows. For , take . For , take ; oddness gives . Hence . The denominator is a -unit, and ensures nonvanishing.
Put . Then and . Choose auxiliary primes outside . For , use of them and set
| (5.2) | ||||||
If , omit and use auxiliaries. The product is . Take an integer relation . The valuations at and give . For , a prime in its support then gives , and each gives for . The tuple without is treated in the same way. All bases are rational -units.
For , Legendre’s formula gives
Each prime contributes at most to the binomial coefficient. Hence . For , use and to obtain . At ,
| (5.3) |
Here . There are at most forbidden primes, and . Therefore is possible.
The auxiliary denominator has logarithm at most . Since , we have ; the same comparison holds for auxiliaries. Therefore,
| (5.4) | |||
| (5.5) |
The cofactor-free tuple satisfies the same bounds. Both maximum terms in (F4) are at most , since
Here and . For ,
That upper bound equals . Consequently,
| (5.6) |
6. Proof of Theorem 1
Set
| (6.1) |
Define the effective threshold
| (6.2) |
Assume and put . Then
| (6.3) |
First suppose the triple lies in and . Choose the least , with the other primes denoted by . The equation is , , or . The local difference in Lemma 5.1 has valuation , with cofactors and the appropriate sign. Their supports are coprime and avoid . By (3.3),
| (6.4) |
In particular, , so . The upper bound for uses , since is the least of the three primes. Also
Every complete exponent is at most . Its logarithm is at most . The middle comparison follows from in (6.3). Lemma 5.1 applies with exponents at most . Using (4.4) gives
| (6.5) |
The function increases for . Put and . Since ,
Apply this to (6.5):
| (6.6) |
because
| (6.7) |
The polynomial factors satisfy
| (6.8) | ||||
| (6.9) |
Here and . This covers the cofactor polynomial, , the factor , and all constants in (6.5). For , or with some , (6.3) gives
| (6.10) | ||||
| (6.11) |
Here and . Equations (3.6), (3.7), and (6.8)–(6.11) prove for .
It remains to cover the finite range. Apart from , at least two distinct primes divide . Hence . Define
| (6.12) |
The function has a unique minimum at . Its maximum on is therefore . For , (F1) yields
For , and . Hence (1.1) also holds there. ∎
Use of AI tools
The author devised the method of proof. Codex (OpenAI, GPT-6 Astra) and Antigravity (Google, Gemini 4 Carbon) carried out numerical checks and ran blind reviews of the manuscript. Claude Code (Anthropic, Claude Fable 5) checked the proofs and the references. The author checked every step of the proof and every reference, and takes full responsibility for the content of the paper.
Statements and declarations
Competing interests. The author has no competing interests.
Funding. No funding was received for this work.
References
- [1] (2019) Bounds for the solutions of -unit equations and decomposable form equations II. Publ. Math. Debrecen 94 (3-4), pp. 507–526. External Links: Document Cited by: Lemma 2.1, §2, Fact F3.
- [2] (2020) Corrigendum to “Bounds for the solutions of -unit equations and decomposable form equations II”. Publ. Math. Debrecen 97 (3-4), pp. 525. External Links: Document Cited by: Lemma 2.1, §2, Fact F3.
-
[3]
(2023)
The largest prime factor of and improvements on subexponential ABC.
Note: arXiv:2312.03566v1, https://
arxiv.org/ abs/ 2312.03566v1; published in Invent. Math. 236 (2024), 373–385, https:// doi.org/ 10.1007/ s00222-024-01244-6 Cited by: §1. - [4] (2013) On divisors of Lucas and Lehmer numbers. Acta Math. 211, pp. 291–314. External Links: Document Cited by: §1, Fact F4.
-
[5]
(1991)
On the conjecture.
Math. Ann. 291, pp. 225–230.
Note: https://
doi.org/ 10.1007/ BF01445201 External Links: Document Cited by: §1. -
[6]
(2001)
On the conjecture, II.
Duke Math. J. 108 (1), pp. 169–181.
Note: https://
doi.org/ 10.1215/ S0012-7094-01-10815-6 External Links: Document Cited by: §1, §2, Fact F1, Fact F2. - [7] (2007) -adic logarithmic forms and group varieties III. Forum Math. 19 (2), pp. 187–280. External Links: Document Cited by: §1.
- [8] (2013) -adic logarithmic forms and a problem of Erdős. Acta Math. 211, pp. 315–382. External Links: Document Cited by: §2, Fact F4.