HASSE Ladder D: Explicit Brauer–Manin Scissors Residual Evaluation and Computability Boundary

The Brauer–Manin scissors are not an abstract tribunal; they consist of threemechanical parts that can be inspected one by one: the generators of the Brauergroup, the local invariants supplied by the residue map, and the reciprocity law thatsums those invariants over places. This paper takes the three parts apart, numbersthem, and attaches a computability boundary to each. The arithmetic core of thereciprocity law: the standard formulas for the Hilbert symbol at odd primes and atthe dyadic place are implemented as an executable calculator; the local invariantsof eight quaternion algebras are evaluated place by place and the sum over placesvanishes identically, with (13,17) a split sample, with zero nontrivial places, andwith the trivial case reducing to zero; the eight samples verify that the reciprocitylaw holds on the samples, while the proof of the reciprocity law itself is carried byload-bearing references. A computable demonstration of the residue map: the polardivisor of the function-field carrier element (2,x) consists of the two components{x = 0} and {x = ∞}, the pointwise residues are 2 and 1/2, the two lie in thesame square class of Q×/Q×2 (since 1/2 = 2 · (1/2)2), and that class is nontrivial;the statement “a pole along a divisor, a hidden edge supplied by the residue” thuschanges from a geometric picture into a verifiable ledger entry. The effective formatfor evaluation pairings: within a declared tier and a declared set of generators, theregistration conditions under which the scissors of that tier are computable arethree and must hold jointly — the generators are known and their tier is writtendown, the invariants are computable from residues and specializations, and thesum is finite and truncatable; if any one of them fails the situation is “cuttablein principle, not cut in practice”, and the transcendental tier does not becomecomputable merely because the three conditions are satisfied. This paper registersthree tier ledger entries: in the teaching tier the quadratic-form scissors do not cut;in the effective tier there is the eight-element scissors ledger of the diagrammatictoy; in the failing tier the scissors on a Selmer-type curve are not cut through, andthe upgrade is registered. This paper does not claim that the Brauer group of ageneral variety is computable, does not treat the output of any software package asa proof, and does not strike transcendental Brauer elements from the register.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24299759
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 D: Explicit Brauer–Manin Scissors Residual Evaluation and Computability Boundary

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

HASSE Ladder D: Explicit Brauer–Manin Scissors Residual Evaluation and Computability Boundary

changzheng zhou, ziqing zhou
preprint en

Abstract

The Brauer–Manin scissors are not an abstract tribunal; they consist of threemechanical parts that can be inspected one by one: the generators of the Brauergroup, the local invariants supplied by the residue map, and the reciprocity law thatsums those invariants over places. This paper takes the three parts apart, numbersthem, and attaches a computability boundary to each. The arithmetic core of thereciprocity law: the standard formulas for the Hilbert symbol at odd primes and atthe dyadic place are implemented as an executable calculator; the local invariantsof eight quaternion algebras are evaluated place by place and the sum over placesvanishes identically, with (13,17) a split sample, with zero nontrivial places, andwith the trivial case reducing to zero; the eight samples verify that the reciprocitylaw holds on the samples, while the proof of the reciprocity law itself is carried byload-bearing references. A computable demonstration of the residue map: the polardivisor of the function-field carrier element (2,x) consists of the two components{x = 0} and {x = ∞}, the pointwise residues are 2 and 1/2, the two lie in thesame square class of Q×/Q×2 (since 1/2 = 2 · (1/2)2), and that class is nontrivial;the statement “a pole along a divisor, a hidden edge supplied by the residue” thuschanges from a geometric picture into a verifiable ledger entry. The effective formatfor evaluation pairings: within a declared tier and a declared set of generators, theregistration conditions under which the scissors of that tier are computable arethree and must hold jointly — the generators are known and their tier is writtendown, the invariants are computable from residues and specializations, and thesum is finite and truncatable; if any one of them fails the situation is “cuttablein principle, not cut in practice”, and the transcendental tier does not becomecomputable merely because the three conditions are satisfied. This paper registersthree tier ledger entries: in the teaching tier the quadratic-form scissors do not cut;in the effective tier there is the eight-element scissors ledger of the diagrammatictoy; in the failing tier the scissors on a Selmer-type curve are not cut through, andthe upgrade is registered. This paper does not claim that the Brauer group of ageneral variety is computable, does not treat the output of any software package asa proof, and does not strike transcendental Brauer elements from the register.

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