Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Irreducible representations separate arbitrary C star algebras

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every complex C*-algebra A (C star algebra), with no separability or unit hypothesis, and every nonzero x∈A, there is a nonzero irreducible nondegenerate star-representation σ of A (Nondegenerate star-representations of a Banach star-algebra) such that σ(x)≠0. Here irreducible means that the representation acts on a nonzero Hilbert space and has no nonzero proper closed invariant subspace. Consequently the intersection of the kernels of all irreducible nondegenerate star-representations of A is zero. For the zero algebra this intersection is the empty intersection inside A={0}, which is {0}.

Facts & Assumptions

Given: AC, a complex C*-algebra A, and a nonzero x∈A.

[F1]

The C*-identity gives a:=x∗x≠0 and ∥a∥=∥x∥2; algebraically positive elements are the elements y∗y (C star algebra, Positive calculus and order estimates in a C star algebra).

[F2]

If A is unital, put D=A. Otherwise its minimal C*-unitization D=A+ is a unital C*-algebra containing A as a closed two-sided star-ideal, with the original norm on A (Minimal C star unitization).

[F3]

In a unital C*-algebra, positive b satisfies 0≤b≤∥b∥1, the positive cone is closed under conjugation b↦y∗by, and 0≤b≤c implies ∥b∥≤∥c∥; in particular b∗y∗yb≤∥y∥2b∗b (Positive calculus and order estimates in a C star algebra).

[F4]

The unital C*-subalgebra C=C∗(1,a) is nonzero and commutative. Its Gelfand transform is an isometric unital star-isomorphism onto C(Δ(C)), where Δ(C) is nonempty compact Hausdorff (Commutative Gelfand Naimark).

[F6]

A norm-one bounded complex linear functional on a subspace of a complex normed space has a norm-one bounded complex linear extension (A bounded complex linear functional on a subspace of a complex normed space extends with the same norm).

[F7]

AC implies the ultrafilter lemma (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter), and under that lemma the closed dual unit ball of a normed space is compact in its weak-star topology (Banach–Alaoglu); a weak-star closed subset of a compact space is compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact).

[F8]

The weak-star topology on D∗ is generated by the seminorms pb(ψ)=∣ψ(b)∣ for b∈D; these seminorms give convex basic neighborhoods and separate distinct functionals, so D∗ is a locally convex Hausdorff topological vector space (The dual space X^* of a normed space and its dual norm, The weak-star topology from finite evaluations, Topological vector spaces over the real and complex fields, Local convexity, convex and balanced sets, and the continuous dual).

[F9]

For a positive functional ω, positivity of ω((a+zb)∗(a+zb)) for every z∈C makes ω(b∗a)=ω(a∗b)‾. Put p=ω(a∗a), q=ω(b∗b) and u=ω(a∗b); then p+2Re⁡(zu)+q∣z∣2≥0. If q>0, take z=−uˉ/q to get ∣u∣2≤pq; if q=0, varying z forces u=0. Thus ∣ω(b∗a)∣2≤ω(a∗a)ω(b∗b). In a nonzero unital C*-algebra, ∥1∥=1 by the C*-identity, and [F3] gives b∗b≤∥b∥21. Hence ∣ω(b)∣2≤ω(b∗b)ω(1)≤∥b∥2ω(1)2, so ∥ω∥≤ω(1); evaluation at 1 gives the reverse inequality. A state therefore has ω(1)=1 (States and positive functionals on a C star algebra, Positive calculus and order estimates in a C star algebra).

[F10]

