Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

C star algebra generated by a normal operator

Definition

Assume Countable Choice and let H be a nonzero complex Hilbert space with T∈B(H) (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators). The unital ∗-algebra generated by T is the smallest subset P(T)⊆B(H) containing the identity I and T that is closed under addition, scalar multiplication, multiplication and the adjoint. The C*-algebra generated by T is its norm closure

C∗(I,T):=P(T)‾ ∥⋅∥⊆B(H).

For an arbitrary T, the concrete elements of P(T) are finite linear combinations of finite words in the two letters T and T∗. When T is normal, the two letters commute and every such word can be reordered, so in that case

P(T)={∑j,kcjkTj(T∗)k:only finitely many cjk≠0}.

Well-definedness and the algebra structure. The set P(T) is a complex ∗-subalgebra of B(H) containing I, and the closure of a ∗-subalgebra of a C*-algebra is again a unital ∗-subalgebra: sums, products and adjoints of limits are the limits of the corresponding sums, products and adjoints, because the algebra operations and the adjoint are continuous (Hilbert-adjoint identities, Bounded Hilbert operators form a C star algebra, C star algebra). A closed subset of the complete space B(H) is complete, so C∗(I,T) with the inherited norm, multiplication, unit and adjoint is itself a unital complex C*-algebra, a unital C*-subalgebra of B(H) with the same identity I.

Commutativity is exactly normality. If T is normal (Self-adjoint, positive, unitary and normal operators), then T commutes with T∗, hence any two words in T and T∗ commute, hence any two ∗-polynomials commute, so P(T) is commutative; commutativity passes to the closure because if AnBn=BnAn and An→A, Bn→B, then AB=BA by continuity of multiplication. Conversely, if C∗(I,T) is commutative, then the elements T and T∗ of it commute, that is TT∗=T∗T and T is normal. In particular C∗(I,T) is a nonzero commutative unital C*-algebra exactly when T is normal, and only that case is fed to the Gelfand theory later on this page.

Minimality convention. C∗(I,T) is the smallest closed unital ∗-subalgebra of B(H) containing T: every closed unital ∗-subalgebra contains P(T) and hence its closure. No generator other than I and T is adjoined, and the definition does not presuppose any particular representation of the generated algebra (The operator norm as the least bound and as the unit-sphere or unit-ball supremum for the norm used in the closure).

Depends on

Dependency tree · 2 levels

Sources