Constraint Failure Boundary A: Hidden Reconnection Genus and Three Classes of Detectors

The failure mode in which all local constraints are satisfied while the globalclosure still fails can be precisely located: the source of failure is neither too manylegal branches nor a search that does not terminate, but the existence of an extrabranch that satisfies all local constraints yet is invisible to the current projectioncoordinates. This article formalizes this mode as the hidden reconnection genusand builds an executable unified decision system for it. The system consists ofa four-layer structure. The first layer is a three-tier definition: the representationlayer uses the non-vanishing of a cohomology class as its criterion, the spectral layeruses the degeneracy of the propagation operator’s spectral gap together with a trichotomy criterion, and the arithmetic height layer uses the failure of a global heightfunctional to cut a branch that passes all local filters as its criterion. The secondlayer is three-tier instantiation and consistency conditions: a single constraint datum carries only one layer of structure according to its layer-type adaptation, jointdecision must be carried out on a composite constraint datum, and the compositedatum must pass four interface conditions—spectral-graph prior provenance, sharedthreshold registration, truncation consistency, and error-attribution arbitration—with consistency verification executed as level zero of the decision tree. The thirdlayer is the three classes of detectors and the joint decision protocol: the spectral detector handles hidden edges and periodic phases of the propagation operator, the cohomological detector handles non-coboundary cochains and higher-orderobstruction to patching of the cover datum, and the arithmetic height detectorhandles special branches that pass all local filters yet are exempted by the globalheight functional; the joint decision protocol specifies the unified report format, theseven-level decision tree, the conditional joint decision proposition, and the table offorbidden inferences. The fourth layer is the five main conditions, three certifications, three witnesses, and open-boundary registration: a negative conclusion mustpass the non-assumption-immune-zone review, the positive-path sensitivity test,and the prior sensitivity test—three certifications—while the three witnesses mustexplicitly hand over a cover certificate, a gluing certificate, and a termination certificate. All numerical readings are machine-checked before the main text is written;readings are only registered, never promoted, and negative conclusions are alwaysconditionalized; this article produces no new arithmetic big theorem, does not passoff load-bearing objects as self-proved, does not write numerical stability as a closedform, and does not write not detected” as nonexistent.” The main text consists ofeleven chapters, Chapter 2 through Chapter 12, in order: the machine-check ledger,the demarcation of the three classes of phenomena and three minimal examples,the constraint-datum five-tuple and the three-tier definition of HRD, three-tier instantiation and consistency conditions, the joint detection protocol and decisiontree, the spectral detector, the cohomological detector, the arithmetic height detector, the conditionalization of the converse proposition, the open registry, andthe dual-channel verification and mis-entry retroactive-recognition protocol of themachine-check ledger; thereafter come the conclusion and Appendices A throughE, five in number

Authors

Publication Details

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

Constraint Failure Boundary A: Hidden Reconnection Genus and Three Classes of Detectors

changzheng zhou, ziqing zhou
Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
preprint

Constraint Failure Boundary A: Hidden Reconnection Genus and Three Classes of Detectors

changzheng zhou, ziqing zhou
preprint en

Abstract

The failure mode in which all local constraints are satisfied while the globalclosure still fails can be precisely located: the source of failure is neither too manylegal branches nor a search that does not terminate, but the existence of an extrabranch that satisfies all local constraints yet is invisible to the current projectioncoordinates. This article formalizes this mode as the hidden reconnection genusand builds an executable unified decision system for it. The system consists ofa four-layer structure. The first layer is a three-tier definition: the representationlayer uses the non-vanishing of a cohomology class as its criterion, the spectral layeruses the degeneracy of the propagation operator’s spectral gap together with a trichotomy criterion, and the arithmetic height layer uses the failure of a global heightfunctional to cut a branch that passes all local filters as its criterion. The secondlayer is three-tier instantiation and consistency conditions: a single constraint datum carries only one layer of structure according to its layer-type adaptation, jointdecision must be carried out on a composite constraint datum, and the compositedatum must pass four interface conditions—spectral-graph prior provenance, sharedthreshold registration, truncation consistency, and error-attribution arbitration—with consistency verification executed as level zero of the decision tree. The thirdlayer is the three classes of detectors and the joint decision protocol: the spectral detector handles hidden edges and periodic phases of the propagation operator, the cohomological detector handles non-coboundary cochains and higher-orderobstruction to patching of the cover datum, and the arithmetic height detectorhandles special branches that pass all local filters yet are exempted by the globalheight functional; the joint decision protocol specifies the unified report format, theseven-level decision tree, the conditional joint decision proposition, and the table offorbidden inferences. The fourth layer is the five main conditions, three certifications, three witnesses, and open-boundary registration: a negative conclusion mustpass the non-assumption-immune-zone review, the positive-path sensitivity test,and the prior sensitivity test—three certifications—while the three witnesses mustexplicitly hand over a cover certificate, a gluing certificate, and a termination certificate. All numerical readings are machine-checked before the main text is written;readings are only registered, never promoted, and negative conclusions are alwaysconditionalized; this article produces no new arithmetic big theorem, does not passoff load-bearing objects as self-proved, does not write numerical stability as a closedform, and does not write not detected” as nonexistent.” The main text consists ofeleven chapters, Chapter 2 through Chapter 12, in order: the machine-check ledger,the demarcation of the three classes of phenomena and three minimal examples,the constraint-datum five-tuple and the three-tier definition of HRD, three-tier instantiation and consistency conditions, the joint detection protocol and decisiontree, the spectral detector, the cohomological detector, the arithmetic height detector, the conditionalization of the converse proposition, the open registry, andthe dual-channel verification and mis-entry retroactive-recognition protocol of themachine-check ledger; thereafter come the conclusion and Appendices A throughE, five in number

Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
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