Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Characters on a unital commutative C star algebra preserve star

Statement

Let A be a unital commutative complex C*-algebra (C star algebra, Unital Banach algebra) and let χ:A→C be a character (Character and maximal ideal space). Then

χ(a∗)  =  χ(a)‾(a∈A).

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 A and a character χ on A.

[F1]

χ is unital and contractive: χ(1)=1 and ∣χ(x)∣≤∥x∥ for every x∈A; χ is complex-linear and multiplicative (Characters on a unital Banach algebra are continuous, Character and maximal ideal space).

[F2]

∥x∗x∥=∥x∥2 and the norm is submultiplicative and satisfies the triangle inequality; the multiplication is commutative (C star algebra, Unital Banach algebra).

[F3]

s∈A is self-adjoint when s∗=s (Self-adjoint positive unitary and normal elements).

Proof

technique · direct
1.1F2F3algebra

First 1∗=1: taking adjoints of 1b=b=b1 and using surjectivity of the involution shows 1∗ is a two-sided identity, hence equals 1 by uniqueness. For a self-adjoint s∈A and real t the element s+it1 satisfies (s+it1)∗(s+it1)=s2+t21: indeed (s+it1)∗=s−it1 by [F3] and conjugate-linearity of the involution, and multiplying out in the commutative algebra gives s2+its−its+t21=s2+t21.

1.2F1

χ is complex-linear with χ(1)=1 and ∣χ(x)∣≤∥x∥ for all x; in particular χ(s+it1)=χ(s)+it.

1.3F2F3algebra

For a∈A set s=(a+a∗)/2 and t=(a−a∗)/(2i). Conjugate-linearity and involutivity give s∗=(a∗+a)/2=s and t∗=−(a∗−a)/(2i)=t, while s+it=a and s−it=a∗. Thus both parts are self-adjoint by [F3].

2.1step 1.1step 1.2F2

For a self-adjoint s and real t: ∣χ(s)+it∣2=∣χ(s+it1)∣2≤∥s+it1∥2=∥(s+it1)∗(s+it1)∥=∥s2+t21∥≤∥s2∥+t2≤∥s∥2+t2, using [step 1.1], [step 1.2], the C*-identity, the triangle inequality and submultiplicativity.

3.1step 2.1algebra

Writing χ(s)=u+iv with u,v real, the inequality of [step 2.1] reads u2+(v+t)2≤∥s∥2+t2, that is, u2+v2+2vt≤∥s∥2 for every real t. If v>0 then t→+∞ makes the left side tend to +∞; if v<0 then t→−∞ does the same; both contradict the uniform upper bound. Hence v=0 and χ(s)∈R for every self-adjoint s.

4.1step 1.3step 3.1F1algebra∎

For arbitrary a=s+it as in [step 1.3]: χ(a∗)=χ(s−it)=χ(s)−iχ(t)=χ(s)+iχ(t)‾=χ(a)‾ by [step 3.1] and linearity.

Remarks

  • The two signs of t are both needed. The estimate at a single real t only bounds v from one side, and it is the freedom to take t arbitrarily large in both directions that forces v=0.
  • 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

Dependency tree · 2 levels

Sources