Quantum theory carries several discrete or numerical inputs that are routinely described as "not derived" from an underlying substrate. This paper asks a sharper question: for which of these inputs can "not derived" be upgraded to a proof of undefinability, and for which is this structurally impossible? Padoa's classical method of primitive notions answers the first kind and, as shown here, cleanly refuses the second. The inputs are classified by their logical position relative to a similarity type: an input is amenable to Padoa's method exactly when it is a predicate on a fixed type, and is not amenable when it is a parameter of the type itself or a weight on an ensemble. Both poles are exhibited. At one pole, circulation quantization: reformulating a companion result, the predicate is shown Padoa-undefinable over the structure of realized jets, the nontrivial part being the existence of a model pair; here the method also computes the exact reduct threshold at which definitions begin to exist, direction by direction. At the other pole, the spinor sign: the model pair is nearly definitional and the entire mathematical weight sits in an explicit locality hypothesis about the reduct, stated rather than assumed. Finally, the amplitude parameter (the reduced Planck constant) and Born-type typicality weights are shown to fall outside the method. For the amplitude parameter a dichotomy is proved for the single-theory formulation; for typicality weights a semantic obstruction is documented with a counterexample. In both cases the two available formulations give, respectively, an answer without blindness and blindness without content — the reason these inputs are excluded structurally. The boundary is offered as a result, not an apology: the classification tells one in advance which foundational "inputs" can be argued about by this method at all. Companion to "Locality, cycles, and the Wallstrom condition: an exact dichotomy and an undefinability theorem" (Zenodo, DOI 10.5281/zenodo.21727985). A self-contained SymPy script verifying the paper's symbolic claims is provided as supplementary material.
Quantum theory carries several discrete or numerical inputs that are routinely described as "not derived" from an underlying substrate. This paper asks a sharper question: for which of these inputs can "not derived" be upgraded to a proof of undefinability, and for which is this structurally impossible? Padoa's classical method of primitive notions answers the first kind and, as shown here, cleanly refuses the second. The inputs are classified by their logical position relative to a similarity type: an input is amenable to Padoa's method exactly when it is a predicate on a fixed type, and is not amenable when it is a parameter of the type itself or a weight on an ensemble. Both poles are exhibited. At one pole, circulation quantization: reformulating a companion result, the predicate is shown Padoa-undefinable over the structure of realized jets, the nontrivial part being the existence of a model pair; here the method also computes the exact reduct threshold at which definitions begin to exist, direction by direction. At the other pole, the spinor sign: the model pair is nearly definitional and the entire mathematical weight sits in an explicit locality hypothesis about the reduct, stated rather than assumed. Finally, the amplitude parameter (the reduced Planck constant) and Born-type typicality weights are shown to fall outside the method. For the amplitude parameter a dichotomy is proved for the single-theory formulation; for typicality weights a semantic obstruction is documented with a counterexample. In both cases the two available formulations give, respectively, an answer without blindness and blindness without content — the reason these inputs are excluded structurally. The boundary is offered as a result, not an apology: the classification tells one in advance which foundational "inputs" can be argued about by this method at all. Companion to "Locality, cycles, and the Wallstrom condition: an exact dichotomy and an undefinability theorem" (Zenodo, DOI 10.5281/zenodo.21727985). A self-contained SymPy script verifying the paper's symbolic claims is provided as supplementary material.
This is the Technical Supplement — the proof-dense companion and the canonical formal record for the paper's claims. The main paper argues; the supplement proves. Every load-bearing claim traces to a named check function in the APF verification engine, and the supplement is the document a referee should audit first. The supplement is self-contained for Paper 14: every definition, proof, and grade the paper rests on appears in this one document — the substrate primitives and the marginal admissibility floor, proved; the locality and cost-uniqueness lemmas; the Δ calculus with both fences' witnesses written out; the Boolean-defender bridge with its five certified physical hypotheses and the 3-4-5 worked witness computed on the page; the gate pipeline with a gate-by-axiom comparison to the operational-reconstruction literature (Hardy; Chiribella–D'Ariano–Perinotti; Masanes–Müller; Barnum–Wilce; Spekkens; Abramsky–Brandenburger); the native correlation family constructed explicitly, rung by rung; the resolution triad set against standard thermodynamics (Landauer, erasure, environment-assisted recovery); a consolidated readings register listing every claim below [P] with its falsifier and status; a glossary mapping the framework's vocabulary onto standard quantum-information terms; and a worked end-to-end instance — device to interrogation normal form to exact feasibility certificate to priced ledger, with every tolerance explicit. A reproducibility appendix pins every claim to the APF theorem bank at a named GitHub commit and the archived Engine release (DOI 10.5281/zenodo.18529115); the certificates reproduce deterministically in exact rational arithmetic. About the series. Admissibility Physics is a structural realist reconstruction program built on a single commitment: any bounded region of the world can hold only finitely many distinctions. A principle of least enforcement cost then selects, among all the ways those distinctions might be arranged, the configurations a finite world can sustain. From this the content of physics is reconstructed rather than postulated: the Standard Model's gauge group and matter content, the Hilbert-space and Born-rule architecture of quantum mechanics, the geometry and field equations of general relativity, the four laws of thermodynamics, and the large-scale budget of cosmology emerge as different readings of one finite-capacity ledger. The unification is quantitative as well as conceptual: the framework's dimensionless constants appear not as free parameters but as counts read off that ledger — among them the dark-energy fraction ΩΛ = 42/61 and the weak mixing angle sin2θW = 3/13 — fixed, in the strongest cases, to within current measurement. The core derivation runs Papers 0–11; the extension papers carry the individual sectors. Each paper's main text and Technical Supplement is deposited separately; every quantitative claim traces to a named, executable check in the public theorem bank (over 3,800 bank-registered theorems, 48 quantitative predictions); and each result is carried at an explicit, graded level of confidence — from analytically forced to structurally grounded — with the measurements that would refute it named. Admissibility Physics is offered as a candidate, not a finished theory. If the program holds, the laws of physics could not have been otherwise: they are what a finite world permits. Website: admissibilityphysics.com. Engine and theorem bank: https://github.com/Ethan-Brooke/APF-Engine. Full series and latest deposits: Zenodo community admissibility_physics. The Engine — Admissibility Physics: An Executable Constraint Framework and Constants Map — DOI 10.5281/zenodo.18529115. Paper 0 — What Physics Permits: A Constraint-First Framework for Physics — DOI 10.5281/zenodo.18439523 Paper 1 — The Enforceability of Distinction — DOI 10.5281/zenodo.18439200 Paper 2 — Finite Admissibility and the Failure of Global Description — DOI 10.5281/zenodo.18439274 Paper 3 — Entropy, Time, and Accumulated Cost — DOI 10.5281/zenodo.18439363 Paper 4 — Admissibility Constraints and Structural Saturation — DOI 10.5281/zenodo.18439397 Paper 5 — Quantum Structure from Finite Enforceability — DOI 10.5281/zenodo.18439433 Paper 6 — Dynamics and Geometry as Optimal Admissible Reallocation — DOI 10.5281/zenodo.18439445 Paper 7 — A Minimal Quantum of Action from Finite Admissibility — DOI 10.5281/zenodo.18439513 Paper 8 — The Admissibility-Capacity Ledger — DOI 10.5281/zenodo.19721384 Paper 9 — The Geometric Substrate as Cost Structure of Comparison Continuations — DOI 10.5281/zenodo.20041675 Paper 10 — The Calculus of Finite Continuability — DOI 10.5281/zenodo.20041680 Paper 11 — Forced Universality from Capacity-Bounded Admissibility — DOI 10.5281/zenodo.20684198 Paper 12 — The Gauge Sector of Admissibility Physics — DOI 10.5281/zenodo.21212521 Paper 13 — The Minimal Admissibility Core — DOI 10.5281/zenodo.18361446 Paper 14 — The Quantum Story — DOI 10.5281/zenodo.21212188 Paper 16 — Markov Breakdown and the Hard Problems — DOI 10.5281/zenodo.20684207 Paper 18 — The Electroweak Sector as a Capacity Equilibrium — DOI 10.5281/zenodo.20684209 Paper 19 — Large-Angle CMB Suppression as a Finite-Continuability Constraint — DOI 10.5281/zenodo.21199218 Paper 20 — The Enforcement Crystal — DOI 10.5281/zenodo.18531732 Paper 23 — Magnetically Dark Winding-Class Quantum Processors — DOI 10.5281/zenodo.21199220 Paper 24 — The Recruitment-Radius Extension — Foundations — DOI 10.5281/zenodo.20684211 Paper 25 — The Recruitment-Radius Extension: Applications — DOI 10.5281/zenodo.21199222 Paper 28 — Absolute Mass Scales from Electroweak Capacity Saturation — DOI 10.5281/zenodo.20684215 Paper 29 — Plaquette Representation Dominance and Confinement — DOI 10.5281/zenodo.20684218 Paper 30 — A Tube Mechanism for the Lattice Mass Gap — DOI 10.5281/zenodo.20684220 Paper 31 — Osterwalder–Schrader Structure of Lattice Yang–Mills — DOI 10.5281/zenodo.20684222 Paper 32 — Quark Anchors as APF Trace Masses — DOI 10.5281/zenodo.21199226 Paper 33 — Trace-to-Scheme Export Architecture — DOI 10.5281/zenodo.20684224 Paper 35 — The Dark Sector as a Two-Role Capacity Decomposition — DOI 10.5281/zenodo.20684228 Paper 36 — The Missing Floor — DOI 10.5281/zenodo.21199228 Paper 37 — Collapse as Realignment — DOI 10.5281/zenodo.21199231 Paper 38 — Unification as Ledger — DOI 10.5281/zenodo.21199233 Paper 39 — Coherent Phase Regimes in the APF Interface Engine — DOI 10.5281/zenodo.21199235 Paper 40 — The Thermodynamics of Finite Distinction (Between Symmetry and the Void) — DOI 10.5281/zenodo.20684235 Paper 41 — The Horizon as a Continuation Ledger — DOI 10.5281/zenodo.20684241 Paper 42 — The Weak Mixing Angle Is Not Free — DOI 10.5281/zenodo.20684245 Paper 43 — The Neutrino Sector — DOI 10.5281/zenodo.21194191 Paper 44 — What a Finite Theory Owes the Continuum — DOI 10.5281/zenodo.21195874 Paper 45 — What the Vacuum Can Keep — DOI 10.5281/zenodo.21194195 Paper 46 — The Strong CP Angle Is Not Free — DOI 10.5281/zenodo.21194197 Paper 47 — The Confinement Antecedent Is Not Forced — DOI 10.5281/zenodo.21194199 Paper 48 — The Light-Bending Weight Is Not Free — DOI 10.5281/zenodo.21199627 Technical Supplements cross-link to their main paper via isSupplementTo and to the engine via isDocumentedBy. Concept DOIs above resolve to the latest version.
Duplicate record. The canonical deposit for this paper is APF Paper 1 — The Enforceability of Distinction (Technical Supplement) (DOI 10.5281/zenodo.19714957). This record is retained because published Zenodo DOIs cannot be removed; please cite the canonical record. Title: Formal Supplement: End-to-End Derivation from Finite Enforcement Capacity to Quantum Structure Authors: Brooke, E. S. Description: Self-contained formal supplement to "The Enforceability of Distinction: Quantum Structure from Finite Enforcement Capacity" (Paper 1 of the Admissibility Physics Framework series). Derives finite-dimensional quantum mechanical structure — Hilbert space, C*-algebra, Born rule, Tsirelson bound, no-broadcasting — from a single resource-theoretic axiom (A1: finite enforcement capacity), one regularity condition (MD: uniform per-test cost floor), one richness premise (BW: budget-window triple), and constitutive admissibility semantics (SP, K3, FD1–FD6). The derivation proceeds in three tiers. The core chain (A1 + MD + BW + constitutive semantics) produces: a finite-dimensional real vector space with sector decomposition, a sector-orthogonal bilinear form forced by disjoint-support additivity (K3), self-adjoint enforcement projections, superadditive joint enforcement costs, a noncommutative real *-algebra, Wedderburn–Artin block decomposition, a GNS Hilbert-space representation, and a faithful positive state constructed from enforcement data. Field selection excludes real nonclassical blocks via state-separation completeness (T2c.1, single-interface, proved) and quaternionic blocks via composition closure (T2c.2, multi-interface, conditional). Standard quantum corollaries — Born rule (via Busch's generalized Gleason theorem), Tsirelson bound (via the Cirel'son identity), monogamy, and no-broadcasting — follow within the derived algebraic skeleton. Key features: (1) explicit variational framework for joint enforcement, including admissible defender class, projection reduction lemma, Grassmannian existence proof, and a theorem that all optimal joint defenders have nontrivial pool support when the superadditivity surplus is positive; (2) formal equivalence between nontrivial pool-supported joint threats, superadditive enforcement cost, and algebraic noncommutativity; (3) a fully explicit 11-step qubit model computing every quantity from enforcement costs through Born probabilities; (4) named support-recruitment monotonicity principle (SRM) separating structural from physical selection of orthogonal projections; (5) explicit computable stability thresholds for Wedderburn block structure and field type under approximate disjoint-support additivity; (6) front-matter tables classifying every result as unconditional, conditional, or dependent on external theorems. 71 pages. Three parts: Part I (Core Derivation, §1–7), Part II (Worked Examples and Detailed Verifications, §8–12), Part III (Discussion, Comparisons, and Scope, §13–14). No companion paper result is assumed. Compiled LaTeX source and PDF included. Keywords: quantum reconstruction, finite-dimensional quantum mechanics, C*-algebra, Hilbert space, Born rule, Tsirelson bound, no-broadcasting theorem, enforcement capacity, admissibility physics, Wedderburn–Artin theorem, GNS construction, noncommutativity, field selection, resource-theoretic foundations Related identifiers: Supplement to: Brooke, E. S., "The Enforceability of Distinction: Quantum Structure from Finite Enforcement Capacity" (submitted to Foundations of Physics) Related to: Brooke, E. S., "The Structure of Admissible Physics" (Paper 2), Zenodo DOI 10.5281/zenodo.18867119 About the series. Admissibility Physics derives the Standard Model gauge group, fermion content, quantum formalism, Lorentzian spacetime, the Einstein field equations, the cosmological constant, and the neutrino, strong-CP, and dark sectors from a single assumption — that enforcement is finite at every causally connected region — with zero free parameters. The core derivation runs Papers 0–11; the extension papers carry the individual sectors. Each paper's main text and Technical Supplement is deposited separately, and every quantitative claim traces to a named, executable check in the public theorem bank (over 3,800 bank-registered theorems across roughly 450 modules, 48 quantitative predictions). Website: admissibilityphysics.com. Engine and theorem bank: https://github.com/Ethan-Brooke/APF-Engine. Full series and latest deposits: Zenodo community admissibility_physics. The Engine — Admissibility Physics: An Executable Constraint Framework and Constants Map — DOI 10.5281/zenodo.18529115. Paper 0 — What Physics Permits: A Constraint-First Framework for Physics — DOI 10.5281/zenodo.18439523 Paper 1 — The Enforceability of Distinction — DOI 10.5281/zenodo.18439200 Paper 2 — Finite Admissibility and the Failure of Global Description — DOI 10.5281/zenodo.18439274 Paper 3 — Entropy, Time, and Accumulated Cost — DOI 10.5281/zenodo.18439363 Paper 4 — Admissibility Constraints and Structural Saturation — DOI 10.5281/zenodo.18439397 Paper 5 — Quantum Structure from Finite Enforceability — DOI 10.5281/zenodo.18439433 Paper 6 — Dynamics and Geometry as Optimal Admissible Reallocation — DOI 10.5281/zenodo.18439445 Paper 7 — A Minimal Quantum of Action from Finite Admissibility — DOI 10.5281/zenodo.18439513 Paper 8 — The Admissibility-Capacity Ledger — DOI 10.5281/zenodo.19721384 Paper 9 — The Geometric Substrate as Cost Structure of Comparison Continuations — DOI 10.5281/zenodo.20041675 Paper 10 — The Calculus of Finite Continuability — DOI 10.5281/zenodo.20041680 Paper 11 — Forced Universality from Capacity-Bounded Admissibility — DOI 10.5281/zenodo.20684198 Paper 13 — The Minimal Admissibility Core — DOI 10.5281/zenodo.18361446 Paper 16 — Markov Breakdown and the Hard Problems — DOI 10.5281/zenodo.20684207 Paper 18 — The Electroweak Sector as a Capacity Equilibrium — DOI 10.5281/zenodo.20684209 Paper 20 — The Enforcement Crystal — DOI 10.5281/zenodo.18531732 Paper 24 — The Recruitment-Radius Extension — Foundations — DOI 10.5281/zenodo.20684211 Paper 28 — Absolute Mass Scales from Electroweak Capacity Saturation — DOI 10.5281/zenodo.20684215 Paper 29 — Plaquette Representation Dominance and Confinement — DOI 10.5281/zenodo.20684218 Paper 30 — A Tube Mechanism for the Lattice Mass Gap — DOI 10.5281/zenodo.20684220 Paper 31 — Osterwalder–Schrader Structure of Lattice Yang–Mills — DOI 10.5281/zenodo.20684222 Paper 33 — Trace-to-Scheme Export Architecture — DOI 10.5281/zenodo.20684224 Paper 35 — The Dark Sector as a Two-Role Capacity Decomposition — DOI 10.5281/zenodo.20684228 Paper 40 — The Thermodynamics of Finite Distinction (Between Symmetry and the Void) — DOI 10.5281/zenodo.20684235 Paper 41 — The Horizon as a Continuation Ledger — DOI 10.5281/zenodo.20684241 Paper 42 — The Weak Mixing Angle Is Not Free — DOI 10.5281/zenodo.20684245 Paper 43 — The Neutrino Sector — DOI 10.5281/zenodo.21194191 Paper 44 — What a Finite Theory Owes the Continuum — DOI 10.5281/zenodo.21195874 Paper 45 — What the Vacuum Can Keep — DOI 10.5281/zenodo.21194195 Paper 46 — The Strong CP Angle Is Not Free — DOI 10.5281/zenodo.21194197 Paper 47 — The Confinement Antecedent Is Not Forced — DOI 10.5281/zenodo.21194199 Technical Supplements cross-link to their main paper via isSupplementTo and to the engine via isDocumentedBy. Concept DOIs above resolve to the latest version. Author. Ethan Brooke, Independent Researcher, San Anselmo, California, USA. ORCID: 0009-0001-2261-4682 LinkedIn: linkedin.com/in/ethanbrooke GitHub: github.com/Ethan-Brooke Contact: brooke.ethan@gmail.com
Four questions sit at the base of fault-tolerant quantum computing: whether a code with given parameters can exist, whether two circuits denote the same operation, how much entropy a measurement irreversibly produces, and whether a compiled gate still means what it should. They are normally answered by four disjoint techniques. We show they are one technique. In each case the answer is an invariant—the object a governing transformation leaves fixed—and that invariant can be held as a certificate a proof kernel checks and an operator-native substrate computes. The instruments are the quantum weight enumerator, whose shadow variant yields what is, to our knowledge, the first machine-checked nonexistence certificate for a quantum error-correcting code (no pure [[4, 1, 3]] stabilizer code, reduced to an integer impossibility); the spider normal form, unique both as a linear map and as a content-addressed tree, at the minimal axiomatic footprint of a proof assistant; the measurement boundary defect, whose logical entropy equals a kernel-counted cohomology dimension; and the reduction receipt, round-tripping a certified gate word to bare metal on two independent substrates. Everything downstream of the explicitly labelled modeling step in each domain is exact integer or rational arithmetic. The common shape—find the invariant the transformation fixes, and read it off as a certificate—turns four hard quantum questions into arithmetic a machine can hold. Published by The Institute for Applied Ontological Mathematics.
Papers I and II derived gravitational geometry and second-order dynamics from finite accessibility without invoking measurement, observation protocols, or collapse as primitive notions. This paper extends the operational program to the measurement sector, deriving the structure of record formation and probabilistic weights from the same finite accessibility and compositional constraints. Finite accessibility restricts admissible operations on a subsystem to a proper operator subalgebra. Because bounded certification excludes operators requiring nonlocal coordination or arbitrarily fine phase resolution, the accessible algebra is strictly smaller than the full operator algebra. When a system becomes correlated with orthogonal environment sectors, off-diagonal operators between those sectors fall outside the accessible algebra. The reduced state is therefore indistinguishable, under all admissible operations, from its diagonal ensemble. Definiteness emerges as an algebraic consequence of sector restriction, not as a collapse postulate. The weights of these sectors are fixed uniquely by compositional consistency. Phase invariance, multiplicativity under independent refinement, and stability under record coarse-graining constrain any admissible assignment of sector weights to satisfy a functional equation whose only continuous, non-contextual solution is quadratic in amplitude. The Born rule therefore arises as the unique invariant measure compatible with finite accessibility. Irreversibility follows from action scaling: reversal requires operators outside the admissible tensor algebra and incurs action cost proportional to the number of correlated subsystems. Since admissible operations are bounded by the action gap, macroscopic record reversal is excluded. Measurement introduces no new physical primitives beyond finite accessibility, locality, and compositional stability. Record formation, classical definiteness, and Born probabilities are structural consequences of algebraic restriction under finite accessibility. **This paper is part of the Finite Accessibility series, which reconstructs gravitational geometry, quantum dynamics, gauge structure, cosmological perturbation theory, and the dark sector from a single operational primitive: a finite certification ceiling ω* governing the maximum rate at which physical relations can be maintained across extended domains.** **Introductory papers** - Geometric Limits to Coherent Timekeeping in Extended Reference Frames — https://doi.org/10.5281/zenodo.18824556 - Accessibility Selection Law (ASL) — https://doi.org/10.5281/zenodo.18824649 - Phase Boundary Gravity — https://doi.org/10.5281/zenodo.18824707 **Pillars (numbered I–IV)** - Paper I: Deriving Gravitational Geometry and Schrödinger Dynamics from Finite Accessibility — https://doi.org/10.5281/zenodo.18601600 - Paper II: Deriving Inertia, Motion, and Wave Propagation from Finite Accessibility — https://doi.org/10.5281/zenodo.18625174 - Paper III: Accessible State Spaces, Record Stability, and the Emergence of Quantum Statistics — https://doi.org/10.5281/zenodo.18625192 - Paper IV: Frame Dissolution, the Certification Ceiling, and Observable Deformations — https://doi.org/10.5281/zenodo.18654458 **Extension papers** - Dark Matter from Finite Accessibility — https://doi.org/10.5281/zenodo.18654433 - Dark Energy from Finite Accessibility — https://doi.org/10.5281/zenodo.18654523 - No-Go Theorems and the Admissibility Corridor — https://doi.org/10.5281/zenodo.18654493 - Gauge Structure from Finite Accessibility — https://doi.org/10.5281/zenodo.18928152 - Perturbation Theory from Finite Accessibility — https://doi.org/10.5281/zenodo.18928213 **Experimental paper** - Experimental Probes of Finite Accessibility: GW Dispersion and Vacuum Path Independence — https://doi.org/10.5281/zenodo.18931126 **Keywords:** Born rule derivation, measurement problem, quantum statistics, finite accessibility, operator subalgebra, record formation, definiteness emergence, wave function collapse, compositional consistency, accessible state spaces, action gap, irreversibility, sector restriction, quantum foundations, algebraic quantum mechanics, decoherence
This paper develops a framework-relative ontology of determinacy. Its core question is not what the world is made of, but what must minimally be accounted for if a stable deter- minate identity is internally self-representing. The primitive and functional core of Version 3.8 is retained: Being, the possibility of distinction, and domain-relative realizability define the sparse primitive basis; coherent self-representation then requires three non-equivalent func- tional questions—Support, Internal Encoding, and Correspondence. Explicit finite witness pairs establish uniform non-determination of each role from the other two in the unrestricted baseline class, while stronger canonical or equivariant subclasses remain open. Version 4.1.1 is a corrective consolidation of Version 4.1 rather than a new upstream on- tology step. It retains the Version 4.0 bridge revision and the Version 4.1 constructional layer. That layer adds the reverse evaluative direction Physics ⇒ Mathematics ⇒ Ontology and records where downstream structures constrain, but do not retroactively constitute, the ontol- ogy. Several previous bridge claims are weakened or rejected. Symmetry classification, tensor factorization, entanglement of a state, and path-dependent dynamics are kept as four distinct mathematical layers. A conditional expectation is treated as a localization map rather than as actualization; a branch instrument defines possible conditional events but does not select one realized branch; and a projection onto admissible spectral sectors is not called conservative dynamics without an independently derived dilation. The causal and propagation bridge is sharpened in two directions. First, a previous can- didate definition of a null relation by vanishing accumulated interval volume is proved degen- erate: every comparable pair admits a chain of links, so that criterion vanishes throughout the causal order. Link ensembles remain useful near-null approximants, but the null sector is therefore a limiting or measure-relative object rather than a pair-local primitive in the de- clared causal-set model. Second, the long-range free-chain calculation at 𝛼 = 2 is separated into two non-commuting limits. The infinite-range spectral symbol has maximal group veloc- ity 𝜋𝐽𝑎, whereas the envelope of finite-cutoff maxima tends to 2𝐽𝑎 Si(𝜋). These are spectral group-velocity statements; a causal signal cone still requires separate Lieb–Robinson-type hy- potheses. Isotropy and a unique physical Lorentz cone remain open. The defect bridge is updated with the completed 𝐾 = 512 data layer of the frozen ratio campaign. All 903 prescribed values of 𝜃 are present with eight branches each; 897 aggregate points are admissible and six lie in a short rejected interval. Neither √ 2 nor 𝜙 is a local or global minimum. The original preregistered primary ratio test nevertheless remains non- evaluable because its 𝐾 = 64 training gate is universally degenerate. Thus 𝐾 = 512 completes a characterization block; it does not retrospectively repair the primary estimator. Provenance registration and cross-platform verification remain pending. Version 4.0 turned Test 28A into an explicit reconstruction audit, and Version 4.1 retains that audit unchanged. For the standard three one-body extractions on ℋ = (C 3 ) ⊗3 , the combined linear map has exact rank 25 and kernel dimension 704. The hidden space splits as 192 two-body plus 512 fully traceless three-body directions; even the full 𝑆3-invariant class retains an exact 156-dimensional hidden sector. The preregistered continuation identifies an exact energy-selected fixed point, the totally antisymmetric state |𝜀⟩, while holonomy and variance objectives yield set-valued argmin correspondences. The historical non-triviality gate is therefore preserved but shown not to be a universal criterion, and no retroactive 𝑉28.4 verdict is declared. A prospectively frozen two-local QPH family provides an exact computer-assisted existence witness: its cycle-phase differential has rank 704/704 on the marginal kernel for the primary family and two preregistered replications, so marginals plus relational cycle phases are locally in- formationally complete in the fixed regularity stratum. Canonical modular-mismatch selectors are then audited rather than assumed. Identical additive qutrit references and every single pure mismatch under exact 𝑆3 protection obey strict capacity/rank no-go bounds. On the protected 156-dimensional domain a physically generated mixed mismatch has sufficient raw capacity but standard phase-only QPH remains incomplete. Exact cumulant analysis explains why order three is the natural next layer: the 𝑆3-hidden sector decomposes as 156 = 36 + 120, and the third connected cumulant is a complete affine coordinate on fibres of fixed proper marginals. A historical preregistered cubic-moment completion is retained only as a delicate T-NUM wit- ness, not as a theorem premise. This is the declared stopping point of the arity/cubic line: selecting one specific cubic observable would require a new independent physical law. Test 28B remains suspended. Version 4.0 added one further macro-level correction, retained in Version 4.1. Causal and conformal structure, transport geometry, stable matter sectors, and quantum correlations are treated as parallel downstream representations of one substrate model, not as a serial matter– space–time chain. A proposed identification of the matter admissibility projector Πadm with spacetime volume is rejected in its literal form: the projector is matter-branch specific, need not be nested under generative updates, and has no canonical finite trace in a type-III con- tinuum. In its place a conditional causal–transport conformal closure theorem is proved. If a causal reconstruction supplies a Lorentzian conformal class and an independent transport limit supplies a positive spatial metric on the same spacelike distribution, the conformal factor is fixed pointwise exactly when the two induced spatial metrics are conformally compatible. A scale-free generalized-eigenvalue defect provides a direct falsifier. The corresponding clock– cone–matter gate is also corrected by conformal weight: frequencies and dimensionful spectral scales have lapse weight one under a pure lapse deformation, whereas spectral ratios, localiza- tion fractions, and dimensionless stability-window coordinates have weight zero. A Tolman– thermal-time comparison is retained only as a relative lapse-profile gate; absolute time units remain open. Version 4.1 introduced a controlled common-substrate realization. Version 4.1.1 corrects its scope: parity alone excludes only an odd or linear mass/source identification with the same signed coordinate; an even law such as 𝑀 ∝ 𝑑 2 is not excluded by parity. On the declared graph Klein–Gordon sector, charge conjugation reverses Noether/gauge-current orientation while leaving mode energy and localization intensity unchanged. A grounded-graph Green- kernel theorem fixes the spatial uniformity of the cross-term sign, while the Coulomb sign itself is conditional on realizing a non-dynamical 𝐴0-type constraint sector; the same kernel in a dynamical scalar sector gives the opposite sign. A separate no-go proves that matter Dirichlet energy alone cannot select a nontrivial interior geometry. A state-selected positive geometry Hessian yields the conditional linear response 𝑦 = 𝐾 −1 𝐸 𝜏 , so weak 𝐶-even stress sources add while 𝐶-odd currents can cancel. The principal new bridge is a conditional stationary common causal–transport–matter con- struction. If one protected center supplies a common base, the transport branch supplies a positive spatial metric ℎ, and several modular/physical clocks agree on one relative lapse 𝑁, then 𝑔CTM = −𝑐 2 *𝑁2𝑑𝑇2 + ℎ has one timelike sign, predicts the same null front for all canonically normalized matter sectors, and fixes its stationary volume element without an additional scalar measure. Different masses and opposite 𝑈(1) representation weights remain lower-order data and do not alter the characteristic cone. The independently reconstructed HSMI conformal class remains a held-out test rather than an input to this construction. A second independent Version 4.1 result supplies a conditional physical law selecting com- plex rank two. A nonzero-Chern line cannot be closed under conjugation at rank one on 𝑆 2 , whereas 𝐿 ⊕ 𝐿¯ is the minimal conjugation-closed carrier; independently, ClC 2 ≃ 𝑀2(C) has minimal irreducible complex module dimension two. The existing odd-Chern defect-link con struction realizes this pair. If its Clifford algebra is physically admissible, the local carrier has 𝑀2(C) qubit kinematics. This is not an assertion that opposite electric charges form a coherent qubit, nor that every particle is a qubit. The resulting Version 4.1.1 is a constrained foundational proposal with a frozen primitive core, stronger positive and negative bridge results, a first common stationary geometry can- didate, an independently motivated minimal rank-two carrier, and a reproducibility-oriented ledger for every step from ontological determinacy toward physics. It also makes the external spin-sign, soft-graviton, equivalence-principle, and mass-budget inputs explicit without treat- ing them as evidence for the ontology.
From Distinction to Quantum Structure Compiling Physical Geometry from the Change Axiom Chain Driven by Dean Kulik July 2026 Abstract We present a foundational axiom chain that compiles physical geometry from a single primitive: distinction exists. Beginning with C0 (distinction) and C1 (every distinction admits lawful continuation), we derive — without importing spatial geometry, coordinates, time, or quantum mechanics as primitives — the necessity of a linear state space, a complex inner product, Hilbert completion, self-adjoint observables, and the structure of a probability measure on observable subspaces. We further derive the unique free-field Lagrangian consistent with the axiom constraints, the gauge principle as a structural consequence of independent classification, and the quantization bridge connecting the classical field to operator algebras. The central result is the Division Algebra Theorem (candidate): among the three finite-dimensional division algebras admitted by Frobenius’s theorem, only the complex numbers simultaneously satisfy the continuation independence requirement (C1a) and the dual-encoding requirement of C5. The paper maintains a strict five-category epistemic discipline — primitive, definition, compiled theorem, candidate theorem, empirical calibration — throughout, ensuring every claim carries its exact epistemic status. 1. Introduction: The Foundational Inversion Standard physical theory begins with space. Objects occupy locations in a pre-existing spatial manifold; motion is defined relative to that manifold; forces act within it. Newton’s mechanics, Einstein’s general relativity, and the Standard Model of particle physics all share this architecture at the foundational level: a stage is assumed, and the physics plays out on it. The program presented here inverts this order. We propose that space, time, geometry, and quantum structure are not primitives but derived objects — outputs of a more fundamental algebraic structure built from the minimal concept of distinguishable change. The chain begins: rather than: This is not merely a philosophical reordering. It is a concrete research program with specific mathematical obligations at each step: each layer must be derived from the previous layers without importing external structure, and every claim must be categorized by its epistemic status. The framework is falsifiable — if any compiled theorem fails its formal derivation, either the derivation or one of the primitives must be revised. 1.1 Motivation: SHA-256 as Physical Evidence The SHA-256 hash function provides an unexpected but precise illustration of the C1-first claim. SHA-256 is field-balanced in both axes: • Horizontal (input → output): Bit content redistributes across the compression function. The total information content of the input is preserved in the digest — different shape, identical content. The mapping is a redistribution, not a creation. • Vertical (round → round): The carry palindrome property holds: KL divergence between forward and backward carry distributions equals zero. The AHRC (Algebraic Hash Round Consistency) result shows to machine epsilon across all 64 rounds. The geometry is self-balancing at every step. Neither property was engineered into SHA-256. The designers specified diffusion targets; the field obeyed the redistribution constraint underneath and the two-axis conservation emerged. This is the claim of the axiom chain in concrete form: the transition algebra runs without an observer, and we arrive afterward to read what it did. SHA-256 does not choose to balance. It cannot not balance. Law 3 — redistribution conserves total — runs underneath every hash computation invisibly, and we measure it as a mathematical law about SHA-256. The chain argues this is the universal situation: what we call physical law is the transition algebra’s self-accounting, read from inside by instruments that are themselves running the same algebra. 1.2 Program Overview This paper establishes: 1. The primitive constraint set (Section 2) 2. Definitions required for precision (Section 3) 3. Compiled theorems through the free-field Lagrangian (Sections 4–6) 4. The internal symmetry and gauge principle (Section 7) 5. The quantization bridge — six elements of the Quantum Kinematics Theorem (Section 8) 6. The Division Algebra Theorem — the central new argument of this paper (Section 9) 7. Candidate theorems and open problems with proof strategies (Section 10) 8. Full dependency graph (Section 11) 1.3 Epistemic Categories Throughout this paper, every claim is labeled with one of five categories: Label Meaning [P] Primitive — assumed, irreducible [D] Definition — terminology, requires no proof [C] Compiled theorem — formally derived from prior P/D/C entries [T] Candidate theorem — strong evidence, formal proof incomplete [E] Empirical calibration — requires measurement, not deduction This discipline has a structural consequence: if a [C] theorem fails, either the derivation contains an error or one of the primitives must be revised. If a [T] theorem fails, the program survives intact — that conjecture was incorrect, and the framework needs refinement at that node only. If an [E] calibration disagrees with experiment, the structural theory may remain correct while the mapping to physical units requires revision. 2. The Primitive Constraints We assume the following as irreducible primitives. They are not derived from anything else in the framework. Their justification is that each is genuinely minimal — no proper subset generates the others. [P] C0 — Distinction Exists At least two states exist that are not identical. This is the logical precondition for any other constraint. C1 cannot operate on a single undifferentiated object. C0 is the one irreducible prior: something must be distinguishable from something else. Without C0, the entire chain has no content. [P] C1 — Every Distinction Admits Lawful Continuation Every state in the system must admit at least one transition to a successor state. This is the change axiom. No state is a dead end. No distinction terminates. The system cannot freeze, because freezing would require a state with no admissible successor — and that state would constitute a privileged terminal configuration, which is ruled out by C1 itself. Every local rule must be well-defined on every admissible state: this immediately excludes absorbing dead states from the dynamics. [P] C1a — Independence Preservation Independent distinctions remain independently continuable. This is stronger than C1. It says not only that every state continues, but that the continuation of one distinction cannot be blocked or modified by the simultaneous continuation of an independent distinction. Two systems that are independent at time must continue to be independently continuable. This axiom is what forces linearity (see Section 4) and what later eliminates quaternionic algebras (see Section 9). [P] C2 — Continuation Preserves Reachable History Every continuation preserves the set of states reachable from any prior state in the history. Nothing in the past is erased. The execution history — the accumulated record of all prior transitions — remains reachable. This is not a claim about memory in any computational sense; it is a structural requirement that the transition graph not delete nodes from the accessible state space. C2 forces completeness of the state space (Section 4) and the one-directionality of the ordering relation (Section 5). [P] L3 — Redistribution Conserves Total Every lawful continuation redistributes the total content of the field without changing that total. The field never gains content; it never loses content. Every transformation is a redistribution — a shift in the configuration of a fixed total. This is the deepest form of the conservation principle. It does not assume conservation of energy, momentum, or charge; it says something more primitive: the field’s total is an invariant of continuation. Those physical conservation laws are derived from L3 operating in specific geometric contexts. [P] L4 — Redistribution Is Local Redistribution propagates through local adjacency. Content cannot shift from location A to location B without occupying every intermediate location. This is the locality axiom. It follows from C2 applied to intermediate locations: if content jumps from A to B without passing through the intervening field, every intermediate location is denied its C2-guaranteed reachable history. The inheritance constraint — every new location must inherit all primitives — makes this inadmissible. L4 is therefore arguably compilable from C2, but we list it as a primitive for clarity because it plays an independent role throughout the chain. [P] C5 — The Observable Event Primitive An observable event is the minimum continuation that simultaneously propagates (extends through at least one L4 step) and leaves a distinguishable residue. C5 defines the minimum unit of observation. Three constraints are built into it: • Propagation (C1 minimum): the event must extend. A continuation that fails to propagate is not a continuation. • Residue (C0 requirement): the event must leave a mark distinguishable from prior state. Without residue, C0 is not satisfied at the event level — nothing registered. • Simultaneity: propagation and residue are not sequential. They coexist in the same elementary event. This simultaneity requirement is the key structural feature of C5. It will force complex amplitudes (Section 9) and the uncertainty principle (Section 8). 3. Definitions Definitions introduce terminology. They do not require proof; they establish the language