Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. We prove the reverse direction of the PSC–Born fixed-point architecture: if quantum probability (Born rule) provides the internal, complete semantics for macroscopic records, then external model selection is impossible and the theory must satisfy Perfect Self-Containment (PSC). Formally, we define Born Internal & Complete Semantics (BICS) as a semantic-architecture condition stating that record probabilities are given by the Born rule via an internal quantum state, are context-independent (noncontextual), and are semantically complete (no external completion bits). We prove: BICS ⇒ NEMS (No External Model Selection), and under existing closure reductions (Externality Reduction + semantic visibility), BICS ⇒ PSC bundle / Full PSC. Within the explicitly defined universe class and under the BICS semantic-architecture condition, PSC and Born-as-internal-complete-record-semantics are equivalent. Combined with the forward direction (Papers 8, 13: PSC ⇒ Born semantics), this establishes a fixed-point equivalence: within an explicitly defined universe class, PSC and Born-as-internal-complete-record-semantics are architecturally equivalent. This overview presents the core NEMS theorem engine and selected applications; stronger domain-specific derivation and ontological synthesis claims belong to separate release surfaces with their own premise bundles and formal artifacts. The core theorem (BICS ⇒ NEMS) is fully machine-checked in Lean 4 with zero custom axioms and zero sorry.
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. We prove the reverse direction of the PSC–Born fixed-point architecture: if quantum probability (Born rule) provides the internal, complete semantics for macroscopic records, then external model selection is impossible and the theory must satisfy Perfect Self-Containment (PSC). Formally, we define Born Internal & Complete Semantics (BICS) as a semantic-architecture condition stating that record probabilities are given by the Born rule via an internal quantum state, are context-independent (noncontextual), and are semantically complete (no external completion bits). We prove: BICS ⇒ NEMS (No External Model Selection), and under existing closure reductions (Externality Reduction + semantic visibility), BICS ⇒ PSC bundle / Full PSC. Within the explicitly defined universe class and under the BICS semantic-architecture condition, PSC and Born-as-internal-complete-record-semantics are equivalent. Combined with the forward direction (Papers 8, 13: PSC ⇒ Born semantics), this establishes a fixed-point equivalence: within an explicitly defined universe class, PSC and Born-as-internal-complete-record-semantics are architecturally equivalent. This overview presents the core NEMS theorem engine and selected applications; stronger domain-specific derivation and ontological synthesis claims belong to separate release surfaces with their own premise bundles and formal artifacts. The core theorem (BICS ⇒ NEMS) is fully machine-checked in Lean 4 with zero custom axioms and zero sorry.
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. This short note provides a fast, technically correct entry point into the NEMS Suite. The suite establishes a fixed-point architecture linking closure (Perfect Self-Containment, PSC) to quantum probability semantics (Born rule) at the level of macroscopic records. The core contributions are stated as a compact theorem ledger with explicit assumptions and a precise map of what is machine-checked in Lean versus what is cited as classical mathematics. We also provide an audit-style "where disagreement must occur" checklist: any critic must reject a specific named premise (records, closure, computation, semantic completeness, or classical linear-algebraic facts), rather than dismissing the framework as interpretive.
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. We prove that the Born rule is the unique consistent probability assignment for any perfectly self-contained (PSC) theory whose records carry quantum effect structure. The argument has two interlocking stages. Formal stage. We machine-check in Lean 4 that any normalized, POVM-additive probability assignment \mu on n-dimensional quantum effects has at most one density operator \rho representing it: [ \mu(E) = \re\bigl(\Tr(\rho E)\bigr) \quad\textfor all effects E. ] What is machine-checked here is the uniqueness of the density-operator representation under the closure constraints. Existence of such a representation is imported from known Busch/Gleason-type results. The uniqueness theorem busch_gleason_unique is fully proved with zero sorrys, using three families of test effects that together span \Herm(n) and extract every matrix entry of \rho. Physical stage. PSC forces any record-level probability assignment to be noncontextual and POVM-additive, because probabilities that depend on external measurement context introduce semantic externality that PSC excludes. Therefore, if a Born-rule density operator exists (Busch/Gleason existence, acknowledged as a known result), it is provably unique by our machine-checked argument. The Born rule is thus not a postulate but the only fixed point of closure. The approach generalizes standard Gleason-type derivations: it applies to POVMs (not only projectors), requires no dimension lower bound, and is interlocked with the NEMS record-closure framework. The Lean artifact constitutes the first machine-verified uniqueness proof for quantum probability in an operationally grounded formalization. This overview presents the core NEMS theorem engine and selected applications; stronger domain-specific derivation and ontological synthesis claims belong to separate release surfaces with their own premise bundles and formal artifacts. Trust boundary. Machine-checked content is the density-operator uniqueness lemma under stated effect constraints (nems-lean ); Busch/Gleason existence is imported as classical mathematics. PSC⇒noncontextual semantics links are premise-sensitive. See .
STATUS (18 October 2026). The physics programme that motivated this work was concluded in October 2026 and its claim of a unified derivation withdrawn. The results in this paper do not depend on that programme and stand as stated. NOTE ON SCOPE (18 October 2026). Where this paper says that the Standard Model's matter content, charges or gauge structure are derived from, forced by or emerge from the eight-bit error-correcting cell, read encoded in or assigned to. The finite results themselves stand: the code, its constraints and the anomaly arithmetic are exact. But two things are premises of the framework, not consequences: the identification of codewords with particles, and the choice of the eight-bit [8,4,4] cell. In particular, the step from read/write balance to a single CSS code is not derived [R22]. The author's October 2026 review of the programme concluded that the framework's Standard-Model content is assigned rather than derived. No observation currently distinguishes the framework's account from the Standard Model itself. This revised note argues that, within the accepted complex quantum-error-correcting record substrate, the quadratic Born form arises from linear record writing, orthogonality of record sectors, and isometric normalization before any probability measure is introduced. Conditional uniqueness is treated separately through Gleason-type and refinement-stable record-sector routes. The 30 August 2026 additivity-audit revision cites Jiaxuan Zhang's analysis of five Born-rule derivations (arXiv:2603.06211) and makes the premise accounting explicit: a Gleason frame function includes orthogonal additivity, while Marko Lela's route begins with a non-negative extensive valuation on disjoint continuation bundles. The closed-record-pair route assumes neither measure-level object, but establishes the quadratic form rather than a standalone uniqueness theorem. The resulting open frontier is to obtain both form and uniqueness without importing measure-level additivity. The paper also records the minimal [8,4,4] record cell and the bare monitored service rate alpha_0 = 1/137, while retaining the deeper reconstruction question as open.
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. See PROGRAM_STATUS.md. Status as of October 2026. We apply 't Hooft's cellular automaton interpretation of quantum mechanics to the GTE cellular automaton f_MDL on Z_7^5, the 16,807-state visible-sector ring encoding the Standard Model generation structure. The complete orbit decomposition of f_MDL () reveals a single cycle: the vacuum fixed point (0,0,0,0,0) with E=0. The physical Hilbert space is one-dimensional; f_MDL belongs to 't Hooft's information-loss regime. SM generation states are transients with tail lengths (gen_1)=3 > (gen_2)=2 > (gen_3)=1, matching the empirical stability hierarchy (). A direct eigenvalue-to-mass correspondence is falsified on every formulation tested (). The Two-Role Structural Principle () separates roles: the cogwheel construction provides Hilbert space structure, unitarity, and the Born rule (, Lean-certified); the GTE N_eff cascade provides the mass spectrum. The seven winding-equivalence classes of Z_7^5 (, gauge\_arithmetic\_identification) are identified as 't Hooft's information-equivalence gauge classes (): the five SM winding sectors \0,2,3,4,6\ yield U(1)_EM, SU(2)_L, and SU(3)_c; sector W=1 predicts the SU(5) Y-leptoquark; the X-leptoquark (Q=+4/3) cohabits W=4. The AFCA causal graph is update-schedule-independent (Lean-certified); discrete Minkowski causal cones are embedded with coordinate surjection certified. Full Minkowski bijection remains open ().
PSC forbids information "lost outside" the universe or true destruction without internal semantic closure. This paper applies NEMS and the hypercomputation taxonomy (Paper 35) to black hole information. We reframe the paradox in terms of record fragments (e.g., outside thermal, infalling, unitarity). We prove: (1) Record consistency (abstract): an information-erasing appearance (two worlds disagree on an observation) implies the semantics is not categorical (multiple world-types; selection is required). Classically (Choice), a selector exists; internal/effective selector is constrained by diagonal barriers (Papers 29/35). (2) No hypercomputing from black holes: under the same barrier assumptions (extensional + nontrivial predicate; anti-decider closure; \hFP), no internal total-effective black-hole decoder can decide a diagonal-capable predicate on the outcome space. Observer-relative records (complementarity) and islands/Page curve are interpreted as closure-driven reassignment; we do not assume any particular QG microphysics. The development is mechanized in Lean 4 as the BlackHoles library in nems-lean, with zero sorry and no custom axioms. Trust boundary. Record-consistency and no-hypercomputing claims are abstract and conditional on the Paper 29/35 barrier hypotheses; we do not assume a specific quantum-gravity completion. Mechanization is nems-lean . See .
A finitist, relational axiomatization of physics: quantum theory and a relativity sector derived from four axioms about group-valued relations and closure. Contributions to the foundations of quantum mechanics (Born rule derivation, quantum reconstruction, local tomography, complex field selection), the emergence of time and causal structure in discrete networks, discrete Noether theorems, lattice gauge structure, and the Schrödinger equation derived by two independent routes. Every claim is graded in a Claim Ledger; every numerical claim is machine-verified with archived scripts; negative results are reported at full strength. What this paper does The universe is taken to be constituted by relations rather than objects. Stable relations form closures (self-consistent cycles) whose holonomies carry the physical content. Four axioms — primacy of relations (group-valued, edge-borne), closure stability, chirality from order, and observation as bidirectional group exchange — yield, at explicitly graded and conditional levels: Quantum sector Exchange-completeness theorems for finite label groups: abelian at all cycle ranks; non-abelian on the single cycle (Wilson readouts plus class-sum convolutions generate the full matrix algebra); the multi-cycle non-abelian case on the operational-equivalence quotient, with the obstruction completely characterized via class-preserving outer automorphisms — and the quotient's necessity now stratified by the source of word blindness (see New in Version 24.0). The Born rule, proved for finite abelian networks from a strictly weaker relational readout premise (statistics of realizable effects depend only on relational content); non-contextuality has this single source; additivity is basis-relative and declared as such. The Schrödinger equation by two routes of unequal premise grade, maintained side by side: a spectral route — the action operator is a weighted Cayley-graph Laplacian in the Pontryagin dual basis, the derived Gibbs state's unique canonical (modular) flow yields the Schrödinger equation with Hamiltonian equal to the action operator, no continuum limit, zero conjectures consumed, the single non-theorem step one flagged identification; and a Madelung route — physical and mechanism-rich (probability density derived from constraint gaps), valid exactly on the domain of the pseudo-continuity conjecture, with its full premise bill stated (continuity equation, Wallstrom circulation condition, m, V). A dedicated comparison subsection gives the line-by-line premise accounting and the machine-measured agreement region. Complex field selection: ℂ selected over ℝ and ℍ within the GPT comparison class in the covered sectors, with a second independent route from chirality (Frobenius–Schur dichotomy, quaternionic double exclusion); "uniquely selected" expressly not claimed. Positivity as pairing: all five in-text positive-semidefiniteness theorems traced to one mechanism (M = B†B with native factor); the Kraus form and complete positivity derived rather than assumed. The Noether sector on Noether's two theorems exactly: Noether I recovered on the holonomy action (compact Lie realization); Noether II identified as present (Bianchi as horn-filling, Schläfli as its Regge form); selection rules recovered for finite groups; the GNS bridge proved non-vacuously on the full exchange algebra; the sole potential extension — conservation as the kernel of exchange — isolated as a registered conjecture, consumed nowhere. A local–global representation theorem: six generative quantities (closure invariant, flux quantization, Weyl phase, non-abelian Stokes, orientation visibility, terminal normalization) are evaluations of cohomology classes against closed chains — one syntax, six exact machine probes. The gatekeeper no-go theorems registered and discharged: Kochen–Specker (the framework posits no global valuation — outcomes are resolutions of constraint gaps, and basis-relative additivity blocks state-independent variants), Pusey–Barrett–Rudolph (the statistical envelope is over resolutions yet to happen, not values already held; machine witness: identical configuration ensembles with opposite relative phase have opposite statistics), Wallstrom (registered as an explicit input, structurally discharged in the finite-abelian sector), Hegerfeldt (the Lieb–Robinson exponential tail identified as the only claimable front form for the continuum limit), Frauchiger–Renner (cross-agent certainty transfer presupposes kernel-free record transport, exactly what exchange-incompleteness excludes), and no-cloning (inherited in the covered sectors); Conway–Kochen and Colbeck–Renner noted as concordant. Relativity sector Time from finite capacity plus genuine randomness: the staging theorem (Θ(d) dependency depth, unbounded chains via the Moore bound; the quantitative failure law conditionalized on measure-level independence with exact minimal witnesses); the temporal quantum defined combinatorially, no Hamiltonian input. The speed of light grounded in an exact discrete dependency cone (combinatorial, no quantum input), the Lieb–Robinson bound consumed at cross-check grade only; a boost no-go theorem reducing Lorentz invariance to named statistical conditions, with the Collins fine-tuning objection recorded as a gate. The trace-descent theorem group: the growth-history measure forced onto the Mazurkiewicz trace quotient; chain reflection positivity at every depth with completely explicit spectrum. An equation sector of nine verification families (Schrödinger, Dirac, Maxwell/U(1), canonical commutator, Yang–Mills SU(2), Regge calculus, Klein–Gordon, Noether loop, Cartan curvature), where every machine-precision claim is the shadow of a proved backbone lemma — including the factor ½ of H = ½L + V, identified as the Wilson Fourier coefficient fixed by the action theorem. Four experimentally testable predictions, including a discriminating flat-versus-sigmoid visibility protocol. The Standard Model gauge group, ħ, and G remain open, with attack routes registered. How to read Three entry paths are marked in the document. Path A (derivational core): axioms → group structure → Noether sector → least action → Born rule → positivity. Path B (physical mechanisms): constraint propagation → time as determination → wave function as gap envelope → fields. Path C (scope and limits): the Claim Ledger, then Discussion and Open Problems — for the reader who wants to know what is claimed and what is not before reading anything else. The Claim Ledger is the single authoritative register of claim status; wherever body text sounds stronger, the Ledger governs. New in Version 24.0 (Version 23.0 is the immediately preceding public release; this version supersedes the internal V12–V15 and V17–V19 series, whose numbers are not used externally.) Version 24.0 resolves the structure of the multi-cycle non-abelian obstruction — the sector's longest-standing open front — following an external research exchange with three rounds of independent re-verification (fourteen core figures, three commutant instruments implemented independently, exact integer arithmetic on the obstruction side) and two rounds of counter-review that corrected one quantifier on each side: A dichotomy of the multi-cycle obstruction (new remark). Word blindness on multi-cycle networks has two identified sources, jointly covering every tested case, with opposite behaviour as cycle rank grows. Type I (global; graded): a class-preserving outer automorphism yields a commutant element by an argument free of cycle-rank reference; its non-triviality holds at theorem grade for b₁ ≥ d(G) via generating tuples, is monotone in b₁, and the threshold is measured at b_σ = 2 on the tested Wall group (at b₁ = 1 the permutation is the identity — no universal claim is made, and the existence of groups with threshold above 2 is registered open). Type II (local; measured): Out_c trivial but fusion fails on a proper subgroup, the blind pairs sitting in non-generating sectors — the same mechanism that defeats Wilson generation; this blindness heals: on every verified group (A₄, SL(2,3), A₄×ℤ₂) the full commutant collapses to trivial at b₁ = 3 by exact computation on two independently implemented instruments, although word readouts remain blind — the shift primitives separate, above a threshold, and the natural explanation (tuples becoming generating) is refuted by the persistence of blind blocks. Three boundaries at full strength: no exhaustiveness proof (a third source is not excluded); no general healing theorem (the verified groups all heal at 3, cause unidentified); the verified Type II sample is narrow. The quotient proposition restated in stratified form. The operational-equivalence quotient's necessity is now part of the proposition's own statement, in three strata: necessary where Out_c ≠ 1 at every b₁ ≥ b_σ(G), with b_σ ≤ d(G) at theorem grade; one-dimensional at b₁ = 2 on the fusion-type groups (verified cases); trivial at b₁ ≥ 3 on every verified fusion-type group and at every tested b₁ for word-separation-complete groups (a fourteen-group scan of orders ≤ 31 found no third source). Pre-registered validation preceded the restatement: a stratification-exhaustiveness scan (pass), a new-witness search (no new witness in range, downgrade clause applied as pre-registered), and a zero-conflict audit of the three strata against all archived data. The residual open problem is now precisely located. What remains of multi-cycle completeness: the rare Out_c ≠ 1 groups (54 in the exhaustive range through order 96) above their measured thresholds, the low-b₁ fusion stratum, a general healing theorem, and whether a threshold above 2 occurs. The multiplicity-freeness conjecture's mechanism sentence is corrected with the two regimes stated separately (at b₁ = 2 the shifts do not separate — the blind-pair transposition commutes with every primitive, integer-exact — and reduce the commutant to