Result and source map
On this page · Permalink · Source line 979
The following map gives the role of each admitted formal result. Exact source anchors, excerpts, hashes, and detailed hypothesis review are in the accompanying machine-readable ledger and review files. Source relationships do not imply that every source page is admitted.
| Result | Preserved object | Source relationship |
|---|---|---|
| 1.1 | A target determined by an available record | GA; shared fibre criterion. |
| 1.2 | Every declared finite continuation | GA and MU, consolidated. |
| 2.1 | Exact split encoding and named composition loss | SR, split and hidden-return identities. |
| 2.3 | Source operations and matched readouts | MU; OSL and Neuralese use the same conditional principle. |
| 2.4 | One output method across candidate dynamics | GA, common observable quotient. |
| 2.5 | Probability interpretation of a complete packet family | LSM, positive packet criterion. |
| 3.1 | Every admitted future set correction | GA, correction-signature theorem. |
| 3.2 | Exact partition-evidence memory cardinality | GA, occupancy corollary. |
| 3.4 | All posterior updates in the actual reporting chain | MU, finite channel factorization. |
| 3.5 | Coarsest partition closed for prediction and update | LSM and PRIQ, finite closure. |
| 3.6 | Joint next-state/report law, posteriors and feedback | PRIQ and AVOC, selected composition. |
| 3.8 | Whole-history error and conditioning cost | LSM, law and normalization bounds. |
| 4.1 | One bounded-loss decision calculation | GA and MU, specialized common-risk bound. |
| 4.2 | One artifact under fixed recipient procedures | MU, intersection and covering criterion. |
| 5.1 | One executable tree under all declared budgets | MU and SII, finite Pareto synthesis. |
| 5.3 | A complete optimality claim for a checked tree | SII, binary singleton-repair scope. |
| 5.4 | One optimal finite-horizon expected-cost inquiry | AVOC, projected values and finite plans. |
| 5.6 | Uniform policy evaluation before selection | LSM/AVOC, common-law specialization. |
| 6.1 | Exact finite candidate rejection and acceptance | SII, finite counterexample refinement. |
| 6.2 | The same proposed ASTs and teacher transcript | SII, sound equations and ordered quotient. |
| 6.4 | The same completed ordered diagnostic search | SII, capacity and streaming arguments. |
| 7.1 | Applicability of dependency-bound witnesses | SII, complete declared dependency graph. |
| 7.3 | Gains under one complete additive ledger | SII, price-relative dominance. |
| 7.4 | Conditional false-acceptance control | SII, adaptive lineage error budget. |
| 8.1 | A target from jointly accessible linear records | SR and SRWT, target-relative specialization. |
| 8.2 | Legal action availability and label histories | MS, exact governance quotient. |
| 8.3 | Continued operation with an ending policy | MS, fully observed finite specialization. |