Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Primitive ideals have standard Borel quotient-norm codings

Statement

Assume AC. For a separable C*-algebra A, bounded quotient C*-seminorms on a countable rational-complex dense star algebra code all closed ideals in a compact metrizable space. The proper primitive codes form a Borel subset; this standard Borel structure equals the Borel structure of the hull-kernel topology. Every proper closed prime ideal is primitive. The pure-state-to-GNS-kernel map is continuous and open onto Prim⁡(A), and Prim⁡(A) is Baire. A proper ideal is prime when two closed ideals with product contained in it cannot both strictly contain it; primitive means a kernel of an irreducible representation.

Facts & Assumptions

Given: The Statement hypotheses and AC.

[F1]

GNS purity, separability, Polish pure states and pure norming states are supplied by C star state GNS construction, purity and Polish pure-state spaces; pure-state neighborhood cutoffs are supplied by Pure-state excision and density of faithful essential vector-state orbits.

[F2]

Quotients are C*-algebras, positive continuous calculus is natural under star-homomorphisms, and ideal approximate units exist (Quotients of C star algebras by closed two-sided ideals, Positive calculus and order estimates in a C star algebra, Positive contractive approximate units for C star algebras and ideals).

[F3]

In a nondegenerate irreducible image, bounded density approximates every contraction on finite vectors (Bounded density and finite-vector transitivity for C*-representations). The hull-kernel convention is The primitive ideal space of a group C star algebra.

[A1]

AC supplies countable dense families and the declared supplier hypotheses (The Axiom of Choice).

Proof

technique · direct

Given: The Statement hypotheses and Facts.

1.1F1F2F3A1algebra

Choose a countable norm-dense rational-complex star subalgebra D={dn}, by closing a countable dense family under finite rational-complex sums, products and adjoints. For a pure state ϕ, cyclicity gives ∥πϕ(a)∥2=sup⁡dϕ(d∗a∗ad)/ϕ(d∗d), where d∈D and positive denominators are retained: the vectors πϕ(d)ξ are dense, and the ratios are their squared norm quotients. Hence strict quotient-norm superlevel sets pull back to unions of the open tests ϕ(d∗d)>0, ϕ(d∗a∗ad)>r2ϕ(d∗d). In the hull-kernel topology {J:∥a+J∥>r} is open, since it says the positive cutoff (∣a∣−r)+ is not in J. These opens generate that topology: every ideal-open is a union of such tests. Thus the kernel map is continuous.

2.1F1F2step 1.1algebra

Let O be open in P(A) and ϕ∈O. By [F1] there is a≥0, ∥a∥=ϕ(a)=1 and 0<ϵ<1 with Ua,ϵ∩P(A)⊆O. Its kernel image is exactly {J:∥a+J∥>1−ϵ}. One inclusion follows from ψ(a)≤∥πψ(a)∥. For the other, in an irreducible representation with kernel J the norm of a positive operator is the supremum of its expectations on unit vectors, so such a vector yields a pure vector state in Ua,ϵ with the same kernel. Therefore the image of O is open, and the map is onto by taking a unit cyclic vector in any irreducible representation. It is consequently continuous, open and surjective.

2.2F2step 1.1A1algebra

There is a countable cofinal family of nonzero ideals: from a countable dense family of positive contractions an take every nonzero (an−r)+ for positive rational r. If J≠0, approximate a positive norm-one b∈J within δ<1/4 and choose δ<r<1/2; its cutoff belongs to J by quotient calculus and is nonzero. Moreover these ideal-opens form a countable base: if J0 avoids an ideal K, choose b∈K+ with ∥b∥=1, ∥b+J0∥>0, and approximate closely enough that a cutoff lies in K but remains nonzero modulo J0. Its ideal-open contains J0 and is contained in the ideal-open of K.

2.3F2F4step 1.1algebra

