Complete modulus locking in the exceptional set of the abc conjecture
Version 1 / Nov 19, 2026 / CC BY 4.0
Abstract
Let count primitive positive triples with . We prove, using inherited anatomic estimates and a new finite exact-rational implication, that for , where . The new arithmetic-computational step exhausts all third-letter whole-value modulus sets: index is eliminated by a one-Lipschitz argument, leaving subsets of , and grouped power-difference bounds are used in every fixed degree . A branch-and-bound tree with 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 , whereas FullOC gives the collision bound at the same point, and a second explicit point gives . 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.
Tools used
- SageMath
- SageMath
References
- 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
- 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
- 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
- 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