IndisputableMonolith.QFT.CPTInvariance
The CPTInvariance module defines parity, time-reversal, and charge-conjugation operators together with their CPT composition inside the Recognition Science framework. Researchers extending the eight-tick discretization to QFT symmetries would cite these definitions when assembling Tier 2 derivations. The module consists of type declarations for the operators and cost-preservation statements built on the imported constants and hypothesis.
claimParity operator implements spatial reflection $x o -x$; time-reversal and charge-conjugation operators are defined analogously; their composition satisfies CPT invariance on the 8-tick cycle with recognition cost preserved.
background
The module sits inside the QFT derivations tier of Recognition Science and imports the fundamental time quantum $ au_0 = 1$ tick together with the eight-tick discretization hypothesis. The upstream EightTick doc states: "The 8-tick hypothesis: time/process is discretized into 8-beat cycles. This is an EXPLICIT HYPOTHESIS about observed traces, not a definitional axiom." Supporting structures LedgerEntry and Ledger track recognition costs while the operators applyC, applyP, applyT, and applyCPT act on them.
proof idea
this is a definition module, no proofs
why it matters in Recognition Science
The module supplies the CPT operators to the parent QFT module, which assembles Tier 2 derivations of quantum field theory fundamentals from the Recognition Science framework. It supplies the discrete symmetry layer required before further QFT constructions that rest on the eight-tick octave.
scope and limits
- Does not derive CPT from the T0-T8 forcing chain.
- Does not link operators to the phi-ladder or mass formula.
- Does not treat continuous-time limits or the alpha band.
- Does not contain numerical checks against measured constants.
used by (1)
depends on (2)
declarations in this module (26)
-
structure
ParityOp -
structure
TimeReversalOp -
structure
LedgerEntry -
structure
Ledger -
def
applyC -
theorem
c_preserves_cost -
def
applyP -
theorem
p_preserves_cost -
def
reverseTick -
def
applyT -
theorem
t_preserves_cost -
def
applyCPT -
theorem
cpt_preserves_cost -
theorem
cpt_preserves_balance -
theorem
reverseTick_involutive -
theorem
cpt_involutive -
def
knownViolations -
def
applyPT -
theorem
pt_involutive -
theorem
cpt_mass_equality -
theorem
cpt_lifetime_equality -
structure
CPTFalsifier -
def
cptBounds -
def
cpt_mass_bound -
theorem
cpt_bound_tight -
theorem
no_observed_cpt_violation