Research Abstracts — Preview

Paper 00 — Overview of the NEMS Framework

The suite overview: structure, dependency map, reader paths for all audiences.

Zenodo (PDF + DOI)

Paper 01 — The NEMS Framework: No External Model Selection as a Principle of Foundational Self-Containment

Introduces NEMS as a foundational self-containment principle and derives its first consequences.

This paper introduces the No External Model Selection (NEMS) framework to a physics audience, explaining in physical rather than model-theoretic language what NEMS requires, why it matters, and what it implies for programs that rely on external choosers (measures, vacuum selectors, observer maps) to extract determinate predictions. The central result is a trichotomy: any candidate fundamental theory is either record-level categorical, internally selecting, or not fundamental in the NEMS sense. The paper summarizes the Externality Reduction bridge (every "outside dependency" is selection in disguise), the semantic visibility closure (the semantics cannot hide outside the records), and the results of three illustrative audits applied to multiverse cosmology, the string landscape, and computational-universe programs. The core theorem spine is machine-checked in Lean 4 (v2.0.0, 8051 jobs, zero sorry, zero custom axioms). The framework does not adjudicate which theory is correct; it provides a precise, auditable criterion for when a theory qualifies as a complete foundational explanation.

Zenodo (PDF + DOI)

Paper 02 — The No External Model Selection Theorem: Semantic Closure, Categoricity, and Diagonalization Constraints

Proves the core NEMS theorem: semantic closure, categoricity, and diagonal barriers.

This paper studies the structural consequences of "no external model selection": the requirement that a realized world is not chosen by ontologically external information among observationally inequivalent realizations of a finite law-description. A minimal axiom package is formalized — single actuality for observational records, no external selection among observationally inequivalent models, a finite syntactic description, exclusion of unconstrained completion data ("free bits"), and sufficient expressiveness for self-reference — and from these assumptions a model-theoretic dichotomy is derived: either the law-description is categorical up to observables or the realized system contains an internal selection functional. Under explicit self-reference hypotheses (the arithmetic self-reference package ASR), any such selection mechanism cannot be a total effective functional on the diagonal fragment, yielding a sharp refinement into restricted/stratified (Class IIa) versus non-effective (Class IIb) internal selection. The resulting classification theorem partitions all candidate universes and autonomous self-modeling systems satisfying the axioms into four universality classes (I, IIa, IIb, III), with applications and domain-specific consequences treated as corollaries under additional premises.

Zenodo (PDF + DOI)

Paper 03 — Structural Stability as a Necessity Principle in Self-Contained Gauge Theories

Derives structural stability (NM*) as a theorem from PSC, excluding GUT groups and CP-conserving theories.

This paper derives the NM condition (Structural Stability) as a necessary consequence of Perfect Self-Containment (PSC) for physical theories, establishing a derivation chain: PSC ⇒ Reflexive Closure (RC) ⇒ NM. Reflexive Closure — the requirement that a theory compute its own S-matrix — is proven to follow from the minimal definition of self-containment, and NM — constancy of qualitative type on an open dense subset of parameter space — is proven to follow from RC, establishing NM not as an axiom but as a theorem. Four consequences are derived: GUT groups are excluded via vacuum topology bifurcations; vector-like fermion theories are excluded; theories without massless particles are excluded; and CP-conserving theories are excluded. These constraints, previously treated as separate physical arguments, are unified under a single derivation chain resting on one philosophical commitment: fundamental theories must be self-contained. The analysis is restricted to 4D renormalizable gauge QFTs without gravity.

Zenodo (PDF + DOI)

Paper 04 — Instantiating No External Model Selection in Physics

Applies NEMS to macroscopic physical records and establishes the Class IIb criterion.

This paper instantiates the No External Model Selection Theorem in a physics-grounded setting by fixing an observational fragment based on stable macroscopic records. Building on the universality-class classification of realized systems under single actuality, no external model selection, and no free completion bits, it provides explicit sufficient conditions under which a realized universe must lie in Class IIb relative to the record language: observational multiplicity forces internal selection, and diagonal-capable self-reference on the same record fragment forbids total effective selection. The paper contributes (i) a minimal, operational definition of a record language L_rec and its record-truth semantics; (ii) a minimality theorem showing that L_rec captures the weakest standard observational commitments needed for empirical science; (iii) two complementary routes to establishing record-level non-categoricity in physically universal systems (Route A via universality/undecided record propositions; Route B via the no-free-bits exclusion of trivial categoricity); and (iv) a theorem package separating a core Class IIb criterion from domain-specific premises that imply its hypotheses. An appendix provides a fully explicit Route A construction with a universality dichotomy lemma, and a second appendix gives mainstream physical support for the universality premise (P4) via cellular automata, reversible computation, and quantum simulation.

Zenodo (PDF + DOI)

Paper 05 — PSC-Optimality of the Standard Model in 4D Gauge Theory Space

Proves the Two-Layer PSC Theorem: hard constraints force SU(3)×SU(2)×U(1); PI selects 3 generations.

This paper analyzes the space of 4D renormalizable gauge quantum field theories under five axioms of Perfect Self-Containment (PSC): Reflexive Closure (RC), Structural Stability (NM*), Thermodynamic Viability (TV), Semantic Admissibility (SA), and Presentation Invariance (PI). A Two-Layer PSC Theorem is proven: Layer I (Consistency) shows that the hard PSC axioms narrow admissible gauge topologies to SU(3)×SU(2)×U(1) with anomaly-minimal chiral matter and N_gen ≥ 3; Layer II (Optimality) shows that Presentation Invariance selects N_gen = 3 as the unique minimal solution. The result precisely distinguishes what is forced by self-consistency from what is selected by minimality, providing a rigorous derivation of the Standard Model gauge structure and three-generation structure from first principles without invoking empirical input.

Zenodo (PDF + DOI)

Paper 06 — No External Model Selection in Quantum Gravity

Extends NEMS to quantum gravity via records, diffeomorphism redundancy, and non-effective internal selection.

This paper applies the No External Model Selection (NEMS) classification framework to quantum-gravity completions by fixing a minimal gravitational record language and isolating quantum-gravity structure that forces record-level non-categoricity absent internal selection. The main result is a theorem package: (i) a minimality lemma for the gravitational record fragment L_rec^grav, showing that any observational language adequate for empirical quantum gravity interprets it up to definitional extension; (ii) a quantum-gravity non-categoricity theorem establishing |WTypes(T_σ; L_rec^grav)| > 1 under explicit, framework-neutral gravitational premises unless internal selection is already present; and (iii) a Class IIb consequence under the NEMS closure bundle. Two complementary mechanisms for non-categoricity are provided: Route A (relational/gauge anchoring multiplicity — diffeomorphism redundancy forces relational anchoring of records, and multiple compatible but distinguishable anchoring schemes yield observational multiplicity) and Route B (horizon/complementarity reconciliation multiplicity — horizon-class phenomena produce context-dependent record descriptions whose reconciliation is underdetermined by the base theory). A definability bridge theorem shows that any anchoring or reconciliation mechanism that is not observationally definable from the remaining primitives constitutes free completion data, contradicting the no-free-bits premise. The paper also provides a holography/complementarity taxonomy organizing bulk–boundary encoding proposals into the NEMS universality classes, and an appendix gives a fully formal Route B construction via cross-context linkage sentences.

Zenodo (PDF + DOI)

Paper 07 — The NEMS Framework for Physicists

Self-contained introduction to NEMS for physics audiences; covers gauge structure and quantum gravity angle.

This paper introduces the No External Model Selection (NEMS) framework to a physics audience, explaining in physical rather than model-theoretic language what NEMS requires, why it matters, and what it implies for programs that rely on external choosers (measures, vacuum selectors, observer maps) to extract determinate predictions. The central result is a trichotomy: any candidate fundamental theory is either record-level categorical, internally selecting, or not fundamental in the NEMS sense. The paper summarizes the Externality Reduction bridge (every "outside dependency" is selection in disguise), the semantic visibility closure (the semantics cannot hide outside the records), and the results of three illustrative audits applied to multiverse cosmology, the string landscape, and computational-universe programs. The core theorem spine is machine-checked in Lean 4 (v2.0.0, 8051 jobs, zero sorry, zero custom axioms). The framework does not adjudicate which theory is correct; it provides a precise, auditable criterion for when a theory qualifies as a complete foundational explanation.

Zenodo (PDF + DOI)

Paper 08 — From NEMS to MFRR: A Machine-Checked Bridge Between Semantic Closure and Reflexive Reality

Machine-checked bridge connecting the NEMS closure theorems to the broader Reflexive Reality framework.

This paper constructs a formal, machine-checked bridge between the NEMS (No External Model Selection) classification framework and the MFRR (Mathematical Foundations of Reflexive Reality) program. It shows that MFRR's Perfect Self-Containment (PSC) condition, combined with record-divergent choice points, forces the existence of an internal adjudication principle (Transputation / PT) as a theorem of the NEMS classification spine. Under diagonal capability — formalized via an Arithmetic Self-Reference (ASR) structure that bridges record-truth to the halting problem — record-truth is provably not computably decidable, constraining any selector to be non-total-effective. The diagonal barrier is proved via reduction to Mathlib's machine-checked halting undecidability theorem, yielding a library with zero custom axioms. All results compile in Lean 4 (v4.28.0, Mathlib 4.28.0, 8051 jobs, zero sorry). This bridge upgrades MFRR's central claim — that a closed universe must contain a lawful, non-algorithmic internal adjudicator — from a physical argument to a fully machine-checked theorem with no escape hatches, making every assumption explicit and auditable.

Zenodo (PDF + DOI)

Paper 09 — Physical Records Imply Non-Effective Internal Adjudication

Proves that diagonal-capable physical records force non-effective internal adjudication in PSC universes.

This paper establishes a universality-level consequence of Perfect Self-Containment (PSC) for any candidate closed theory of the physical universe. Using the machine-checked NEMS classification spine and a machine-checked bridge to the MFRR adjudication principle (Transputation / PT), it proves two results: (i) internal adjudication is forced — if macroscopic records do not uniquely determine a realization and the theory is PSC at the NEMS interface level, then an internal selector/adjudicator exists as a theorem; and (ii) total effective adjudication is forbidden on diagonal-capable record fragments — if the record fragment is diagonal-capable in the ASR sense, then record-truth is not computably decidable, and therefore no internal adjudicator can be total-effective on that fragment. The formal core is kernel-verified in Lean 4 with zero custom axioms, reducing the diagonal constraint to Mathlib's machine-checked halting undecidability theorem. The paper supplies the remaining physical component: a conservative argument that our universe satisfies the required premises in any realistic macroscopic-record description, because physical systems implement universal computation (yielding diagonal capability at the record level) and physically admissible dynamics generically exhibit record-level underdetermination in any account that permits stable macroscopic records. This constitutes a Gödel/Turing-class constraint on the form of closed physical theories.

Zenodo (PDF + DOI)

Paper 10 — Transputation Versus Computation

Distinguishes Transputation (non-algorithmic internal adjudication) from computation and proves its necessity.

This paper distinguishes computation — effective rule application reducible to Turing computation — from transputation — a law-governed internal adjudication required in perfectly self-contained (PSC) theories when observational records do not uniquely determine realizations. The distinction is formalized using the NEMS framework: in record-non-categorical settings, PSC forces an internal selector (adjudicator) selecting canonical representatives of observational world-types. Under diagonal capability, formalized by an Arithmetic Self-Reference (ASR) structure, record-truth on the ASR fragment is not computably decidable, and therefore no internal adjudicator can be total-effective on that fragment. These forcing and diagonal results are kernel-verified in Lean 4 with zero custom axioms, reducing the diagonal barrier to Mathlib's halting undecidability theorem. The paper then presents MFRR's mechanistic proposal for transputation — coherence-driven minimization of a dissonance functional (DSAC/PR-0 style dynamics) — which implements internal adjudication as a physical relaxation process rather than a total algorithmic decider. The paper concludes with a taxonomy of where computation suffices, where transputation is forced, and how transputation may be instantiated in realistic physical systems with stable macroscopic records and universal computation.

Zenodo (PDF + DOI)

Paper 11 — Physical Incompleteness from Universal Computation

Machine-checked diagonal barrier: closed physical theories with universal computation are physically incomplete.

Release role: first-entry theorem surface for the broader diagonal/closure program (stated in-paper).

Zenodo (PDF + DOI)

Paper 12 — Determinism No-Go Under Perfect Self-Containment

Diagonal-capable records forbid total-effective record determinism in theories with genuine record-divergent choice.

This paper proves a determinism no-go theorem for closed physical theories with macroscopic records. Using the machine-checked NEMS classification spine and the machine-checked diagonal barrier, it shows that in any perfectly self-contained (PSC) framework that is both (i) diagonal-capable at the record level (i.e., it can encode universal computation and halting as record-truth) and (ii) admits genuine record-divergent choice (multiple admissible continuations disagreeing on records), there is no total effective deterministic law that maps past records to unique future records on the diagonal-capable fragment. Formally, any purported total computable "record determinism" function would induce a total computable decider for diagonal-capable record-truth, contradicting the diagonal barrier proved via reduction to Mathlib's halting undecidability theorem. The proof is kernel-verified in Lean 4 with zero custom axioms. This establishes a Gödel/Turing-class limitation on deterministic closure: if a theory is PSC and admits record-divergent choice, then any determinism compatible with diagonal-capable records must be non-total-effective (or must retreat to record-categoricity / triviality).

Zenodo (PDF + DOI)

Paper 13 — Born Rule as a Closure Fixed Point

Proves the Born rule is the unique quantum probability assignment in perfectly self-contained theories.

This paper proves 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. In the formal stage, it is machine-checked in Lean 4 that any normalized, POVM-additive probability assignment μ on n-dimensional quantum effects has at most one density operator ρ representing it: μ(E) = Re(Tr(ρE)) for all effects E. The uniqueness theorem is fully proved with zero sorrys, using three families of test effects that together span the space of Hermitian matrices and extract every matrix entry of ρ. In the 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, a known result), it is provably unique by the 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/MFRR record-closure framework.

Zenodo (PDF + DOI)

Paper 14 — Born Internal & Complete Semantics Implies Perfect Self-Containment

The reverse direction: from quantum probability (Born rule) back to closure.

