Closure, Realization, and Reflective Residue: A Machine-Checked Synthesis of NEMS, Infinity Compression, and APS with Bridge Theorems and the Non-Erasure Principle

Three research lines developed in parallel now admit a common structural formalization: they have been unified in a machine-checked Lean 4 development at the abstract architecture level, with zero proof placeholders. The NEMS (No External Model Selection) program proves that load-bearing determinacy cannot be outsourced: if a framework is non-categorical under closure, some internal adjudicator is structurally forced. Infinity Compression proves that canonical bare certification does not exhaust enriched realization: positive non-injective comparison generates residual fibers, section data, and obstruction laws as theorems. The APS (Anchored Pointer System) program proves indexed composition laws for recursive structure. This paper reports the machine-checked synthesis: a common abstract architecture that simultaneously discharges obligations from all three programs, together with bridge theorems and the Non-Erasure Principle.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-26
DOI
https://doi.org/10.5281/zenodo.20951700
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Closure, Realization, and Reflective Residue: A Machine-Checked Synthesis of NEMS, Infinity Compression, and APS with Bridge Theorems and the Non-Erasure Principle

Nova Spivack
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

Closure, Realization, and Reflective Residue: A Machine-Checked Synthesis of NEMS, Infinity Compression, and APS with Bridge Theorems and the Non-Erasure Principle

Nova Spivack
preprint en

Abstract

Three research lines developed in parallel now admit a common structural formalization: they have been unified in a machine-checked Lean 4 development at the abstract architecture level, with zero proof placeholders. The NEMS (No External Model Selection) program proves that load-bearing determinacy cannot be outsourced: if a framework is non-categorical under closure, some internal adjudicator is structurally forced. Infinity Compression proves that canonical bare certification does not exhaust enriched realization: positive non-injective comparison generates residual fibers, section data, and obstruction laws as theorems. The APS (Anchored Pointer System) program proves indexed composition laws for recursive structure. This paper reports the machine-checked synthesis: a common abstract architecture that simultaneously discharges obligations from all three programs, together with bridge theorems and the Non-Erasure Principle.

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.