Operational Completeness and Classical Separation
Abstract
Full finite-window operations and state tomography do not yield a multiplicative classical state.
Theorem 1.1 (Operational completeness does not imply classical completeness).
Proof. Machine-checked in Lean as D5/S3/Observer/WindowAlgebra/OperationalClassicalSeparation.operational_complete_not_classically_complete (✓ std3). ∎
Source. Repository-derived.
Commentary.
For every finite cyclic window with more than one address, the algebra generated by the canonical clock and shift is the full matrix algebra. Its canonical centralizer is exactly the scalar matrices, and the generated algebra has no unital complex character.
The trace functional is imported from the matrix-state family. Trace expectations against all matrices separate positive trace-one density matrices, while each such density gives a normalized complex-linear functional that is nonnegative on adjoint squares.
The final clause constructs the basis density at address zero and the opposite matrix units from zero to one and one to zero. Their individual expectations vanish, but the expectation of their product is one, so the state is explicitly not multiplicative.
The proof applies the existing window generation, scalar commutant, character exclusion, and matrix-state cone results together with Mathlib’s trace-pairing separation and matrix-unit identities. No existing declaration combined all six public clauses.
References
- Truth anchor:
D5/S3/Observer/WindowAlgebra/OperationalClassicalSeparation.operational_complete_not_classically_complete - Dependency: D5/S3/Observer/WindowAlgebra/WindowGeneration
- Dependency: D5/S3/Observer/WindowCharacter
- Dependency: D5/S3/QuantumStates/GNSStateCone
- Dependency: D5/S3/QuantumStates/GNSZeroPropagation