Code a seminorm q by (q(dn))n∈∏n[0,∥dn∥], imposing the rational-complex seminorm laws, q(xy)≤q(x)q(y), q(x∗)=q(x) and q(x∗x)=q(x)2. These are countably many closed equations or inequalities. The product has a complete weighted metric by [F4]; finitely approximating its first coordinates and ignoring the small metric tail proves total boundedness, hence compactness by [F4]. Every such q is norm-Lipschitz, since ∣q(x)−q(y)∣≤q(x−y)≤∥x−y∥, so it extends uniquely to A. Its kernel is a closed ideal. The metric completion of its quotient seminorm exists by [F4]; multiplication extends along Cauchy sequences by submultiplicativity and boundedness of Cauchy sequences, the isometric adjoint extends as well, and the C*-identity passes to limits. It is therefore a C*-algebra; the induced injective star map from the usual C*-quotient A/ker⁡q to that completion is isometric: if a positive element lost norm, a continuous spectral cutoff vanishing at0 and supported above the image norm would be nonzero but mapped to0, contradicting injectivity. Thus q(a)=∥a+ker⁡q∥. Conversely every closed ideal gives these laws. This proves the claimed compact metrizable code space of all closed ideals.

3.1F1F4step 2.1algebra

If Vn are dense open subsets of Prim⁡(A), their inverse images are dense open subsets of P(A): every nonempty pure-state open set has nonempty open image by step 2.1, which meets Vn. The Polish pure-state space is Baire by [F1,F4], so their intersection meets the preimage of every nonempty primitive open set. Thus Prim⁡(A) is Baire. The zero algebra gives empty pure and primitive spaces and the same assertion vacuously.

4.1F1F2step 3.1step 2.2algebra

Primitive kernels are prime. Indeed, in an irreducible representation the support projection of any represented ideal is a commuting projection, hence is0 or1. If two ideal images are nonzero, their approximate units converge strongly to1; their products cannot all vanish. Now suppose A is nonzero and prime. For each nonzero ideal I, its ideal-open is dense in Prim⁡(A): any nonempty basic ideal-open comes from nonzero K, and primeness makes IK≠0. A pure norming state detecting a nonzero positive element of IK gives a primitive kernel avoiding both I and K. Baire applied to the cofinal countable ideals of step 2.2 gives a primitive kernel avoiding all of them. That kernel must be0, since any nonzero ideal contains one of the cofinal ideals. Applying this to A/J proves every proper closed prime J is primitive.

5.1F2F3step 4.1step 2.3algebra

Fix a countable dense family (ck) in the unit ball of A, including it in D. A proper quotient code is primitive exactly when, for every a,b∈D, sup⁡kq(ackb)=q(a)q(b). For a primitive quotient, choose a faithful irreducible representation, vectors nearly attaining the norms of b and a, and a contraction linking the normalized output of b to a near-norming input of a. Bounded density [F3] approximates this linker on that vector; quotient-norm lifting and density of (ck) then prove the equality. Conversely, if the quotient is not prime, two nonzero ideals with zero product give nonzero a,b for which all acb=0. Continuity in a,b makes this violate a test with a,b∈D. Step 4.1 identifies proper prime and primitive quotients. The countable supremum tests are Borel coordinate conditions; excluding the zero quotient is the Borel condition ∃d q(d)>0. Thus primitive codes are Borel.

6.1F4step 1.1step 2.1step 3.1step 2.2step 4.1step 5.1∎

Coordinate strict superlevels are hull-kernel open by step 1.1, and their countable Boolean combinations give the inverse images of every real Borel interval. Conversely step 2.2 gives a countable ideal-open base, each expressible as a countable union of coordinate norm tests. Hence the code Borel structure equals the hull-kernel-topology Borel structure. The primitive-code subset is standard Borel by [F4]. Together with steps 2.1, 2.2, 3.1 and 4.1 this proves all assertions, without appealing to Choquet's theorem or a standardness claim for arbitrary second-countable T0 spaces.

Depends on

Used by

Dependency tree · two levels

125 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