Answers are grounded in this paper and cite their sources.
The Hasse principle is not a bridge but a ladder. Local solvability is only the firstrung; finite descent, the Brauer–Manin obstruction, and the ´etale Brauer–Maninobstruction are cohomological scissors of increasing strength, and no known top liesabove the ladder. This paper fixes the hierarchy of scissors as a registrable table:for each level it records the definition, the evaluation pairing, the respective logicalstatus of empty and non-empty sets, and a death-registration protocol recording atwhich level an object dies. The fixed inclusion chain is registered asX(k) ⊆ X(A)´etBr ⊆ X(A)Br ⊆ X(A); whether equality holds at any link is a deep problem. This paper only registers thelevel at which an object dies and does not predict where the ladder ends. The deathregistration table is fixed to have eight columns: object; Jacobian and dimension;local solvability; finite descent; Brauer–Manin scissors; ´etale Brauer–Manin scissors;involvement of Sha; and evidence grade. The paper delivers two self-containedtheorems. The diagrammatic scissors theorem says that evaluation of the cyclesum functional β on local ledgers cuts exactly half of the ledgers passing the localconditions, while the tree comparison shows explicitly that the existence of scissorsdepends on the presence of a cycle. The diagrammatic descent theorem says thatthe double cover pulls the scissors back to the empty obstruction, that both the cutledger and the surviving ledger lift, thereby reproducing the mechanism “the scissorsare pulled empty while the problem is upgraded,” and it records the discipline thatliftability does not constitute a global point. Readout Three, concerning Selmer’scurve, is refilled as follows: descent cuts (load-bearing anchor: Cassels, §18, theninefold cover); the Brauer–Manin set is cut empty (subset cut-empty; load-bearinganchor: the composition of Cassels, §18, with Stoll’s 2007 theorem for curves);and Sha is involved (a nontrivial 3-torsion element). Stix 2011 supplies a levellocation anchor for failure above the Brauer level and does not carry the load ofcut-emptiness. The repaired formulation of the general gap is this: the cut-emptyside carries no obligation of exhaustive enumeration, and it is closed as soon as afinite cutting subfamily S with X(A)S = ∅ is exhibited; only a non-emptiness claimcarries the generator burden, so that “non-empty” may be registered only when S isknown to generate Br(X). Readouts are registered, not promoted: non-emptinessof the Brauer–Manin set is not an existence certificate, failure of a box search isnot a proof of global pointlessness, and machine-check observations are registeredrather than promoted to theorems.
No takes yet. Share an insight, caveat, or question.
zhou et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: