Complete modulus locking in the exceptional set of the abc conjecture
Year: 2026
Type: preprint
Abstract: Let N\lambda(X) count primitive positive triples a+b=c\le X with \operatorname{rad}(abc)<c^\lambda. Using inherited anatomic estimates and a new finite exact-rational implication, we prove N\lambda(X)\ll X^{U+\varepsilon}\qquad(0<\lambda\le 1), where U=\frac{5845}{10009}<\frac{73}{125}=0.584. The new arithmetic-computational step exhausts all third-letter whole-value modulus sets: index 1 is eliminated by a one-Lipschitz argument, leaving 32 subsets of \{2,3,4,5,6\}, and grouped power-difference bounds are used in every fixed degree 2\le e\le 6. A reoptimized branch-and-bound tree with 84{,}147 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. The certificate includes a finite pair-deviation branch and is checked by the accompanying patched verifier. We also prove that the enlargement is mathematically essential, not merely a faster solver: an explicit rational point feasible for the old modulus family has D=403/690, whereas FullOC gives the collision bound 53/92 at the same point, and a second explicit point gives 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: Zeng, Chunping
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236248640
