Answers are grounded in this paper and cite their sources.
This closing paper delivers four objects through four theorems, all inside thefour-question audit format family: the incompressibility of the witness objects, theundecidability of real-chamber attribution, the separation between searchability ofthe parametrized chamber and real-geometric finite-chamber decomposition, anda complete classification of the arc-consistency gap on F2 cycle graphs. TheoremOne (L4, a meta-theorem) is the axis; Theorems Two to Four are supporting theorems at the object layer: Theorem Two pins down Wall One, Theorem Threelocates Wall Two exactly and gives the passage through it, and Theorem Fourcloses off the smallest-scale source of illusion. Theorem One (L4, meta-theorem):inside the four-question audit format family the witness-object set {O1 chamberdecomposition table, O2 structure registration, O3 exhaustiveness certificate, O4height bound and halting certificate} is incompressible; for every defective claimthe failure falls uniquely into the earliest failing cell, the failure coordinates of thefour kinds of minimal defect witness are unique, and the remaining cells are presentglobally or in anchored form and are auditable item by item (for object dependencies see the remark in 4.2(b)); any format that asks only three items must miss oneclass. Theorem Two (L3): there is a computably enumerable family of nine-variablereal hypersurfaces for which the chamber decomposition is effective under a fixedcylindrical algebraic decomposition, yet the question of which chamber contains anintegral point is undecidable; this is a direct reduction from the negative solutionof Hilbert’s Tenth Problem over the integers, and a reduction checklist is attached.Theorem Three (L3): for the Pell solution group {±εn0} the three conditions ofonticity, effectiveness and boundedness in the parametrized-chamber sense holdthrough explicit elementary algorithms (descent decision; |n| ≤ ln(2√DH)/lnε0);the same object fails the onticity condition in the real-geometric finite-chamberdecomposition sense, and the two senses are registered separately. Theorem Four(L2): a complete classification of the arc-consistency gap on cycle graphs over thetwo-element field; for the reciprocity type with arbitrary right-hand side, the divisibility relation between n and 3 together with three sums modulo 3 gives a solvabilitycriterion and the number of solutions; the gap appears for the edge type and thereciprocity type alike, and the joint minimal counterexamples are the three-vertexedge-type system and the three-vertex reciprocity non-homogeneous system, eachof size eight configurations. Evidence grades are registered on separate tracks:machine-checkable ledger entries carry a verbalised registration of algorithm stepsand a definite version lock, while executable source code is not included and is registered as a missing item; undecidability theorems carry a reduction checklist, andnumerical corroboration is kept apart from manual verification of the literature.Scope statement: the incompressibility of Theorem One is confined to this formatfamily; whether a three-question format outside the family is complete remainsopen.
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: