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.

Commutative Gelfand duality

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let CHaus≠∅ be the category whose objects are nonempty compact Hausdorff spaces and whose arrows are continuous maps, and let uC≠0∗ be the category whose objects are nonzero unital commutative complex C*-algebras (C star algebra) and whose arrows are unital ∗-homomorphisms. Then the assignments

X⟼C(X,C),A⟼Δ(A),

together with the pullback g↦g∗, g∗(f):=f∘g, on continuous maps and the transpose φ↦φ∗, φ∗(ψ):=ψ∘φ, on unital ∗-homomorphisms, define a contravariant equivalence of categories: for every compact Hausdorff X the evaluation map ηX:X→Δ(C(X)), ηX(x)=evx, is a homeomorphism, for every unital commutative C*-algebra A the Gelfand transform ΓA:A→C(Δ(A)) is an isometric unital ∗-isomorphism (Commutative Gelfand Naimark), these identifications are natural, and the two arrow assignments are mutually inverse under them. The empty space and zero algebra are excluded because this library's unital Banach-algebra convention requires a nonzero unit of norm one.

Facts & Assumptions

Given: The Axiom of Choice, the categories CHaus≠∅ and uC≠0∗ as described in the statement.

[L1]

For a nonzero unital commutative C*-algebra A, the Gelfand transform ΓA:A→C(Δ(A)) is an isometric unital ∗-isomorphism onto C(Δ(A)) (Commutative Gelfand Naimark, The Axiom of Choice).

[L2]

For a nonempty compact Hausdorff space X, the evaluation map ηX:X→Δ(C(X)) is a homeomorphism, under Dependent Choice, which follows from the Axiom of Choice (Characters of continuous functions are evaluations).

[L3]

In a unital commutative C*-algebra a ∗-homomorphism between unital algebras is unital by hypothesis here; the transpose φ∗(ψ)=ψ∘φ of a unital ∗-homomorphism φ is nonzero because ψ(φ(1A))=ψ(1B)=1, and it is a character of the domain; likewise g∗(f)=f∘g is a unital ∗-homomorphism of unital commutative C*-algebras.

Proof

technique · direct
1.1L1L2algebra

The object assignments are well defined: for nonempty compact Hausdorff X, the algebra C(X,C) is a nonzero unital commutative complex C*-algebra with the supremum norm and pointwise conjugation; and for every nonzero unital commutative C*-algebra A, the character space Δ(A) is a nonempty compact Hausdorff space by Maximal ideal space is compact Hausdorff.

1.2L3algebra

For a continuous map g:Y→X between compact Hausdorff spaces, the pullback g∗:C(X)→C(Y), g∗(f)=f∘g, is a unital ∗-homomorphism: it is complex-linear, multiplicative, preserves constants and conjugation, and is bounded with ∥g∗∥≤1; the identity map induces the identity pullback and (g∘h)∗=h∗∘g∗ for composable continuous maps.

1.3L3algebra

For a unital ∗-homomorphism φ:A→B of unital commutative C*-algebras, the transpose φ∗:Δ(B)→Δ(A), φ∗(ψ)=ψ∘φ, is well defined: ψ∘φ is a nonzero complex-linear multiplicative map because ψ is, and (ψ∘φ)(1A)=ψ(1B)=1 by unitality of ψ and φ; it is continuous for the evaluation topologies, since for a∈A the composition ψ↦(ψ∘φ)(a)=ψ(φ(a)) is the evaluation at φ(a). Moreover (idA)∗=idΔ(A) and (ψ∘φ)∗=φ∗∘ψ∗ for composable unital ∗-homomorphisms.

2.1step 1.2step 1.3L1L2algebra

The evaluation homeomorphisms of [L2] and the inverse Gelfand isomorphisms ΓA−1 of [L1] are the components of natural isomorphisms: for a continuous g:Y→X and y∈Y one has evg(y)=evy∘g∗, that is, ηX∘g=g∗∗∘ηY; and for a unital ∗-homomorphism φ:A→B, every ψ∈Δ(B) satisfies ΓB(φ(a))(ψ)=ψ(φ(a))=(ψ∘φ)(a)=ΓA(a)(φ∗(ψ)), that is, ΓB∘φ=φ∗∗∘ΓA.

3.1step 1.2step 1.3step 2.1L1L2

The assignments are inverse equivalences on arrows: given a unital ∗-homomorphism φ:A→B, naturality in [step 2.1] gives φ=ΓB−1∘(φ∗)∗∘ΓA, so φ is determined by φ∗; given a continuous g:Y→X, the same identity at the space level gives g=ηX−1∘(g∗)∗∘ηY, so g is determined by g∗; and both φ↦φ∗ and g↦g∗ preserve identities and composition in the reversed order by [step 1.2] and [step 1.3]. Hence the two contravariant functors are mutually inverse up to the natural isomorphisms η and Γ−1.

4.1step 3.1L1L2∎

The object-level identifications [L1], [L2] and the arrow-level bijections [step 3.1] define a contravariant equivalence between CHaus≠∅ and uC≠0∗, as claimed.

Remarks

  • AC and DC are both inherited. The Gelfand–Naimark side spends AC, the evaluation side inherits DC from Urysohn through Characters of continuous functions are evaluations; the derivation DC from AC is the declared dependency, so no choice principle weaker than what is used is claimed.
  • "Equivalence", not "duality of objects only". The content is the arrow-level statement of [step 3.1]: the two functors are inverse on hom-sets through the natural isomorphisms. The nonempty/nonzero restriction makes the statement agree with the library's normalized unital Banach-algebra convention.

Depends on

Dependency tree · 2 levels

Sources