Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 2.7, p. 14, observations (i)–(ii) — diagonal blocks are scalar, the S0S_0S0​ rows and columns vanish

Proved
InvariantSDP.BlockDiag.obs_i_ii

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

block-diagonalizationmatrix-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 that is in diagonal form B={λ1I1+⋯+λkIk:λi∈C}\mathcal B = \{\lambda_1 I_1 + \dots + \lambda_k I_k : \lambda_i \in \mathbb C\}B={λ1​I1​+⋯+λk​Ik​:λi​∈C} 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, IiI_iIi​ the zero-one diagonal matrix of SiS_iSi​. Then for every X∈AX \in \mathcal AX∈A:

  1. (i) for each i=1,…,ki = 1, \dots, ki=1,…,k there is c∈Cc \in \mathbb Cc∈C with IiXIi=c IiI_i X I_i = c\, I_iIi​XIi​=cIi​, and I0XI0=0I_0 X I_0 = 0I0​XI0​=0;
  2. (ii) I0X=0I_0 X = 0I0​X=0 and XI0=0X I_0 = 0XI0​=0.

In the paper's block notation XijX_{ij}Xij​ (the restriction of IiXIjI_iXI_jIi​XIj​ to rows SiS_iSi​ and columns SjS_jSj​): XiiX_{ii}Xii​ is a multiple of the identity, X00=0X_{00} = 0X00​=0, and X0iX_{0i}X0i​, Xi0X_{i0}Xi0​ are zero for all i=0,…,ki = 0, \dots, ki=0,…,k. Consequently I1+⋯+IkI_1 + \dots + I_kI1​+⋯+Ik​ acts as the identity on A\mathcal AA.

Formalization Note The block XijX_{ij}Xij​ is represented by the full n×nn\times nn×n product IiXIjI_iXI_jIi​XIj​, which carries the same entries padded with zeros. The paper's "we may assume B\mathcal BB is in diagonal form" (after a unitary change of basis supplied by Theorem 2.2) is taken as the hypothesis IsDiagForm B S. Since I0+I1+⋯+Ik=II_0 + I_1 + \dots + I_k = II0​+I1​+⋯+Ik​=I, item (ii) for all iii is exactly I0X=0=XI0I_0X = 0 = XI_0I0​X=0=XI0​. Partition indices are 0-based, with none for S0S_0S0​.

Preamble
import Mathlib
import Definitions.Def_InvariantSDP_BlockDiag_Basic
Formal statement
namespace InvariantSDP.BlockDiag

/-- Proof of Theorem 2.7, p. 14, observations (i) and (ii): with `ℬ` a maximal commutative ∗-subalgebra of
`𝒜` in the diagonal form `ℬ = ℂI₁ + ⋯ + ℂI_k`, for every `X ∈ 𝒜` each diagonal block `I_i X I_i` is a
multiple of `I_i`, `I₀ X I₀ = 0`, and `I₀ X = X I₀ = 0`. -/
theorem obs_i_ii {n k : ℕ} (A B : NonUnitalStarSubalgebra ℂ (Matrix (Fin n) (Fin n) ℂ))
    (S : Fin n → Option (Fin k)) (hB : IsMaxCommutative A B) (hS : IsDiagForm B S)
    (X : Matrix (Fin n) (Fin n) ℂ) (hX : X ∈ A) :
    ((∀ i : Fin k, ∃ c : ℂ,
        zeroOneDiag S (some i) * X * zeroOneDiag S (some i) = c • zeroOneDiag S (some i)) ∧
      zeroOneDiag S none * X * zeroOneDiag S none = 0) ∧
    (zeroOneDiag S none * X = 0 ∧ X * zeroOneDiag S none = 0) := by sorry

end InvariantSDP.BlockDiag
Source
Bachoc, Gijswijt, Schrijver & Vallentin, Invariant semidefinite programs, arXiv:1007.2905v2, p. 14, proof of Theorem 2.7, observations (i) and (ii)
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