This paper proves 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). Born Internal & Complete Semantics (BICS) is defined 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). The paper proves: BICS ⇒ NEMS (No External Model Selection), and under existing closure reductions (Externality Reduction + semantic visibility), BICS ⇒ PSC bundle / Full PSC. Combined with the forward direction (Papers 08 and 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. The core theorem (BICS ⇒ NEMS) is fully machine-checked in Lean 4 with zero custom axioms and zero sorry. This completes the NEMS suite by closing the loop between semantic closure, quantum probability, and perfect self-containment.

Zenodo (PDF + DOI)

Paper 15 — No-Emulation and Self-Necessitating Adjudication (C1)

Proves no-emulation as a constraint and that self-necessitating adjudication follows from closure.

This paper proves that in any diagonal-capable physical framework — one expressive enough to host the halting problem in its record fragment — no total computable function can emulate the internal adjudication operator (Transputation, PT) on all inputs. A choice-point interface is defined, identifying states where PT must actively select among multiple valid continuations, and an adjudication function is defined specifying the valid-selection contract. The No-Emulation Theorem is then proved: any claimed computable emulator for PT would yield a total computable decider for record-truth RT on the diagonal fragment, contradicting the diagonal barrier established in Papers 11–12. The proof is a one-step reduction to the existing machine-checked diagonal_barrier_rt theorem. As a corollary, active internal selection (Transputation) is self-necessitating: it cannot be replaced by any static algorithm. This is the first theorem of Phase 2 of the NEMS program, bridging the diagonal barrier to the necessity of observer-like adjudication infrastructure (Papers 16–17). All results are machine-checked in Lean 4 with zero custom axioms and zero new sorrys (8069 jobs, build clean).

Zenodo (PDF + DOI)

Paper 16 — Relative PSC and Recursive NEMS (Fractal Closure) (C2)

Fractal closure: relative PSC and recursive application of NEMS constraints.

This paper introduces the concept of relative closure for subsystems within the No External Model Selection (NEMS) framework. By defining a subsystem as an autonomous framework with its own internal model, records, and truth relations, we prove a powerful recursion principle (Recursive NEMS): if a subsystem implements complete internal semantics (BICS) for its own records, it necessarily satisfies NEMS relative to its environment. Furthermore, we prove the heredity of the diagonal barrier: if a subsystem is rich enough to host Arithmetic Self-Reference (ASR), the undecidability of its internal record-truth applies directly to it, rendering its internal adjudication non-emulable by any total-effective algorithm. This establishes the "fractal" nature of semantic closure in NEMS. We also present a strengthened version of the No-Emulation theorem (deferred from Paper 15), explicitly formalizing the instance-level encoding that bridges physical emulation and computational decidability. All definitions and theorems are fully machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 17 — Necessary Adjudicators and Reflexive Self-Model Closure (RSMC) (C3)

Proves necessary adjudicators and the reflexive self-model closure requirement.

This paper establishes that observer-like subsystems are not accidental flukes of biology, but necessary infrastructural components of any physical universe that maintains global record stability and nonlocal coherence while satisfying Perfect Self-Containment (PSC). Building on the No External Model Selection (NEMS) framework, we prove a weak necessity theorem: if a PSC universe contains persistent, re-readable records and must reconcile record-truth across distributed contexts, it must contain a network of internal subsystems (Adjudicator Nodes) that maintain records, adjudicate local choice points, and propagate sufficient information to support global coherence. Crucially, we show that if such a node is computationally rich enough to host Arithmetic Self-Reference (ASR) and robust enough to maintain its semantics under self-reference, it is forced to develop Reflexive Self-Model Closure (RSMC)—an operational, non-anthropic surrogate for self-awareness. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 18 — The Theorem of Semantic Terminality (T1)

Semantic terminality: the closure of semantic self-description under NEMS constraints.

This paper proves that the reductionist regress—the assumption of an endless hierarchy of deeper micro-theories—must terminate in any universe satisfying Perfect Self-Containment (PSC). We introduce the concept of a PSC-optimal theory, which minimizes descriptional complexity while fully capturing all macroscopic record facts. The Theorem of Semantic Terminality establishes that any "deeper" theory extending a PSC-optimal description either fails foundational status (by requiring new external selectors, thus violating PSC) or is physically redundant (adding unforced complexity without altering record-truth). This implies that a foundational theory achieving record-level closure, such as the Standard Model at its appropriate scale, is not merely an effective approximation but the logical limit of semantic closure. All definitions and theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 19 — The Non-Emulability of Execution — Agentic Necessity (T2)

Execution cannot be emulated from within; agentic necessity follows.

This paper formalizes the refutation of static models of reality, such as the "Block Universe" and the Simulation Hypothesis, by proving that the universe must be actively "run" from within. Building on the Diagonal Barrier (Papers 11-12), we introduce the premise of Record-Divergent Choice: the existence of internal adjudication events that strictly determine future macroscopic records. We prove the Theorem of Execution Necessity: no total-effective static algorithm can perfectly emulate the universe's internal adjudication. If such an emulation existed, it would induce a computable decider for record-truth, violating the diagonal barrier. Consequently, internal adjudicators (agents) are not biological accidents but the necessary execution engine of physical reality. All definitions and theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 20 — Rigidity of the Gauge Signature under PSC: A Sieve Theorem (T3)

Sieve theorem for theory spaces; residual classification program for gauge signatures.

This paper extends the logic of semantic closure to the gauge structure of the universe, challenging the string theory "landscape" paradigm. We propose that the Standard Model gauge signature is the unique mathematical fixed point for any stable, self-contained record-bearing system in 4D spacetime. We formalize a PSC Sieve on 4D gauge-theory space, consisting of self-containment constraints: structural stability (NM*), semantic admissibility (SA), thermodynamic viability (TV), and anomaly consistency. We prove that these constraints eliminate large classes of theories, leaving a highly constrained residual set. We state the Residual Classification Conjecture: within this residual set, only the SU(3) × SU(2) × U(1) signature with 3 generations survives. All definitions and conditional theorems are formalized in Lean 4, and the residual conjecture is supported by a reproducible computational classification pipeline.

Zenodo (PDF + DOI)

Paper 21 — The Theorem of Existential Rigidity: The Collapse of Contingency (T4)

Contingency collapses under PSC: existence is not contingent but necessary.

This paper formalizes the ultimate ontological conclusion of the NEMS framework: in a self-contained reality, mathematical possibility collapses into a single, singular solution. We define a theory as ontologically legal if it is foundational (does not require external selectors or free bits) and is not physically redundant relative to a PSC-optimal terminal theory. Building upon the Sieve Theorem (Paper 20) and the Semantic Terminality theorem (Paper 18), we prove the Theorem of Existential Rigidity: if the Residual Classification Conjecture holds, the Standard Model signature is not merely an optimal effective theory, but the only ontologically legal foundation for a universe. Any other mathematically possible gauge group violates the closure axioms, making it an incomplete foundation. Under these premises, contingency collapses. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 22 — Irreducible Agency: Non-Algorithmic Adjudication as a Physical Requirement (T5)

Agency is irreducible: non-algorithmic adjudication is a structural physical requirement.

This paper formalizes the theorem that in a Perfectly Self-Contained (PSC) universe with computers, the internal adjudicator network cannot operate via a total computable function. By merging the Diagonal Barrier (Papers 11–16) with Adjudicator Necessity (Paper 17) and Execution Necessity (Paper 19), we prove that a "dead" algorithmic law cannot reach a determinate state. The "law of physics" at the choice-resolution layer is strictly non-algorithmic. This establishes irreducible adjudication at the choice-resolution layer: internal record determinacy in a diagonal-capable PSC universe requires a non-total-effective adjudication mechanism. Observer-like subsystems are interpreted as the physical implementation of this mechanism within a record-stabilizing network. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 23 — Foundational Finality: The Master Loop and the End of Reductionism (T6)

The master loop theorem; reductionism ends at the reflexive fixed point.

This paper formalizes the theorem that physics terminates at the Reflexive Fixed Point. We define a "Master Loop" as a physical framework where the law-description, record semantics, and execution mechanism are internally co-realized without external separation. We prove the Theorem of Foundational Finality: any attempt to explain a Perfectly Self-Contained (PSC) universe from the "outside" (e.g., via a simulator, a multiverse measure, or an external runner) must either violate self-containment, be physically redundant, or be isomorphic to the original universe. We further demonstrate that the universe is a literal fixed point of the map from ontology to semantics and back to optimal ontology. This establishes that no foundational explanation can rely on external model selection without ceasing to be foundational. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 24 — The Theorem of the Semantic Floor: The Minimal Reflexive Seed (T7)

Minimal reflexive seed theorem: the semantic floor forced by PSC.

This paper formalizes an information-theoretic constraint on the initial conditions of a Perfectly Self-Contained (PSC) universe. We prove the Theorem of the Semantic Floor: a PSC universe cannot originate from an underspecified initial boundary that requires external completion data to determine record-truth. Instead, any admissible initial state must possess a "Semantic Floor"---a structural capacity to host or internally generate Diagonal Capability (Arithmetic Self-Reference) and Internal Adjudication ($\PT$) without relying on an external model selector. We show that classical singularities, which represent states of infinite underdetermination requiring external initial conditions, are non-foundational under PSC. The universe must begin as a discrete, self-interpreting "Reflexive Seed." All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 25 — The Unified Rigidity Theorem: The Lepton Seed (T8)

Unifies the rigidity results; the lepton seed is the unique PSC-minimal survivor.

This paper formalizes the final capstone theorem of the NEMS/MFRR suite: the Unified Rigidity Theorem. We prove that the intersection of Gauge Rigidity (the PSC Sieve) and Gravitational Anchoring (Relationalism) isolates a singular, necessary Reflexive Seed for reality. By bridging the abstract NEMS closure constraints with the specific Generative Triple Evolution (GTE) mechanics, we identify the Lepton Seed Triple (1, 73, 823) as the unique instantiation of the Semantic Floor. We define Unified Admissibility as the conjunction of the Semantic Floor, Quarter-Lock Rigidity, and Relational Anchoring. The Residual Seed Uniqueness Theorem (RSUC) — proved in the ugp-lean artifact — states that the residual set collapses to the Lepton Seed up to mirror equivalence and Presentation Invariance. Under RSUC and the premise bundle (P25.1)–(P25.4), any admissible foundational seed has the Lepton Seed as its canonical (MDL-minimal) representative. This concludes the suite by demonstrating that our specific laws of physics are not a contingent fit to empirical data, but the unique semantic solution for a self-contained reality. All definitions and theorems are formalized and machine-checked in ugp-lean.

Zenodo (PDF + DOI)

Paper 26 — A General Self-Reference Calculus

One fixed-point theorem and one diagonal barrier behind Gödel, Kleene, Löb, and NEMS.

Release role: exposes the reusable self-reference engine underlying multiple diagonal phenomena (stated in-paper).

Zenodo (PDF + DOI)

Paper 27 — A No-Free-Bits Calculus for Determinacy and Outsourcing

Closure audits for theories: a no-free-bits calculus measuring internal determinacy and outsourcing.

Theory-closure and audit toolkit for “no free bits”: observational semantics, world-types, selectors, parameterized internality, and audit soundness (decidable-on-world-type ⇒ invariant; contrapositive: non-invariant ⇒ not decidable on world-types). The paper distinguishes two equivalent selector presentations: quotient selectors (sections q : WType → World of the quotient map) and world-selectors (endomaps sel : World → World satisfying invariance, idempotence, class-canonicality). New (§4.3): Selector–Quotient Splitting Equivalence — proves these two notions are in canonical bijection (selectorSectionEquiv): every world-selector factors through a unique quotient selector (selector_quotient_splitting, selector_equiv_section), and every quotient selector induces a world-selector (quotientSectionToSelector, section_defines_selector_general). This identifies the exact mathematical content of the selector abstraction: a world-selector is precisely a right inverse of the world-type quotient projection. The substantive closure question is therefore not whether selectors classify world-types (they do) but whether the corresponding quotient section is internally realizable. Negative instance: The halting-framework bridge proves no computable quotient section exists under ASR and unbounded world-types (QuotientSectionBridge, halting_framework_no_computable_section). Full barrier: QuotientSectionStrength proves no computable decider exists for any nontrivial extensional predicate on the halting framework (halting_framework_no_decider_at_computable). Canonicalization, EffectiveSemantics, and BoundedCover lead to a nailed instance: under bounded cover and canonicalization, a selector exists; with DecidableEq WorldType, a total bounded-search selector is built without Choice. FintypeWorld shows finite worlds + decidable observational equivalence ⇒ selector. The A0 bridge (internal representability ⇒ SRI′) connects Closure to SelfReference so MFP-1 and the diagonal barrier apply. Zero sorrys, zero custom axioms.

Zenodo (PDF + DOI)

Paper 28 — Reflection as a Resource

Stratified representability, fixed points under restricted internalization, and a selector-strength hierarchy.

Fills the graded middle ground between Paper 26 (full repr ⇒ MFP-1) and Paper 27 (closure audits): how much internalization is enough for which fixed points. Parameterizes representability by a class R ⊆ (Code→Obj). Diagonal Closure Theorem: if R is closed under the diagonalization template, then every F∈R has a mixed fixed point p ≃ F(quote p). When R is not diagonally closed, method-level separation: e.g. R = {id} on ℕ is not diagonally closed; the diagonal construction cannot generate a fixed point via repr(G_F) because G_F ∉ R. Bridge to Closure and SelfReference. Sets up Papers 29 and 30. Lean: SRI_R, DiagClosed, restricted_master_fixed_point, not_diagClosed_identity_only, method_level_separation; zero sorrys, zero custom axioms.

Zenodo (PDF + DOI)

Paper 29 — Selector Strength and Completion Hierarchies

A poset of internal determinacy, barriers, and escape costs.

Formalizes selector strength as a preorder (selector-strength lattice) of realizability classes and proves the barrier theorem family: under anti-decider closure and a fixed-point premise (hFP) at a strength level, no total decider exists at that strength for any nontrivial extensional predicate. Reflection supplies hFP when the representability class R is diagonally closed; Closure supplies the selector-at-strength vocabulary. Monotonicity; instances: trivial “all functions” (S_all) and a template for computable-on-ℕ (parametric hFP). Maps the hierarchy to NEMS IIa/IIb. A concrete quotient-section barrier is mechanized in QuotientSectionBridge: under ASR and unbounded world-types, no computably realizable quotient section exists; the halting-framework bridge uses Mathlib's Nat.Partrec.Code with no custom axioms. Fully instantiated computable barrier (QuotientSectionStrength): on the halting framework, no computable δ decides any nontrivial extensional predicate (e.g. halts on 0); composes nems_rt_no_computable_bool_decider with Nat.Partrec.Code.fixed_point. Lean: no_total_decider_at_strength, reflection_supplies_hFP, decidableAt_mono, S_all, no_total_decider_nat, halting_framework_no_decider_at_computable; zero sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 30 — Second Incompleteness for Self-Certifying Learners

No total internal certifier exists under diagonal capability — a learning-theoretic incompleteness.

Applies the Paper 29 barrier to self-trust in learning systems: certificates, claims (guarantee predicates), and internal verifiers. Proves no total internal self-certifier exists for any nontrivial extensional claim when the strength is anti-decider closed and has the fixed-point premise (hFP); Reflection supplies hFP when R is diagonally closed (“diagonal capability”). Defines diagonal capability precisely; states the result as a “second incompleteness for self-certifying learners.” Positive result: when hFP is not supplied (Stratum 1), total internal verifiers can exist—stratified self-certification; toy claim (n=0) at S_all with explicit no-contradiction note. Minimal toy and learning-flavored sketch (hypothesis fits finite dataset). Companion note: “Why Perfect Self-Certification Is Impossible in Self-Referential Systems.” Lean: no_total_self_certifier, reflection_supplies_hFP_for_learning, ToyClaim, stratified_self_certification_toy; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 31 — Epistemic Agency Under Diagonal Constraints

Society as a verification protocol; strict separations and the necessity of role diversity.

Turns the Papers 26–30 spine into a theorem-grade theory of epistemic agency and social verification. Restates as an agency theorem: no diagonal-capable agent admits a universal total internal self-certifier for any nontrivial extensional claim (imported from Paper 30). Formalizes society as a verification protocol: a finite family of verifiers with soundness-on-coverage, aggregated by an admissible protocol that does not hallucinate where all inputs abstain. Proves strict separation: there exist societies and protocols whose certified coverage is strictly larger than that of any individual verifier. Proves necessity: homogeneous societies cannot strictly improve under admissible protocols, and role diversity (non-identical coverage sets) is necessary for strict improvement. Adds corollaries for control verification (safety, stability, bounded loss) and for stratified self-awareness and the necessity of social mirrors. Shows that if society-plus-protocol is treated as a single diagonal-capable system attempting universal total self-certification, the Paper 30 barrier reappears at the societal level (meta-barrier). Lean: EpistemicAgency library; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 32 — Self-Improvement Under Diagonal Constraints

No universal self-upgrade certifier; stratified improvement and evolution as an attractor architecture.

Formalizes self-improvement as upgrade certificates and good-predicates over agents. Proves a barrier theorem: no total internal self-upgrade certifier exists under diagonal capability (Paper 30 applied to upgrades). Proves stratified improvement (positive result when hFP is not assumed), protocol strict improvement (societies plus admissible protocols can strictly improve certified coverage), and diversity necessity (homogeneous societies cannot strictly improve). A meta-barrier shows that society-plus-protocol as a single diagonal-capable system cannot totally self-certify upgrades. Lean: no_total_upgrade_certifier, stratified_improvement_schema, protocol_strict_improvement_upgrades, diversity_necessary_upgrades, meta_barrier_self_improvement; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 33 — Self-Awareness as a Resource

Hierarchies of internal self-knowledge, selector necessity, and limits of introspective optimality.

Formalizes self-awareness as internal certification capacity over classes of self-claims. Proves three theorem families: (i) self-awareness hierarchy — strict separations (e.g. C₀ admits total certifier; C₂ does not under diagonal capability); (ii) selector necessity — when multiple observationally indistinguishable self-model fixed points exist, identifying “the actual self” requires symmetry-breaking selection, non-total-effective in diagonal-capable regimes; (iii) introspective optimality barrier — no diagonal-capable agent can totally certify nontrivial extensional “rightness of decision” in full generality; stratified positive results on restricted fragments. Lean: ClaimFamilies, SelfModel (Fix, MultipleFixedPoints), no_total_certifier_C2, selection_not_total_effective, selector_necessary_from_multiplicity, no_total_rightness_certifier, ToyHierarchy, ToyRightness; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 34 — A Sieve Engine for Theory Spaces

Proof-carrying classification and residual certification for theory spaces.

Adds a meta-methodology kernel for theory spaces: a type of candidates with optional equivalence and canonicalization, constraints as a list of predicates, a sieve as the conjunction of constraints, and a residual as the subtype of candidates satisfying the sieve. Proves monotonicity (adding constraints shrinks the residual) and residual functoriality (pullback of constraints along a map preserves sieve membership). Supports proof-carrying enumeration: external generators propose candidates plus certificates that Lean verifies. Mechanized in Lean 4 as the Sieve library with zero sorry and no custom axioms; a toy domain (small rewriting systems) illustrates the engine.

Zenodo (PDF + DOI)

Paper 35 — Oracles as External Selectors

NEMS constraints on hypercomputation and physical computability.

Constrains the physical realizability of oracles and hypercomputers in a PSC universe with stable records and diagonal capability. Delivers three headline results: (1) Oracle-as-Selector Theorem (Closure) — any oracle that decides a predicate not determined by the observational quotient is formally an external selector injecting free bits unless its provenance is internalized. (2) No Internal Hypercomputer Theorem (SelectorStrength) — in a diagonal-capable PSC universe with stable records, no total-effective internal procedure can decide halting or record-truth-like predicates; a "halting oracle machine" cannot be physically realized as an internal device. (3) Hypercomputation Taxonomy — any hypercomputer claim forces at least one escape regime (non–diagonal-capable fragment, unstable records, non-extensional predicate, non-total or non-effective selection, or PSC violation). The taxonomy serves as an audit tool for exotic proposals (CTCs, Malament–Hogarth spacetimes, black-hole decoders). Papers 36 (Arrow of Time), 37 (Chronology Under Closure), and 38 (Black Hole Information) apply this machinery.

Zenodo (PDF + DOI)

Paper 36 — The Arrow of Time from Closure

Stable records, no-overwrite, and the necessity of irreversibility in PSC universes.

Proves that stable records force an arrow of time at the level of semantics. Defines record filtration (Visible at time t), stage world-types, and forgetful maps. Proves: (1) Arrow as refinement — monotone record growth ⇒ later stages refine earlier; strict growth ⇒ forget not injective. (2) No-overwrite — dynamics that flips a stable record at stage t forces non-categoricity at t. (3) Irreversibility — no stage-preserving involution can undo refinement without overwrite or selection. (4) Selection barrier for retrodiction — under diagonal capability, selecting among consistent pasts cannot be total-effective internally. Papers 37 (chronology) and 38 (black holes) appear as corollaries. Mechanized in Lean 4 as ArrowOfTime (RecordFiltration, Refinement, strict_refinement, no_overwrite_implies_not_categorical, no_global_reversal, selection_barrier_retrodiction, Toy); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 37 — Chronology Under Closure

NEMS constraints on admissible time travel.

Applies NEMS/Closure and the hypercomputation taxonomy (Paper 35) to admissible time travel. Models evolution as a feedback operator on histories; self-consistent loops = fixed points modulo observational equivalence (Deutsch/Novikov). Proves: (1) Record non-overwrite theorem — overwriting stable records forces non-categoricity (branching); selection required; internal selection constrained by barrier. (2) Selection barrier for chronology — under diagonal capability, selecting among consistent loops cannot be total-effective internally (Paper 29 barrier). (3) Taxonomy: contradiction vs fixed-point vs branching; only closure-compliant options admissible. Mechanized in Lean 4 as ChronologyUnderClosure (record_non_overwrite, selection_barrier_chronology); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 38 — NEMS Constraints on Black Hole Information

Applies PSC and diagonal-capability constraints to the black hole information problem.

Applies NEMS/Closure and the hypercomputation taxonomy (Paper 35) to black hole information. PSC forbids information "lost outside" or true destruction without internal closure. Proves: (1) Record consistency (abstract) — erasing appearance ⇒ not categorical (selection required); a selector exists classically (Choice); internal/effective selector constrained by barriers. (2) No hypercomputing from black holes — no internal total-effective BH decoder for diagonal-capable predicates. Observer-relative records (complementarity) and islands/Page curve interpreted as closure-driven reassignment. Mechanized in Lean 4 as BlackHoles (record_consistency_abstract, no_hypercomputing_from_bh); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 39 — Probability as Closure in General Probabilistic Theories

Uniqueness and rigidity of state assignment from auditability principles.

Proves that under closure-style constraints (context-independence of effects, additivity, normalization), probability assignments in general probabilistic theories (GPTs) are not free but forced: any assignment satisfying these principles corresponds to a unique affine state functional on effects; if effects span the space, this extends uniquely to a linear functional. States are determined by agreement on all effects (extensionality) and on a spanning set. The quantum Born rule is the instance for matrix-ordered spaces. A dedicated bridge module (GPTClosure/Instances/QuantumFinite.lean) connects Paper 13's quantum formalization (NemS.Quantum) with the GPT framework, showing that finite-dimensional quantum probability is an instance of closure-forced probability: the PSD cone defines an ordered unit space, the Born rule equals the GPT state-effect pairing (born_rule_is_gpt_prob), and POVMs map to GPT measurements (povmToMeasurement); state uniqueness follows from the GPT uniqueness theorem (quantum_state_uniqueness). Mechanized in Lean 4 as GPTClosure (ordered unit space, effects, states, measurements, state_ext_effect_span, uniqueness_under_spanning, closure_implies_state, Toy, QuantumFinite); 3 documented sorrys in QuantumFinite (PSD cone pointedness, Born-rule nonnegativity, wiring to busch_gleason_unique), 0 sorry in all other GPTClosure modules, no custom axioms.

Zenodo (PDF + DOI)

Paper 40 — Institutions Under Diagonal Constraints

Minimal role sets, robust audit protocols, and the impossibility of universal self-governance.

Scales the diagonal/self-trust barrier to institutions: protocolized governance with roles, threat models, and minimality. Proves: (1) No universal final judge — under anti-decider closure and hFP, no institution can be total+sound+complete on nontrivial claim families. (2) k-role lower bound — under a k-way partition and role-type constraint, any protocol achieving full certified coverage needs at least k roles. (3) Diversity necessity — strict robustness improvement under admissible protocols implies at least two non-equivalent roles (generalizing Paper 31). (4) Meta-barrier — the institution cannot universally self-certify if diagonal-capable. Defines institutions as verification protocols with roles, coverage sets, and admissibility (no hallucination). Mechanized in Lean 4 as InstitutionalEpistemics (no_universal_final_judge, k_role_lower_bound, diversity_necessity, meta-barrier, ToyRegulation); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 41 — Refinement Flow of World-Types

Time as growth of stable distinguishability.

Reframes Paper 36's record filtration and stage world-types as a refinement flow: time as growth of stable distinguishability. Extends ArrowOfTime with iterated forget maps (forgetFromTo from any later stage t′ down to any earlier t), proves coherence (forgetFromTo sends quotient at t′ to quotient at t) and naturality (composition of forgets along a chain equals forget over the interval). Toy witness: two-bit world with strict growth at t=0. Mechanized in Lean 4 as RefinementFlow (forgetFromTo, forgetFromTo_coherent, forgetFromTo_naturality, ToyBits); 0 sorry, no custom axioms. Builds on ArrowOfTime (Paper 36).

Zenodo (PDF + DOI)

Paper 42 — Record Entropy and Noncomputability

Monotone semantic complexity under diagonal capability.

Defines record entropy H(t) as the cardinality of stage world-types at time t—a semantic measure of record complexity. Proves monotonicity (H(t+1) ≥ H(t)) from surjectivity of the forget map and strict monotonicity when refinement is strict. Establishes a uniform entropy decision barrier: the predicate T(c) := (EntropyOfCode(c) = n(c)) on codes (encoding filtration, t, n) is extensional and nontrivial; under anti-decider closure and fixed-point premise, no total-effective decider exists for T over encoded instances. Toy witness: two-bit filtration with H(0)=2, H(1)=4; monotone, strict at t=0. Mechanized in Lean 4 as RecordEntropy (recordEntropy, recordEntropy_monotone, recordEntropy_strict, UniformEntropyBarrier: EntropyCode, entropyOfCode, uniformEntropyClaim, no_total_decider_uniform_entropy, ToyEntropy); 0 sorry, no custom axioms. Builds on ArrowOfTime (Paper 36), RefinementFlow (Paper 41), SelectorStrength (Paper 29).

Zenodo (PDF + DOI)

Paper 43 — Adjudication as Decoding: Semantic Error-Correction under PSC Closure

The universe as a semantic error-correcting code; adjudication as decoding.

Reinterprets internal adjudication (the IIb/PT layer) as decoding and repair of semantic inconsistency in distributed records. Formalizes record fragments as codeword-like constraints and a uniform decoder-claim predicate on encoded instances. Under the SelectorStrength barrier schema (Paper 29), no total-effective decider exists for this predicate over encoded instances when anti-decider closure and a fixed-point premise hold. Stratified decoding is possible; societies improve decoding coverage, and role diversity is necessary for strict improvement (Paper 40). A minimal toy witnesses multiplicity of decoders and the effective constraint. Builds on RecordEntropy (Paper 42), InstitutionalEpistemics (Paper 40), SelectorStrength (Paper 29).

Zenodo (PDF + DOI)

Paper 44 — Calibration as Closure

Laws as compression fixed points under no-free-bits; the calibration principle.

Formalizes "laws" as stable fixed points of an internal law-update operator driven by closure constraints, keeping minimality abstract (no MDL commitment). Multiplicity of fixed points implies a selection problem. Under the SelectorStrength barrier schema (Paper 29), no total-effective decider exists for the uniform law-selector claim over an encoded family of law-update instances when anti-decider closure and a fixed-point premise hold on the code domain. Stratified law selection on restricted fragments remains possible. A minimal toy witnesses multiplicity and the effective constraint. Builds on No-Free-Bits (Paper 27), SelectorStrength (Paper 29), ErrorCorrecting (Paper 43).

Zenodo (PDF + DOI)

Paper 45 — Local Dynamics, Global Semantics: A Closure Engine for Semantic Nonlocality

A closure engine for semantic nonlocality from local dynamics.

Adopts a strong locality axiom at the Holds level: factorization — global satisfaction of observational propositions is the conjunction over fragments of a local predicate applied to the restricted world. This is algebraic, not geometric; no spacetime structure is assumed. Under factorization, same local views (same restriction at every fragment) imply observational equivalence; hence world-type is determined by the global map from fragments to local views. Interpretation: local dynamics alone do not guarantee local semantic closure; semantics is glued globally. Establishes the formal engine that Paper 46 then uses to derive effective nonlocality. Builds on world-type machinery (Papers 33, 41, 42).

Zenodo (PDF + DOI)

Paper 46 — Causal Nonlocality from Closure

A no-go for naive semantic locality under PSC and diagonal capability.

Under PSC-style closure, stable records, and diagonal capability (Papers 27, 29), proves that one cannot simultaneously hold a strong factorization locality axiom (Paper 45) and local semantic determinacy — the condition that world-type is computed from local views in a total-effective way. Proves a no-go: any such procedure would decide an extensional nontrivial predicate on a diagonal-capable domain and thus contradict the selector-strength barrier. So total-effective local semantic determinacy must fail (factorization can hold). This is semantic nonlocality in the effective sense, without implying superluminal signalling. Builds on SemanticNonlocality (Paper 45), FTLConstraints (Paper 47), SelectorStrength (Paper 29).

Zenodo (PDF + DOI)

Paper 47 — No Spooky-to-Signal Compiler

EPR correlations cannot be total-effectively upgraded to FTL signaling.

Proves a theorem-grade constraint on FTL: no total-effective internal procedure can implement a total-effective signalling extractor (a decider for a nontrivial extensional predicate of the globally glued semantics) without amounting to an internal oracle or selector. Defines a spooky-to-signal compiler for predicate T as a total decider for T (not merely correlated); the Paper 29 barrier yields that no such compiler exists. So EPR-style correlations cannot be total-effectively upgraded to controllable signalling—a NEMS-native reframing of "why EPR ≠ FTL." Mechanized in Lean 4 as FTLConstraints (SpookyToSignalCompiler, no_spooky_to_signal_compiler, ToyEPR); 0 axioms.

Zenodo (PDF + DOI)

Paper 48 — Holography Under Closure

World-type duality, no-free-bits reconstruction, and limits of boundary decoding.

Formalizes holography as a closure-preserving interpretation between bulk and boundary observational semantics (Paper 27: worldMap, obsMap, satisfaction preservation). Proves: (1) World-type holography (T48.1): boundary can determine bulk up to observational equivalence via a surjective world-type map. (2) No-free-bits reconstruction (T48.2): deciding a non-invariant bulk predicate from boundary world-types violates audit soundness; extra decoding bits are selectors unless internalized. (3) No total-effective boundary decoder (T48.3): an internal total-effective reconstruction that decides a nontrivial extensional bulk predicate on a diagonal-capable fragment would violate the Paper 29 barrier. (4) Taxonomy (T48.4): any holography claim lands in H0–H4. Mechanized in Lean 4 as HolographyUnderClosure; 0 axioms.

Zenodo (PDF + DOI)

Paper 49 — Cosmic Audit: Universe as a Self-Auditing Institution

Distributed adjudication networks forced by record closure.

Universe as a self-auditing institution: forced distributed adjudication (T49.1) and diversity necessity for strict improvement (T49.2). CosmicAudit lives inside InstitutionalEpistemics; uses Role and protocol aggregation. Mechanized in Lean 4; 1 sorry in Examples.ToyCosmic.

Zenodo (PDF + DOI)

Paper 50 — A Complete Logic of Certification

Soundness, completeness, and maximality for stratified verification protocols.

Stratified certification calculus with nontrivial semantics (CertifiableAt = coverage sense). Proof system ⊢_S mirrors protocol combinators. T50.1 Soundness: every derivation yields a protocol witness. T50.2 Completeness: every protocol witness normalizes to a derivation (normal-form theorem, protocolCoverage_subset_union_atoms). T50.3 Maximality: any extension yielding a total decider for an extensional nontrivial predicate on a diagonal-capable domain contradicts the Paper 29 barrier. Toys: Fin 4 (toy_equiv), Nat boundary (toy_boundary, parametric in hFP). Build: full lake build from nems-lean root. 0 axioms.

Zenodo (PDF + DOI)

Paper 51 — Necessary Incompleteness of Internal Semantic Self-Description

The non-self-erasure theorem and semantic remainder in reflexive systems.

Defines a self-semantic frame: a family of internally encoded claims whose truth is the realized semantic truth of the system itself. Proves the flagship theorem: no sufficiently expressive diagonally capable realized system can internally contain a final theory (internal, total, and exact) of its own realized semantics. Rules out internal semantic self-exhaustion. Introduces weak self-erasure (final self-theory whose verdict behavior lies inside the self-semantic claim family) and strong self-erasure (exact internal semantic image closed under self-application); both ruled out as corollaries. Proves the positive master statement: every internal self-theory either fails totality or leaves an irreducible semantic remainder. Yields the general non-self-erasure principle: reflexive closure does not collapse a system into pointlike self-identity. Physical corollary: no final internal GUT. Mechanized in Lean 4 as SemanticSelfDescription; 0 sorry, no custom axioms. Builds on SelectorStrength (Paper 29), Reflection (Paper 28), SelfReference (Paper 26). Cross-reference (§F): quotient-section realizability (Paper 27 / Paper 78) is a structurally parallel obstruction—no total-effective quotient section under diagonal capability (QuotientSectionBridge.halting_framework_no_computable_section). The concrete halting-framework instance: no computable decider for any nontrivial extensional predicate (e.g. halts-on-zero) on the halting framework (QuotientSectionStrength.halting_framework_no_decider_at_computable). Downstream: Paper 72 (Constraint Theory of Autonomous Agency) imports NoFinalSelfTheory and discharges mirror non-exhaustion as a theorem.

Zenodo (PDF + DOI)

Paper 52 — Direct Self-Semantic Fixed Points

Intrinsic diagonal claims against final internal self-theories.

Upgrades Paper 51 from reduction-to-barrier into an intrinsic theorem: constructs the contradiction directly inside the self-semantic framework. Introduces semantic negation on claims, a self-reference frame for code-level fixed points, and anti-verdict claims. Proves that under these hypotheses there exists a fixed-point code \(d\) such that \(\Decode(d)\) is semantically equivalent to the anti-yes claim for \(T\) on \(d\); a putative final self-theory yields contradiction in every branch. Derives direct no-weak-self-erasure and no-strong-self-erasure corollaries. Mechanized in Lean 4 as SemanticSelfReference; bridges back to Paper 26.

Zenodo (PDF + DOI)

Paper 53 — Syntax Cannot Exhaust Semantics

A no-reduction theorem for reflexive systems.

Proves that no purely syntactic internal structure can be total and exact for realized semantic truth in a diagonally capable reflexive system. Defines syntactic theory-objects, semantic adequacy, and semantic exhaustiveness; proves that syntactic semantic exhaustion would induce a final self-theory and thus yield contradiction. Includes comparison with Tarski-style truth undefinability. Mechanized in Lean 4 as SyntaxSemantics.

Zenodo (PDF + DOI)

Paper 54 — Observers, Minds, and Reflexive Non-Self-Exhaustion

An observer corollary of the no-final-self-theory theorem.

Proves that no reflexive observer can internally exhaust itself as a complete semantic object. An observer that could do so would possess a final internal self-theory; by Papers 51–52, no such theory exists. Blocks only total self-exhaustion; stratified observer models and mirror-improved coverage remain available. Observerhood requires semantic remainder, external mirror, or selector structure under diagonal capability.

Zenodo (PDF + DOI)

Paper 55 — Qualia and the Semantic Ledger

A formal dissolution of the hard problem of consciousness.

Proves that any qualitative content known by a subject must be represented in the semantic ledger; once represented, it cannot be reduced to purely syntactic content (Paper 53). Hence any viable account of qualia must treat them as irreducible semantic ledger content. The traditional hard problem, construed as demanding syntax alone to generate qualia from outside the ledger, is category-mistaken. Mechanized in Lean 4 as QualiaLedger; depends on SyntaxSemantics and SemanticSelfReference.

Zenodo (PDF + DOI)

Paper 56 — The Reflexive Closure Theorem

Closure without collapse in reflexive systems.

Unifies Papers 51–55 into the Reflexive Closure Theorem: a nontrivial reflexive system may close over itself, but cannot coincide with its own complete internal semantic image. Closure is possible (self-return, partial self-articulation, semantic remainder); collapse is impossible (no total self-exhaustion, no self-coincidence). Defines self-coincidence and irreducible reflexive distance. Mechanized in Lean 4 as ReflexiveClosure; depends on SemanticSelfReference, SyntaxSemantics, QualiaLedger.

Zenodo (PDF + DOI)

Paper 57 — The Reflexive Unfolding Theorem

Frontier generation and why there is change.

Turns the static summit (Paper 56) into a dynamic theorem: every achieved closure generates new semantic frontier, so reflexive unfolding cannot halt. Proves no terminal reflexive completion under diagonal capability. Cosmological corollaries: no null origin, no null terminus, no external null boundary. Bridges to RefinementFlow (Paper 41) and RecordEntropy (Paper 42).

Zenodo (PDF + DOI)

Paper 58 — Necessary Reflexive Intelligence

Why nontrivial reflexive worlds are not random or robotic.

Proves that nontrivial reflexive worlds are neither dead mechanism nor brute randomness, but necessarily adjudicative: lawful non-algorithmic selection. Under frontier-sensitive self-model-bearing closure, such worlds exhibit minimal reflexive intelligence in a structural sense. Bridges to nems-lean NemS.Adjudication (Papers 15, 19, 22).

Zenodo (PDF + DOI)

Paper 59 — A Calculus of Intelligence

Frontier, adjudication, and self-modeling in reflexive systems.

Provides a formal calculus of intelligence: intelligence levels coincide with the chooser hierarchy; without frontier, there is no nontrivial intelligence; frontier-bearing reflexive systems admit precise intelligence levels; distributed diversity strictly amplifies certified intelligence coverage. Proves terminal reflexive completion implies no minimal reflexive intelligence. Bridges to Paper 31 (EpistemicAgency).

Zenodo (PDF + DOI)

Paper 60 — Reality as Recursive Intelligence

The final theorem of reflexive closure, frontier, and adjudication.

Unifies Papers 56–59 into one master theorem: a nontrivial reflexive reality cannot close as static self-identity; it persists as recursive frontier-generation through lawful internal adjudication, and is therefore recursively intelligent in a structural sense. Defines nontrivial reflexive reality and recursive intelligence; proves the final theorem of reflexive reality.

Zenodo (PDF + DOI)

Paper 61 — Ghost Collapse and Ledger Finality

Why off-ledger being is either illicit or null.

Proves that any purported off-ledger entity is either determinacy-relevant (hence illicit under no-free-bits, Paper 27) or semantically inert (hence theory-null). No viable ontology of real-but-off-ledger ghost entities survives. Bridges to Paper 27 (no-free-bits) and Paper 55 (QualiaLedger).

Zenodo (PDF + DOI)

Paper 62 — No Self-Actualizing Ledger

Syntax, semantics, and same-level completion cannot ground reality.

Proves that no articulated ledger can be the full sufficient ontological ground of its own actuality. Syntax cannot ground it (Paper 53). Object-level semantics cannot ground it (circular). Equal-status external completion cannot ground it (Paper 23). Self-actualizing ledger cannot ground it (circular). Corollary: grounding squeeze—any adequate ground must be of a different category.

Zenodo (PDF + DOI)

Paper 63 — The Alpha Theorem

The necessary ontological ground beyond syntax and semantics.

Proves that if nontrivial reflexive reality exists, then there must exist a necessary pre-categorial ontological ground of its actuality. We call this ground Alpha. Derives ground existence from no-free-bits (Papers 27, 61) and the grounding squeeze of Papers 61–62. 0 sorry, 0 axioms in Alpha.

Zenodo (PDF + DOI)

Paper 64 — Primordial Ground and Grounded Existence

Whatever exists is Alpha-grounded; Alpha is the unique pre-categorial ontological ground.

Unfolds consequences of the Alpha theorem: whatever exists is Alpha-grounded, and Alpha is characterized structurally—not grounded by same-level other, not object-level, not temporalized, primordial, not null, and not mere infinity. Formal theory of grounded existence.

Zenodo (PDF + DOI)

Paper 65 — Qualia as Alpha-Grounded Semantic Content

Known qualia are irreducible semantic content whose actuality is Alpha-grounded.

Proves the safe theorem (Layer A): known qualia are irreducible semantic content whose actuality is Alpha-grounded. Composes Papers 53 (syntax cannot exhaust semantics), 55 (qualia on-ledger), 63 (Alpha exists), 64 (whatever exists is Alpha-grounded). The stronger manifestation thesis (Layer B) is reserved for the next arc and is bridge-dependent. 0 sorry, no bridge axiom.

Zenodo (PDF + DOI)

Paper 66 — Phenomenal Presence and Ground-Manifestation

From Alpha-grounded qualia to the manifestation theorem.

Proves that known qualia are Alpha-manifestations: phenomenal presence and ground-mode bridge known qualia to Alpha. Defines phenomenal presence independently of ground-mode; proves that phenomenally present, irreducible, Alpha-grounded content is in ground-mode; defines Alpha-manifestation as ground-mode with phenomenal presence. Proves the non-collapse theorem: there exist Alpha-grounded entities that are not Alpha-manifestations. Depends on Papers 53, 55, 63, 64, 65.

Zenodo (PDF + DOI)

Paper 67 — Awareness as the Locus of Ground-Presence

Why conscious presence is not an object in the world.

Defines awareness as the locus at which Alpha-grounded reality is present as experience. Proves that Alpha-manifestation implies presence at an awareness-locus; establishes existence of an awareness-locus that is a locus of Alpha-presence. Proves that awareness-locus is not object-level content. Derives self-illumination of realized awareness from the awareness structure (via Paper 33). Depends on Papers 66, 33.

Zenodo (PDF + DOI)

Paper 68 — Alpha Is Not Null

Ground, presence, and the refutation of nihilistic emptiness.

Refinement and anti-misreading theorem: separates ObjectEmpty, Null, SemanticallySterile, and Inert as distinct predicates. Proves Alpha is object-empty but not null, not sterile, and not inert. Blocks the nihilistic interpretation of Alpha as sheer absence, the passive-backdrop reading, and the sterility attack. Does not contradict Paper 64; disambiguates and strengthens. Depends on Papers 64, 66, 67.

Zenodo (PDF + DOI)

Paper 69 — Reality, Existence, and Awareness

The unified theorem of ground, articulation, and manifestation.

Unifies ground, articulation, and manifestation-in-awareness as three coordinated aspects of one structured ontological fact. Proves reality is Alpha-grounded (69.1), world-process is Alpha-grounded recursive articulation (69.2), qualia and awareness are Alpha-grounded manifestation-in-awareness (69.3), and three-aspect coordination (69.4). The synthesis recapitulates Paper 56's minimal ternary closure form at the ontological level (69.T). Depends on Papers 60, 64, 66, 67, 68; structurally integrates Paper 56.

Zenodo (PDF + DOI)

Paper 70 — The Golden Bridge

The final unification of ground, being, and awareness.

Crown paper: states the final integrated theorem and explicitly dissolves the false dilemmas—hard problem, object-search for consciousness, Alpha as nihilistic nullity, syntax-only exhaustivism, world/awareness alienation. Ground, Articulation, and Manifestation-in-Awareness are coordinated irreducible aspects of one primordial ontological fact. Imports Theorem 69.4 as the final statement; no new machinery. The final triad is the mature ontological recurrence of Paper 56's minimal ternary closure form. Includes the self-illumination culmination: in realized awareness, Alpha-presence is self-illuminating without becoming dualistically split.

Zenodo (PDF + DOI)

Paper 71 — Viable Continuation Under Constraint

A general theory of stability, pathology, and collapse across reflexive systems.

Introduces and proves a general theorem framework for systems whose persistence depends on reconciling local transitions with whole-system viability. Defines an abstract ontology of record-bearing constrained systems, a relational measure layer, and a theorem spine in three levels: foothill theorems (local defects defeat system-level robustness), ridge theorems (four principal routes to failure: proxy drift, local-global pathology, correlated failure, constraint deficit), and a summit abstraction, BoundaryDefect, with a theorem pair establishing a general viability boundary. Nine domain bridges (AGI, law, biology, civilization, war, pluralism, ecology, science, physical regimes) are instantiated in both markdown and Lean schemas; FrontierPrinciples (Phase VII+) maps the frontier canon to defect witnesses. Appendices A–C provide theorem-ascent overview, bridge schema mappings, and canonical principles. The abstract theorem family is fully proved in Lean (zero sorry); nine Lean bridge schemas plus FrontierPrinciples each prove LocalGlobalDecoupled.

Zenodo (PDF + DOI)

Paper 72 — Structural Principles of Stability, Pathology, and Collapse

Canonical principles of viable continuation across reflexive systems.

Companion to Paper 71. Paper 72 collects canonical principles of viable continuation across reflexive systems into a structured canon organized by domain: AGI, civilization, pluralism, war, science, biology, ecology, markets. Each principle is formalized in the principle environment, cited with formal anchors, and mapped to defect witnesses in the Lean artifact via FrontierPrinciples.lean. The paper provides the human-readable interface to the frontier canon; the Lean bridge supplies machine-checked LocalGlobalDecoupled and common-mode failure proofs per principle. See FRONTIER_BRIDGE_TARGET_LEDGER.md for the full ledger.

Zenodo (PDF + DOI)

Paper 73 — The Constraint Theory of Autonomous Agency

Self-indexing manifolds and the boundaries of unified systems.

Formalizes the Self-Indexing Adjudicative Manifold (SIAM) as a bounded dynamical regime in phase space—a specialized unified-agent regime inside the proved closure/selection/diagonal framework. Defines O-SIAM via seven structural invariants with witness-carrying structures, timescales, Master Bottleneck, openness band, and topology on ReconciliationSimplex. All load-bearing theorems proved: summit (osiam_collapse_at_boundary), mirror non-exhaustion (from Paper 51), burden–VC capacity, ridge pathology mapping, separation (feedforward_not_OSIAM, stateful_not_OSIAM, robust_SIAM_implies_unified; non-vacuous definitions). Maps SIAM pathologies to Paper 71 defects via explicit embedding ι and toVCDefectProfile. DSAC validation via sentience-compute (10 scenarios, TDA reconciliation/unity modes, burden decomposition, ablations, non-examples). P-SIAM (phenomenological extension) demoted to appendix.

Zenodo (PDF + DOI)

Paper 74 — The Formal Structure of Phenomenology

Qualia, manifestation, and selector-access regimes.

Develops the formal phenomenology layer extending the operational boundary theory of Paper 73 (O-SIAM). Introduces a six-part ontology, distinguishes primitive from induced structure, and defines matter, mind, qualia, self, and common world as regime-cuts. Proves anti-collapse theorems (articulation insufficient, manifestation not reducible, locus irreducible; off-ledger strategies illicit or semantically null under bridge premises). Formalizes ownership, typed manifestation, locus-dependence, selector-access regimes, and bounded restriction-relaxation. Proves coherence theorems and a unified explanatory schema: one machinery explains private manifestation, owned content, self-presence, structured qualia, and selector-access differences. Physics coupling is out of scope. Appendix A: Claim Typing and Flagship Theorem Spine Audit.

Zenodo (PDF + DOI)

Paper 75 — The Uniqueness of the Phenomenology Framework

Uniqueness, categoricity, and survivor selection for closure-compatible phenomenology.

Develops the uniqueness program for the formal phenomenology framework. Defines admissible theory-space 𝔗, stratification (ground sieve, among-survivors, reconstruction), theory-equivalence ∼. Proves elimination over rival classes; reconstructs six-part structure from admissibility; proves the Paper 74 framework is uniquely selected survivor up to ∼. Machine-checked in phenomenology-lean (Phenomenology.Meta, Admissibility, SelfRisk, Paper74Audit).

Zenodo (PDF + DOI)

Paper 76 — A Formal Theory of Transputation

Closure, internal adjudication, and non-algorithmic continuation selection.

Defines transputation as the internal adjudicative layer forced under closure and record-divergent choice in diagonal-capable frameworks. Establishes that ordinary total-effective computation is insufficient for continuation-selection; an internal adjudicator is required. Proves the forcing theorem (closure + choice ⇒ internal adjudicator), the diagonal barrier (record-truth not computably decidable), and the no-collapse theorem (adjudicator not replaceable by total-effective decider). Provides realization criteria (Section 8) for implementations. All flagship theorems machine-checked. Companion Paper 77 presents DSAC as a candidate realization family.

Zenodo (PDF + DOI)

Paper 77 — DSAC as a Realization of Transputation

A candidate architecture for internal adjudication under closure.

Presents DSAC (Delta Self-Adjudicative Computation) as a candidate realization family for transputation. Maps the Δ-machine architecture (continuous lattice, reflexive constraint graph, scenario-driven execution) to Paper 76's realization criteria. Distinguishes operational vs. formal closure; explains why DSAC is not merely a heuristic optimizer. Validation evidence from SAT, Max-SAT, constraint discovery, metric closure, and TSP. Supported by abstract interface-level formalization: dsac_witness_instantiates_realization, operationally_closed_implies_non_externalized, dsac_step_deterministic, witness_transport, scenario-class fit theorems. DSAC is not the definition of transputation; it demonstrates that the abstract class admits concrete implementation.

Zenodo (PDF + DOI)

Paper 78 — Second-Law Grounding from Closure

Record refinement, hidden history, and the structural preconditions of thermodynamic irreversibility.

Develops the second-law grounding arc of the NEMS program: identifies record-theoretic asymmetries forced by closure-compatible refinement and proves monotonicity theorems in Lean. Track 1: record-resolution monotonicity (observational equivalence classes cannot decrease under refinement). Track 2: hidden-history fiber monotonicity (fiber size over later visible class cannot exceed earlier fiber under forgetful map). Structural irreversibility is already in ArrowOfTime; this paper connects record-resolution and hidden-history monotonicity to the unified closure architecture. Thermodynamic interpretation remains conceptually supported but not fully reduced.

Zenodo (PDF + DOI)

Paper 79 — Foundational Admissibility

Closure as a selection principle on cosmological possibility space.

Proves that closure compatibility and foundational viability are equivalent: \(\FndViable(U) \Leftrightarrow \ClosureCompat(U)\). Defines \(\FndViable(U)\) as conjunction of closure-admissible initiality, structural irreversibility, and closure-realized history; \(\ClosureCompat(U)\) as nonemptiness of the cosmological closure schema. Proved by foundational_admissibility and foundationally_viable_implies_closure_compatible. Establishes closure compatibility as the first selection sieve on cosmological possibility space. Defines survivor compatibility, probabilistic admissibility, and physics-architecture admissibility as post-admissibility cascade stages.

Zenodo (PDF + DOI)

Paper 80 — The Classification Cascade for Foundational Universes

Survivor selection from closure to physics architecture.

Formalizes the next arrows in the classification cascade with structure-tied predicates: survivor compatibility \(\Rightarrow\) probabilistic admissibility \(\Rightarrow\) physics-architecture admissibility. Defines \(\CascadeCompat(U)\) and \(\NarrowSurvivor(U)\); proves survivor-compatible frameworks with nonvacuous worlds land in the narrow survivor class. Main theorems: ClosureForcedProbabilityStructure, ClosureCalibratedLawStructure, survivor_filter_narrows_class, survivor_compatible_implies_cascade_compatible. Does not yet yield final narrow-survivor or near-categoricity theorem.

Zenodo (PDF + DOI)

Paper 81 — Big Results from the NEMS Program

Flagship theorems across nine thematic arcs: logic, physics, quantum mechanics, computation, epistemology, ontology, and reflective certification. Updated April 2026.

Synthesis paper stating flagship results of the NEMS program across nine thematic arcs (updated April 2026): (I) Logic and Mathematics—including the Closure Without Exhaustion two-route summit (Paper 91) and the Internality/Outsourcing Schema (Papers 82–83); (II) Cosmology and Spacetime—physical incompleteness, semantic floor, foundational finality, closure arrow of time, second-law grounding (now Earned, Paper 78), grand unification, foundational admissibility, classification cascade with Survivor Calculus backbone (Paper 84), quotient-section realizability, semantic terminality, quantum gravity, chronology, black holes, holography; (III) Gauge Theory and Standard Model; (IV) Quantum Mechanics and Probability; (V) Computation and Realizability; (VI) Epistemology and Agency; (VII) Ontology and Consciousness; (VIII) Applied Boundary Theory—including Admissible Continuation (Paper 85); (IX) Reflective Certification and Non-Exhaustion—canonical certification, enriched realization, reflective non-exhaustion summit, and external validation (Infinity Compression program, infinity-compression-lean). All arcs now Earned. Foundational Admissibility (79), Classification Cascade (80), and Survivor Calculus (84) close the cosmological loop; Closure Without Exhaustion (91) closes the self-theory arc. Zenodo: 10.5281/zenodo.19429891 (concept DOI, always latest).

Zenodo (PDF + DOI)

Paper 82 — Meta-Principles of Closure, Admissibility, and Internal Burden

Determinacy without outsourcing: the meta-principles governing the NEMS program.

Typed synthesis paper extracting ten meta-principles from the NEMS theorem spine, with explicit claim-typing (theorem-extracted, schema-level, interpretive) and named formal anchors for eight of the ten. Central thesis: load-bearing determinacy cannot be illicitly outsourced. The ten meta-principles are: (1) No Free Determinacy — InternalitySchema.outsourcing_barrier; (2) Fundamentality as Internal Completion — Foundationality.foundational_iff_internal_completion (new: Foundational ↔ ObsCategorical ∨ ∃ internal selector); (3) Internalization Does Not Mean Totalization — InternalizationNotTotalization.internalization_not_totalization (new: under barrier premises, total exhaustive internal completion fails); (4) Forced Adjudication — ForcedAdjudication.forced_adjudicative_role; (5) Structural Incompleteness — StructuralNonExhaustibility.no_total_exhaustion_of; (6) Hypercomputation as Premise Audit — Hypercomputation.internal_hypercomputer_claim_forces_premise_failure; (7) Closure-Compatible Continuation — AdmissibleContinuation.closure_compatible_continuation; (8) Foundational Survivorship — SurvivorCalculus.residual_inclusion; (9) Distributed Burden Requires Structured Diversity — EpistemicAgency.diversity_necessary; (10) Reality as Closure-Constrained Burden-Bearing (interpretive). Includes a summary table mapping all ten principles to status and primary formal anchor. Does not itself present new foundational theorem developments; organizes and interprets what the suite jointly expresses, and notes subsequent abstract formalizations of the extracted meta-principles. Companion to Paper 81 (theorem survey).

Zenodo (PDF + DOI)

Paper 83 — The Internality / Outsourcing Schema

A general Lean theory of load-bearing tasks.

Formalizes the core structural pattern underlying many NEMS results as an abstract reusable schema. Introduces the SystemTaskInterface (types: System, Task, Structure; predicates: LoadBearing, InternallyRealizable, CompletedBy, InternalTo; bridge axiom: completion by internal structure implies internal realizability) and proves the Generic Outsourcing Barrier: if a task is load-bearing and not internally realizable, any completion witness is non-internal. Proves the Outsourcing Witness corollary. Instantiates the schema for the NEMS framework, recovering the trichotomy (categorical / internal selector / needs external selection) as a corollary (nems_recovery). Formalizes Fundamentality as Internal Completion (Meta-Principle 2 of Paper 82): a framework is foundational iff it is observationally categorical or has an admissible internal selector (foundational_iff_internal_completion). Sketches three application instances: no-free-bits (Paper 27), oracle-as-selector (Paper 35), and forced adjudication (Paper 8). Companion formalization paper for Paper 82.

Zenodo (PDF + DOI)

Paper 84 — The Survivor Calculus

A generic admissibility cascade for theory spaces.

Formalizes the admissibility cascade underlying the NEMS cosmological program as a generic abstract framework. Defines a Cascade as a list of constraints on a base space and residual classes $R_k$ as the sets satisfying the first $k$ constraints. Proves the Monotone Cascade Theorem: $R_{k+1} \subseteq R_k$ (via List.take_isPrefix_take and Sieve.residual_mono). Instantiates the cascade for the cosmological application: four stages (closure compatibility, survivor compatibility, probabilistic admissibility, physics-architecture admissibility) yielding a descending chain of viable framework classes. Explains the relation to the Sieve library (Paper 34) and provides a bridge scaffold to NemS.Cosmology.FoundationalAdmissibility (Papers 79–80). Packages the filtering structure of Papers 79–80 into a reusable abstract theory. Companion formalization paper for Papers 79–80 and Meta-Principle 8 of Paper 82.

Zenodo (PDF + DOI)

Paper 85 — Admissible Continuation

Closure-compatible burden-bearing constraints on system evolution.

Formalizes the bridge between closure-compatible determinacy and admissible continuation. Introduces the ContinuationSystem structure (State, Record, Time, holds, update, record-preservation axiom: updates cannot destroy records that already hold). Defines ClosureCompatible and BurdenBearing as abstract predicates and AdmissibleContinuation as their conjunction. Proves the Closure-Compatible Continuation Theorem: ClosureCompatible ∧ BurdenBearing ⇒ AdmissibleContinuation. Interprets the result: the same conditions that constrain static determinacy also determine whether continuation is admissible; systems failing either condition do not have admissible continuation. Connects to the viable-continuation program (Papers 71–72), the ArrowOfTime library (Paper 36), and Meta-Principle 7 of Paper 82 (closure and continuation are coupled). Companion formalization paper for Meta-Principle 7 of Paper 82.

Zenodo (PDF + DOI)

Paper 86 — Reflexive Reality: A Philosophical Exposition

What the NEMS research program tells us about the deepest questions.

Closing philosophical capstone of the NEMS Suite (Paper 86): written for philosophers, scientists, and serious non-specialists rather than as a Lean-forward technical manuscript. Explains Reflexive Reality as the view forced by taking Perfect Self-Containment seriously—closure, the diagonal barrier, physical incompleteness, phenomenology of ground and awareness, and the surviving Alpha / Golden-Bridge picture—using sketch-proofs and suite citation codes ([P63], [RP-RI], etc.) tied to the verified program. Situates the suite relative to Infinity Compression, Reflexive Architecture, Adequacy, RI, RFO, ONE, and the General Science of Reflexive Systems so the full research arc is legible without reading every technical paper.

Zenodo (PDF + DOI)

Paper 87 — Reflexive Reality: A Survey for Formal Theory Specialists

New impossibility results, new proof methods, and a positive science of what happens after impossibility.

Paper C2 of the capstone portal series: audience-specific survey for logic, computability theory, proof theory, type theory, and mechanized mathematics. Organizes the program’s formal-theory contributions into four tracks—new impossibility results (three independent engines and their joint classification); new machine-checked theorems on classical mathematical objects (including group-extension splitting, Quillen Theorem A for Galois connections, and twelve-tranche external validation of a positive-closure proof architecture); the Reflexive Development Law as a positive dynamical classification after impossibility; and a methodology for typed formal synthesis at program scale. Maintains explicit claim-typing (theorem-extracted, bridge, interpretive). Companion portals C3 (physics) and C4 (AI/agents) cover non-formal-audience surveys.

Zenodo (PDF + DOI)

Paper 88 — Reflexive Reality: A Survey for Physicists

What closure proves about the Standard Model, quantum mechanics, and spacetime.

Paper C3 of the capstone portal series: survey of physical results for theoretical physicists (high-energy theory, quantum foundations, quantum gravity, cosmology, statistical mechanics). Thesis-level content includes the Two-Layer PSC theorem (Standard Model gauge structure forced in Layer I, three-generation selection in Layer II, with machine-checked support in nems-lean and ugp-lean), the Born rule as the unique closure fixed point of the probability-assignment problem, the arrow of time as structurally tied to stable records, unified diagonal constraints on black-hole information, holographic encoding, time-travel selection, and FTL non-signaling, parameter-free UGP derivations of couplings and fermion masses where cited as machine-checked, and the classification cascade framing closure compatibility as central to foundational viability. Claim-typing matches C2/C4.

Zenodo (PDF + DOI)

Paper 89 — Reflexive Reality: A Survey for AI, Agents, and AGI Researchers

Theorem-grade constraints on intelligence, agency, safety, and machine consciousness.

Paper C4 of the capstone portal series: theorem-grade constraints for AI, AGI, multi-agent systems, AI safety, cognitive science, and agent foundations—what structural conditions any system must satisfy to qualify for designated properties, and which properties are formally impossible regardless of scale. Headline themes: structural blind spot in parametric self-models; formal SIAM characterization of genuine autonomous agency with separation theorems (e.g. feedforward and stateless systems not qualifying); impossibility of total, sound, and complete institutional AI verification under diagonal constraints; simulation hypothesis closed on three independent grounds; Reflexive Development Law distinguishing real architectural progress from scaling and relabeling; substrate-independent structural characterization of machine sentience. Explicitly not a claim that AI cannot be capable or that current systems are or are not conscious.

Zenodo (PDF + DOI)

Paper 90 — A Continent Map of the Reflexive Reality Program

Structure, dependencies, reader routes, and the role of recent results.

Orientation map for the full program: six major thematic zones (verified NEMS spine; barrier / impossibility engines including RI, RFO, and semantic-type obstruction; ontology and awareness; continuation, agency, and sentience; transputation and realization; summit synthesis), their dependencies, flagship papers per zone, and discipline-specific entry routes for philosophers, logicians, physicists, and AI researchers. Highlights recent machine-checked semantic-type obstruction results (from reflective-fold-obstruction-lean, SemanticType/ modules) bearing on simulation versus realization. Explicitly an architecture chart for navigating the research continent, not a theorem index or literature review.

Zenodo (PDF + DOI)

Paper 91 — Closure Without Exhaustion

A theorem of internal semantic non-exhaustion for reflexive systems.

Flagship statement of internal semantic non-exhaustion for sufficiently expressive reflexive systems: they may close over themselves but cannot admit a final, total, exact internal theory of their own realized semantics; something remains structurally unabsorbed. Sharpens classical incompleteness barriers toward the demand for full internal capture of total semantic truth (not mere unprovability in a fixed formal system). Gives two independent machine-checked proof routes, closure-vs.-collapse discipline, a reusable notion of final internal self-theory, and consequence links to physical incompleteness, non-emulability of execution under record-divergent choice, observer non-self-exhaustion, and syntax–semantics separation; unification corollary treats Gödel, Kleene, Löb, and Tarski-style phenomena under a master fixed-point spine in Lean.

Zenodo (PDF + DOI)

Paper 92 — Consciousness, Phenomenology, and Mind

A formal theory of sentience, qualia, and awareness in Reflexive Reality.

Paper C5 capstone survey of mind and phenomenology for philosophers, cognitive scientists, and serious non-specialists. Central thesis: consciousness has a formal structure uniquely selected under stated admissibility constraints; mind, qualia, awareness, and world are coordinated aspects within one Alpha-grounded fact—not alien substances or mere illusions. Synthesizes the consciousness arc (Papers 51–75): Paper 74’s six-part phenomenology ontology with anti-collapse theorems; Paper 75’s uniqueness / survivor theorem in admissible theory space; Paper 73’s SIAM sentience regime and separation theorems (e.g. feedforward and stateless architectures not qualifying); qualia and awareness-locus results from Papers 55–70; companion to the continent map (Paper 90). Does not settle every phenomenal detail; states the proved architectural skeleton.

Zenodo (PDF + DOI)

Reader On-Ramp: The PSC–Born Fixed-Point Architecture

What is proven, what is assumed, and where disagreement must land.

Zenodo (PDF + DOI)

Significance of the General Self-Reference Calculus

Explanatory note for Paper 26 of the NEMS Suite.

Zenodo (PDF + DOI)

Explanatory Companion Note to Paper 30

Why perfect self-certification is impossible in self-referential systems.

Zenodo (PDF + DOI)

Domain Corollaries of Viable Continuation

Companion to Paper 71: Section 12 and principal appendices.

Zenodo (PDF + DOI)

Certification, Realization, and Obstruction: A Universal Fiber Architecture

Synthesis map of the full program; routes C/A/B/D; cross-domain dictionary.

This paper closes the editorial loop for a multi-manuscript program in machine-checked mathematics. The executive claim is that a single collapse / refinement / fiber architecture---certification at a bare carrier, strict comparison upstairs, obstruction organized as fiber and section data---is instantiated internally in dependent type theory, validated on twelve external mathematical families, and then discharged into algebra, arithmetic (embedding problems), topology (Quillen for Galois connections), and logic/computability (self-certification and halting anchors). We state the role of each companion paper, a cross-domain dictionary, route labels used in the program (C/A/B/D), and what remains open. The intended reader is an advanced mathematician who has not read the series; citations p

Zenodo (PDF + DOI)

External Validation of a Positive-Closure Proof Architecture

Transferability across twelve external mathematical families (T1–T12).

Transferability paper. This manuscript establishes that the positive-closure architecture is exportable to ordinary mathematics outside the flagship Infinity Compression modules; it is not the program map and not the venue for theorem-level leverage in algebra, topology, or arithmetic---those roles belong to the companion general-method papers cited below. The Infinity Compression (\IC{}) formalization develops a layered positive-closure proof architecture: collapse to a bare certificate, a typed forgetful map, fiber structure over that certificate, and, where appropriate, canonical witnesses or sections. A natural methodological concern is that this architecture may be endogenous to the flagship NEMS-style case rather than a reusable proof pattern. This paper presents a consolidated machi

Zenodo (PDF + DOI)

Fiber Architecture for Group Extensions in Lean 4

Cocycles, splitting criterion, and the cohomological bridge.

We present a machine-checked formalization of the section 2-cocycle, splitting criterion, and embedding-problem equivalence for group extensions in Lean 4 , built on Mathlib's \lean{GroupExtension} API . The formalization is organized around a fiber architecture that decomposes extensions into layers: fibers over quotient elements (N-torsors), set-theoretic sections (always exist), and homomorphic splittings (may not exist). The central results are: (1) the splitting criterion---an extension splits if and only if some section has trivial cocycle; (2) the embedding-problem equivalence---an abstract embedding problem (the central lifting problem in inverse Galois theory) is solvable if and only if the associated extension splits, if and only if the cocycle obstruction vanishes; (3) the 2-coc

Zenodo (PDF + DOI)

Quillen's Theorem A for Galois Connections

First machine-checked formalization of Quillen A for Galois connections.

Machine-checked construction of the homotopy data for Quillen's Theorem A in the Galois connection case: nerve maps induced by the lower and upper adjoints, and explicit 1-simplex witnesses (closure edges [p → u(l(p))] and kernel edges [l(u(q)) → q]). The composition-to-identity step requires simplicial homotopy as a Lean type (not yet in Mathlib) and is deferred to future work.

Zenodo (PDF + DOI)

Completing the Cohomological Extension Package

Mathlib companion: section cocycles and splitting criterion for PR reviewers.

Mathlib's GroupExtension/Defs.lean documents two explicit TODO items: a bijection between N-conjugacy classes of splittings and H^1, and a bijection between equivalence classes of group extensions and H^2, both for abelian kernel N. Neither is currently formalized. This technical note documents a proposed Mathlib contribution that constitutes Phase 1 of completing these TODOs: the section cocycle associated to a set-theoretic section of a group extension, the splitting criterion (splits_iff_trivial_cocycle), and supporting infrastructure including the section difference function, the conjugation action via sections, and the multiplicative 2-cocycle identity. All theorems are fully verified by the Lean type checker with zero sorry. We describe the proposed API surface, design decisions (nam

Zenodo (PDF + DOI)

Closure, Realization, and Reflective Residue (Summit 1)

Strata synthesis: NEMS + APS + IC with bridge theorems and the Non-Erasure Principle.

Lean 4 software archive for the NEMS program: Lean Reflexive Architecture. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

The Geometry of What Maps Forget (Summit 2)

Residual kernels and what maps forget: universal fiber architecture for non-injective comparison.

Lean 4 software archive for the NEMS program: Lean Reflexive Architecture. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Representational Incompleteness

No parametric self-model covers its own diagonal; six no-escape routes closed as theorems.

Lean 4 software archive for the NEMS program: Lean Representational Incompleteness. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Reflective Fold Obstruction

Hull theorem: forward-closed predicates confine the entire reachable hull; fold barriers are real.

Lean 4 software archive for the NEMS program: Lean Reflective Fold Obstruction. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Observer Non-Exhaustibility: A Formal Synthesis and Classification of Observer Architectures

Three blocked families + positive non-collapsing residual architecture from the awareness arc.

Lean 4 software archive for the NEMS program: Lean Observer Non Exhaustability. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

The Architecture of Outer Admissibility

Unified gate theorem; heterogeneous outer certificate forms collapse; strict three-level architecture.

Lean 4 software archive for the NEMS program: Lean Adequacy Architecture. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

The General Science of Reflexive Systems

Anchored completion limits, barrier families, residual aftermath, and the Reflexive Development Law.

Lean 4 software archive for the NEMS program: Lean Reflexive Architecture Nonexhaustibility. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Survey and Reader's Guide to UGP Physics

Portal paper: scope, structure, and reading paths for the full UGP Physics program.

This survey covers the 52 UGP Physics papers (P01-P52), providing a one-paragraph summary of each paper, a thematic grouping into nine natural clusters, an annotated logical dependency graph showing how the UGP results sit within the broader Reflexive Reality programme, reading paths for different research backgrounds, and the five-status epistemic taxonomy (A_Lean, A_MDL, A/D, B, D) used throughout the corpus. UGP Physics is the quantitative branch of the Reflexive Reality programme, sibling to NEMS. Where the NEMS papers establish why the Standard Model structure is the only consistent option, the UGP papers ask what numerical values the masses, couplings, and quantum numbers must take - and derive them from a single uniquely selected integer seed via a deterministic arithmetic cascade. Papers P30-P52 extend this programme into the electroweak mixing angle, CKM mixing, QCD structure, quantum mechanics, emergent gravity from the Phi_MDL continuum field, a complete perturbative quantum-gravity description, the full 3+1D architecture via the Three-Tape CMCA, first-principles cosmological predictions, a synthesis monograph unifying the full derivation chain, a condensed matter realization of the GTE polynomial as a 7-state spin lattice model, the polynomial certificate of transputation (which classifies quantum adjudication at exactly the halting degree), and the PSL(2,7) algebraic structure of the GTE framework. Two primary falsifiable predictions are derived: the tensor-to-scalar ratio r = 0 (testable at LiteBIRD) and the PMNS Dirac CP phase delta_CP = 205.71 degrees. This guide does not require prior familiarity with UGP or Reflexive Reality; it can be read as the first paper in the series.

Zenodo (PDF + DOI)

Standard Model from the Universal Generative Principle

Derives the Standard Model gauge group and 25 free parameters from the UGP deterministic number-theoretic framework. Bare Higgs prediction: 124.2 GeV at −9.1σ from PDG (open problem, disclosed). Level 1 (self-consistent EW VEV): 124.971 GeV at −2.08σ (Grade C). Structural EW VEV derivation: vₚₛᶜ = 246.16 GeV, −0.024% from vₚᴰᴳ (grade [A−], Lean-certified).

The Standard Model's 25 free parameters-gauge couplings, fermion masses, mixing angles, and the cosmological constant-have no accepted theoretical origin. We present the Universal Generative Principle (UGP): the Perfect Self-Containment (PSC) foundational principle uniquely selects a single integer seed (1,73,823) at ridge level n=10, and a deterministic arithmetic cascade generates the Category-A structural backbone of the SM parameter spectrum. The framework is complementary to QFT: it fixes the numerical constants that a QFT Lagrangian takes as input. The Category-A derivation chain is machine-checked in Lean 4 with zero sorry and the standard Mathlib axiom signature; all sectors are classified by a five-status claim taxonomy (machine-certified, MDL-optimal, partially-derived, calibrated, and exploratory; :status). Headline results: (1) Bare gauge couplings g_1^2, g_2^2, g_3^2 are Lean-certified exact rationals; the blind evaluation _s(M_Z) = 0.11822 sits at +0.24 of PDG 2024, pre-committed 43 days before the first PDG comparison (Appendix app:alpha_s_precommit). (2) Nine charged-fermion masses at 0.293\% RMS with zero active parameters at prediction time; a 1000-permutation null confirms arithmetic structure. (3) Neutrino mass-squared ratio m^2_21/ m^2_31 = 0.0294 at 0.16 from NuFIT 6.0, parameter-free, from Braid Atlas b-values and the structural exponent 29/9. (4) Cosmological constant from the derived model bit-length L_model = _2(2000/3) at 0.31 from Planck 2018 (H_0 is the sole external input). (5) Higgs quartic = phi/(4)\!(1+IPT-12c_H+1) is machine-certified (Category A_Lean; SpivackGTEUnification,SpivackSRRG); with v_PSC=246.16 GeV, this gives m_H = 125.2499 GeV (-0.0003 PDG 2022), closing the prior -2.08 tension. The lepton seed b_L_1=73 of this triple is doubly certified: the GTE cascade formula G(N_c)=N_c^4-(N_c^2+1)/2-N_c and the Frobenius prime chain F(n)=n^4-n^2+1 independently yield 73 at n=N_c=3, with agreement provably unique at n=3 (fgci\_unique\_at\_nc, UgpLean.Universality.FrobeniusChain, 17 theorems, zero sorry). Preregistered falsification tests for JUNO, DUNE, CMB-S4, and LEGEND-1000 are listed in :falsifiability.

Zenodo (PDF + DOI)

The GTE Particle Spectrum at n=10

All 24 SM particles rank in the top viability tier across 1,000,035 GTE candidates with 50-fold enrichment (p < 10⁻⁴).

We present a comprehensive analysis of the Generative Triple Evolution (GTE) particle spectrum at n=10, derived from the Universal Generative Principle (UGP). A large-scale discovery run generates 1,000,035 candidate particles below 173~GeV, classified into viability tiers (Green, Blue, Purple, Orange, Red) by a scoring system that reduces in practice to viability-only ranking (GTE compliance = 1.0 for all candidates by construction; stability score is effectively constant). Key findings: (1)~all 24 known Standard Model particles rank in the Green tier by both structural landscape position and blind composite score (before force-labeling), with 50-fold SM enrichment (p < 10^-4 vs.\ random draw; three distinct notions of recovery defined in 5); among the 19 candidates with confidence ≥ 0.90, all are SM particles; (2)~piecewise-linear hinge laws in the (k, m) plane with universal law-family parameters B = 4.01 × 10^-6 and D = -3.13 × 10^-6; (3)~genuine oscillatory structure with intrinsic period ~100,000 steps (z>50, stable across five window-size tests; a prior single-cycle estimate of ~500,000 steps is corrected here); (4)~multivariate surfaces linking ladder index, branch, and c-state to mass and lifetime; (5)~9 genuinely novel candidate states (GTE-P1, P2, P3, P6, P7, P8, P10, P11, and trajectory-reinterpreted P9) representing mass-band predictions (calibration uncertainty ± 1–40\% depending on candidate; three align with companion paper first-principles derivations); and (6)~trajectory-path multiplicity: GTE-P4 and P5 share GTE triples with the canonical muon and electron respectively but arrive via distinct evolution paths at 137~MeV and 21~MeV — these are trajectory-path variants of SM particles, not independently novel predictions. All results are derived from a single deterministic run with frozen code and integrity-checked artifacts (SHA-256 hashes recorded).

Zenodo (PDF + DOI)

GTE Coordinates as Nuclear Descriptors

GTE composition features achieve ~25% improvement over equal-size random baselines on nuclear binding energies; all seven nuclear magic numbers derived analytically.

GTE (Generative Triple Evolution) coordinates derived from nucleon-triple compositions provide competitive predictive power for nuclear binding energies. In a controlled ablation using exactly 50 features, GTE composition features achieve a 10-fold cross-validated MAE of 3.17~MeV versus 4.24~MeV for an equal-size random polynomial baseline—a ~25\% improvement demonstrating that GTE coordinates carry non-trivial nuclear information beyond arbitrary polynomial combinations of (A,Z). A 6-term analytical law achieves 0.032~MeV/A MAE for binding energy. A 10-term stability classifier using NUBASE2020 labels achieves 94.5\% accuracy in 5-fold cross-validation (majority-class baseline: 75.0\%). Smooth analytical stability laws cannot resolve discrete anomalies such as Tc and Pm; this limitation is disclosed in . Two GTE-theoretic predictions follow from the same arithmetic. First, the nuclear pairing constant Δ_ pair = a_ seed^g/2 = 5^3/2 = 11.18MeV, matching modern SEMF fits within 0.003\% with no free parameters; the underlying GTE b-seed parity is certified in Lean~4 ( .GTE.NuclearPairing, zero sorry). Second, all seven nuclear magic numbers \2,8,20,28,50,82,126\ are derived from the GTE cascade via pion-exchange physics (κ_ emp/κ_ min(N=50) = 1.149 ≈ IPT = 1.1309, 1.6\%, bridge claim). Scope: Stability predictions for Z > 118 are extrapolative ( ).

Zenodo (PDF + DOI)

UGP Dynamics: Attractors, Holography, Thermodynamics

Systematic characterization of UGP as a dynamical system: attractors, holographic properties, and thermodynamic behavior.

The Universal Generative Principle (UGP) is a deterministic, computable framework proposed as a candidate for a theory of everything. While its applications in deriving physical constants have been explored, the fundamental properties of the UGP as a dynamical system have not been systematically characterized. In this paper, we present the results of a comprehensive computational investigation into the UGP's core machinery. Claim types (canonical): CatAL machine-checked theorem ( -lean) | CatA computationally certified (SHA-256) | CatB bridge (theorem + stated premise) | [I] interpretive (local label). We first establish the UGP's computational and structural foundations, proving ( ) that its substrate is Turing-universal and ( ) compatible with reversible computing. We then analyze its long-term dynamics using a Renormalization Group (RG) operator, revealing ( ) that the system is not chaotic but is governed by three observed basin clusters (A, B, C) in a 98-seed deep-trajectory survey. We show ( ) that the Logarithmic Complexity Charge Q_4 at seed initialization predicts basin assignment across the four canonical seeds (one-way Analysis of Variance (ANOVA) p ≈ 0), establishing Q_4 as a genuine predictive invariant. Finally, we investigate ( ) the emergence of thermodynamics and establish that coarse-grained entropy systematically decreases as trajectories collapse into basin clusters, with ( ) a Lean-verified non-monotone witness ( \_entropy\_prefix8\_gt\_prefix9), while shuffled controls show monotone increase. These findings establish the UGP as a universal, reversible, and dynamically structured substrate. The Universal Windowed CA (UWCA) step function admits the algebraic characterization p(L,C,R) = C+R-CR-LCR over F_7, machine-certified in Lean~4 ( 110\_z7\_poly\_rep, zero ); when the center cell equals 1, this reduces to the NAND gate, providing a Cook-independent universality certificate~.

Zenodo (PDF + DOI)

The Uniqueness of the Universal Generative Principle

Formal proof that the canonical seed (1,73,823) at ridge n=10 is the unique arithmetic-admissible and physically-viable solution, certified to 2.39 ppm.

A candidate theory of everything must not only be sufficient to describe our universe but should ideally be the unique and necessary consequence of its own foundational principles. We present a formal proof of uniqueness for the Universal Generative Principle (UGP) , a deterministic, computable framework for fundamental physics. The proof proceeds as a two-stage sieve that systematically filters the space of possible theories from the mathematically possible to the physically actual. We first define the UGP Universality Class, a set of five axiomatic constraints that any equivalent theory must satisfy. We then demonstrate how Stage 1 of the sieve—based on arithmetic minimality, symmetry, and mathematical elegance—identifies a small set of mathematically admissible universes. Finally, we show how Stage 2 of the sieve—applying a powerful filter derived from the physics of instantiation—proves that only one of these candidates is physically viable. We present the results of a computational sieve that formally verifies this two-stage process, demonstrating that the canonical UGP solution (seeded by n=10, b_1=73) is the unique survivor. This convergence of mathematical and physical constraints provides overwhelming evidence that the UGP is the unique theory within its axiomatic class. We further establish non-circularity: the instantiation filter target δ_target is derived from CODATA α_EM combined with Lean-certified constants (theorems \_L2\_eq and in ugp-lean, zero ), independently of b_1=73, and the CODATA-derived value selects b_1=73 to within 2.39~ppm.

Zenodo (PDF + DOI)

Algebraic and Geometric Foundations of the SM Gauge Group

Complete mathematical foundations of UGP: Quarter-Lock Law and algebraic derivation of SU(3)×SU(2)×U(1) from three arithmetic axioms.

We present the complete mathematical foundations of the Universal Generative Principle (UGP) , a deterministic, computable framework from which the laws of physics emerge. We demonstrate that the UGP is a self-contained, axiomatically-driven mathematical structure. We prove the Quarter-Lock Law as a theorem of the UGP's invariant space and derive the algebraic constants of the Elegant Kernel from its symmetries. The centerpiece of this work is a two-stage, first-principles derivation of the Standard Model gauge couplings. First, we derive the bare algebraic values of g_1^2, g_2^2, g_3^2 from their unique, group-specific invariants. Second, we derive a Universal Instantiation Factor, δ_UGP, a parameter-free correction that universally applies to all bare constants, accounting for the physical realization of the theory on its discrete substrate. This factor is derived from the Principle of Invariant Restoration, a necessary consequence of the Quarter-Lock Law. This work establishes the UGP as a single, coherent mathematical object that derives the algebraic structure and several exact parameter values; other sectors are classified A/D or B in the companion paper~. The full SM parameter status ledger, including A/D and B sectors, is given in~.

Zenodo (PDF + DOI)

UGP/GTE as an Organizing Principle for Nine Meta-Laws of Physics

UGP/GTE as a unifying vocabulary that subsumes nine universal meta-laws from three axioms: Locality, Symmetry, and Compression/MDL.

We present the Universal Generative Principle (UGP)~ as a unifying vocabulary that subsumes the premises of nine universal meta-laws (ML-1 through ML-9). The UGP framework, grounded in the Perfect Self-Containment (PSC) foundational principle, provides a single substrate—Generative Triple Evolution (GTE, 225 machine-checked modules)—from which each meta-law follows as a structural consequence. For ML-2 (Natural Gradient Flows), ML-4 (Hydrodynamics), ML-5 (Gauge Fields), and ML-6 (Geometric Flows/GR), we show that UGP's axioms subsume the premises of the classical results of Jaynes~(1957), Yau~(1991), Yang–Mills~(1954), and Jacobson~(1995) respectively; the proofs of those results stand as cited, and the UGP contribution is showing they are instances of the same framework. For ML-7 (Zipf's Law), we provide a complete, rigorous derivation with a finite-rank Euler–Maclaurin error bound, validated on 21 diverse corpora. For ML-3 (Arrow of Time) and ML-8 (Basin Selection by Conserved Charge), machine-checked backing is available in the NEMS programme~(Papers~36, 78, 09, 17, 22). For ML-9 (Attractor Thermodynamics), a Lean-verified entropy witness exists in -lean~( \_entropy\_prefix8\_gt\_prefix9, zero sorry).

