Compiler theorem from the admissibility complex
tfpt-32
Assume the primitive and hard layers summarized in tab:status-matrix, together with the closure theorems of sec:closure-theorems and the declared benchmark bridge [formula in source] . Then every main-text observable in scope is classified by exactly one of the following modes: a derived carrier or closure output, a retained branch value, an anchor-governed comparison image under [formula in source] , or a conditiona
Opening source excerpt. Formulas and the full argument remain in the original document.
Source location and explicit evidence links
documents/archive--paper-latex--tfpt-32/sections/014-section-primary-benchmark-map-and-prediction-ledger.tex · lines 220 to 235
These are recorded citation relations. A source citation or topic match does not establish a mathematical or physical result.
No explicit verification citation is attached to this section in the registry.