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.
Characters on a unital commutative C star algebra preserve star
Statement
Let be a unital commutative complex C*-algebra (C star algebra, Unital Banach algebra) and let be a character (Character and maximal ideal space). Then
The argument is choice-free and does not use the later theorem that the spectrum of a self-adjoint element is real.
Facts & Assumptions
Given: A unital commutative complex C*-algebra and a character on .
is unital and contractive: and for every ; is complex-linear and multiplicative (Characters on a unital Banach algebra are continuous, Character and maximal ideal space).
and the norm is submultiplicative and satisfies the triangle inequality; the multiplication is commutative (C star algebra, Unital Banach algebra).
is self-adjoint when (Self-adjoint positive unitary and normal elements).
Proof
First : taking adjoints of and using surjectivity of the involution shows is a two-sided identity, hence equals by uniqueness. For a self-adjoint and real the element satisfies : indeed by [F3] and conjugate-linearity of the involution, and multiplying out in the commutative algebra gives .
is complex-linear with and for all ; in particular .
For set and . Conjugate-linearity and involutivity give and , while and . Thus both parts are self-adjoint by [F3].
For a self-adjoint and real : , using [step 1.1], [step 1.2], the C*-identity, the triangle inequality and submultiplicativity.
Writing with real, the inequality of [step 2.1] reads , that is, for every real . If then makes the left side tend to ; if then does the same; both contradict the uniform upper bound. Hence and for every self-adjoint .
For arbitrary as in [step 1.3]: by [step 3.1] and linearity.
Remarks
- The two signs of are both needed. The estimate at a single real only bounds from one side, and it is the freedom to take arbitrarily large in both directions that forces .
- The lemma is what makes the Gelfand transform a -map in the commutative Gelfand–Naimark theorem; without it, the range of would be a mere algebra of functions.
Depends on
Used by
Dependency tree · two levels
16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Vahid Shirbisheh, Lectures on C-star Algebras, v2 — Proposition 3.1.31, printed p. 64 (standard reference, not scraped)
- Theo Bühler and Dietmar A. Salamon, Functional Analysis — §5.5.1, printed pp. 258–262 (standard reference, not scraped)