Zenodo (PDF + DOI)

Architecture of a Computable Universe: Five Meta-Laws

Interpretive synthesis: five architectural meta-laws describing a universe that is computable, self-defining, and reflexively closed.

This work presents an interpretive synthesis of the conceptual architecture of the Universal Generative Principle (UGP) as a candidate theory of everything. We synthesize foundational results from the UGP Physics programme, the quantitative branch of the Reflexive Reality programme SpivackResearchProgrammes, into five interconnected architectural principles that describe a universe in which physical law, mathematical structure, and the structural necessity of formal adjudicator subsystems are co-determined within a single self-consistent computational architecture. We show that under the UGP-1/PSC/MDL premise bundle, physical law is not arbitrary but is the minimally selected program at operational level n=10 (The Principle of Constrained Contingency). We argue that physical reality is a conservative extension of a minimal self-referential logical object (The Principle of Ontological Scaffolding). We establish that the universe is a self-executing system (The Principle of Reflexive Computation). For a Category-A backbone of structural constants-including gauge couplings, the Koide phase, and the neutrino splitting ratio-these constants are emergent, computable invariants of the UGP's Elegant Kernel (The Principle of Constants as Compression Ratios); several phenomenological sectors remain open (see companion paper for full status taxonomy). Finally, we argue that observers are a necessary structural feature of the architecture (The Theorem of Necessary Observers). Together, these five principles describe a candidate closed, self-defining architecture in which physics, mathematics, and the structural necessity of formal adjudicator subsystems emerge as facets of a single computable reality-conditional on the stated premises and the resolution of the remaining open fronts enumerated in the companion papers Spivack2026_SM_UGP,Spivack2026_Koide,Spivack2026_CyclotomicMass.

