HASSE Ladder F: Effective Halting Height Bounds, Chabauty Islands and the Four-Cell Interface

The last rung of the Hasse ladder is not a larger pair of scissors but a colderheight machine: even once the scissors have reduced the candidates to a finiteset, enumeration does not halt without an effective height bound. This papertreats halting itself: where the gap between finiteness and effectivity lies, whatground the Chabauty–Coleman islands occupy, and how the failure coordinatesof the Hasse ladder are mounted on the four-cell wall for Hilbert’s tenth problemover the rationals. Three self-contained or conditional conclusions and one auditprotocol are registered.The tight-bound ledger of the rank-zero island: for y2 = x3 − x the torsionsubgroup is trapped between injective reduction at good reduction and two explicittorsion points, giving exactly (Z/2)2; the four points remain distinct modulo 3, sothe bound #E(Q) ≤ #E(F3) = 4 is tight, the island bound is the point count, andthe tight bound comes from the torsion bound together with rank zero, not fromintegration. This decision uses the structural direct-giving channel of the exemptionclause in Chapter 7, clause 7.1; its dependencies are the rank-zero external anchorand load-bearing reference [3], and it is not classified among the three certificates.The off-island failure ledger: for y2 = x3 − x + 1 the first six multiples of thenon-torsion point are distinct, the rank is at least one, the failure threshold for thegenus is reached, and the rank-zero bound fails on the same family. The table ofthe first six multiples bears only a lower bound on the rank, not an upper one.The proof-obligation protocol: inside the description-tower formal model, anycompleteness proof claiming to decide the existence of rational points must explicitly import one of a cut certificate, a gluing-elimination certificate or an effectivetruncation certificate; without a certificate the chain of inference cannot cross thecorresponding gap. The axioms of the model come in four layers, and the protocoldoes not pass itself off as an unconditional theorem.All machine checks are registered: the two-channel interlocking entry for thePell equation at genus zero, the tight-bound entry for the rank-zero island at genusone, and the signature entry for box search without a completeness certificate atgenus two. One absence is registered: the order-type characterization of the Kleenetree is borne by the recursion-theoretic literature and is not reproduced here, theevidence for the existence of the gap being carried by the self-contained three-stepargument. This paper announces no answer to Hilbert’s tenth problem over therationals, no through-traffic on the bridge of non-abelian Chabauty, no decisionreading of Faltings finiteness, and no positive solution of Hilbert’s tenth problemfrom defining Z inside Q.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24327964
Primary Topic
Algebraic Geometry and Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

HASSE Ladder F: Effective Halting Height Bounds, Chabauty Islands and the Four-Cell Interface

changzheng zhou, ziqing zhou
3 links
Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
preprint

HASSE Ladder F: Effective Halting Height Bounds, Chabauty Islands and the Four-Cell Interface

changzheng zhou, ziqing zhou
preprint en

Abstract

The last rung of the Hasse ladder is not a larger pair of scissors but a colderheight machine: even once the scissors have reduced the candidates to a finiteset, enumeration does not halt without an effective height bound. This papertreats halting itself: where the gap between finiteness and effectivity lies, whatground the Chabauty–Coleman islands occupy, and how the failure coordinatesof the Hasse ladder are mounted on the four-cell wall for Hilbert’s tenth problemover the rationals. Three self-contained or conditional conclusions and one auditprotocol are registered.The tight-bound ledger of the rank-zero island: for y2 = x3 − x the torsionsubgroup is trapped between injective reduction at good reduction and two explicittorsion points, giving exactly (Z/2)2; the four points remain distinct modulo 3, sothe bound #E(Q) ≤ #E(F3) = 4 is tight, the island bound is the point count, andthe tight bound comes from the torsion bound together with rank zero, not fromintegration. This decision uses the structural direct-giving channel of the exemptionclause in Chapter 7, clause 7.1; its dependencies are the rank-zero external anchorand load-bearing reference [3], and it is not classified among the three certificates.The off-island failure ledger: for y2 = x3 − x + 1 the first six multiples of thenon-torsion point are distinct, the rank is at least one, the failure threshold for thegenus is reached, and the rank-zero bound fails on the same family. The table ofthe first six multiples bears only a lower bound on the rank, not an upper one.The proof-obligation protocol: inside the description-tower formal model, anycompleteness proof claiming to decide the existence of rational points must explicitly import one of a cut certificate, a gluing-elimination certificate or an effectivetruncation certificate; without a certificate the chain of inference cannot cross thecorresponding gap. The axioms of the model come in four layers, and the protocoldoes not pass itself off as an unconditional theorem.All machine checks are registered: the two-channel interlocking entry for thePell equation at genus zero, the tight-bound entry for the rank-zero island at genusone, and the signature entry for box search without a completeness certificate atgenus two. One absence is registered: the order-type characterization of the Kleenetree is borne by the recursion-theoretic literature and is not reproduced here, theevidence for the existence of the gap being carried by the self-contained three-stepargument. This paper announces no answer to Hilbert’s tenth problem over therationals, no through-traffic on the bridge of non-abelian Chabauty, no decisionreading of Faltings finiteness, and no positive solution of Hilbert’s tenth problemfrom defining Z inside Q.

Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon