Alphabeta Math
TheoremStatement: 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.

Gelfand transform is a contractive unital homomorphism

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let A be a nonzero commutative unital complex Banach algebra (Unital Banach algebra) with Gelfand transform Γ=ΓA:A→C(Δ(A)) (Gelfand transform). Then:

  1. Γ is a unital complex-algebra homomorphism: Γ(λa+μb)=λΓ(a)+μΓ(b), Γ(ab)=Γ(a)Γ(b) and Γ(1)=1;
  2. ∥Γ(a)∥∞=r(a) for every a∈A (Spectral radius), and consequently Γ is contractive: ∥Γ(a)∥∞≤∥a∥.

No injectivity, surjectivity or *-preservation is claimed for a general commutative unital Banach algebra.

Facts & Assumptions

Given: An assumed Axiom of Choice, a nonzero commutative unital complex Banach algebra A, its character space Δ(A) with the pointwise-evaluation topology, and Γ=ΓA.

[L1]

Every character of A satisfies χ(1)=1 and ∣χ(a)∣≤∥a∥ for all a∈A (Characters on a unital Banach algebra are continuous).

[L2]

Γ(a)=a^ with a^(χ)=χ(a), and each a^ is continuous on Δ(A) by the definition of the evaluation topology (Gelfand transform).

[L3]

σA(a)={χ(a):χ∈Δ(A)}, and every character satisfies ∣χ(a)∣≤r(a)≤∥a∥ (Spectrum as character values, Spectral radius, The Axiom of Choice).

Proof

technique · direct
1.1L1

For χ∈Δ(A) we have χ(1)=1 and ∣χ(a)∣≤∥a∥ for every a, by [L1].

1.2L2

Each a^ is a continuous complex-valued function on Δ(A), since a^ is the evaluation map ea and the evaluation topology makes all ea continuous; thus Γ(a)∈C(Δ(A)) and it makes sense to speak of ∥Γ(a)∥∞.

1.3L2

Γ is complex-linear and multiplicative: for all χ∈Δ(A), Γ(λa+μb)(χ)=χ(λa+μb)=λχ(a)+μχ(b)=(λΓ(a)+μΓ(b))(χ) and Γ(ab)(χ)=χ(ab)=χ(a)χ(b)=(Γ(a)Γ(b))(χ), by linearity and multiplicativity of characters.

1.4L3

{χ(a):χ∈Δ(A)}=σA(a) and ∣χ(a)∣≤r(a)≤∥a∥ for every χ, by [L3].

2.1step 1.1step 1.4L3algebra

∥Γ(a)∥∞=r(a) for every a: the set of values {a^(χ):χ}={χ(a):χ} equals σA(a) by [step 1.4], and by [step 1.1] and [L1] the function a^ is bounded with ∣a^(χ)∣≤∥a∥, so the supremum over χ of ∣a^(χ)∣ is the maximum of ∣z∣ over z∈σA(a), that is, r(a); in particular ∥Γ(a)∥∞≤∥a∥.

2.2step 1.1

Γ(1)=1, the constant function one: Γ(1)(χ)=χ(1)=1 for every χ by [step 1.1].

3.1step 1.3step 2.1step 2.2∎

By [step 1.3], [step 2.1] and [step 2.2], Γ is a unital algebra homomorphism with ∥Γ(a)∥∞=r(a)≤∥a∥ for all a; hence it is contractive.

Remarks

  • The sup norm is finite. Boundedness of a^ is not assumed: it follows from the norm bound ∣χ(a)∣≤∥a∥ of [L1], so the supremum in ∥Γ(a)∥∞ is taken over a bounded set of values.
  • The formula ∥a^∥∞=r(a) is the exact quantitative content of the theorem; the inequality r(a)≤∥a∥ is the contractivity, and for a general Banach algebra it may be strict.

Depends on

Dependency tree · 2 levels

Sources