Finite-dimensional complex C*-algebras have unique matrix block sizes
OpenQAlgorithms.Papers.Independent.Intakethird100.P96.finite_cstar_classificationLet be a finite-dimensional complex C*-algebra. There is a unique finite nonincreasing list of positive integers for which
as complex star algebras. The empty list is allowed and represents the zero algebra. The isomorphism itself need not be unique.
The ordered list completely determines the algebra up to star isomorphism. A finite direct sum is represented by the componentwise finite product.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P96
noncomputable section
open scoped TensorProduct Kronecker BigOperators
namespace QAlgorithms.Papers.Independent.Intakethird100.P96
open QAlgorithms.Papers.Independent.Information100.P26 (Mat)
/-- Proposition 11, PDF p.18: unique ordered positive matrix sizes.
The empty list represents the zero algebra. Finite products are finite direct sums. -/
theorem finite_cstar_classification (A : Type*) [CStarAlgebra A] [FiniteDimensional ℂ A] :
∃! sizes : List ℕ,
(∀ n ∈ sizes, 0 < n) ∧ sizes.Pairwise (fun a b => b ≤ a) ∧
Nonempty (A ≃⋆ₐ[ℂ] ((i : Fin sizes.length) → Mat (sizes.get i))) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P96
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every complex -algebra that is finite dimensional over , there exists exactly one finite list of natural numbers such that every entry is strictly positive, the entries are weakly decreasing ( whenever ), and there exists a complex linear, multiplicative, involution-preserving algebra equivalence
The uniqueness concerns the list of sizes; the equivalence is only asserted to exist. The list may be empty, in which case the product is the algebra with one element.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.