IndisputableMonolith.Verification.CPT
Re-export surface for the CPT verification layer: window identifiability and the P→B→A composition pipeline. Auditors cite it for paper-aligned names of fully proved theorems (no sorry, no new axioms). The module itself only imports the Exports barrel; all mathematical content lives one level down.
claimCitation barrel for the CPT formalization: the window-identifiability family (paper Thm.\ 4.5 / 6.5) and the $P\to B\to A$ pipeline composition (paper §§5–6), exposed under stable $WINDOW_*$ and $CPT\_PIPELINE_*$ aliases.
background
Recognition Science verification packages proved claims under stable names so paper citations do not track internal Lean paths. CPT here is the formalization layer for charge–parity–time style constraints as they appear in the RS forcing and measurement pipeline, not a standalone QFT axiom dump.
The sole import is Verification.CPT.Exports, documented as the citation-friendly theorem alias surface. That barrel states that every exported item is fully proved (no sorry, no new axiom) and maps paper labels to Lean names: WINDOW_* for the window identifiability family (Thm.\ 4.5 / 6.5) and CPT_PIPELINE_* for the P→B→A composition in §§5–6.
This module file is therefore a thin namespace entry point: it does not introduce new definitions or lemmas of its own; it surfaces the export layer for downstream verification and paper crosswalks.
proof idea
No local proofs. The module is a one-import barrel that re-exports the CPT.Exports surface. All argument structure (window identifiability and pipeline composition) lives in the imported export layer and its upstream proved theorems.
why it matters in Recognition Science
Gives auditors and paper readers a single stable import for CPT verification claims without depending on internal file layout. Upstream Exports pins the paper-to-Lean map: window identifiability (Thm.\ 4.5 / 6.5) and the P→B→A pipeline (§§5–6). Used_by is empty at this module node; value is organizational, feeding any consumer that needs citation-stable CPT theorem names inside the Verification domain.
scope and limits
- Does not prove window identifiability or pipeline lemmas locally.
- Does not add axioms, sorries, or new CPT physics content.
- Does not define WINDOW_* or CPT_PIPELINE_* here; those live in Exports.
- Does not claim a used_by parent theorem at this module node.