Effective Closure B; The Height Machine- Where the Bound Comes From, Where the Distortion Sits, and What a Compression Certificate Means

Height is not a single function but a functorial machine: it runs one channelalong multiplication, one along addition, one along torsion, and each channel carries its own distortion format—multiplicative distortion is bounded by a constant,additive deviation is predicted exactly by the parallelogram law, and torsion landsin the zero-height tier. This paper treats the three channels of the height machine, the computational prerequisites of the standard height, the ineffective gapleft by Northcott’s theorem, and the semantics of height as an information reading.The paper proves three self-contained theorems. The height table theorem: thefirst twelve multiples of a point on the curve y2 = x3 − x + 1 yield a completeledger, the naive height growing from zero to 64.42, the quadratic fit of the standard height near 0.4483, the residuals oscillating boundedly between 0.01 and 0.64,the truncation approximation differing from the fitted reading by about 0.00024,within the fit error, so that the quadratic-growth anchor and the bounded-deviationledger close. The distortion double-ledger theorem: the deviation h(2Q)−4h(Q) onthe multiplication channel is bounded (between 0.0006 and 1.6185), the deviationon the sum channel grows linearly with a slope quantitatively consistent with theparallelogram-law prediction 2ˆ h(P) (slope 0.902, ratio 1.006, bounded residual),and the two distortion formats each sit where they belong. The torsion zero-heighttheorem: at a torsion point the standard height vanishes identically and the naiveheight is bounded (zero), so that the height machine separates torsion from nontorsion into two decidable tiers, the discriminator itself being a special case of ahalting certificate. The paper also delivers one concrete compression certificate: the637-digit lowest-terms entity of the twelve multiples is compressed into twenty-nineregistration digits counted under the convention pinned in Chapter 6, a compression ratio of about 22 : 1 inside the window, exactly complete inside the windowand written off beyond it pending Chh, so that “compression certificate” turns froma semantic promise into a digit-by-digit auditable ledger. The paper registers twovoided ledgers: the first version of the distortion ledger misstated the additive deviation as bounded, and verification confirmed instead the linear growth predictedby the law; and a set of old fit readings kept in the first version of the reconciliationnote of Appendix A.6, which no natural protocol reproduces on back-filling, bothfinal versions following the verified statement, with the full text in Appendix D.1.The paper does not prove a general higher-dimensional height transfer and givescondition templates only; it does not read Northcott’s finiteness as effectiveness;it does not read the existence of a height machine as the existence of a heightbound; and it does not read the mathematical definition of the standard height asits computational availability

Authors

Publication Details

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

Effective Closure B; The Height Machine- Where the Bound Comes From, Where the Distortion Sits, and What a Compression Certificate Means

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

Effective Closure B; The Height Machine- Where the Bound Comes From, Where the Distortion Sits, and What a Compression Certificate Means

changzheng zhou, ziqing zhou
preprint en

Abstract

Height is not a single function but a functorial machine: it runs one channelalong multiplication, one along addition, one along torsion, and each channel carries its own distortion format—multiplicative distortion is bounded by a constant,additive deviation is predicted exactly by the parallelogram law, and torsion landsin the zero-height tier. This paper treats the three channels of the height machine, the computational prerequisites of the standard height, the ineffective gapleft by Northcott’s theorem, and the semantics of height as an information reading.The paper proves three self-contained theorems. The height table theorem: thefirst twelve multiples of a point on the curve y2 = x3 − x + 1 yield a completeledger, the naive height growing from zero to 64.42, the quadratic fit of the standard height near 0.4483, the residuals oscillating boundedly between 0.01 and 0.64,the truncation approximation differing from the fitted reading by about 0.00024,within the fit error, so that the quadratic-growth anchor and the bounded-deviationledger close. The distortion double-ledger theorem: the deviation h(2Q)−4h(Q) onthe multiplication channel is bounded (between 0.0006 and 1.6185), the deviationon the sum channel grows linearly with a slope quantitatively consistent with theparallelogram-law prediction 2ˆ h(P) (slope 0.902, ratio 1.006, bounded residual),and the two distortion formats each sit where they belong. The torsion zero-heighttheorem: at a torsion point the standard height vanishes identically and the naiveheight is bounded (zero), so that the height machine separates torsion from nontorsion into two decidable tiers, the discriminator itself being a special case of ahalting certificate. The paper also delivers one concrete compression certificate: the637-digit lowest-terms entity of the twelve multiples is compressed into twenty-nineregistration digits counted under the convention pinned in Chapter 6, a compression ratio of about 22 : 1 inside the window, exactly complete inside the windowand written off beyond it pending Chh, so that “compression certificate” turns froma semantic promise into a digit-by-digit auditable ledger. The paper registers twovoided ledgers: the first version of the distortion ledger misstated the additive deviation as bounded, and verification confirmed instead the linear growth predictedby the law; and a set of old fit readings kept in the first version of the reconciliationnote of Appendix A.6, which no natural protocol reproduces on back-filling, bothfinal versions following the verified statement, with the full text in Appendix D.1.The paper does not prove a general higher-dimensional height transfer and givescondition templates only; it does not read Northcott’s finiteness as effectiveness;it does not read the existence of a height machine as the existence of a heightbound; and it does not read the mathematical definition of the standard height asits computational availability

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