Proof of Theorem 2.7, p. 14, observations (i)–(ii) — diagonal blocks are scalar, the rows and columns vanish
ProvedInvariantSDP.BlockDiag.obs_i_iiLet be a matrix ∗-algebra, and let be an inclusionwise maximal commutative ∗-subalgebra of that is in diagonal form for a partition with nonempty, the zero-one diagonal matrix of . Then for every :
- (i) for each there is with , and ;
- (ii) and .
In the paper's block notation (the restriction of to rows and columns ): is a multiple of the identity, , and , are zero for all . Consequently acts as the identity on .
Formalization Note The block is represented by the full product , which carries the same entries padded with zeros. The paper's "we may assume is in diagonal form" (after a unitary change of basis supplied by Theorem 2.2) is taken as the hypothesis IsDiagForm B S. Since , item (ii) for all is exactly . Partition indices are 0-based, with none for .
import Mathlib import Definitions.Def_InvariantSDP_BlockDiag_Basic
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.