Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Finite Detection Dark Space

Abstract

A finite-dimensional repeated-detection dark space is determined after dimension many no-click steps.

Theorem 1.1 (Positive semidefinite dependent block matrices).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/FiniteDetectionDarkSpace.positiveBlockDiagonal (✓ std3). ∎

Source. Repository-derived.

Commentary.

A finite dependent block diagonal matrix is positive semidefinite when every diagonal block is positive semidefinite.

Theorem 1.2 (The dark space is a finite survival-defect kernel).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/FiniteDetectionDarkSpace.dark_space_eq_survival_defect_kernel (✓ std3). ∎

Source. Repository-derived.

Commentary.

Let Q be the no-click operator and let the finite family L_x contain the click operators. Their adjoint products sum with Q^* Q to the identity. The statement also holds in dimension zero, where both sides are trivially true.

The completeness equation telescopes: the defect of the N-step survival operator is the sum, from n = 0 to N - 1 and over all outcomes x, of the Gram operators of L_x Q^n. Positivity therefore identifies its kernel with the common kernel of those event amplitudes.

At N equal to the dimension, Cayley-Hamilton expresses every later power of Q through earlier powers. Hence vanishing of the first dimension many event amplitudes propagates to every time.

References