Section 3.5 / Appendix B — the basic theorem of operator-algebra quantum error correction
ProvedADH2015.oaqec_basic_theoremLet be finite-dimensional ( the erased part, the retained part) and let be a code subspace. An operator acts within if and both map into itself. It has a representation on if some satisfies and for all (and analogously on , with ). Let act within (Eq. (3.26)). Then has a representation on (Eq. (3.27)) if and only if commutes, on the code subspace, with every operator on (Eq. (3.28)):
The theorem characterizes, by a checkable commutation condition, which logical operators survive the erasure of . Applied to all operators acting within the code subspace it recovers the erasure-correction criterion of Section 3.2, and it underlies the algebraic no-cloning property and the holographic interpretation of bulk reconstruction.
Formalization Note The source states (3.28) as for an orthonormal basis of the code subspace; by sesquilinearity this is the same as vanishing on all pairs of code vectors, which is how it is stated here (no basis is fixed).
import Mathlib import Definitions.Def_ADH2015_defs open Matrix open scoped Kronecker
namespace ADH2015
theorem oaqec_basic_theorem {e ē : Type*} [Fintype e] [Fintype ē] [DecidableEq e]
[DecidableEq ē] (C : Submodule ℂ (e × ē → ℂ)) (O : Matrix (e × ē) (e × ē) ℂ)
(hO : ActsWithin C O) :
HasRepOnBar C O ↔
∀ X : Matrix e e ℂ, ∀ v ∈ C, ∀ w ∈ C,
star w ⬝ᵥ ((O * (X ⊗ₖ (1 : Matrix ē ē ℂ)) - (X ⊗ₖ (1 : Matrix ē ē ℂ)) * O) *ᵥ v) = 0 := by sorry
end ADH2015Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let and be arbitrary finite types (index sets, possibly in different universes, possibly empty), each with decidable equality. The ambient space is , i.e. all functions , viewed as with the first factor indexed by and the second by . Let be an arbitrary complex linear subspace (no orthonormal basis, dimension, or other structure assumed), and let be an arbitrary complex matrix (not assumed Hermitian, unitary, or anything else). The Kronecker product is , so acts only on the -factor and acts only on the -factor. denotes the conjugate transpose. The pairing used is
conjugate-linear in the first argument , linear in the second.
Hypothesis (" acts within "). For every , both and ; i.e. and .
Left-hand side (" has a representation on "). There exists a complex matrix (no further condition on : not required Hermitian, unitary, etc.) such that for every ,
(Note .) The equalities are required only on vectors of , not on all of ; a single must serve for all and for both equations.
Right-hand side (commutator condition). For every complex matrix (arbitrary: not restricted to Hermitian or unitary ones), and for all and all ,
That is, the commutator has vanishing matrix elements between any two vectors of (equivalently, its compression to by the orthogonal projection onto is zero). The quantifier order is .
Assertion. Under the hypothesis that and both map into , the following are equivalent (both directions are claimed):
- () if some on satisfies and for all , then for every on and all ;
- () if for every on and all , then such a exists.
No condition on about correctability of erasure of (or anything else) is assumed; the only hypothesis beyond finiteness/decidable equality of is the invariance of under and .
Edge cases. If , the hypothesis holds for every , the left side holds (any , e.g. ), and the right side holds vacuously, so the equivalence is trivially true. If or is empty, then is empty, is the zero space, necessarily, and the statement reduces to the trivial case above. If is empty but is not (or vice versa), the same applies. When is a single point, is a scalar multiple of the identity, so the right side holds automatically for every , and the theorem then asserts that every for which is invariant under both and has such a .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.