Complete modulus locking in the exceptional set of the abc conjecture

A mix of human-written and AI-generated textHuman understanding: all partsmath.NT — Number Theory

Contributed by Zeng Chunping ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

Let Nλ(X)N_\lambda(X) count primitive positive triples a+b=c≤Xa+b=c\le X with rad(abc)<cλ\mathrm{rad}(abc)<c^\lambda. We prove, using inherited anatomic estimates and a new finite exact-rational implication, that Nλ(X)≪λ,εXU+εN_\lambda(X)\ll_{\lambda,\varepsilon}X^{U+\varepsilon} for 0<λ≤10<\lambda\le1, where U=1168000720000012<73125=0.584U=\frac{11680007}{20000012}<\frac{73}{125}=0.584. The new arithmetic-computational step exhausts all third-letter whole-value modulus sets: index 11 is eliminated by a one-Lipschitz argument, leaving 3232 subsets of {2,3,4,5,6}\{2,3,4,5,6\}, and grouped power-difference bounds are used in every fixed degree 2≤e≤62\le e\le6. A branch-and-bound tree with 65,57665{,}576 leaves is verified by an independent standard-library checker which reconstructs every inequality and checks every rational multiplier; floating-point linear programming is used only to discover the tree. We also prove that the enlargement is mathematically essential: an explicit rational point feasible for the old modulus family has D=403/690D=403/690, whereas FullOC gives the collision bound 53/9253/92 at the same point, and a second explicit point gives 7/12≤DFullOC∗7/12\le D^*_{\mathrm{FullOC}}. These are statements about exponent programs, not lower bounds for abc triples. No assertion of abc, Szpiro, finiteness of the exceptional set, or an Arakelov degeneration functor is made.

Author comments: First version. Computer-assisted theorem with exact rational certificates (65,576 leaves); the certificate tree and verification scripts are archived on Zenodo (DOI: 10.5281/zenodo.24354214). The abstract-level statement is verified by an independent standard-library checker; floating-point LP is used only to discover the tree.

Tools used

SageMath
SageMath

References

  1. Christian Bernert, Tim Browning, Jared Duker Lichtman and Joni Teräväinen, Bounds on the exceptional set in the abc conjecture , arXiv:2410.12234v2, version 2 submitted 9 May 2026 (version 1: 16 October 2024). https://arxiv.org/abs/2410.12234v2.arXiv
  2. Hongmin Li, Collision inequalities and the radical budget for the exceptional set in the abc conjecture , rStation, Mathematics paper 17, version 2 (2026). https://rstation.ai/problems/math/papers/17/v2.link
  3. Hongmin Li, Squares and twisted energy in the exceptional set of the abc conjecture , rStation, Mathematics paper 28, version 3, 13 November 2026. https://rstation.ai/problems/math/papers/28/v3.link

Version history

  1. v1 · 17 pagesSubmitted by Zeng ChunpingFirst version. Computer-assisted theorem with exact rational certificates (65,576 leaves); the certificate tree and verification scripts are archived on Zenodo (DOI: 10.5281/zenodo.24354214). The abstract-level statement is verified by an independent standard-library checker; floating-point LP is used only to discover the tree.CurrentNov 18, 2026