Lemma 1: commutant closed under adjoints
ProvedQAlgorithms.Papers.Independent.Advance50.P50.lemma1prove2quantum
Fix , , and a subgroup . For every complex operator on the copies,
There is no assumption that itself is Hermitian or nonzero. This supplies adjoint closure for the physical symmetry space.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P50
open MeasureTheory ProbabilityTheory
open scoped ComplexConjugate ENNReal
-- Exact accepted primitives; no paper-local redeclarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)
open QAlgorithms.Papers.Independent.Information100.P32 (purity)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
-- Matrices carry the associative commutator bracket X*Y-Y*X.
attribute [local instance 100] LieRing.ofAssociativeRing
/-- PDF p.23, Lemma 1: unitary-group commutants are closed under adjoints. -/
theorem lemma1 {n k : ℕ} (hk : 0 < k)
(G : Subgroup (Matrix.unitaryGroup (Qubits n) ℂ))
(A : Mat (Copies (Qubits n) k)) (hA : A ∈ tensorCommutant k (groupMatrices G)) :
A.conjTranspose ∈ tensorCommutant k (groupMatrices G) := by sorry
end QAlgorithms.Papers.Independent.Advance50.P50
end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 23, Lemma 1: commutant closed under adjoints
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , positive natural number , subgroup of the unitary matrices on -bit configurations, and arbitrary complex matrix indexed by -tuples of such configurations, suppose commutes with every matrix for , where
Then also commutes with every for . No Hermiticity assumption is imposed on , and is allowed.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.