AC implies Countable Choice (AC implies DC implies countable choice); under Countable Choice an inner-product space has a Hilbert completion (The norm completion of an inner-product space is a Hilbert space), and a closed subspace of a Hilbert space has an orthogonal complement decomposition and its orthogonal projection is linear, self-adjoint, idempotent, and contractive (Orthogonal decomposition by a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

[F11]

A nondegenerate star-representation is a bounded star-representation whose represented vectors have dense linear span in the Hilbert space (Nondegenerate star-representations of a Banach star-algebra); bounded Hilbert-space operators form a C*-algebra with the Hilbert adjoint (Bounded Hilbert operators form a C star algebra).

[F12]

Every nonempty compact convex subset of a locally convex Hausdorff real or complex topological vector space has an extreme point under AC (Krein–Milman existence of extreme points).

Proof

technique · norm-attaining state, GNS construction, and a reducing-projection argument
1.1givenF1F2

Let a=x∗x. By [F1], a is positive and ∥a∥=∥x∥2>0. Choose the unital C*-algebra D of [F2], and set C=C∗(1,a)⊆D.

1.2F1F4F5

The positive calculus of Positive calculus and order estimates in a C star algebra gives b=a1/2∈C∗(1,a)=C with b=b∗ and b∗b=a. Thus the Gelfand transform sends a to the nonnegative continuous function a^(χ)=∣χ(b)∣2 on the nonempty compact space Δ(C). Its supremum norm is ∥a∥ by [F4]. By [F5], its maximum is attained at some character χ0∈Δ(C) and equals ∥a∥.

2.1F2F4F6step 1.1step 1.2

The character χ0 has norm one and takes 1 to 1. Extend it by [F6] to F∈D∗ with ∥F∥=1, F(1)=1, and F(a)=∥a∥.

2.2F7F8F9step 1.1

Define S(D)={ψ∈D∗:∥ψ∥≤1, ψ(1)=1, ψ(b∗b)≥0 for every b∈D}. Every member is a state: the unit-ball bound and ψ(1)=1 give norm one, and the remaining condition is positivity; conversely every state belongs to this set by [F9]. It is convex because its normalization and positivity constraints are preserved by convex combinations, which remain in the unit ball. Within that ball its normalization and positivity conditions are intersections of closed evaluation constraints, so [F7] and the closed-subset compactness clause there make S(D) weak-star compact. The weak-star topology is locally convex and Hausdorff by [F8].

3.1F1F3step 2.1algebra

If c=c∗∈D and t∈R, then ∣1+itF(c)∣2=∣F(1+itc)∣2≤∥1+itc∥2=∥1+t2c2∥≤1+t2∥c∥2. Expanding the left side and letting t tend to zero through positive and negative values forces Im⁡F(c)=0. If 0≤b≤1, then [F3] gives ∥1−b∥≤1; since F(b) is real, ∣1−F(b)∣≤1 implies F(b)≥0. Scaling proves F(b)≥0 for every positive b, so F is a state and F(a)=∥a∥.

4.1F3step 1.1step 2.2

Let K={ψ∈S(D):ψ(a)=∥a∥}. It is nonempty by step 3.1 and is weak-star closed, hence compact. For every ψ∈S(D), positivity and [F3], together with ψ(1)=1, give 0≤ψ(a)≤∥a∥; therefore K is convex and is a face of S(D), since a proper convex combination can attain the upper bound only if both terms attain it.

5.1F12step 4.1

By [F12], K has an extreme point φ. Because K is a face of S(D), any convex decomposition of φ in S(D) has both terms in K; extremality in K then makes both terms equal φ. Thus φ is an extreme state of D, and φ(a)=∥a∥.

6.1F3F9F10step 5.1

Define N={b∈D:φ(b∗b)=0}. Cauchy–Schwarz [F9] makes N a linear subspace, makes ⟨[b],[c]⟩=φ(c∗b) independent of representatives, and makes it positive definite on D/N; this form is linear in its first variable. For d,b∈D, [F3] gives 0≤φ(b∗d∗db)≤∥d∥2φ(b∗b), so N is a left ideal and left multiplication is bounded on the quotient with norm at most ∥d∥. By [F10], the inner-product space D/N has a Hilbert completion H under AC.

7.1F11step 6.1algebra

Define π(d)[b]=[db] on D/N and extend it continuously to H. Then ∥π(d)∥≤∥d∥, π(de)=π(d)π(e), π(1)=IH, and π(d∗)=π(d)∗: the product and unit identities hold on quotient classes, and ⟨π(d)[b],[c]⟩=φ(c∗db)=⟨[b],π(d∗)[c]⟩ gives the adjoint identity. The Hilbert adjoint has the properties used here by [F11].

8.1step 7.1step 5.1

The vector ξ=[1] has norm one, the span of π(D)ξ is dense by construction, and φ(d)=⟨π(d)ξ,ξ⟩ for every d∈D. In particular, ∥π(x)ξ∥2=φ(x∗x)=∥x∥2>0. Thus H≠{0} and π(x)≠0.

9.1F10step 8.1

Suppose a nonzero proper closed subspace M⊂H is invariant under every π(d). Since D is star-closed, M⊥ is invariant too: for v∈M⊥, m∈M, and d∈D, ⟨π(d)v,m⟩=⟨v,π(d∗)m⟩=0. By [F10] its orthogonal projection E is a nonzero proper self-adjoint idempotent commuting with every π(d). Cyclicity implies t:=∥Eξ∥2 satisfies 0<t<1, since either Eξ=0 or (I−E)ξ=0 would make E=0 or E=I on the dense cyclic span.

10.1step 5.1step 7.1step 9.1F11algebra

Put φ1(d)=t−1⟨π(d)Eξ,Eξ⟩ and φ2(d)=(1−t)−1⟨π(d)(I−E)ξ,(I−E)ξ⟩. These vector functionals are positive; they have norm one because they take 1 to 1 and are bounded by one using ∥π(d)∥≤∥d∥. Since M and M⊥ are invariant, the cross terms vanish and φ=tφ1+(1−t)φ2. The extremality of φ from step 5.1 gives φ1=φ2=φ.

11.1step 8.1step 9.1step 10.1algebra

For b,c∈D, commutation of E with π(D) and the orthogonality of M and M⊥ give ⟨Eπ(b)ξ,π(c)ξ⟩=⟨π(b)Eξ,π(c)Eξ⟩=tφ(c∗b)=t⟨π(b)ξ,π(c)ξ⟩. The vectors π(b)ξ span a dense subspace, so continuity implies E=tIH. This contradicts E2=E and 0<t<1. Thus π is irreducible.

12.1F2F11step 8.1step 11.1

If A is unital, take σ=π. If A is nonunital, its closed ideal property in [F2] makes H0=span⁡‾ π(A)H a reducing subspace for π(D): for d∈D and a∈A, both da and d∗a lie in A, so π(d) and its adjoint preserve the dense spanning set. It is nonzero because π(x)ξ≠0. Irreducibility gives H0=H, so σ:=π∣A is nondegenerate. Any closed A-invariant subspace is invariant under π(D)=π(A)+CIH, hence σ is irreducible as well. In either case σ is nonzero and σ(x)≠0.

13.1step 12.1∎

We have constructed the required representation for each nonzero x∈A, so an element in the intersection of all the stated kernels must be zero. If A={0}, there is no nonzero x, and the empty intersection inside A is A={0}, as stated.

Depends on

Used by

Dependency tree · two levels

134 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