Zenodo (PDF + DOI)

Reflexive Reality and Self-Defining Physical Law

Formalizes that a complete, self-contained universe has laws arising from within — law, state, and evolution as three aspects of one reflexive process.

Modern physics treats the laws of nature as meta-descriptions written ``outside'' the universe. If the universe is complete and self-contained, its governing principles must arise from within: the laws, the state, and the act of evolution are three aspects of a single reflexive process. This paper formalises the concept of reflexive reality, classifies known physical theories by their degree of reflexivity, and illustrates with concrete examples how self-defining dynamics manifest. The central philosophical argument is that a finite, knowable, self-contained universe must obey reflexive laws (conjectural, see taxonomy below). This argument has been formalised and machine-checked in the companion NEMS programme: the Theorem of Foundational Finality~ and the Reflexive Closure Theorem~ provide machine-checked backing (both proved in Lean~4, zero sorry). This paper presents the physical intuition and conceptual framework; readers seeking formal proofs are directed to the NEMS companion papers~.

Zenodo (PDF + DOI)

Ontological Dissonance Minimization and SDS Validation

Minimizing the ontological dissonance functional D within the SDS framework produces results consistent with maximizing integrated information.

We report that minimizing an ontological dissonance functional D—formulated within the Self-Defining System (SDS) framework—produces results empirically consistent with maximizing a spatial-integration proxy for integrated information Φ within the PR-0 field-only substrate. In PR-0 experiments, D-minimization and Φ-proxy-maximization independently discover a short-range binding potential V(d)≈ α + σ/d^2 for the strong interaction. Measured jointly on the same dynamical system (n=21 samples, single deterministic trajectory), D and Φ_proxy exhibit a strong inverse correlation (r=-0.9108, r^2=0.83, p<10^-9 after autocorrelation correction). Under physically motivated constraint-conditioned D, we obtain potential forms qualitatively consistent with (i) short-range binding for strong, (ii) Coulomb-like decay for electromagnetism, (iii) Yukawa-like screening for weak, and (iv) Einstein-like geometric coupling for gravity. These results provide preliminary empirical support for SDS as a generative principle and suggest a connection between dissonance minimization, spatial information integration, and emergent force structure. The constraints embed prior physical knowledge; deriving force constants from D analytically remains an open problem.

Zenodo (PDF + DOI)

Unified Rigidity Theorem for PSC/UGP Universes

Three independently developed rigidity mechanisms jointly select the SM gauge structure and three generations; Lean 4 certified.

