Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 2.7, p. 14 — a maximal commutative ∗-subalgebra contains every element of A\mathcal AA commuting with it

Proved
InvariantSDP.BlockDiag.maxComm_commutant_subset

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

block-diagonalizationcommutantmatrix-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⊆A\mathcal B \subseteq \mathcal AB⊆A be an inclusionwise maximal commutative ∗-subalgebra of A\mathcal AA. Then every X∈AX \in \mathcal AX∈A that commutes with every element of B\mathcal BB is itself an element of B\mathcal BB:

X∈A,XY=YX  for all Y∈B⟹X∈B.X \in \mathcal A,\quad XY = YX \ \text{ for all } Y \in \mathcal B \quad\Longrightarrow\quad X \in \mathcal B.X∈A,XY=YX  for all Y∈B⟹X∈B.

This is the first step of the paper's elementary proof of Theorem 2.7: the relative commutant of B\mathcal BB in A\mathcal AA is B\mathcal BB itself, which later forces the diagonal blocks of every element of A\mathcal AA to be scalar.

Formalization Note Matrix ∗-algebras are NonUnitalStarSubalgebras (no unit assumed); maximality is among commutative NonUnitalStarSubalgebras between B\mathcal BB and A\mathcal AA.

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
  • 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