Work

HASSE Ladder E; Decision-Format Engineering - Witness Syntax, Termination Bounds and the Soundness Ledger

Year: 2026
Type: preprint
Abstract: The emptiness decision for the descent scissors has long remained at the levelof tone: one says “the scissors have cut”, but what is the warrant? This paperturns each of the three components of that decision into a machine-checkable object, and delivers five theorems and two registers. Chapter 4 establishes a finitesyntax for the objects being decided: a ledger is a finite string, of type T1 (algebraic ledger) or type T2 (finite-support ledger), and the three rejection channels ofthe well-formedness verifier V0 make an accepted string determine its verificationledger uniquely in the sense of the decision — a T1 string determines a global point,a T2 string determines a unique smooth residue point at each local place togetherwith its Hensel ball, and the decision is independent of the choice of representativeinside the ball; a representation-layer no-go, under the formal-verification model,rules out bad-reduction-data certificate schemes that satisfy both the completenessand the soundness direction from covering infinitely many inert places. Chapter 5(Theorem 1, witness syntax and soundness) gives the formal syntax of the emptiness witness W1 and the survival witness W2, the verifier algorithm, the soundnessclauses (S1) and (S2), the completeness clause (C) and the verifier running time(V3); the finite representation of the survival witness provides channel F1 (globallift) and channel F2 (split fibre), aligned with the T1 and T2 ledgers respectively.Chapter 6 (Theorem 2, four-condition effective descent and an explicit terminationbound) gives a terminating algorithm under the four conditions — finite covering,finite-type object, decidable gluing class, effective height bound B — with a counting lemma that yields Ncand(B) by S-unit parametrization and Minkowski reduction, and a termination bound, formula (5), equal to Ntwist·Ncand(B)·(cver+cdec);the shape (2B+1)M is only the special case k = Q, S = ∅. Chapter 7 (Theorem 3,decidability of the gluing class of cyclic structure group descent data) gives threekinds of finite check — valuation check, residual factor check, exceptional check;the exceptional check is executed only for the Kummer form xn = a, the convention s = ∞ makes condition (α) never hold over number fields containing all realsubfields of the 2-power cyclotomic fields, n = 2 and n = 4 never trigger it, andthe minimal explicit example K = Q(√7), n = 8, a0 = 16 is verified item by itemby machine. Chapter 8 (Theorem 4, all four conditions are necessary) constructsfour failing families from four standard coordinates — diagonalization, the s-m-ntheorem, the gluing-class halting encoding lemma, and Kleene’s tree existence theorem — each family declaring how the other three conditions hold, so as to excludecontamination. Chapter 9 (Theorem 5, the interface theorem) maps the decisionformat constructively into three certificate systems — cut certificates, eliminationcertificates, effective truncation certificates — with the engineering ledger and themathematical ledger kept in separate columns. Two further registers: Chapter 10registers the reduction of the Brauer stratified complex, formula (6), in the numberfield case H3(k,Gm) = 0, and its collapse for curves; Chapter 11 registers the twoSelmer computation for the curve y2 = x3 − x as a classical two-descent ledgerentry, whose elimination certificate is of descent type rather than of Euler-systemtype. The fourteen machine-check readings of Chapter 2 are registered before themain text, comprising passing and failing ledgers, registered only and never promoted; Chapter 12 places the evidence discipline and the knowledge boundary itemby item through the F-i prohibition, the F-v prohibition, the R-x registration andopen registrations one to five.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W7235587562
Cites:
Cited by:
Related to: 10