Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 2.7, p. 14 — i∼j  ⟺  IiAIj≠{0}i\sim j \iff I_i\mathcal A I_j\neq\{0\}i∼j⟺Ii​AIj​={0} is an equivalence relation

Proved
InvariantSDP.BlockDiag.blockRel_equivalence

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-diagonalizationequivalence-relationmatrix-star-algebrap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A⊆Cn×n\mathcal A \subseteq \mathbb C^{n\times n}A⊆Cn×n be a matrix ∗-algebra and let B\mathcal BB be an inclusionwise maximal commutative ∗-subalgebra of A\mathcal AA in diagonal form B=CI1+⋯+CIk\mathcal B = \mathbb C I_1 + \dots + \mathbb C I_kB=CI1​+⋯+CIk​ for a partition [n]=S0∪S1∪⋯∪Sk[n] = S_0 \cup S_1 \cup \dots \cup S_k[n]=S0​∪S1​∪⋯∪Sk​ with S1,…,SkS_1, \dots, S_kS1​,…,Sk​ nonempty. Define the relation ∼\sim∼ on {1,…,k}\{1, \dots, k\}{1,…,k} by

i∼j  ⟺  IiAIj≠{0},i \sim j \iff I_i \mathcal A I_j \neq \{0\},i∼j⟺Ii​AIj​={0},

i.e. there is X∈AX \in \mathcal AX∈A with IiXIj≠0I_i X I_j \neq 0Ii​XIj​=0. Then ∼\sim∼ is an equivalence relation.

Its classes group the diagonal blocks into the simple components of A\mathcal AA: summing IjI_jIj​ over a class gives the minimal idempotents E1,…,EdE_1, \dots, E_dE1​,…,Ed​ of the center.

Formalization Note Indices are 0-based (Fin k for {1,…,k}\{1,\dots,k\}{1,…,k}). 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
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me