Pith. sign in
module module high

IndisputableMonolith.Verification.CPT

show as:
view Lean formalization →

Re-export surface for the CPT verification layer: window identifiability and the P→B→A composition pipeline. Anyone citing the formal CPT theorems against the paper should import here rather than deep paths. The module itself holds no new proofs; it forwards the fully proved export aliases.

claimCitation surface 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 as named theorem aliases with no new axioms.

background

Recognition Science verification packages theorems so paper citations map cleanly onto Lean names. CPT here is the charge–parity–time style identification layer in that stack: window families that pin observables, and a staged pipeline that composes those windows into the full claim chain.

The sole import is Verification.CPT.Exports, whose module doc states it is the citation-friendly alias layer: all items fully proved (no sorry, no new axiom). Paper-to-Lean tags are explicit: WINDOW_* for Thm.\ 4.5 / 6.5 window identifiability, and CPT_PIPELINE_* for the §5 / §6 P→B→A composition.

This parent module is the stable entry point. Downstream readers and paper appendices should depend on it rather than on internal file paths that may move.

proof idea

Definition and re-export module only; no local proofs. Structure is a single import of the CPT export surface, which already carries the proved window and pipeline aliases. Argument content lives entirely in those exported theorems.

why it matters in Recognition Science

Gives a single, citable root for the CPT formalization inside the Verification domain. Paper authors and auditors map Thm.\ 4.5 / 6.5 and the §5–§6 pipeline onto Lean without hunting internal modules. Used_by is empty at this snapshot, so the module is an entry facade rather than a lemma feeder; its value is namespace stability and the guarantee that everything under the export surface is sorry-free.

scope and limits

depends on (1)

Lean names referenced from this declaration's body.