Proof of Theorem 2.7, p. 14 — is an equivalence relation
ProvedInvariantSDP.BlockDiag.blockRel_equivalenceblock-diagonalizationequivalence-relationmatrix-star-algebrap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a matrix ∗-algebra and let be an inclusionwise maximal commutative ∗-subalgebra of in diagonal form for a partition with nonempty. Define the relation on by
i.e. there is with . Then is an equivalence relation.
Its classes group the diagonal blocks into the simple components of : summing over a class gives the minimal idempotents of the center.
Formalization Note Indices are 0-based (Fin k for ). The setting is the same as for observations (i)–(iii).
Preamble
import Mathlib import Definitions.Def_InvariantSDP_BlockDiag_Basic
Formal statement
namespace InvariantSDP.BlockDiag
/-- Proof of Theorem 2.7, p. 14: in the setting of observations (i)–(iii), the relation `i ∼ j` iff
`I_i 𝒜 I_j ≠ {0}` is an equivalence relation on `{1, …, k}`. -/
theorem blockRel_equivalence {n k : ℕ} (A B : NonUnitalStarSubalgebra ℂ (Matrix (Fin n) (Fin n) ℂ))
(S : Fin n → Option (Fin k)) (hB : IsMaxCommutative A B) (hS : IsDiagForm B S) :
Equivalence (blockRel A S) := by sorry
end InvariantSDP.BlockDiag
Source
Bachoc, Gijswijt, Schrijver & Vallentin, Invariant semidefinite programs, arXiv:1007.2905v2, p. 14, proof of Theorem 2.7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.