We show that three independently developed rigidity mechanisms jointly select the same canonical physical branch under an explicit and audited premise bundle. Layer I/II PSC theory-space selection SpivackPhysicsPortal,Spivack2025_FirstPrinciplesSM narrows the space of 4D renormalizable gauge theories to the Standard Model gauge structure and three generations; this is supported by a finite exhaustive enumeration over 34,560 candidate universes across 12 gauge groups including Pati-Salam and E_6 (TE2.2 extended scan: SM ranks \#1, only 0.03\% pass the hard PSC filters, all survivors are SM-like, all BSM candidates decisively eliminated SpivackPSCConcordance). UGP arithmetic and seed rigidity Spivack2025_UGPUniqueness,spivack2025main_ugp_paper is fully machine-checked in ugp-lean ugp-lean: the RSUC theorem isolates the Lepton Seed (1,73,823) as the unique MDL-minimal survivor of the two-stage sieve (0 sorrys, 0 custom axioms). Dynamical basin structure places the Lepton Seed and its mirror in the canonical basin A across all tested configurations, while off-residual seeds fall in basins B/C; this is frozen and SHA-256 certified. A new Lean bridge library, unified-rigidity-lean unified-rigidity-lean, formalizes the common admissibility framework and proves unified\_rigidity\_theorem under the explicit premise bundle recorded in its assumption ledger. Every claim is strictly typed: theorem-extracted, bridge, computational/certified, or residual/open. The result is a conditional synthesis theorem under an explicit premise bundle; every assumption is typed and audited. The formal PSCSM step is now unconditional: the Residual Classification (RCC) is established as a theorem (PSC.RCCInfiniteFamilies, zero sorry ugp-lean); the all-n UGP extension is now proved (asymptotic\_sparsity\_universal, zero sorry Spivack2026_Uniqueness25); the neutrino mass-squared splitting ratio m^2_21/ m^2_31 is predicted to 0.52\% from Braid Atlas b-values via the formula m__g b_g^N_c + _Koide = b_g^29/9, with normal ordering automatic and no external anchor (companion paper Spivack2026_SM_UGP). Any construction of a PSC-admissible theory outside the SM signature, a non-Lepton-Seed UGP survivor satisfying the full sieve, or a canonical-seed trajectory failing the predicted basin would falsify the result.

Zenodo (PDF + DOI)

Formal and Computational Concordance on Perfect Self-Containment

Computational certificate for the Two-Layer PSC Theorem; full constraint independence analysis; three new UGP coupling-ratio predictions.

We present the computational certificate complementing the Two-Layer PSC Theorem~, with a full constraint independence analysis and three new UGP-derived coupling-ratio predictions. The PSC theorem chain establishes that any self-contained 4D renormalizable gauge theory must have G = G_ SM and N_ gen ≥ 3 (Layer I, forced by consistency); Presentation Invariance uniquely selects N_ gen = 3 (Layer II, optimality). Key steps are machine-certified in Lean~4 with zero , including the Residual Classification theorem .RCCInfiniteFamilies~. An exhaustive enumeration of 20,160 candidate universe descriptions minimizes a PSC dissonance functional D[Ψ]. Only 12 pass the hard Layer~I filters (0.06\%); all 12 are SM-like. The five hard filters (C_1, C_6, C_8, C_12, C_13) contain no reference to G_ SM; they encode dimensional consistency, holographic closure, unitary evolution, area law, and K\"ahler structure. The SM tuple (d,G,N_ gen) = (4,G_ SM,3) achieves the unique Layer~II minimum D_ = 1.0667 (Hessian λ_ = 2.0 > 0). The residual D_ > 0 is entirely due to C_4 (Quarter-Lock), a UGP-derived prediction satisfied by the SM to 95\% at M_Z. Three new UGP-orbit-invariant constraints (C_15: bare g_1^2/g_2^2; C_16: bare g_3^2/g_2^2; C_4': multi-scale Quarter-Lock) are machine-checked rationals; the SM satisfies all three to within 2–7\% after RG running. A pre-committed ablation study confirms the SM as the unique D-minimizer. Extended scans covering Pati-Salam, E_6, G_2, and SU(6) all fail the PSC sieve.

Zenodo (PDF + DOI)

The Information Profit Principle

Derives the Information Profit Threshold IPT ≈ 1.1309 within the MFRR framework; a reflexive self-maintaining system must generate information structure faster than it dissipates it.

A reflexive self-maintaining system must generate information structure faster than it dissipates it. Within the MFRR framework, this requirement yields a sharp dimensionless threshold, the Information Profit Threshold (IPT): where phi = (1+5)/2, giving IPT 1.1309. A system with generative-to-drain ratio = G/D > IPT can sustain coherent self-referential processing; one with IPT cannot. All three structural premises and the IPT theorem are machine-certified in Lean 4 (ugp-lean, zero sorry; ). Three computational validations confirm the threshold across qualitatively distinct parameter regimes; eight real-world tests across seven domains support it as a genuine viability threshold. Key empirical results: published mean GPP/RECO for tropical moist forest is 1.130 (n=24 sites; Luyssaert et al.\ 2007), matching IPT to three decimal places; above-IPT populations grow at +1.46\%/yr versus near-zero in the buffer zone (p < 10^-4); self-organized criticality systems fall in the buffer zone, confirming the threshold is not a critical-point artifact; a three-regime organizational failure cascade in U.S.\ equity data echoes the threshold (= -92.19; AUC = 0.781; ^-). Deriving the PSC overhead functional analytically from first principles remains open.

Zenodo (PDF + DOI)

Black Hole Unitarity via Reflexive Unitarity

Black hole information paradox resolved via reflexive unitarity within MFRR; Stinespring fidelity F ≥ 1−10⁻⁸; full Page curve recovered.

We examine black hole information unitarity within the Mathematical Foundations of Reflexive Reality (MFRR) framework SpivackNEMSMFRRBridge. The MFRR Transputation operator PT^-1 provides a physical mechanism for unitary information recovery consistent with the Perfect Self-Containment condition. Since every CPTP map admits a Stinespring dilation (a mathematical theorem independent of gravitational modelling), Hawking evaporation is unitarily equivalent to a reversible evolution on a system-plus-environment space. We construct the evaporation channel _ t = e^ tL as a GKSL master equation for a JT-like system of n=3 bosonic modes (d_H = 8) at T_H 0.004. Stinespring dilation achieves fidelity F 1 - 10^-8; detailed balance holds to 0.00\%; the entropy curve reaches 97.2\% of the ideal thermal value. In two complementary closed unitary models - a pure initial BH state and a purified thermal initial state with reference system R - the full Page curve with turnover is reproduced and PT^-1 recovery achieves F = 1.000000. Open fronts are stated explicitly: extension to 3+1 quantum gravity, the firewall tension, and a first-principles derivation of PT^-1.

Zenodo (PDF + DOI)

Braid Atlas v2: Standard Model Topology from First Principles

Derives SM spin, charge, and family quantum numbers from particle braid topology; 64-schema finite vertex audit returns zero mismatches.

The quantum numbers of the Standard Model (spin, charge, family) are experimentally verified but theoretically unexplained. We present a theory that derives these properties from a deeper, information-theoretic foundation: the Universal Generative Principle (UGP). We model fundamental particles as topologically stable, braided worldlines on a discrete substrate. A consistent description ties the UGP arithmetic identifiers (GTE triples) to an effectively complex-valued component, whose phase carries chirality—the observable signature of a dual-operator evolution , T^ \ for matter versus antimatter, with chirality as a dynamical, path-dependent property. This framework yields a kinematic dictionary—the GTE Rosetta Stone—mapping braid `phenotype'' (writhe, strand count, crossing number) to the complex triple `genotype,'' fixed by Lorentz, SU(3), and SU(2) symmetry with an explicit pipeline in Appendix~B. The Canonical Braid Atlas v2.0 summarizes derived topological fingerprints for all fundamental fermions, extended here to composite hadrons and massive electroweak bosons. Electric charge (Theorem C-W): Q = W_g/N_c for each SM fermion class is machine-checked ( .ChargeTheorem: \_charge\_leptons, zero , -lean); anomaly cancellation yields W_g = N_c(N_c-3) iff N_c=3, certifying colour rank ( \_cancellation\_forces\_Nc\_3). Braid winding pattern from N_c: the winding set \{N_c-1,-1,0,-N_c\} for the SM at N_c=3 is derived algebraically ( .ChargeDerivation: \_winding\_numbers\_from\_Nc, \_ql\_unifies\_vv\_and\_winding), closing the kinematic consistency between hypercharge bookkeeping and braid charges. Nine light-baryon (a,b,c;g) triples are Lean-certified ( .CompositeTriples, zero ). Companion results on gauge-sector rigidity and RCC closure over all compact simple groups appear in PSC and deeper-theory manuscripts; see the companion formalization paper~.

Zenodo (PDF + DOI)

The Koide Relation as a Cyclotomic-12 Closed Form

Koide phase θ = 2/9 derived unconditionally from N_c = 3 via cyclotomic-12 identities; mτ predicted to 61 ppm (0.91σ) — Lean certified.

Koide's 1983 relation Q ≡ (m_e + m_μ + m_τ)/(√(m_e) + √(m_μ) + √(m_τ))^2 = 2/3 has no accepted structural origin. We promote it from a numerical coincidence to a structural statement via three interlocking results. Geometric form. The relation is equivalent to v = (√(m_e), √(m_μ), √(m_τ)) lying on the 45^ cone about the democratic axis (1,1,1)/√(3); PDG values place v at 44.99974^ , just 0.95 arcseconds from exact. Closed form. Solving as a quadratic in √(m_τ) yields predicting m_τ = 1.776969~GeV against the PDG value 1.77686~GeV—a relative error of 61~ppm (0.91σ_ PDG). The surd coefficients satisfy cyclotomic-12 identities, placing the lepton mass spectrum in the atom family \π/12, (π/12), √(3)\. Structural origin. Within the UGP framework, the Koide phase θ = 2/9 is derived unconditionally from the QCD colour rank N_c = 3 via θ = (N_c^2 - 1)/(4N_c^2). The absolute lepton mass scale follows from first principles: y_τ = 1/98 arises as c_V/N_ mod2, where c_V = 1/49 is the canonical Z_7 potential coefficient and N_ mod2 = 2 the binary tape level, giving m_τ = v_H/(98√(2)) = 1776.57~MeV (-2.42σ from PDG~2024) with the SRRG Higgs VEV as the sole dimensional anchor. The closed form then predicts all three charged-lepton masses with zero free parameters. The combination N_c + θ = 29/9 also controls the neutrino mass-squared splitting ratio Δ m^2_21/Δ m^2_31 to 0.52\% from NuFIT~6.0. An S_3-equivariant Newton-step operator with the Koide null cone as its attractor provides a dynamical realisation of the 45^ condition. All identities are machine-checked in Lean~4 against Mathlib with zero .

Zenodo (PDF + DOI)

Cyclotomic-12 Structure in the Charged-Fermion Mass Spectrum

Two structural mass relations reduce nine charged-fermion masses to two empirical inputs; VV coefficient α_d = 13/9 derived from SU(5)/SO(10) group theory.

We present two structural mass relations that reduce the nine charged-fermion masses to two empirical scale inputs and identify their cyclotomic-12 and SU(5)/SO(10) origins. The TT relation (m_u_g/m__g) = (/6) 2^g + /8 holds against PDG masses at 0.37\% max-fractional-error across six -free inter-generational identities (null density 610^-6). The VV relation (m_d_g) = 139(m_u_g) - 76(m__g) - 514 holds at 0.17\% across all three generations (null density 10^-5). Combined with the Koide closed form Spivack2026_Koide, all nine charged-fermion masses are determined from two scalar inputs. The TT coefficient = /6 is the half-opening angle of the A_2 Weyl chamber (Lean-certified: angle\_alpha1\_omega1\_eq\_pi\_div\_six, zero sorry); the generation-doubling factor 2^g is proved via a binary cascade (Lean-certified). The VV coefficients (13/9, -7/6, -5/14) satisfy exact SU(5)/SO(10) group-theoretic identities (VV\_from\_GUT\_group\_theory, zero sorry) classified as structural facts [T]; the coefficient-value interpretation is classified [C] (see :vv_honest). A pre-registered three-null-test discipline accompanies each derivation. All Lean content is machine-checked at zero sorry in the ugp-lean library ugp-lean.

Zenodo (PDF + DOI)

MFRR Physics Survey

Survey of MFRR formal and computational results: unified framework in which logic, computation, and physics are aspects of one self-defining process.

We survey the formal and computational results of the Mathematical Foundations of Reflexive Reality (MFRR) programme, which establishes a unified framework in which logic, computation, and physics are aspects of one self-defining process. The central construct, Transputation (), is the unique internal adjudicator of computational degeneracies (machine-proved in Lean 4, zero sorry, zero custom axioms). Machine-certified results: forced adjudication ( unique under closed-choice conditions); Born rule uniqueness from MDL; arrow of time from irreversibility; no-emulation ( is super-Turing); SM gauge group and N_gen 3 forced by PSC consistency; UCL2 correction k_gen = phi(/10). Computationally certified results: SM ranks \#1 of 34,560 universes scanned (P: SM selection); 97.02\% SRRG attraction rate to the SM fixed point (C: flow-basin size); Information Profit Threshold 1.1300 0.0001, matching the UGP-derived value to 0.08\% (P); emergent force law exponent p = 2.60 0.16, asymptoting to r^-2 (M); Reflexive Landauer bound compliance 100\% (C). The Residual Classification is Lean-certified (PSC.RCCInfiniteFamilies, zero sorry), making SM uniqueness unconditional. The Information Profit Threshold is machine-checked (UgpPhysicsLean.IPT.InformationProfitThreshold, zero sorry). Primary open fronts: gravity/gauge unification in the two-layer theorem and T8 holographic closure numerical certification (circularity noted; :limitations).

Zenodo (PDF + DOI)

Neutrino Mass-Squared Ratio from the Braid Atlas

First parameter-free structural prediction of Δm²₂₁/Δm²₃₁ = 0.02936, matching NuFIT 6.0 at 0.16σ with zero free parameters; normal ordering automatic.

We present a parameter-free structural prediction of the neutrino mass-squared ratio from the GTE Braid Atlas, using only the QCD colour rank N_c = 3 and the right-handed neutrino b-values \5, 11, 19\. The result, m^2_21/ m^2_31 = 0.02936, matches the NuFIT 6.0 global fit (0.02951 0.00098) to 0.16 (0.52\%) with normal mass ordering automatic. The seesaw exponent 29/9 = N_c + _Koide admits three independent structural decompositions (Braid Atlas topology, mirror-offset invariant , and SO(10)/SU(5) representation dimensions), all converging on 29/9. The integer 29 = (adj_SO(10)) - (spinor_SO(10)) is Lean-certified as seesaw\_index\_is\_gauge\_matter\_defect (zero sorry). The Froggatt-Nielsen texture (q_1,q_2)=(3,2) is MDL-uniquely selected (fn\_structural\_texture\_existence\_and\_uniqueness, zero sorry). The structural Dirac scale E_D = v_H/29 places m_ [55,75] meV within the Planck bound with no cosmological anchor. Three PMNS mixing angles follow from the same orbit-ratio structure: ^2_12 = 4/13 (+0.01 NuFIT 6.0), ^2_23 = 19/42 (-1.35, within 3), _13 = 11/73 (+1.0); ^2 = 0.564. The CP phase _CP = 205.71^ and Jarlskog invariant J_GTE = -(8184437/5057221)(/7) are machine-certified (zero sorry). Preregistered falsification criteria for JUNO, DUNE, CMB-S4, and Hyper-Kamiokande are listed.

Zenodo (PDF + DOI)

UGP Interaction Skeleton Theorem

Lean 4 proof (zero sorry) that UGP winding data alone determines the SM's finite renormalizable interaction skeleton — all vertices, Yukawa couplings, anomaly cancellation.

We prove in Lean 4, with zero \ for all theorem-grade claims, that the Universal Generative Principle (UGP) winding, chirality, hypercharge, and color-fiber data determine the Standard Model's finite renormalizable interaction skeleton: gauge-fermion vertices, Yukawa mass-generating vertices, anomaly cancellation, representation-level color-singlet constraints, proton-stability forbiddance at dimension four, and a topological dark-sector isolation gap. The winding number W = N_cQ, the GTE chirality fiber T/T^, integerized hypercharge Y_3 = 2W - T_6 = 3Y (e.g., Y_3(e_L) = -3, Y_3(Q_L) = +1, Y_3(e_R) = -6, Y_3(u_R) = +4), and the minimal gauge-boson winding spectrum \0, 3\ suffice to reproduce all renormalizable SM vertex schemas and exclude all forbidden ones-without any additional gauge-theoretic input. The main theorem-UGPVertex(f_1,f_2,B) SMVertex(f_1,f_2,B) for all colored fermions f_1,f_2 and gauge bosons B-is proved by exhaustive finite case analysis. A vertex audit over 64 electroweak schemas returns MISMATCH COUNT\,=\,0 (SHA-256: c927758a9b7801db). Three independent proofs force N_c = 3; the SM fermion quartet is the unique anomaly-free solution at N_c = 3; proton decay at dimension four is topologically forbidden; and fermions with W \1,-2,4\ are isolated from all SM particles via SM bosons. Electroweak predictions from Lean-certified bare couplings give m_W = 80.364\,GeV (-0.42 vs PDG 2024 world average 80.3692 0.0133) and _s(M_Z) = 0.1179 (0.0). These results were independently foreshadowed computationally: the PR-1/Logos cellular automaton recovered the winding-transfer structure at 87.38\% consistency with zero false negatives over 1.02 10^6 events, and the PR-0/MFRR field substrate exhibited force emergence from dissonance minimization, both before the Lean proofs were written.

Zenodo (PDF + DOI)

Substrate Depth and Self-Generated Mass: Closure Structure of UGP

Reflexive closure correlation r = −0.913 (p = 1.3×10⁻¹⁵) between log|c| and self-generated mass fraction across 38 composite hadrons; all triples Lean-derived.

We ask: to what degree does each composite particle generate its own mass internally, versus inheriting it from its constituents? We define the reflexive closure = (M - m_i)/M as the fraction of rest mass arising from internal dynamics (QCD binding energy, gluon fields, quark kinetic energy). Across the PDG composite-particle dataset (n=38), _10(M/M_lightest-in-sector) correlates with RC at Pearson r = -0.83. The Universal Generative Principle (UGP) assigns every fundamental fermion a canonical integer triple (a,b,c;\,g) via the Generative Triple Evolution mechanism; the c-component encodes position in a Mersenne-prime ladder indexing substrate complexity. The canonical triples for all 38 composite hadrons are now formally Lean-derived (module BraidAtlas.CompositeTriples, zero sorry). We find that _10|c| from the formal GTE Mersenne-sector rule correlates with RC at r = -0.913 (p = 1.310^-15, Outcome A); under the Braid-Atlas max-|c| rule, r = -0.981 (p = 2.110^-27, Outcome A); and the combined metric _10\!|b||c| gives r = -0.928 (p = 5.010^-17, Outcome A). All five physically motivated rules reach Outcome A (|r|0.90), while a random-triple null test (10,000 trials) yields 0 of 10,000 reaching that threshold. A 6-dimensional PCA captures 92\% of variance in three components, with PC1 dominated by _10|c|, _10|b|, and RC moving together. The correlation is structural evidence that the c-component encodes a previously unrecognized physical property: the Mersenne-ladder depth of a particle's canonical triple predicts how much of its rest mass is self-generated versus externally imposed. We discuss implications for the concept of ``generation'' in the UGP framework and identify a Lean-certifiable version of the correlation for the elementary-fermion subset.

Zenodo (PDF + DOI)

The Arithmetic Uniqueness of the Standard Model

UGP is the unique arithmetic-admissible and physically-viable solution across all ridge levels; Galois substrate Q(ζ₁₂₀) identified; all 8 Zamolodchikov E8 mass ratios Lean certified.

The Universal Generative Principle (UGP) addresses the Standard Model parameter spectrum, classifying each sector by epistemic status~, from a uniquely selected integer seed at ridge level n=10 via a deterministic arithmetic cascade. We investigate whether UGP is itself a shadow of a deeper mathematical structure. Four main results. (1)~The Asymptotic Sparsity Theorem proves the joint arithmetic-admissibility and physical-viability constraint has exactly one solution across all ridge levels: (n=10,b_1=73). The arithmetic component is Lean-certified (unconditional); the physical-viability component uses the CODATA-derived instantiation factor (A/D). (2)~The Positive Root Theorem identifies an exact arithmetic correspondence between the SM bare gauge-coupling numerators and the positive-root counts |Φ^+(G)| of the respective gauge groups; the Chirality Theorem shows the squareness/non-squareness of these numerators is the Lean-certified arithmetic signature of the vector-like/chiral distinction. (3)~Galois structure: the UGP algebraic constants lie in the unique minimal cyclotomic field Q( _120) whose conductor is the lcm of the Coxeter numbers of the SM gauge algebras; algebras with h 120 (notably E_7, h=18) are algebraically impossible to contain in Q( _120) — a structural Tower Law theorem, Lean-certified zero-sorry (Corollary~). (4)~The WZW route is falsified: the Wess-Zumino-Witten construction cannot reproduce the UGP bare coupling rationals, closing a natural alternative-parent hypothesis. Epistemic status: all main arithmetic theorems are A_ Lean (Lean-certified, zero ); physics-bridge interpretations and CODATA-conditioned results are A/D. A front-matter claim-status table lists every result's status explicitly. All computations are reproducible via the open-source scripts at ( /24\_deeper\_theory/; \_all.py reproduces all results in <1~s).

Zenodo (PDF + DOI)

Structural Admissibility Selects the Standard Genetic Code

Two-stage sieve uniquely selects the standard genetic code at z = +3.22σ (p < 0.009%); zero of 10⁵ random wobble-admissible codes outperform it.

The near-universality of the standard genetic code raises a deep question: is it the best possible encoding of amino acids, or merely one of many adequate solutions? We address this by applying a two-stage sieve — admissibility followed by multi-criterion viability — to the space of all codon-to-amino-acid maps. Stage~1 (wobble admissibility) reduces the 23 64 possible maps by a factor of~10^50, to the $23^27 ≈ 5.8 × 10^36$ maps that respect the Crick wobble degeneracy rules. Stage~2 applies eight independent biological viability criteria simultaneously: error minimization, prebiotic accessibility, stop-codon robustness, chemical clustering, polar-requirement conservation, evolvability (minimum accessible mutation diversity), historical reachability (first-wave amino acids in ancient codon boxes), and complete stop-codon coverage. Monte Carlo sampling of 10^5 complete wobble-admissible codes shows that the standard code ranks at z = +3.22σ on the five-criterion Phase~5 metric~(p < 0.009\%). Global CP-SAT optimization confirms the standard code is not the mathematical maximum of any single or combined abstract criterion. However, codes that score higher on abstract criteria have max\_jump ≤ 5 (hyper-conservative mutation profiles), which disqualifies them under the evolvability criterion (Stage~2G). With all eight criteria applied jointly, no code among 99,998 evolvable complete wobble-admissible codes outperforms the standard code. The standard genetic code is the unique survivor of the two-stage sieve within this sampling depth. Codes that score higher on abstract criteria all carry hyper-conservative mutation profiles (max\_jump ≤ 5), which disqualifies them on biological grounds: they would prevent the drastic substitutions required for protein fold diversification.

Zenodo (PDF + DOI)

A General Theory of Selection

General Selection Principle (GSP): two-stage admissibility + viability sieve with IPT ≈ 1.1309 unifies selection across six domains.

Selection from astronomically large candidate spaces recurs across domains as disparate as subatomic physics, molecular biology, and corporate finance. We propose the General Selection Principle (GSP): the observed configuration is selected by the conjunction of two independently motivated filters-admissibility (structural/arithmetic consistency) and viability (a dynamical threshold on generative-to-dissipative rates). The viability filter requires the rate ratio to exceed the Information Profit Threshold = 1 + 2(2) 1.1309, derived from first principles in SpivackIPT. Together, the filters produce asymptotically sparse but non-empty survivor sets. We document two independent quantitative signatures of the GSP. The IPT threshold recurs across five empirical domains - ecology and economics (prior derivation SpivackIPT), nuclear magic numbers, prebiotic chemistry, corporate survival, and microbial metabolism (FBA, r=0.971, p<0.001) - together with one model-internal symbolic-communication result (natural language alphabet size). The algebraic substrate Q(120) recurs in the Standard Model parameter spectrum Spivack2026_SM_UGP, the Zamolodchikov E8 integrable QFT mass ratios ugp-lean, ADE Toda field theories, and SU(2)_k WZW quantum dimensions. The E7 Toda theory (h=18, 18 120) provides a clean falsifier: all six mass ratios lie provably outside Q(120), with the exclusion Lean-certified ugp-lean. Evidence grades range from [T] (theorem-level, machine-certified) through [B] (empirical, replication pending) to [B^-] (empirical, single-laboratory, not yet independently replicated); [Br] denotes bridge claims conditional on companion-paper premises; a domain-by-domain evidence map appears in Table tab:evidence_map. The co-occurrence of these two independent signatures supports the hypothesis that a single mathematical mechanism underlies selection across discrete combinatorial systems; see also the companion Self-Referential Renormalization Group (SRRG) paper SpivackSRRG for a proposed mechanism.

Zenodo (PDF + DOI)

The Self-Referential Renormalization Group (SRRG)

Unique IR fixed point S* satisfies R[S*]/CΛ[S*] = IPT; minimal symmetry group at S* is U(1); viable-continuation theorem proven — machine-checked in srrg-lean. VEVProof: 4 Lean-certified modules (SrrgLean.VEVProof.*), zero sorry, structural EW VEV derivation vₚₛᶜ = 246.16 GeV (grade [A−], conditional on 2 named open axioms).

We introduce the Self-Referential Renormalization Group (): a gradient-flow theory on the space of self-referential physical theories. The \ flow maximises a net viability functional F[S] = R[S] - C_[S], where R[S] measures self-representation capacity and C_[S] decomposes into closure, self-computation, and selector costs inherited from the No External Model Selection (NEMS)/PSC framework. The core results are: fixed-point existence via the Master Fixed-Point Theorem; monotonicity of F along the flow (an analogue of Zamolodchikov's c-theorem); linearised contraction rate 1/ where is the golden ratio; and an Information Profit Threshold 1.1309 at the fixed point, conditional on the PSC Landauer self-consistency hypothesis h_psc\_sc (grade [A^-]). The -flow -function _ = (-)(-2) has an IR-stable fixed point at =; its algebraic uniqueness is machine-certified in Lean 4 (zero sorry). Conditional physical applications - including theta_QCD=0, N_gen=3, the electroweak VEV v_PSC=246.16\,GeV (grade [A_Lean], zero sorry, zero open axioms), and structural exclusion of Planck-scale vacuum energy - are developed in the appendices, with all bridge hypotheses stated explicitly (Table tab:assumptions). The SRRG-MDL equivalence (Open Problem 9) identifies _S F[S] with _S K[S]; the algebraic core is machine-certified (, op9\_catal\_unconditional, zero sorry, conditional on UGPSubstrateConstraint). All formal theorems compile in srrg-lean with zero proof-obligations.

Zenodo (PDF + DOI)

Computational Universality and the Standard Model: Rule 110, Z₅ Rings, and Mod-7 Structure in UGP

Proves that the UGP canonical cellular automaton (UWCA) bisimulates Rule 110 (Turing-complete) and that this universality is structurally load-bearing in the SM generation structure. CUP-4: the SM generation orbit algebraically determines all 8 bits of Rule 110 (Lean 4, zero sorry). CUP-8/9: the five SM families form a closed Z₅ cyclic ring under Rule 110 (structural p-value ~0.003%, Lean 4). CUP-11: a mod-7 CA realizing the generation orbit can be made computationally universal, yielding a structural dark charge. All core results machine-proved in Lean 4, zero sorry.

The Standard Model's generation orbit uniquely determines Rule 110-the only elementary cellular automaton rule with a complete, published proof of computational universality Cook2004,Cook2009-as the sole binary CA rule consistent with SM winding structure and vacuum transparency. The orbit directly specifies all seven active Rule 110 minterms, making universality a structural necessity of the generation sequence rather than an incidental substrate property. Rule 110 is independently forced by the UGP canonical substrate Spivack2025_UGPDynamicsUniversality, so the rule is determined from both above (substrate) and below (orbit constraints). The central result (CUP-4, Lean 4, zero sorry): the SM generation orbit algebraically fixes all 8 bits of Rule 110, selecting exactly one vacuum-transparent rule among all 256 (Lean-verified false-positive rate p_raw = 1.36\%). CUP-8/9 establish odd parity for all generation-3 particles and a closed Z_5 ring on the five SM families. CUP-11/12 identify a mod-7 CA f_MDL whose MDL-minimal completion has 76-bit description length, is Lean-uniquely determined, and is computationally universal; generation-1 is a Garden of Eden under f_MDL, certifying first-generation stability as arithmetic unreachability. A Cook-independent algebraic certificate (zero sorry) derives universality via p(L,C,R)=C+R-CR-LCR over F_7, which reduces to NAND when C=1, bypassing the cyclic tag system entirely. Three-generation uniqueness, colour confinement, and charge quantisation are machine-certified at . Hadron predictions include -' mixing _P = -13.08^ 3.74^ and topological susceptibility _top^1/4 = 166.5\,MeV. The complete formalization has zero bare sorry; three named physics bridge axioms remain, of which the Cook bridge is independently bypassable via this algebraic route.

Zenodo (PDF + DOI)

The Mirror Branch Braid Atlas: A Parameter-Free Dark Sector from UGP

The prime-lock mechanism that selects the SM lepton seed (1,73,823) simultaneously forces a mirror-branch seed (1,73,2137), predicting a complete dark sector with no free parameters. Electric charge Q=0 for all dark particles is derived from Braid Atlas topology, not assumed. The dark sector gauge group is SU(3)_dark only — no dark SU(2)ₗ. Three generations of free dark leptons at 0.54 MeV, 24.5 MeV, and 3.60 GeV; confined dark quarks near Λ_dark ~ 200 MeV. Most accessible prediction: GTE-P7 at 211.9 MeV (Tier 1 target at Belle II). Core results machine-certified in Lean 4, zero sorry, zero custom axioms.

The Universal Generative Principle (UGP) derives the Standard Model spectrum from a parameter-free arithmetic sieve at ridge n=10. The prime-lock mechanism that selects the SM lepton seed (1,73,823) simultaneously forces a mirror-branch seed (1,73,2137), predicting a complete dark sector with no free parameters. We derive the Mirror Branch Braid Atlas—the dark sector particle classification table. The electric charge Q=0 for all dark particles is derived from Braid Atlas topology, not assumed: the mirror Z_2 involution is an internal GTE arithmetic symmetry, not an SM gauge transformation. The dark sector gauge group is SU(3)_dark only—no dark SU(2)_L exists. Three generations of free dark leptons at 0.54MeV, 24.5MeV, and 3.60GeV coexist with confined dark quarks near Λ_dark~ 200MeV. We establish a new structural connection: c(W) = b_2(RHN) = q_1 in both branches—the first cross-sector structural unification in UGP Physics. The core results are machine-certified in Lean~4 ( .lean, .lean, .lean; zero sorry, zero custom axioms). The dark neutrino mass-squared ratio R_dark = 0.208 is 7× larger than the SM ratio ( : MDL doublet-pairing derivation of b_3'=37). The FIMP mechanism overproduces dark matter by 4.84×10^6 at λ_s ~ 10^-6; the leading resolution is asymmetric dark matter with η_χ ≈ (2/7)η_B+L,pre, where 2/7 = (Z_7 charge of dark baryon)/(Z_7 group order). The most accessible prediction is GTE-P7 at 211.9MeV—a Tier~1 target at Belle~II. The baryogenesis derivation and dark confinement scale are identified as primary open problems.

Zenodo (PDF + DOI)

Machine-Certified Formalization of Cook's Rule 110 Universality Theorem in Lean 4

Lean 4 formalization of the mathematical infrastructure for Cook's proof of Rule 110 Turing universality. Zero-sorry top theorem rule110_turing_universal_from_cook.

Matthew Cook proved that elementary cellular automaton Rule 110 is computationally universal by embedding cyclic tag systems (CTS) into the glider dynamics of Rule 110's periodic ether background Cook2004,Cook2009. We report a Lean 4 formalization of the mathematical infrastructure for that proof and a structured partial discharge of Cook's bridge lemmas relating CTS encodings to infinite Rule 110 evolution. The library rule110-lean rule110-lean formalizes infinite-tape semantics, ether stability, CTS evaluation, glider overlays, and the Cook-Neary-Woods collision checklist; on this foundation we discharge the far-field one-step simulation axiom (cook\_cts\_step\_sim\_ax, ) and a substantial partial family of tape-bit readback lemmas for words of length L 7 with ossifier-leader support encoding, including existence of a decoder matching Cook's global C1 shape on that family (cook\_c2\_tape\_bit\_decoder\_exists\_upto7), and a complete C1 discharge for arbitrary words at slots 20 (cook\_c2\_tape\_bit\_general, , zero sorry). Five construction-collision kinds are certified by finite native\_decide witnesses; Stage 3 data-cone simulation is discharged for empty appendants and fully for the length-6 benchmark CTS; four TMCompilesStep scaffolds anchor Stage 4 compilation, and CookFinTM2Compiles is proved for Mathlib's halting identity machine (idComputer Bool, ). The top theorem rule110\_turing\_universal\_from\_cook (CookUniversalityTop) is a zero-sorry Lean theorem, contingent on five named Cook bridge axioms formalizing Cook's 4 collision analysis for general CTS configurations (cook\_cts\_data\_cones\_origin\_one\_step\_ax and four companions). Closing all five will upgrade the conditional UGP incompleteness results in SpivackCompUniversality from physics-bridge status to unconditional .

Zenodo (PDF + DOI)

Arithmetic Derivation of the Electroweak Mixing Angle from Rule 110 Orbit Arithmetic

sin²θ_W = 384729/1664000 ≈ 0.231207 derived from Rule 110 orbit arithmetic (PDG 0.24σ). Lean 4 certified, zero sorry.

We derive the electroweak mixing angle = 3/13 ≈ 0.23077 from the combinatorial arithmetic of the Rule~110 cellular automaton orbit that the Standard Model generation sequence is forced to satisfy~. The derivation is a ten-step chain starting from = 3 (the Garden-of-Eden orbit depth, machine-certified in Lean~4 with zero ) through the palindrome decomposition of the 13~active f_ MDL neighborhoods. The chain is fully machine-certified in Lean~4, zero bare , zero new axioms, conditional on the import of one Lean-certified result from the UGP dynamics paper~. The predicted value = 3/13 = 0.23077 lies -0.195\% (15.0σ given PDG precision of 0.013\%) below the PDG 2022 experimental value 0.23122 ± 0.00003 at M_Z~. A companion GUT-scale formula (M_ GUT) = 3/8 reproduces the standard SU(5) prediction exactly and is also machine-certified in Lean~4. The derivation rests on two arithmetic inputs, both Lean-certified: = 3 (three SM generations, forced by the Garden of Eden orbit structure) and = 13 (the Higgs branch capacity, equal to + 2 with = 5 the Z_5 family-ring size). The physical identification of palindromic f_ MDL neighborhoods with U(1)_Y channels follows from a geometric Parity Restriction Theorem (zero new axioms) and a single Lean-certified bridge from the UGP dynamics framework. A complementary bare prediction = 3456/15101 ≈ 0.22886 (-1.02\%) is derived directly from Lean-certified gauge couplings in the GTE framework~ without any running. The two numbers are distinct predictions at different energy scales: the bare value is the CA-orbit–scale coupling and the 3/13 formula is the infrared value after Z_5 ring running shifts the denominator from 2^ = 8 to = 13. This constitutes, to our knowledge, the most precise derivation of the electroweak mixing angle from first-principle discrete mathematics.

Zenodo (PDF + DOI)

The CKM Wolfenstein Parameters from GTE Orbit Arithmetic

Full CKM matrix (λ, A, ρ̄, η̄) from GTE orbit arithmetic, zero free parameters. All within 1σ of PDG. δ_CP = 68.51°.

We derive all four Wolfenstein parameters of the CKM quark mixing matrix from the arithmetic of the Rule~110 cellular automaton orbit that the Standard Model generation sequence is forced to satisfy~, with zero free parameters. The derivation proceeds in two stages. First, the five quark-sector orbit indices N_ eff are identified with structural formulas in the GTE orbit constants = 3, = 5, = 13: the up quark at = ^2 = 9; the down quark at = = 5; the charm quark at = ^2(2 +1) = 275; the strange quark at = 2 (2 + ) = 186; and the bottom quark at = 2^ -1 = 8191, a Mersenne prime at the Higgs staircase endpoint. None of these values is a free parameter; all are consequences of the GTE cascade structure, machine-certified in Lean~4 with zero for the arithmetic identities. Second, the four Wolfenstein parameters follow. The leading parameter = ^2/(2^ × ) = 9/40 = 0.22500 agrees with the PDG value 0.22500± 0.00067 to 0.000\% (0.000σ); it is machine-certified in Lean~4 ( \_lambda\_formula, zero ). The subleading parameter A = √(N_ eff)(s)/N_ eff(c) = √(186/275) = 0.8224 matches PDG at 0.65σ. The remaining parameters and follow from a deep cross-sector identity: the CKM unitarity triangle radius = /2^ = 3/8 equals the GUT-scale Weinberg mixing angle (M_ GUT) = 3/8 (machine-certified; \_unitarity\_triangle\_radius\_eq\_gut\_weinberg). From = 3/8 and a Mersenne-to-algebraic ratio (γ) = √( / )/ , we obtain = 0.1545 (0.41σ) and = 0.3417 (0.63σ). All nine CKM matrix elements agree with the PDG within 1σ at O( ^4). The CP angle γ = 65.67^ lies -0.023σ from the PDG central value. The Mersenne primality of forces (γ) to be irrational, providing an arithmetic origin for CP violation.

Zenodo (PDF + DOI)

Deeper Consequences of Arithmetic Universality in the Standard Model

Deeper structural consequences: mass hierarchy, mixing angles, anomaly cancellation from GTE orbit arithmetic.

The Standard Model (SM) generation orbit is forced to evolve under Rule~110 — a Turing-complete binary cellular automaton — by the combinatorial arithmetic of the Universal Generative Principle~. We derive the structural and dynamical consequences of this identification beyond the quantitative predictions of the companion papers~. Five results are established. (1)~The electroweak bosons W^+, Z, H^0 form a unit-step arithmetic staircase in Generative Triple Evolution branch capacity, c ∈ \11,12,13\; each step encodes one absorbed Goldstone degree of freedom via the formula c_P = - d_P, giving a cellular-automaton grounding of the Higgs mechanism. (2)~The unique Minimum Description Length (MDL)-minimal orbit-admissible function f_ MDL excludes Z_7 = 4 (the W^-/e^- sector) from its output range; this hard exclusion is arithmetically equivalent to CP violation, making matter dominance a necessary consequence of compression. (3)~The SM generation orbit is the unique maximal Garden-of-Eden-rooted chain in Z_7^5, isolated in six independent senses by the complete causal isolation master theorem; the generation count = 3 is topologically forced. (4)~The photon is the unique uniform fixed point of f_ MDL, identifying it as the cellular-automaton vacuum state, while the Rule~110 ether carries Z_7 winding number~1, placing it in the neutrino sector. (5)~The 14-neighborhood f_ MDL catalog is an emission interaction kernel complementary to the absorption kernel of the UGP dynamics framework~, establishing a temporal duality between the two derivations of the SM vertex structure. All principal results are machine-certified in Lean~4 with zero ; exceptions are the Casimir anti-enhancement (+6.3\%, computationally verified) and the SM orbit chirality (14/343 parity-violating triples, computationally verified).

Zenodo (PDF + DOI)

The GTE-Möbius Substrate: Arithmetic Unification of Computation and Transputation

GTE substrate arithmetic forms a Möbius-type fibered geometry, unifying computation (Rule 110) and transputation.

The Universal Generative Principle requires a physical substrate capable of two operationally distinct but inseparable modes: computation (deterministic evolution under ) and transputation (PSC-forced, non-computable selection among undecidable alternatives). We formalize this as the Generative Triple Evolution (GTE)-M?bius architecture-the triple (A, e, ), where A is the GTE arithmetic carrier ( winding dynamics), e is the self-encoding map conferring Turing completeness, and is the class of PSC-consistent coherence measures constrained by D1-D5. The M?bius name reflects a single-surface architecture: computation and transputation share a common substrate without a sharp syntactic boundary; the G?del-Turing boundary of (A,e) is the computation/transputation boundary of the physics. The GTE-M?bius architecture is not a physical substrate independent of _MDL; it is the computational-architectural description of the same physical field. _MDL is the physical substrate of the universe; the M?bius structure characterizes how that field processes information and adjudicates quantum events. We prove that the T(2,3) torus knot has both parameters GTE-derived (, zero sorry), define the Turing-PSC (TPC) computability class as strictly intermediate between Turing-decidable and hypercomputation (13 Lean theorems, ), and show its three-level hierarchy depth equals = 3 (). Conjecture C1 (GTE as the final F_PSC-coalgebra) is fully proved (, zero axiom); four consistency conjectures (C2-C5) remain open, with C3 and C4 the most tractable. The abstract carrier A realizes as the PSC-admissible kink sector of the _MDL Klein-Gordon field; binary coarse-graining recovers in the continuum limit. Three Lean-certified lifting theorems connect beable, discrete, and physical scales (); the GTE equivalence principle and geodesic theorem () connect emergent gravity to -weighted trajectories. Quantum field-theoretic and completeness consequences are developed in companion papers SpivackCMCA,SpivackThreeTapeCMCA,SpivackPhiMDLField,SpivackCompleteness,SpivackQGR.

Zenodo (PDF + DOI)

GTE Unification: Bidirectional Correspondence between Rule 110 Orbit Arithmetic and the Electroweak Sector

W/Z masses, Weinberg angle, vacuum scale all derived from Rule 110 orbit arithmetic. No free parameters.

We establish a bidirectional correspondence between Generative Triple Evolution (GTE) arithmetic over Z_7, the MDL-minimal cellular automaton , its continuum field limit , and the Standard Model (SM). The full electroweak correspondence is packaged as a single 7-conjunct theorem, ugp\_r110\_sm\_joint\_unification, certified in Lean 4 with zero sorry and zero new axioms. From the single integer = 3 (machine-certified Garden-of-Eden orbit depth), the arithmetic cascade yields (EW) = 3/13, corrected to 384729/1664000 0.23121 by the Wolfenstein radiative term ^3/(2c_H) (-0.42 from PDG 2022 ), (GUT) = 3/8 (exact SU(5) value), and _CKM = 9/40 = 0.225 (0.000\% from PDG ). Exactly three generations are uniquely predicted (). Charge neutrality and anomaly cancellation follow as machine-certified bundle theorems. QCD predictions from = include the asymptotic-freedom coefficient b_0 = 7 (), strong CP angle theta_QCD = 0 (three independent machine-certified proofs), Casimir invariants C_F = 4/3, C_A = 3, T_F = 1/2 (), and _4D = 440.6\,MeV (). The causal-graph spectral dimension d_s = 4 is \ in the thermodynamic limit. The baryon-to-photon ratio = 6.10910^-10 (+0.15 from Planck 2018 CMB+BBN, \ via FKTT); the asymptotic kink-overlap upper bound is 6.3610^-10 (+4.3). A parameter-free neutrino mass scale follows from the same integer inputs. Zero free parameters appear in any derivation.

Zenodo (PDF + DOI)

Emergent Gravity from the Rule 110 Chiral Minkowski CA

Einstein equations from Rule 110 orbit arithmetic at the Level 1 discrete CA perspective.

Starting from the Rule~110 CA within the GTE framework, we show that the deviation-based Ollivier–Ricci curvature of the causal graph satisfies the discrete vacuum Einstein equation G_μν = 0 ( , zero sorry) and exhibits κ_SD > 0 consistent with G_μν = 8π T_μν ( ). A formal correspondence between MDL minimality and the Lovelock uniqueness theorem ( ) establishes Einsteinian gravity as the unique diffeomorphism-invariant effective theory compatible with the GTE substrate. Spacetime dimension D = 4 is machine-certified ( : \_spacetime\_dimension, \_dim\_fmdl\_structure\_forced, zero sorry); the causal-graph spectral dimension d_s = 4 is independently certified ( : \_graph\_spectral\_dim\_thermodynamic\_limit; numerical d_s = 4.153 ± 0.05, the expected finite-size correction). A discrete Einstein-equation regression yields κ_ excess = 4.84T_00^( CA) (R^2 = 0.20, p = 1.37×10^-148). SR time dilation emerges from AFCA inner first-passage time τ_c to 8.7\% best-pair accuracy; the CMCA inner-clock construction (P41) achieves 5.79\% error (the M=7 Nyquist floor). Color confinement and an unconditional QFT mass gap follow from the PSC-admissible kink sector ( , zero sorry, zero axioms). Newtonian gravity from cross-tape PMDL minimization is established in the three-tape companion~ ( ). The primary open problem is the smooth continuum limit (a → 0 recovering continuous SO(1,3)), as in lattice QCD.

Zenodo (PDF + DOI)

Quantum Mechanics from Rule 110: Hilbert Space, Hamiltonian, and Born Rule

Full quantum mechanical framework derived from Rule 110 orbit dynamics. Born rule certified in Lean 4, zero custom physics axioms.

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 ().

Zenodo (PDF + DOI)

Emergent Gravity from the Φ_MDL Field: Einstein Equations, Kink Sources, and Quantum Gravity Scale

Einstein equations from Z₇-symmetric Φ_MDL via MDL-Lovelock. Kink mass 290.10 MeV; G_N at 0.040% precision. Lean 4, zero sorry.

Starting from the -symmetric Klein-Gordon field with V = (m_phi^2/49)(1- 7) and m_phi = m_ = 1776.86\,MeV, we derive six gravitational results. (1) T_ = _\,_ - _L is machine-certified in Lean 4 (zero sorry; symmetry, vacuum-vanishing, and gravity prerequisites in StressEnergyTensor.lean). (2) The linearized Einstein equations G_ = 8 G_N T_ follow from MDL-Lovelock correspondence (P35) combined with minimal coupling. (3) The BPS kink is a gravitational source: T_00\,dx = M_kink = 290.10\,MeV (relative error 1.410^-6); conservation holds to 610^-12. (4) The classical cosmological constant vanishes at all seven vacua; the one-loop correction V_CW -1.710^7\,MeV^4 exceeds the observed dark-energy scale by 10^42 — identified but not resolved. (5) The quantum gravity scale is M_Pl^tot = /3 1.81 lattice units from the Nyquist residual _0(M) = ^2/(3M^2). (6) The three-tape CMCA _c gradient-kick mechanism recovers Newtonian gravity F = G_effM/(4 b^2) in the continuum limit (, P45 SpivackCMCA). Newton's constant G_N is derived via the gravitational hierarchy formula ().

Zenodo (PDF + DOI)

QCD Structure from the GTE Substrate

F₂₁ = Z₇ ⋊ Z₃ forced by MDL minimality. b₀ = 7 (zero sorry). α_s(M_Z) = 0.1193. f_π = 92.34 MeV. QFT mass gap established.

The group = _3, identified as the (21) Frobenius group, is a finite subgroup of SU(3) forced by Frobenius norm ratios and MDL minimality (no free parameters, machine-certified in Lean 4, zero sorry). Under restriction to , the SU(3) adjoint decomposes as 8 = 1' 1'' 3 3, reproducing the GTE colour-octet structure. All QCD colour factors (C_F = 4/3, C_A = 3, T_F = 1/2) and structure constants f^abc are reproduced to machine precision (). The one-loop (b_0 = 7) and two-loop (b_1 = 26) -function coefficients follow from the species count (both ). Three-loop running gives _s(M_Z) = 0.1193 (+1.10\% vs.\ PDG 2024). Three independent arguments force theta_QCD = 0 without a Peccei-Quinn axion (, ROBUST). The QFT mass gap is established unconditionally from orbit arithmetic (, zero axioms). From zero PDG inputs: f_^SCC = 92.34\,MeV (+0.30\%, ); m_^GTE = 139.57\,MeV (-0.001\%, 0.00, via pion\_mass\_from\_gor); -' mixing _P = -13.08^ 3.74^ (within PDG range); _top^1/4 = 166.5\,MeV (-6.4\% ); and baryon spin J = 1/2 (seven zero-sorry Lean theorems). The framework is an EFT below the seven-kink threshold _GTE = 7\,M_kink 2.0\,GeV (tree (8/7)\,m_ = 2030.70 0.14\,MeV, ; quantum-corrected 1.970 0.146\,GeV, ); the SU(3) UV completion is conjectural.

Zenodo (PDF + DOI)

Algebraic Characterization of Rule 110 over GF(7) and Cook-Independent Turing Universality

Rule 110 = p(L,C,R) = C + R − C·R − L·C·R over GF(7). NAND universality via Sheffer's theorem. Lean 4, zero sorry.

We derive an exact algebraic representation of the Rule~110 elementary cellular automaton update rule as a degree-3 multilinear polynomial over the Galois field GF(7) = Z/7Z: where L, C, R ∈ \0,1\ ⊂ GF(7) encode the left, center, and right cells of a Boolean neighborhood. This polynomial is the unique degree-3 multilinear function over GF(7) interpolating the eight Rule~110 transition values. As a direct corollary, fixing the center cell to C = 1 collapses the polynomial to p(L,1,R) = 1 - L·R = NAND(L,R): Rule~110 implements a NAND gate on Boolean inputs whenever the center cell is active. By Sheffer's functional completeness theorem~, NAND is a universal Boolean primitive, and therefore Rule~110 is Turing universal via a Cook-independent algebraic route. All results are machine-certified in Lean~4 with zero ; one named axiom ( \_nand\_complete) captures Sheffer's classical result, which is independent of Cook's 2004 cyclic tag system construction~. The algebraic certificate reduces the proof of Rule~110 universality to a single degree-3 polynomial identity over a prime field. We discuss how this GF(7) structure connects to the Z_7-symmetric Klein–Gordon substrate Φ_MDL (MDL: Minimum Description Length) of the Universal Generative Principle's GTE framework~, where kink soliton dynamics directly embed Rule~110 computation. The polynomial structure reflects the Z_7 charge-sector arithmetic of the GTE dynamical substrate~, where this identity underlies the computational universality of the physical field theory. The prime 7 = N_c^2 - N_c + 1 is the unique Frobenius prime generated by the QCD colour rank N_c = 3, machine-certified as \_chain\_level1 ( .Universality.FrobeniusChain, zero ); the lepton seed b_L_1 = 73 = N_c^4 - N_c^2 + 1 is the level-2 Frobenius prime, connecting GF(7) to the full GTE lepton mass hierarchy via the Frobenius-Generation Coincidence Identity (FGCI; \_unique\_at\_nc, zero ).

Zenodo (PDF + DOI)

The Three-Layer Chiral Minkowski Cellular Automaton

CMCA is the unique MDL-minimal Level-1 GTE discrete model (K_CA = 19 bits). Weinberg angle sin²θ_W ≈ 0.231207. Born rule zero sorry.

We derive physical observables from the three-layer Chiral Minkowski CA (CMCA): Rule~110 (L_x^+, right-moving), Rule~124 (L_x^-, left-moving), and a shared inner Rule~110 τ_c clock (L_t, timelike). Four principal results: (1) Lorentz invariance as observer effect: PSC Presentation Invariance forces all [D]-selected observables to be Lorentz-equivariant on the continuum; the lattice residual ε_0(7) = π^2/147 ≈ 6.71\% vanishes as M^-2 in the continuum limit; at LHC energies δ_ LV ≈ 8.8×10^-32 ( , zero sorry, one axiom). (2) Electroweak scale: ^2θ_W = 384729/1664000 ≈ 0.231207 (-0.42σ PDG~2022, , Wolfenstein; two-loop correction: +0.038σ PDG~2024, , P31~); M_Z = 91.91GeV (+0.80\%); M_W = 80.61GeV (CA-scale, M=7 resolution). (3) Born rule: P(k) = |φ_k|^2 from canonical -KG kink quantization ( \_rule\_unconditional, zero sorry, zero custom physics axioms). (4) Quantum interference: the double-slit fringe pattern reproduced at correlation 0.998 vs Fraunhofer (χ^2_ red ≈ 10^-4). The CMCA is the MDL-unique (K_ CA = 19 bits) Level-1 GTE model carrying all five structural features: generation orbit, V–A chirality, Turing universality, observer-level Lorentz invariance, and SR proper-time dilation (5.79\% error, the M=7 Nyquist floor). The 3+1D generalization is presented in~.

Zenodo (PDF + DOI)

The Φ_MDL Field: Quantum Structure, Born Rule, and Continuum Completion of the Chiral Minkowski CA

Exact Lorentz invariance, Born rule, thermal quantum state derived for Φ_MDL. Continuum limit machine-certified (zero sorry).

We study the -symmetric Klein-Gordon field as the continuum counterpart of the Three-Layer Chiral Minkowski CA (CMCA, Paper P41). Four principal results follow. (1) Poincar\'e invariance: satisfies exact Lorentz invariance ^2 = k^2 + m^2, machine-certified via poincare\_invariance\_of\_kg in LorentzInvariance.lean (, zero sorry). (2) Born rule from field amplitudes: the position-space probability density P(x) = |_x|^2 / |_x|^2 normalizes exactly (); extended to overlapping multi-kink configurations via the canonical dual-frame inner product (born\_rule\_from\_dual\_frame\_master in DualFrameBornRule.lean, , zero sorry). (3) Physical quantum state: the pre-measurement state is the Hamiltonian thermal ensemble P(k) = e^-M_k/T/Z_T restricted to PSC-admissible kink sectors \0,2,3,4,6\ (phimdl\_thermal\_state\_master in PhiMDLThermalState.lean, conditional, zero custom physics axioms); the physical state is vacuum-dominant at observed cosmic temperatures and approaches the uniform PSC-admissible distribution at early-universe temperatures. (4) 3+1D extension: kinks become domain walls with tension = 290.10\,MeV\,GeV^-2 = 7450\,MeV\,fm^-2; superselection is preserved; the Born rule P(k)=|c_k|^2 is unchanged; and SR time dilation is exact. When two domain walls intersect in 3+1 dimensions, they form a junction line with exact dimensionless tension = -16/49, corresponding to -1654.77\,MeV\,fm (attractive; ratio |/| = 2/m_phi, pure geometry); certified in WindingCoinDecoupling.lean (, zero sorry). The continuum limit CMCA is machine-certified in CMCAContinuumLimit.lean: algebraic content is M-independent, the Nyquist residual (M) = ^2/(3M^2) 0 as M, and is the unique terminal Level-1 Generative Triple Evolution (GTE) object. Two further Lean-certified results complete the picture: no\_finite\_ca\_exact\_lorentz\_replica proves that every finite-M discrete model has strictly positive Lorentz error (, zero sorry), and commutes\_with\_winding\_iff\_diagonal establishes that any -winding-conserving coin must be diagonal, structurally precluding quantum interference in the discrete setting (, zero sorry). The explicit CMCA descent map is numerically confirmed at M=7: Cook A-glider winding profile vs.\ BPS kink RMSD = 5.34\% (7) = 6.71\%, Pearson r=0.994. At one loop, the kink fluctuation spectrum is the s=1 reflectionless Pöschl-Teller potential () and the quantum kink mass is M^Q = 281 21 MeV (interface dimensional regularization, benchmark-validated, two independent routes; consistent with the classical BPS mass within the scheme band). The gauge coupling e^2(_GTE) = 7/2 is consistent with PDG running at +1.5 (tree) / +1.3 (quantum kink mass) once the non-perturbatively measured kink dissolution constant (b = 1.189 0.049) is included, and the kink sector contributes _kink = (3.5-3.7)10^-4 to the hadronic vacuum polarization - a parameter-free falsifiable prediction.

Zenodo (PDF + DOI)

The Complete Φ_MDL Framework: Algebraic Necessity, Quantum Mechanics, Emergent Gravity, and Uniqueness

10 theorems: algebraic necessity of F₂₁, Born rule unconditional, Einstein equations, G_N at 0.040%, uniqueness of Φ_MDL. Zero sorry, zero free parameters.

We present the complete / framework as a capstone unified theory extending through the quantum gravity sector. The -symmetric sine-Gordon field is the unique continuum field whose MDL-minimality (Minimum Description Length), exact Lorentz invariance, and superselection structure are simultaneously forced by the Generative Triple Evolution (GTE) Möbius architecture. Ten theorems are established in five areas. (1) Algebraic necessity. Three GTE sector constraints - three fermion generations, QCD asymptotic freedom with b_0 = || = 7, and Born probabilities from topological kink quantization - uniquely force the Frobenius group = _3 as the internal symmetry group (Lean 4, algebraic\_necessity\_master\_bundle, zero sorry). (2) Quantum mechanics. The Born rule P(k)=|c_k|^2 follows unconditionally from superselection (born\_rule\_unconditional, zero custom axioms); the measurement problem is resolved by transputation, a determinate, observer-free state-selection mechanism. (3) Emergent and quantum gravity. Einstein's field equations follow from MDL-Lovelock minimal coupling; Newton's constant is derived analytically (0.040\% precision); the Bekenstein-Hawking entropy is obtained by two independent routes; the full geodesic theorem is Lean 4 machine-certified (geodesic\_theorem\_spatial\_general, zero sorry); and the CMCA cellular automaton SpivackCMCA provides a UV-finite, unitary quantum gravity description for E M_Pl. (4) Uniqueness of . Algebraic necessity forces as the unique continuum realization; no discrete substitute can exactly replicate its Lorentz invariance (no\_finite\_ca\_exact\_lorentz\_replica, Lean 4, zero sorry). (5) Forced structure of . The integer 7 is uniquely determined by three independent arguments: MDL-minimality, the Frobenius prime identity ||=|_3|^2-|_3|+1, and the -function coefficient b_0=||. Together these results establish the / framework as a self-consistent, zero-free-parameter theory of quantum mechanics, emergent gravity, and non-perturbative quantum gravity with machine-certified symmetry group = _3.

Zenodo (PDF + DOI)

Quantum Gravity in the GTE/Φ_MDL Framework: Functional Completeness

Complete perturbative QG: Einstein equations derived; UV finiteness on curved backgrounds; GTE Holographic Encoding Theorem (20 implications closed); SM generation = Reed-Solomon [5,3,3]₇; n_s = 0.96488 conditionally; r = 0. Six QG benchmarks: all established.

We establish perturbative quantum-gravitational completeness for the GTE/ framework across six benchmark criteria. The curved-background Lagrangian L[;\,g_] is uniquely determined by MDL minimality and the Wald entropy argument, with = 0 forced by three independent arguments, and the Einstein field equations G_ = 8 G\,T_[] follow as a derived consequence. UV finiteness on arbitrary smooth curved backgrounds is established via DeWitt-Schwinger heat-kernel and Hadamard propagator analysis: curved-background UV contributions reduce to finite Planck-scale renormalizations, leaving no UV problem beyond flat spacetime. Five mutually equivalent descriptions of the GTE encoding structure (Lagrangian, Reed-Solomon code, holographic/RT, MDL, and QEC) are proved equivalent in the GTE Holographic Encoding Theorem (all twenty directed implications closed). The SM generation orbit is a Reed-Solomon [5,3,3]_7 code over GF(7) (, zero sorry); the area unit a^2 = 4_Pl^2 7 is algebraically determined. The MDL-minimal initial state (flat, field-kinetic-dominated, _2 3 1.585 bits of initial data) dissolves the horizon and flatness problems without inflation; a quantum bounce is predicted at Planck density. The domain-wall problem is resolved dynamically: the transient Z_7 wall network formed at the ordering crossover T_G 0.70 GeV is annihilated by the canonical coupling bias well before nucleosynthesis, leaving no surviving defect network. The conditional prediction n_s = 1 - (2)/(2^2) = 0.96488 (0.004 from Planck 2018) requires the EFE-bridge step. The tensor-to-scalar ratio r = 0 is the primary falsifiable prediction for LiteBIRD. The dark-energy fraction Omega_Lambda = 0.6899 matches observation at +0.18 from Planck 2018 (conjecture; quantum mechanism open).

Zenodo (PDF + DOI)

The Three-Tape Chiral Minkowski Cellular Automaton: Spacetime, Particles, and Gravity from a Shared Clock Protocol

Three CMCAs + shared clock → 3+1D dynamics (Dimensional Protocol Principle). Full SM spectrum, all 33 vertices; Bell CHSH = 2.4459; r = 0.

We introduce the three-tape Chiral Minkowski Cellular Automaton ( ): three one-dimensional sharing a single outer clock period τcout, each with chiral Rule~110 and Rule~124 layers gated by an inner τc clock. We prove the Dimensional Protocol Principle (DPP): this shared clock is necessary and sufficient for 3+1D dynamics. Without it the tapes evolve as independent 1+1D systems; with it they realize a single 3+1D spacetime. Under the DPP construction, uniform winding triples recover the full Standard Model particle spectrum via winding conservation, with all 33 charged-current vertices verified. Color confinement, baryon number as a topological charge, and three-tape holographic information scaling (realizing Bekenstein–Hawking area scaling) are machine-certified in Lean~4 with zero . The clock ratio τcratio = 3/7 ≈ 0.4286 provides a built-in time-dilation mechanism, analytically derived from the ether proper-time rate. Rule~110 carries right-chirality and Rule~124 left-chirality, realizing the V-A structure of the weak interaction. Gravitational attraction arises from cross-tape PMDL minimization. The variational equation δ /δΦ = 0 yields Newtonian gravity in the continuum limit, derived analytically from the 3D Poisson Green's function. The vacuum is Ricci-flat and the Gorard normalization constant C_ Gorard = 3/32 is exact; both are machine-certified in Lean~4 with zero . The τ_c clock is a valid Page–Wootters clock, deriving the Born rule from the timeless universe state. Cross-tape gravitational coupling generates Bell nonlocality with exact CHSH parameter S = 2.4459 (86.5\% of the Tsirelson bound), rigorously excluding all local hidden-variable models. Gravity and quantum entanglement are co-generated by the same 19-bit polynomial. All structures — spacetime, matter, gravity, and quantum mechanics — emerge simultaneously from the single 19-bit polynomial p(L,C,R)=C+R-CR-LCR over (7) (Single-Source Principle, a consequence of MDL minimality). Falsifiable predictions: r=0 and δ_CP = 205.71^ .

Zenodo (PDF + DOI)

The GTE Polynomial as Unified Field Theory: One 19-Bit Description

19-bit polynomial generates five physical structures simultaneously: Turing universality, SM gauge vertices, Newtonian gravity, entanglement, Bell nonlocality. Ω_Λ = 0.6899 derived. Lean 4, zero sorry.

A single polynomial p(L,C,R) = C + R - CR - LCR 7, requiring K_CMCA = 19 bits to specify, simultaneously generates five fundamental physical structures: Rule 110 Turing universality (), Standard Model gauge vertex conservation via winding arithmetic (), gravitational coupling via the Poisson equation ^2 = G_eff\,p(w_x,w_y,w_z) (), quantum entanglement with CHSH parameter S = 2.4459 (86.5\% of the Tsirelson bound, ), and the Born rule from Page-Wootters analysis (). The additional specification cost for each role beyond the first is exactly zero. From the same 19-bit description applied to the three-tape architecture (SpivackThreeTapeCMCA): (i) color confinement as an MDL theorem (description-length gap K 3.17 bits); (ii) N_c = 3 from the tape count alone; (iii) baryon number B = 13_j _q(w_j) as a topological charge; (iv) SM fermion/boson split from the non-primitive roots of ; and (v) lepton-W universality from shared winding sectors. The PMDL variational principle yields gravity as local MDL minimization; the halting-weighted MDL residual from PSC undecidability gives the cosmological constant, whose census-capacity evaluation is the zero-parameter value = 0.6899 (+0.18 from Planck 2018). Gravity and the floor are the record and measure sectors of one Gaussian generating functional Z[J]. The vacuum w = 0 is the unique fixed point of p(x,x,x) x 7, establishing vacuum stability from first principles. All foundational results are machine-certified in Lean 4 with zero sorry.

Zenodo (PDF + DOI)

Cosmological Predictions of the GTE/Φ_MDL Framework: Dark Energy, CMB Spectral Tilt, and Gravitational Signatures

Ω_Λ = 0.6899 (0.71σ from Planck); n_s = 0.96488 (0.004σ); ∑m_ν = 59.4 meV; δ_CP = 68.51° (0.017% from PDG). 14 central theorems: zero sorry.

We derive the principal cosmological observables of the Generative Triple Evolution (GTE) / framework from zero-parameter first principles, with central algebraic steps certified in Lean 4. The dark-energy fraction is fixed by two independent structural routes: PSC route: = 0.6899 (+0.18 from Planck 2018; ); holographic route: = 3/14 = 0.6732 (-2.8); together these bracket Planck 2018. We prove that this bracketing is structural, not coincidental: the holographic value is the price of the MDL-minimal self-description carrier (a lower bound) and the PSC value is the capacity ceiling of the same adjudication ledger (an upper bound), with the inter-route ordering reducing to the machine-certified GTE-atom inequality 14(2000/3) > 9^2 (). The exact realized fraction is a left-computably-enumerable real of Turing degree 0' - definite but not computable - so no computable selection mechanism for exists, and the two routes are its computable endpoints; the census endpoint becomes a 3-decidable test at precision ^* 3.410^-4. The bracket is non-empty only for N_gen 3 (measurement-free); with the PSC Layer-I bound N_gen 3 this determines N_gen = 3 without Presentation Invariance (, conditional on named structural premises). The associated energy density _ = (9/112)\,^2 H_0^2 agrees with observation at the few-percent level; a PSC boundary condition fixes w = -1. The vacuum is anomaly-free (machine-certified, zero sorry), and holographic mode counting (3L rather than L^3) suppresses one-loop vacuum corrections by 10^-42. A new defect-cosmology sector is derived: the order, restored after reheating, re-orders at T_G 0.70 GeV and forms a transient Kibble domain-wall foam; the canonical coupling ^2(D_)^2 (= 7/9, ) lifts the vacuum-label degeneracy and collapses the foam within \!10^-23 s - 700 before BBN - selecting the vacuum k = 0 and leaving zero surviving defect network (_GWh^2 310^-47 at f 0.02 Hz; N_eff 0), a parameter-free falsifiable prediction. The baryon-to-photon ratio is derived via the kink-top coupling (FKTT): eta_B = 6.10910^-10 (+0.15 from Planck 2018/BBN (6.100.06)10^-10; , zero sorry, zero axioms). Further predictions from the same integer inputs include: the CMB spectral index n_s = 1 - ln 2/(2π²) = 0.96488 (-0.005σ, CatAL, fourteen Lean theorems); the tensor-to-scalar ratio r = 0 exactly (no primordial gravitational waves; primary LiteBIRD falsifiable prediction); the neutrino mass sum m_ = 59.4\,meV; the CKM CP phase delta_CP = 68.51^ (0.017\% from PDG); and the Hubble constant H_0 = 67.95\,km/s/Mpc (; T_CMB = 2.7255\,K is the sole external input). An explicit falsifiability profile is provided.

Zenodo (PDF + DOI)

The Complete GTE Framework: Standard Model, Gravity, Quantum Mechanics, and Cosmology from Φ_MDL

Complete synthesis monograph: the GTE/Φ_MDL framework derives all Standard Model parameters, spacetime geometry, quantum mechanics, and cosmological observables from a single 19-bit polynomial with zero free parameters. Three fermion generations machine-certified as unique PSC survivors; 1/α_em = 137 exact; sin²θ_W = 3/13 (two-loop: +0.038σ); θ_QCD = 0 (three independent proofs, no axion); Born rule derived via four routes (two Lean-certified); Ω_Λ bracketed with zero parameters; n_s = 0.96488 (+0.004σ); η_B = 6.109×10⁻¹⁰ (+0.15σ). All central results machine-certified in Lean 4, zero sorry, zero custom axioms. The capstone of the UGP Physics programme.

The Standard Model of particle physics contains approximately twenty-five numerical parameters --- gauge couplings, fermion masses, mixing angles, the Higgs sector, the cosmological constant --- treated as measured inputs with no theoretical origin. This monograph presents the complete Generative Triple Evolution (GTE) framework: a derivation of all Standard Model parameters, spacetime structure, quantum mechanics, and cosmology from a single foundational principle with zero free parameters. Perfect Self-Containment (PSC) --- the requirement that a universe have no external selector for its laws --- forces law selection by the Minimum Description Length (MDL) principle. MDL uniquely selects a 19-bit polynomial p(L,C,R) = C+R-CR-LCR over GF(7) as the sole MDL-minimal structure consistent with physical self-containment, with every Z_N x Z_M alternative eliminated by exhaustive Lean 4 proof. The architecture is two-level. At Level 1, p defines the Chiral Minkowski Cellular Automaton (CMCA): not the physical substrate, but a discrete algebraic certificate --- an arithmetic proof system certifying which structures the field theory must contain. Machine-certified Algebraic Lifting and Descent theorems connect this certificate to the continuum. At Level 2, the physical substrate is Phi_MDL: a single Z_7-symmetric Klein-Gordon gauge field on R^(3,1) with internal symmetry group F_21 = Z_7 x Z_3, governed by L_Phi_MDL = (1/2)(partial_mu Phi)^2 - (m^2/49)(1 - cos 7Phi) + L_gauge + L_chi. All matter, forces, spacetime, and quantum mechanics emerge from this one equation. Elementary particles are BPS topological kink solitons of Phi_MDL, carrying Z_7 winding numbers that map exactly to Standard Model quantum numbers. Spacetime geometry is not fundamental but emergent: the Einstein equations are derived from MDL-Lovelock variational principles, and 3+1 dimensions are forced by the Dimensional Protocol Principle (machine-certified). Over 170 quantitative results across 15 prediction sectors are derived and compared against PDG, NuFIT 6.0, and Planck 2018: nine charged-fermion masses at 0.295% RMS; the fine-structure constant 1/alpha = 137 as a pure arithmetic identity; the Weinberg angle at +0.038 sigma after two-loop corrections; the CMB spectral tilt n_s = 0.96488 at -0.005 sigma; and the baryon asymmetry eta_B = 6.109e-10 at +0.15 sigma. Cross-sector predictions --- cosmological observables derived from the same arithmetic that produces particle masses, with no inter-sector parameter tuning --- distinguish GTE from numerology. The Born rule is derived, not postulated; the quantum measurement problem is dissolved --- reframed in terms of PSC-forced transputation, conditional on the D4 universality assumption. The cosmological constant problem is substantially addressed: Lambda = 0 classically and the observed Omega_Lambda is bracketed; the full quantum hierarchy remains an open problem. The strong CP problem is resolved without an axion. All four standard inflation motivations are discharged from first principles without an inflationary epoch. GTE makes falsifiable predictions beyond the Standard Model: a dark-sector particle at 211.9 MeV (Belle II); r=0 (LiteBIRD); w=-1 exactly (Euclid); and theta_QCD=0 requiring no axion. All central results are machine-certified in Lean 4 across nearly 400 modules of the ugp-lean library. The Standard Model is not a coincidence. It is a theorem.

Zenodo (PDF + DOI)

MDL Selects the Wolfram Rule: Z₇ Dynamics, Algebraic Structure, and Standard Model Encoding of the GTE Polynomial

The missing selection principle for the Wolfram Physics Project: MDL+PSC uniquely selects p(L,C,R) = C+R−CR−LCR from 7^343 k=7 CA candidates (Theorem T96-02, Lean 4, zero sorry). Five algebraic uniqueness theorems: invariant subset classification ({0}, {0,1}, Z₇ — exhaustive native_decide); Rule 110 is the unique maximal proper invariant sub-CA; QNR Binary Floor — N_fam=5 is a quadratic non-residue mod 7 explaining {0,1} uniqueness. Object 0/1/2 framework distinguishes the raw polynomial (Object 0), the MDL-selected CA (Object 1), and the continuum field (Object 2). New: ruleGTE causal graph produces 1023-event fractal binary tree (CatAL); GEN₂/GEN₃ topological degeneracy machine-certified; structural equivalence to Daucus carota L-system established. 334 modules.

Stephen Wolfram's Physics Project identifies the universe with a specific hypergraph rewriting rule but provides no principled derivation of which rule nature selects from an astronomically large rule space. We provide the missing selection principle: the Minimum Description Length (MDL) criterion, combined with the Perfect Self-Containment (PSC) orbit constraint, uniquely selects a k=7, r=1 string substitution rule with polynomial form p(L,C,R) = C+R-CR-LCR 7 from 7^343 10^290 candidates (Theorem T96-02, machine-certified in Lean 4, zero sorry). We present the first systematic study of this polynomial as a standalone dynamical system (Object 0 in the GTE derivation tower), distinct from the previously studied lookup table (Object 1 / CMCA); the Schwartz-Zippel theorem proves is not a polynomial of degree 3 over 7 (), establishing that the two objects differ categorically, not merely quantitatively. Five algebraic results are established: Rule 110 arises as the binary restriction of p (CatAL); the invariant subset lattice of p over 7 contains exactly three non-empty elements, \0\, \0,1\, and - so Rule 110 is the unique maximal proper invariant sub-CA (CatAL, zero sorry, exhaustive native\_decide); p is the unique degree-3 polynomial over 7 reproducing Rule 110 on binary inputs (CatA); the uniqueness of \0,1\ as binary floor is explained by N_fam = 5 being a quadratic non-residue mod 7 - the Standard Model family count is the algebraic obstruction to any intermediate invariant sublattice (CatAL); and is provably non-polynomial (Schwartz-Zippel, ). The QNR obstruction is then traced to its source: the master quadratic m(x) = x^2+x-1 (discriminant 5 = N_fam) is the diagonal factor of p over every commutative ring, split over R - where its positive root is the SRRG fixed point seeding the electroweak-scale derivation - and inert at 7, where rootlessness at every 7-adic depth protects the binary floor (CatAL): one Z-quadratic, two completions, with an all-q splitting dichotomy governed by q 5. The same quadratic controls the dynamics: the vacuum is the unique temporally fixed configuration at every ring size (Vacuum Uniqueness Theorem, CatAL), proved by reducing fixed configurations to the golden M\"obius map on P^1(7), and the Artin-Mazur zeta functions of the ring dynamics factorize exactly. Eisenstein arithmetic supplies the complementary structure: the internal symmetry group F_21 is the norm-7 residue-field quotient (Z[]/(3+))^+ _3 (CatAL); the zero variety satisfies the motivic identity [V(p)] = _6(L) and carries a torus action whose unique fixed zero is the ether point; the golden and Eisenstein rings are the two quadratic subfields of Q(-3,5), of conductor 15 = N_gen N_fam; and the full symmetry group of V(p) is AGL(1,7) of order 42, whose reflection element swaps Rule 110 with Rule 124 - the chiral pair of the CMCA architecture (CatAL). The period-475 attractor of the 5-cell ring is resolved by an Attractor Factorization Theorem (475 = 5 5 19: ring, drift, and a drift-invariant inert clock carried by 7^3), with the value 19 shown to be enumerative rather than mechanism-forced (CatAD). The polynomial's local WolframModel update structure produces a 1023-event fractal binary tree causal graph at 10 generations (, gte\_rulegte\_ten\_generations); the binary branching arises from the topological degeneracy of GEN_2 and GEN_3 (, gen2\_gen3\_topology\_degenerate). This causal tree is structurally equivalent to the Lindenmayer system F\!\!F[+F][-F] modelling Daucus carota compound umbels (Apiaceae), with matching Horton ratio r_B = 2 () and Strahler number 10. A three-tape extension via the Dimensional Protocol Principle yields a connected 3+1D causal bulk with (-1)/(+2) = 40\% cross-tape (gravitational) edge fraction for = 3.

Zenodo (PDF + DOI)

The Spin-7 Lattice Model: Phase Transitions and Statistical Mechanics of the GTE Polynomial

The GTE polynomial p(L,C,R) = C+R−CR−LCR over F₇ defines a 7-state nearest-neighbor spin model with three-body interactions. 1D: spectral gap Δ≈3.69, ground-state degeneracy 43 (Cyclotomic Point Count Theorem, CatAL). 2D: phase transition at β_c≈0.35 with Z₃-like symmetry breaking; three degenerate ground states {0,1,5} machine-certified. Secondary transition at β_{c,2}≈1.7 with hysteresis (domain-wall locking). Ground-state sectors {0,1,5} map to color charge sectors. Minimal realization: 7-level Rydberg atoms.

The polynomial p(L,C,R) = C + R - CR - LCR over F_7, derived as the unique MDL-minimal substrate encoding the Standard Model from first principles, defines a natural statistical mechanics system: a 7-state nearest-neighbor spin model with three-body interactions. We analyze this spin-7 model in one and two spatial dimensions. In 1D, the exact transfer matrix acts on pair states (s_i-1, s_i); its Perron eigenvalue at = 1 is _1 = 1.4846, the correlation length grows from 2.9 sites at = 1 to 15.0 at = 2 and diverges as , and the local zero-energy windows number 43 = _6(7) (consistent with the Cyclotomic Point Count Theorem). The global zero-energy rings are exactly the three uniform configurations \0^n, 1^n, 5^n\ at every ring length n 3 - an exact threefold ground-space degeneracy, machine-certified in Lean 4 - so the ground space realizes the ternary repetition code of length n and distance n. In 2D, Metropolis Monte Carlo simulations on L L tori (L = 4-16) reveal a phase transition at _c 0.35 (T_c 2.86\,J) with Z_3-like symmetry breaking among three degenerate global ground states: the uniform configurations \0, 1, 5\, algebraically characterized as the roots of p(x,x,x) = -x(x-1)(x-5) 7. A secondary feature at _c,2 1.7 exhibits strong hysteresis consistent with domain-wall locking. The zero-temperature support of the 1D transfer matrix is the deterministic pair-state digraph of the CMCA vacuum sector, and the thermodynamic entropy rate S_CMCA() = _1() interpolates from 7 = 1.946 nats at infinite temperature through 0.395 nats per site per update at = 1 to 0 at zero temperature, where only the three rigid ground states survive. The three ground-state sectors \0, 1, 5\ map to the color charge sectors of the Standard Model, and the NL identity NL(p) = 1 - c_H/7^2 connects the polynomial's cryptographic nonlinearity to the Higgs branch capacity c_H = 13. A minimal experimental realization using 7-level Rydberg atoms in optical tweezer arrays is proposed.

Zenodo (PDF + DOI)

The Polynomial Certificate of Transputation: MDL Unification, Quantum Measurement, and the SRRG Fixed Point

The GTE polynomial carries a complete formal certificate of the quantum measurement mechanism. SRRG adjudication fixed point φ=(√5−1)/2≈0.618 machine-certified (Lean 4). Three-Level MDL Unification Theorem: polynomial p connects theory selection (Level 1), field dynamics (Level 2), and quantum event adjudication via transputation (Level 3) in a single non-circular derivation. MDL Tower non-circularity machine-certified (Round 100, 334 modules). P51 OP3 CLOSED.

The quantum measurement problem - why a superposition produces a single definite outcome, and why with probability |c_k|^2 - remains unresolved across standard interpretations of quantum mechanics, which either postulate collapse, multiply unobservable branches, or explain apparent classicality without resolving outcomes. This paper provides a formal derivation of the measurement mechanism from first principles within the GTE (Generative Triple Evolution) framework. The GTE polynomial p(L,C,R) = C+R-CR-LCR over 7, the unique Minimum Description Length (MDL)-minimal encoding of the Standard Model generation structure, carries a complete formal certificate of the quantum measurement mechanism. Its Perfect Self-Containment (PSC) projection is , the discrete adjudicator that defines the measurement orbit GEN_1 GEN_2 GEN_3 VAC - the only PSC-consistent trajectory in the cellular automaton dynamics - and this projection is characterized in three parts: agrees with p on the binary sector \0,1\^3 (Rule 110), overrides p on the ten SM-orbit neighborhoods to enforce generation-orbit consistency, and projects to zero on all remaining 325 neighborhoods. The polynomial's real diagonal encodes the Self-Referential Renormalization Group (SRRG) adjudication fixed point phi = (5-1)/2 0.618 (machine-certified, ). A Three-Level MDL Unification Theorem () shows that (X) = _x X K(x PSC) operates at three nested, non-circular domains: theory selection (p from rule space), field dynamics ( via the PMDL variational principle), and quantum event adjudication (Born rule via transputation). The polynomial p is the connecting object: it is the output of Level 1, enters the PMDL action at Level 2, and its PSC-projection defines the orbit used at Level 3. A two-sided computability classification (; hardness core ) locates transputation exactly: record-truth on the diagonal fragment is ^0_1-complete, the adjudicator is limit-computable with boundedly many mind changes under a named premise bundle, and hence _T(diag) = 0' exactly - the Gold-Putnam trial-and-error stratum, with no computable convergence modulus. Quantum measurement is trial-and-error computation at the halting degree, and no stronger: physics requires exactly one Turing jump. The same degree-0' structure reappears at the field level: the irreducible residual of the PMDL action is a left-c.e.\ real of degree exactly 0', so the cosmological constant inherits the transputation classification. Differential Self-Adjudicative Computation (DSAC) is positioned as the continuum member of the [D] adjudicator class, bridging the discrete projection and the transputation selector _D: its relaxation-to-coherence dynamics is the physical realization of the computable stage sequence whose limit is the adjudication outcome.

Zenodo (PDF + DOI)

The PSL(2,7) Algebraic Structure of the Generative Triple Evolution Framework

Proves that the GTE Fibonacci–Möbius map, F₂₁ gauge skeleton, and Eisenstein integers are all facets of PSL(2,7), the unique simple group of order 168. Seven CatAL machine-certified theorems with zero sorry: F₂₁ is the Borel subgroup of PSL(2,7) and acts simply transitively on all 21 flags of the Fano plane; Eisenstein integers yield F₂₁ from the norm-7 prime and A₄ from the inert prime 2; Klein quartic genus = N_gen = 3. PSL(2,7) unifies the gauge skeleton, neutrino flavor symmetry A₄, and the geometric reason for three SM generations. 361 modules.

The Generative Triple Evolution (GTE) framework is built on three algebraic pillars: the Fibonacci-Möbius action on P^1(F_7), the order-21 metacyclic group F_21 = Z_7 ⋊ Z_3 (the Borel stabilizer of ∞ in PSL(2,7)), and the Eisenstein integers Z[ω] (ω = e^{2πi/3}, primitive cube root of unity). This paper proves that these three pillars are unified through PSL(2,7), the unique simple group of order 168. We establish four main results, all machine-certified in Lean 4 with zero sorry. First, F_21 is the stabilizer of ∞ ∈ P^1(F_7) in PSL(2,7) (the Borel subgroup of order 21), and together with the Fibonacci-Möbius generator, these two elements generate PGL(2,7) of order 336 (f21_is_borel_psl27, pgl27_generated_by_singer_and_borel). Second, PSL(2,7) is the unique simple group of order 168 and equals Aut(F) for the Fano plane F, and F_21 acts simply transitively on all 21 incidence flags of F (psl27_is_aut_fano, f21_regular_on_fano_flags). Third, the Eisenstein integers yield F_21 and A_4 from the same functor: 7 splits as 7Z[ω] = π π̄ (norm-7 primes), giving Z[ω]/(π) ≅ GF(7) and F_21 from the unit group; 2 is inert (2Z[ω] prime), giving Z[ω]/(2) ≅ GF(4), whose additive group is V_4 ≅ Z_2^2 and whose multiplicative group is Z_3 = μ_3, assembling to A_4 = V_4 ⋊ μ_3 (eisenstein_a4_from_inert_2). Fourth, the Klein quartic — the unique Hurwitz surface saturating 84(g−1) automorphisms for genus g — has genus equal to N_gen = 3 (the number of Standard Model generations), arising from the (2,3,7) triangle group shared with PSL(2,7) (klein_quartic_genus_eq_n_gen). These results establish a coherent group-theoretic skeleton: PSL(2,7) contains F_21 as its Borel subgroup, acts as the automorphism group of the Fano plane (with F_21 as its regular flag-transitive subgroup), and is the automorphism group of the genus-3 Klein quartic. The shared μ_3 = SU(2)_L-cyclic factor links F_21 to A_4 via the Eisenstein functor, and the manifest GTE neutrino flavor symmetries μ_3 and the μ-τ exchange Z_2 generate S_3 ≤ A_4, completing the leading-order neutrino flavor mixing group. The physical interpretation — F_21 as gauge skeleton group, A_4 as the GTE leading-order neutrino flavor symmetry yielding tri-bimaximal mixing angles, and the Klein quartic as the geometric reason for three generations — is argued at the stated confidence levels.

Zenodo (PDF + DOI)

The GTE Framework: A Comparative Assessment

Assesses the GTE framework against a neutral 10-dimension rubric comparing it to the Standard Model, SUSY, string theory, loop quantum gravity, causal sets, the Wolfram physics programme, asymptotic safety, and other frameworks. GTE is the only programme simultaneously supplying a derived selection principle, zero free dimensionless parameters, machine-certified load-bearing steps in Lean 4 (zero sorry, ~364 modules), cross-sector predictions, and named falsifiers. Roughly 40 zero-parameter predictions, ~37 within 1σ of PDG 2024/NuFIT 6.0/Planck 2018. Conclusion: the framework earns serious consideration on its own stated terms.

The Generative Triple Evolution (GTE) framework derives the Standard Model parameter spectrum, the gauge group, spacetime, the postulates of quantum mechanics, and the principal cosmological observables from a single Z_7-symmetric scalar field Phi_MDL whose algebraic certificate is a 19-bit polynomial p(L,C,R) = C+R-CR-LCR over GF(7), selected by a minimum-description-length (MDL) principle that is itself a theorem of perfect self-containment. This paper does not re-derive those results; it assesses the framework against the standards a skeptical foundations-of-physics audience would reasonably apply. We define a neutral, eleven-dimension rubric — selection principle, free-parameter count, derivation of the gauge group and quantum-mechanical postulates, origin of spacetime, cross-sector and out-of-sample predictivity, quantitative agreement, falsifiability, formal verification, and resolution of long-standing problems — and score GTE side by side with the Standard Model, supersymmetric grand unification, string theory and the landscape, loop quantum gravity, causal sets, the Wolfram and digital-physics programmes, asymptotic safety, Wheeler's "it from bit," Tegmark's mathematical-universe hypothesis, and Penrose objective reduction. On this rubric GTE is, to our knowledge, the only programme that simultaneously (i) supplies a derived selection principle rather than an assumed one, (ii) carries zero free dimensionless parameters fitted to particle data, (iii) machine-certifies its load-bearing steps in Lean 4 with zero sorry and the standard Mathlib axiom signature across roughly four hundred modules, (iv) makes cross-sector predictions (n_s, eta_B) in domains causally disconnected from any fitting target, and (v) names explicit near-term falsifiers. We quantify the case (roughly forty zero-parameter predictions, about thirty-seven within 1-sigma of PDG 2024 / NuFIT 6.0 / Planck 2018; an out-of-sample evidence accounting; machine-verified non-circularity) and place it honestly against its open problems (a single dimensional anchor m_tau, the conditional gauge-group derivation, an atmospheric-angle tension at -1.35 sigma, the Gromov–Hausdorff continuum limit, and the quantum cosmological-constant hierarchy). The conclusion is narrow and defensible: the framework is not numerology, it is more economical and more rigorously verified than its rivals on the dimensions where it can be compared, and it earns serious consideration on its own stated terms.

Zenodo (PDF + DOI)

The Born Rule as a Theorem, Not a Postulate: Quantum Measurement in the GTE Framework

Derives the Born rule probability law from first principles within the GTE framework, without postulating it.

Quantum mechanics says a particle can be in a superposition — in two states at once. Measurement collapses it to one. The measurement problem is: what causes the collapse, and why do the probabilities follow the formula P(k) = |c_k|^2? Nobody has a satisfying answer from within standard quantum theory. This tutorial explains how the GTE (Generative Triple Evolution) framework derives the Born rule — the law that links quantum amplitudes to measurement probabilities — as a theorem from first principles, requiring no additional postulates. The Born rule emerges necessarily from the arithmetic structure of the GTE substrate.

Zenodo (PDF + DOI)

The Cosmological Constant: Why It Isn't Zero But Nearly So

Explains the cosmological constant fine-tuning problem and its resolution through PSC selection and incompleteness-implies-nonzero omega_Lambda.

The cosmological constant — Einstein's lambda — is the most famous fine-tuning problem in physics: its observed value is roughly 10^120 times smaller than any naive quantum field theory estimate. This tutorial explains how the UGP Physics / GTE framework addresses the cosmological constant problem. Rather than a coincidence or fine-tuning, the near-zero value of the cosmological constant emerges from the arithmetic structure of the GTE substrate: the MDL selection principle constrains vacuum energy contributions, and the discrete number-theoretic geometry of the generative polynomial produces a residual cosmological term that is small but nonzero by structural necessity.

Zenodo (PDF + DOI)

Z_7 Defect Cosmology: Domain Walls, Phase Transitions, and the Zero-Relic Prediction

Shows how Z_7 symmetry of the GTE substrate predicts domain walls that dilute to below observational bounds — the zero-relic prediction.

As the early universe cooled, it underwent phase transitions — just like water freezing into ice. When different regions of space independently chose their low-energy configuration, boundaries called domain walls formed between them. These topological defects are potentially catastrophic for the universe's development. This tutorial explains how the Z_7 symmetry of the GTE polynomial gives rise to a specific defect cosmology: what kinds of defects form, why the seven-fold degeneracy of the GTE vacuum predicts a zero relic abundance of dangerous monopoles and textures, and how the discrete arithmetic structure of the substrate controls the cosmological phase-transition history.

Zenodo (PDF + DOI)

The Master Quadratic: One Equation, Two Crown Jewels — From the Diagonal of the GTE Polynomial to the Higgs Boson and Rule 110

Traces how the diagonal of the GTE polynomial yields a master quadratic whose roots determine the Higgs boson mass and select Rule 110.

Setting all three inputs of the GTE polynomial equal (L = C = R = x) reveals a hidden quadratic: the master quadratic m(x) = x^2 + x - 1. This single equation with discriminant 5 (the number of Standard Model fermion families) governs two crown jewels of the UGP Physics derivation tower: the golden ratio (the SRRG fixed point that seeds the electroweak scale and Higgs mass derivation) and the binary floor structure that protects Rule 110 as the unique computationally universal sub-automaton. This tutorial walks through the derivation step by step, explaining why one Z-quadratic controls both the Higgs boson mass and the universality of cellular automata computation.

Zenodo (PDF + DOI)

Gravity from Description-Length Minimization: The MDL-Lovelock Principle and the GTE Derivation of General Relativity

Derives general relativity from MDL minimization: the Lovelock theorem selects the Einstein–Hilbert action as the unique shortest gravitational description.

Every other force in nature is described by a quantum field theory; gravity alone is still described by a classical theory, and the two are mathematically incompatible at the highest energies. This tutorial explains how the GTE framework derives gravity from description-length minimization. The MDL-Lovelock principle identifies the Einstein-Hilbert action as the minimum-description-length curvature functional over the GTE substrate, explaining why gravity takes the specific form it does — including the number of spacetime dimensions and the structure of the Einstein field equations — without assuming these as axioms. The derivation is independent of the other forces and proceeds entirely from the MDL selection criterion applied to continuum limits of the three-tape CMCA substrate.

Zenodo (PDF + DOI)

The Levels of the Theory: Coarse, Fine, and the Role of the Algebraic Certificate

Maps the full derivation tower from the GTE arithmetic substrate through cellular automata, continuum field theory, and Standard Model particle content.

The UGP Physics / GTE derivation tower spans multiple levels of description — from the discrete arithmetic substrate of the GTE polynomial up through cellular automaton dynamics, continuum field theory, and finally the Standard Model particle content and parameters. This tutorial explains the architecture of these levels, the distinction between coarse and fine descriptions, and the critical role of the algebraic certificate: the machine-certified (Lean 4, zero sorry) proof that the MDL selection criterion uniquely identifies the GTE polynomial from all candidates. Understanding the levels of the theory is essential for seeing how results at the discrete level propagate upward to produce predictions at the continuum level.

Zenodo (PDF + DOI)

How MDL Selects the 19-Bit Polynomial: The Five-Step Elimination

Walks through the five-step MDL elimination chain that selects p(L,C,R) = C + R - CR - LCR mod 7 from ~10^290 candidate polynomials.

The MDL (Minimum Description Length) principle selects the GTE polynomial p(L,C,R) = C + R - CR - LCR mod 7 from 7^343 approximately 10^290 candidates by running a five-step elimination chain. Every step is a forward inference; none refers back to any Standard Model input. This tutorial walks through each of the five elimination steps, explaining the mathematical criterion applied at each stage and why the specific polynomial p is the unique survivor. The selection is machine-certified in Lean 4 (zero sorry), providing a formal guarantee that no other polynomial of the same degree and modulus satisfies all five MDL constraints simultaneously.

Zenodo (PDF + DOI)

The Phi_MDL Field: From Discrete Certificate to Continuum Physics

Explains how the discrete GTE polynomial gives rise to the phi_MDL continuum field and how all Standard Model parameters emerge from its dynamics.

From a single polynomial — p(L,C,R) = C + R - CR - LCR mod 7 — that updates a row of cells in seven possible states, the masses of all elementary particles, the structure of spacetime, and the gauge couplings of the Standard Model can be derived. The bridge between the discrete arithmetic substrate and continuum physics is the Phi_MDL scalar field: a smooth field whose vacuum expectation value is fixed by the SRRG (Self-Referential Recursion Group) fixed point of the master quadratic. This tutorial explains how the Phi_MDL field is constructed from the GTE certificate, how its dynamics are derived from the MDL-Lovelock principle, and how its vacuum structure produces the electroweak scale and Higgs mass without free parameters.

Zenodo (PDF + DOI)

The GTE Polynomial: A Step-by-Step Cheat Sheet — From Cellular Automata to the Standard Model

Concise reference on the GTE polynomial p(L,C,R) = C + R - CR - LCR mod 7 and the full derivation chain from this single arithmetic rule to the Standard Model.

A concise reference tutorial on the GTE (Generative Triple Evolution) polynomial p(L,C,R) = C + R - CR - LCR mod 7 and the complete derivation chain from this single arithmetic rule to the Standard Model of particle physics. The polynomial is a cellular automaton rule that updates a cell's state from its two neighbors and its own current state, with arithmetic done modulo 7. This cheat sheet walks through all the major steps in compact form: MDL selection of p from the full rule space, the master quadratic and its two completions, the three-tape CMCA construction of 3+1D spacetime, derivation of gauge groups and quantum numbers, the GTE cascade for particle masses, and the machine-certified Lean 4 theorems that underpin each step. Suitable as a quick reference for readers already familiar with the UGP Physics series.

Zenodo (PDF + DOI)

Perfect Self-Containment and MDL: Why the Universe Has to Select Itself

Explains PSC (Perfect Self-Containment) as the uniqueness criterion that, combined with MDL, selects the observed universe's parameters without free constants.

Why do the laws of physics have the specific values they do? The Standard Model of particle physics is the most precise physical theory ever constructed, but it cannot explain its own parameters — it requires approximately 25 free constants that must be measured and inserted by hand. The UGP Physics framework answers this through two interlocking principles: Perfect Self-Containment (PSC), which requires that the universe's description be internally self-consistent without external reference, and the Minimum Description Length (MDL) criterion, which selects the simplest such self-consistent description. This tutorial explains both principles, their mathematical formulation, and how their combination forces the universe to select the specific polynomial and parameters that match the observed Standard Model.

Zenodo (PDF + DOI)

How the Standard Model Quantum Numbers Emerge from Z_7 x Z_3: A Tutorial on Winding Numbers, Ground States, and Generations

Shows how the discrete symmetry group Z_7 x Z_3 of the GTE substrate determines all Standard Model quantum numbers via winding numbers and ground-state selection.

A quantum number is a permanent label attached to a particle — like a barcode that no physical process can change. The Standard Model has been discovered to require a specific set of such labels (color charge, weak isospin, hypercharge, baryon number, lepton number, and generation) but provides no explanation for why these particular quantum numbers exist. This tutorial explains how the UGP Physics / GTE framework derives the complete set of Standard Model quantum numbers from the group structure Z_7 x Z_3, using winding numbers around the discrete vacuum of the GTE polynomial, ground state degeneracy counting, and the arithmetic structure of the three-tape CMCA. The three generations of fermions emerge from the three independent tape directions; the specific charge assignments follow from the number-theoretic structure of the Z_7 symmetry group.

Zenodo (PDF + DOI)

Why the Strong CP Problem Is Solved: theta_QCD = 0 from F_21 Group Theory

Explains the strong CP problem and proves theta_QCD = 0 from F_21 group symmetry of the GTE framework — no axion required.

The strong CP problem is one of the deepest mysteries in particle physics: the QCD Lagrangian contains a term proportional to theta_QCD that would generically cause the strong force to violate CP symmetry (the combined symmetry of charge conjugation and parity). But experiments show theta_QCD is smaller than 10^-10 — essentially zero — with no known reason why. This tutorial explains why the strong CP problem is automatically solved in the GTE framework. The F_21 symmetry group (the full symmetry group of the GTE polynomial over Z_7, of order 42) contains a reflection element that maps p to its CP-conjugate; the vanishing of theta_QCD follows from this structural symmetry as a theorem, not a coincidence. The derivation is machine-certified in Lean 4 with zero sorry.

Zenodo (PDF + DOI)

The Three-Tape CMCA: How 3+1D Spacetime Emerges from Three 1D Rules

Explains the Three-Tape Chiral Minkowski Cellular Automaton construction that derives 3+1D spacetime geometry from three independent GTE tape executions.

A single 1D cellular automaton rule operates on a line — but how do you get three-dimensional space from a one-dimensional rule? This tutorial explains the Three-Tape Chiral Minkowski Cellular Automaton (CMCA), the key construction in the UGP Physics framework for deriving 3+1D spacetime from the GTE polynomial. Three independent copies of the GTE rule run on three orthogonal tapes, coupled through the PSC (Perfect Self-Containment) constraint. The Dimensional Protocol Principle determines the coupling strength between tapes, and the Lorentzian signature of spacetime (+,-,-,-) emerges from the chiral structure of the coupling. This tutorial walks through the construction step by step, explaining why exactly three spatial dimensions arise and how the tape coupling fraction of approximately 40% for n=3 produces the observed gravitational-to-total edge ratio in the causal bulk.

Zenodo (PDF + DOI)

Transputation: Quantum Measurement at Turing Degree Exactly 0-prime

Explains transputation and proves that quantum measurement has a precise computational complexity: Turing degree exactly 0' (halting problem), neither computable nor arbitrarily hard.

This tutorial explains one of the most surprising results in the GTE framework: quantum measurement has a precise location in the mathematical hierarchy of computational difficulty. It sits at exactly one level above an ordinary Turing machine — no more, no less. That level is Turing degree 0' (zero-prime), the halting problem. This is a theorem machine-certified in Lean 4 with zero sorry, not a metaphor. The result, called Transputation, shows that the Born-rule probability update during quantum measurement is exactly as hard to compute as the halting problem: it is decidable given an oracle for the halting problem, but not by any ordinary Turing machine. This tutorial explains the computability classification, the GTE derivation that places measurement at degree 0', and the physical interpretation of why quantum indeterminacy sits at precisely this level of the arithmetical hierarchy.

Zenodo (PDF + DOI)

From the Arithmetic Substrate to Particle Masses: The GTE Cascade and the Nine Charged-Fermion Masses

Traces the full GTE cascade from the integer ridge level n to the nine charged-fermion masses, matching PDG values to sub-percent precision.

The Universal Generative Principle (UGP) is a number-theoretic sieve that, starting from a single integer ridge level n, severely restricts which starting triples are internally self-consistent — and identifies our universe as the unique self-consistent solution. The Standard Model of particle physics requires approximately 25 numerical constants that cannot be derived within the Standard Model itself; the masses of the nine charged fermions (three charged leptons and six quarks) are among the most mysterious. This tutorial provides a step-by-step guide to the GTE Cascade: the sequence of derivations that connects the arithmetic substrate of the GTE polynomial through the SRRG fixed point, the Phi_MDL vacuum, and the electroweak scale to produce specific numerical predictions for all nine charged-fermion masses without free parameters.

Zenodo (PDF + DOI)

Computational Universality of the Substrate: Undecidability, Self-Reference, and Why the Universe Can't Know Itself Completely

Proves that the computational universality of the GTE substrate implies undecidability and fundamental limits on self-knowledge within the universe.

The substrate of the universe is computationally universal — it can, in principle, simulate any computation. This is not just a philosophical claim but a theorem derived in the GTE framework: the GTE polynomial, via its invariant Rule 110 sub-automaton, is Turing-complete (machine-certified in Lean 4, zero sorry). Computational universality has profound consequences: any sufficiently rich physical system is subject to undecidability and Godel incompleteness. This tutorial explains what computational universality means for physics, how Turing completeness is established for the GTE substrate, and why it implies that the universe cannot have a complete self-description within itself — a result directly connected to the PSC (Perfect Self-Containment) principle and to the Transputation theorem placing quantum measurement at Turing degree 0'.

Zenodo (PDF + DOI)

How the UWCA Works: A Step-by-Step Explanation of the Universal Windowed Cellular Automaton

Step-by-step explanation of the UWCA (Universal Windowed Cellular Automaton), the key computational architecture that runs the GTE polynomial over finite windows.

A regular cellular automaton (like Rule 110) updates every cell at once using a lookup table. The UWCA (Universal Windowed Cellular Automaton) does something more sophisticated: it encodes the states of cells as residues of large prime numbers, and uses a single arithmetic sweep to find the correct next state for each position. The result is a cellular automaton that can implement any rule in a sliding-window fashion, using only modular arithmetic. This tutorial explains how the UWCA works step by step: the residue encoding, the arithmetic sweep, the window mechanism, and how the GTE polynomial specifically implements the UWCA architecture. The UWCA construction is key to understanding how the 19-bit GTE rule gives rise to the universality and computational completeness properties of the substrate.

Zenodo (PDF + DOI)

The Weinberg Angle, Fine-Structure Constant, and Gauge Couplings from the Polynomial

Derives the Weinberg angle (sin^2 theta_W = 3/11), fine-structure constant, and all three gauge couplings from the Z_7 algebraic structure of the GTE polynomial.

A gauge coupling is a number that tells you how strongly particles interact via one of the three non-gravitational forces. The Standard Model of particle physics has three such numbers — one for each force — and cannot explain their values. The GTE framework derives all three gauge couplings from the arithmetic structure of the GTE polynomial. This tutorial explains how a 19-bit cellular automaton rule encodes the strengths of electromagnetism (the fine-structure constant alpha approximately 1/137) and the weak nuclear force (the Weinberg angle theta_W approximately 28.7 degrees). The derivation proceeds from the number-theoretic properties of the GTE polynomial modulo 7, the F_21 symmetry group structure, and the SRRG fixed point — producing specific numerical predictions that match experiment without any free parameters.

Zenodo (PDF + DOI)

A Reader's Guide to the Mathematical Foundations of Reflexive Reality

Executive summary for physicists: Perfect Self-Containment, the MFRR closure theorems, and reading paths into the main monograph.

The Mathematical Foundations of Reflexive Reality (MFRR) framework proves that a physically real universe must be reflexive—its law, its description, and its execution must be three aspects of the same internal mechanism. This condition, Perfect Self-Containment (PSC), eliminates the need for external laws or meta-rules and forces a specific mathematical structure that unifies logic, computation, quantum mechanics, gravitation, and cosmology. MFRR is built on a suite of seventeen closure theorems which prove that any universe that can exist self-consistently and computably must implement: Transputation (PT)—a lawful, non-computable adjudication process that resolves logical degeneracies (Choice Points) internal to the universe. Forced as the unique internal adjudicator under closed-choice conditions, machine-proved in a companion Lean development (zero sorry; Strong Transputational Universality, STU). Reflexive Landauer Bound—every act of adjudication carries a quantifiable energetic cost exceeding the classical bound, linking information, energy, and geometry. Fisher Information Geometry—the natural geometry of distinguishability, whose curvature governs adjudication density and whose stress-energy sources a physical field. Self-Referential Renormalization Group (SRRG)—a reflexive gradient flow on theory space whose unique stable fixed point is the Standard Model gauge structure, established via the Two-Layer PSC Theorem. Information Profit Principle—a universal...

Zenodo (PDF + DOI)

A Gentle Introduction to the Mathematical Foundations of Reflexive Reality

Popular science introduction: why a self-contained universe must compute itself, and what that forces about physical law.

Most scientific theories assume that the universe behaves according to laws written `outside'' the universe: equations that simply exist, like a cosmic instruction manual. But if the universe is all there is, where do these laws come from? Who or what enforces them? The central idea of the Mathematical Foundations of Reflexive Reality (MFRR) is that the universe has no external rulebook. It cannot rely on an outside referee. It must therefore contain its own laws, its own mechanism of execution, and its own system for resolving ambiguities. A universe must, in effect, compute itself. This requirement is called Perfect Self-Containment (PSC). It is not speculative: logical arguments, computational reasoning, and geometric considerations all show that PSC is unavoidable for any universe that exists `on its own.''

Zenodo (PDF + DOI)

Mathematical Foundations of Reflexive Reality: Summary for Physicists and Referees

Technical summary of the MFRR framework, closure theorems, and Two-Layer PSC Theorem for physicists and peer reviewers.

The Mathematical Foundations of Reflexive Reality (MFRR) establishes a unified framework in which logic, computation, and physics are aspects of one self-defining process. A universe can exist consistently only if its laws are internal, reflexively executed, and energetically self-accounting. The central construct—Transputation (\( \))—realizes lawful internal adjudication of computational degeneracies, producing Perfect Self-Containment (\( \)). The forcing of transputation as the unique internal adjudicator under closed-choice conditions is machine-proved in a companion Lean development (zero sorry; Strong Transputational Universality, STU). Seventeen closure theorems connect logic, energy, geometry, thermodynamics, and theory space. The pinnacle structural result is the Two-Layer PSC Theorem: Layer~I (hard PSC axioms) uniquely forces gauge group SU(3)× SU(2)× U(1) with N_gen 3; Layer~II (Presentation Invariance/MDL) selects N_gen=3 as the unique PSC-optimal solution. The framework further resolves the black-hole information paradox via reversible transputation ( ^-1 =I), derives ensemble quantum decoherence as the origin of GKSL dynamics without external environment, and establishes three universal information-energetic laws: (i)~superlinear energy amplification (α: 1.01→ 1.83) quantifying the quantum-to-classical transition; (ii)~the Information Profit Principle (Gen/Drain >1.13=1+Λ/2) governing all self-organization; (iii)~decoherence as profit-accounting corruption by additive external noise. Part~V realizes MFRR constructively via steel-man experiments (TE_2.1: 11 experiments, 710 runs) deriving gravity, quantization, entanglement, and wormhole formation from information-theoretic constraints alone, and via five advanced theorems (TE_2.2–TE_2.6) proving PSC-optimality of SM, nuclear physics, unitarity, ΛCDM, and Δ-machine necessity. The framework is verified by the ΛΩ-RCP, TE_1, and TE_2 validation programs: 297 first-party Python modules, 57,337+ experimental runs, 15,894+ result files, confirming core predictions to sub-percent precision.

Zenodo (PDF + DOI)