Claim-to-Proof Map
Purpose
This map routes public claims into proof obligations, implementation tests, or external review paths.
Claim Routing Table
| Public Claim | Corpus Node | Current Status | Required Evidence | Proof / Test Path | Boundary |
|---|---|---|---|---|---|
| SFR organizes a fabric-reality spine | SFR | authorial framework | definitions + source graph + review | Theory Atlas + Review Portal | not accepted science |
| DFT defines a digital fabric architecture | DFT | architecture framework | definitions + implementation tests | DFT Foundations + invariant audits | not certified standard |
| FQFT proposes fractal field logic | FQFT | machine-verified (algebraic) | resolvent identity + scale covariance | Lean 4 (Fabrica.FQFT · 4 proofs) | not validated physics |
| Fabricon is minimal structural unit | Fabricon | machine-verified (discrete) | reflexive coupling + involution | Lean 4 (Fabrica.Fabricon · 3 proofs) | not physical particle |
| ISP Reciprocity is a trace theorem target | ISP | machine-verified (algebraic) | trace involution + dual symmetry | Lean 4 (Fabrica.TraceReciprocity · 3 proofs) | mathematical invariant |
| FFE stationarity and foliation constraints | FFE | machine-verified (algebraic) | KKT uniqueness + zero-nullity | Lean 4 (Fabrica.FFE · 4 proofs) | continuum recovery target |
| Observer monad projection laws | Observer | machine-verified (categorical) | monad identities + associativity | Lean 4 (Fabrica.ObserverMonad · 3 proofs) | epistemic boundary |
| CodexStation is deterministic runtime | CodexStation | implementation architecture | tests + invariant registry | CLI/test suite + node audits | not theory proof |