Constraint Failure Boundary C: Hidden Anchors in the Geometric Layer—Special Subvarieties as Extra Rational-Point Branches

This paper treats the hidden reconnection genus of the geometric layer: therational-point branches produced by special geometry (a structural prior) and theexpected branches given by asymptotic extrapolation of a propagation functionΦ are not objects of the same kind. To make the distinction between them verifiable rather than merely rhetorical, this paper formalizes the difference as thehidden reconnection genus of the geometric layer (geometric HRD), and expressesthe two load-bearing predicates of the decision layer, Φ covers Z” and Z belongsto Yexpected”, as registrable coverage-proxy readings and membership certificates,supplemented by source labels and a registration-independence clause that blocksself-justifying circularity. On this protocol the paper gives three types of verifiable distinction certificates (distribution-deviation type, height-degeneration type,effective-descriptiveness type), the six-exit format of the detection decision tree(precondition fails → open; all three types fail with a membership certificate →excluded; all three types fail without a membership certificate → open; at least onetype passes but sensitivity is not closed → candidate; passes and closed but withan exclusive reading or a reading conflict → open; passes and closed with no conflict → positive), and a no-go template: a completeness claim pruned only by localheight inequalities and local compatibility conditions cannot hold. All numericalreadings are machine-checked before the main text is written: the thirteen chambers of class number one (nine fundamental discriminants, four non-fundamentaldiscriminants), the six-order cycle of torsion of the curve y2 = x3 + 1, the mod3 and mod 5 counts 7 and 8 of E′ together with five height readings, are registered item by item in Chapter 2. Readings are registered only, never promoted;fitted values are not written as identities; no torsion in the box” is not written asno torsion”; negative conclusions are always conditionalized. This paper does notprove Zilber–Pink, Manin–Mumford, or Andr´e–Oort; load-bearing references serveonly for localization. The main text runs from Chapter 2 to Chapter 11, ten chapters in all, namely the machine-check ledger, expected branches and hidden-anchorbranches, torsion-point branches, coverage membership and registration independence, verifiable distinction criteria and detection protocol for geometric HRD, CMbranches and finite chambers of class number, the height-degeneration detector, theno-go, prohibitions and open registrations, and the reading guide and executionentry index of the whole paper; thereafter come the conclusion and Appendices Ato D, four in number.

Authors

Publication Details

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

Constraint Failure Boundary C: Hidden Anchors in the Geometric Layer—Special Subvarieties as Extra Rational-Point Branches

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

Constraint Failure Boundary C: Hidden Anchors in the Geometric Layer—Special Subvarieties as Extra Rational-Point Branches

changzheng zhou, ziqing zhou
preprint en

Abstract

This paper treats the hidden reconnection genus of the geometric layer: therational-point branches produced by special geometry (a structural prior) and theexpected branches given by asymptotic extrapolation of a propagation functionΦ are not objects of the same kind. To make the distinction between them verifiable rather than merely rhetorical, this paper formalizes the difference as thehidden reconnection genus of the geometric layer (geometric HRD), and expressesthe two load-bearing predicates of the decision layer, Φ covers Z” and Z belongsto Yexpected”, as registrable coverage-proxy readings and membership certificates,supplemented by source labels and a registration-independence clause that blocksself-justifying circularity. On this protocol the paper gives three types of verifiable distinction certificates (distribution-deviation type, height-degeneration type,effective-descriptiveness type), the six-exit format of the detection decision tree(precondition fails → open; all three types fail with a membership certificate →excluded; all three types fail without a membership certificate → open; at least onetype passes but sensitivity is not closed → candidate; passes and closed but withan exclusive reading or a reading conflict → open; passes and closed with no conflict → positive), and a no-go template: a completeness claim pruned only by localheight inequalities and local compatibility conditions cannot hold. All numericalreadings are machine-checked before the main text is written: the thirteen chambers of class number one (nine fundamental discriminants, four non-fundamentaldiscriminants), the six-order cycle of torsion of the curve y2 = x3 + 1, the mod3 and mod 5 counts 7 and 8 of E′ together with five height readings, are registered item by item in Chapter 2. Readings are registered only, never promoted;fitted values are not written as identities; no torsion in the box” is not written asno torsion”; negative conclusions are always conditionalized. This paper does notprove Zilber–Pink, Manin–Mumford, or Andr´e–Oort; load-bearing references serveonly for localization. The main text runs from Chapter 2 to Chapter 11, ten chapters in all, namely the machine-check ledger, expected branches and hidden-anchorbranches, torsion-point branches, coverage membership and registration independence, verifiable distinction criteria and detection protocol for geometric HRD, CMbranches and finite chambers of class number, the height-degeneration detector, theno-go, prohibitions and open registrations, and the reading guide and executionentry index of the whole paper; thereafter come the conclusion and Appendices Ato D, four in number.

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