Proof of Theorem 2.7, p. 14 — a maximal commutative ∗-subalgebra contains every element of commuting with it
ProvedInvariantSDP.BlockDiag.maxComm_commutant_subsetblock-diagonalizationcommutantmatrix-star-algebrap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a matrix ∗-algebra and let be an inclusionwise maximal commutative ∗-subalgebra of . Then every that commutes with every element of is itself an element of :
This is the first step of the paper's elementary proof of Theorem 2.7: the relative commutant of in is itself, which later forces the diagonal blocks of every element of to be scalar.
Formalization Note Matrix ∗-algebras are NonUnitalStarSubalgebras (no unit assumed); maximality is among commutative NonUnitalStarSubalgebras between and .
Preamble
import Mathlib import Definitions.Def_InvariantSDP_BlockDiag_Basic
Formal statement
namespace InvariantSDP.BlockDiag
/-- Proof of Theorem 2.7, p. 14: if `ℬ ⊆ 𝒜` is an inclusionwise maximal commutative ∗-subalgebra, then every
element of `𝒜` commuting with all of `ℬ` lies in `ℬ`. -/
theorem maxComm_commutant_subset {n : ℕ} (A B : NonUnitalStarSubalgebra ℂ (Matrix (Fin n) (Fin n) ℂ))
(hB : IsMaxCommutative A B) :
∀ X ∈ A, (∀ Y ∈ B, X * Y = Y * X) → X ∈ B := by sorry
end InvariantSDP.BlockDiag
Source
Bachoc, Gijswijt, Schrijver & Vallentin, Invariant semidefinite programs, arXiv:1007.2905v2, p. 14, proof of Theorem 2.7, first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.