Section 3.5 — algebraic no-cloning: operators represented on and on commute on the code
ProvedADH2015.algebraic_noCloningLet 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 ). Then:
- if and act within , has a representation on and has a representation on , then for every ;
- for any set of operators each of which acts within and has representations both on and on , any two elements of commute on .
In particular a non-abelian algebra of logical operators cannot be represented both on and on : quantum information about a non-commuting set of observables cannot be accessible from two complementary subsystems at once.
import Mathlib import Definitions.Def_ADH2015_defs open Matrix open scoped Kronecker
namespace ADH2015
theorem algebraic_noCloning {e ē : Type*} [Fintype e] [Fintype ē] [DecidableEq e]
[DecidableEq ē] (C : Submodule ℂ (e × ē → ℂ)) :
(∀ O₁ O₂ : Matrix (e × ē) (e × ē) ℂ, ActsWithin C O₁ → ActsWithin C O₂ →
HasRepOnBar C O₁ → HasRepOnE C O₂ →
∀ v ∈ C, O₁ *ᵥ (O₂ *ᵥ v) = O₂ *ᵥ (O₁ *ᵥ v)) ∧
(∀ S : Set (Matrix (e × ē) (e × ē) ℂ),
(∀ O ∈ S, ActsWithin C O ∧ HasRepOnBar C O ∧ HasRepOnE C O) →
∀ O₁ ∈ S, ∀ O₂ ∈ S, ∀ v ∈ C, O₁ *ᵥ (O₂ *ᵥ v) = O₂ *ᵥ (O₁ *ᵥ v)) := 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 of the two tensor factors, called and ), each equipped with decidable equality; they may be of any universe and either may be empty. The ambient space is , the complex vectors indexed by pairs with , , which is identified with (first factor , second factor ). Let be an arbitrary complex linear subspace (the "code subspace"); no further condition is placed on — it may be , all of , or anything in between, and no error-correction property of is assumed. Operators are complex square matrices indexed by , acting on column vectors by ; denotes the conjugate transpose. For matrices and , is the Kronecker product with entries ; , are identity matrices.
Custom definitions (unfolded). For an operator on :
- : for every , both and .
- ("representable on the second factor "): there exists a matrix such that for every ,
- ("representable on the first factor "): there exists a matrix such that for every ,
In both representation notions the representing matrix ( or ) is arbitrary (not required to be unitary, Hermitian, etc.), and agreement with and with is required only on vectors of , not on all of . Nothing is required of itself beyond what is stated (no Hermiticity, unitarity, or invertibility).
Assertion. For all such , the conjunction of the following two statements holds.
(1) Pairwise statement. For all operators on : if , , has a representation on (some as above), and has a representation on (some as above), then
No representation of on or of on is assumed. The roles are asymmetric: is the one represented on , the one represented on .
(2) Set statement. For every set of operators on such that every satisfies all three of , and , it holds that for all (including ) and every ,
Exact strength and edge cases. The conclusion in both parts is commutation only when applied to vectors in (equality of the vectors and for ); it is not commutation of the matrices and on all of , and not a statement about the projected operators. Both parts are implications with the hypotheses stated; no converse is asserted. In part (2), if the statement holds vacuously; the case is trivially true. If , every operator satisfies all three predicates (with any , ) and the conclusion is trivially true, so both parts hold trivially for the zero subspace. If or is empty, is the zero space and everything is trivial. Part (2) is a separate conjunct; it is not derived within the statement from part (1), though each element of satisfies the hypotheses on both sides. The definition from the same definitions file is not used in this statement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.