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.

Pure-state excision and density of faithful essential vector-state orbits

Statement

Assume AC. For a pure state ϕ of a unital C*-algebra A there is a net of positive norm-one contractions bt with ϕ(bt)=1 such that ∥btxbt−ϕ(x)bt2∥→0 for every x∈A. The sets Ua,ϵ={ψ∈S(A):ψ(a)>1−ϵ}, where a≥0, ∥a∥=ϕ(a)=1 and ϵ>0, form a weak-star neighborhood basis at ϕ. If π is a faithful irreducible representation with π(A)∩K(H)={0}, its pure vector states from unit vectors orthogonal to any prescribed finite-dimensional subspace of H are weak-star dense in P(A). For nonunital A the same assertions hold with a,bt∈A, using the unique state extension to the minimal unitization.

Facts & Assumptions

Given: The Statement hypotheses and AC.

[F1]

States have cyclic GNS representations, purity is equivalent to irreducibility, and pure states extend uniquely to pure states of the minimal unitization (C star state GNS construction, purity and Polish pure-state spaces).

[F2]

Bounded density, exact finite self-adjoint vector transitivity with interval clipping, internal-unitary vector transport, and pure-state norm-distance criteria are proved in Bounded density and finite-vector transitivity for C*-representations.

[F3]

Every C*-algebra has a positive contractive approximate unit; C*-quotients and the closed image of a star-homomorphism, positivity, continuous calculus, contractivity, and the minimal unitization have their local proofs (Positive contractive approximate units for C star algebras and ideals, Quotients of C star algebras by closed two-sided ideals, Positive calculus and order estimates in a C star algebra, Minimal C star unitization). States obey Cauchy–Schwarz (States and positive functionals on a C star algebra).

[F4]

Bounded positive operators have spectral projections; a finite-dimensional spectral range makes a supported continuous-calculus operator finite rank, hence compact (Borel functional calculus for bounded normal operators, Compact linear operator).

[A1]

AC supplies the supplier assumptions and the chosen finite witnesses and approximate unit (The Axiom of Choice).

Proof

technique · direct

Given: The Statement hypotheses and Facts.

1.1F1F2F3algebra

Work in A~, with the unique pure extension of ϕ if needed, and its irreducible GNS triple (π,H,ξ). Put N={z:π(z)ξ=0}. For ϕ(x)=0, let η=π(x)ξ, so η⊥ξ. If η=0, x∈N. Otherwise [F2] realizes a self-adjoint operator h with π(h)ξ=0, π(h)η=η: these prescriptions are compatible with the projection onto Cη. Then x−hx∈N and hx=(x∗h)∗ with x∗h∈N. Conversely Cauchy–Schwarz makes ϕ vanish on N+N∗. Thus ker⁡ϕ=N+N∗, with no closure required.

1.2F2F3A1algebra

The norm-closed left ideal N gives a norm-closed ∗-subalgebra C=N∩N∗: if c,d∈C, both cd and (cd)∗ annihilate ξ. Choose a positive contractive approximate unit et of C by [F3]. For z∈N, the positive element z∗z belongs to C, since π(z∗z)ξ=0; hence ∥z(1−et)∥2=∥(1−et)z∗z(1−et)∥→0. Also π(et)ξ=0. In the unital case take a0=1. In the nonunital case [F2] realizes the eigenvalue1 on ξ by a positive contraction in the image π(A); lift a self-adjoint preimage and clip it to [0,1] using [F3] to obtain a0∈A with 0≤a0≤1 and π(a0)ξ=ξ. Put u=a01/2 and bt=u(1−et)u∈A. Then 0≤bt≤1, π(u)ξ=ξ, and ϕ(bt)=1, so ∥bt∥=1.

2.1step 1.1step 1.2algebra

For z∈N, zu∈N since π(u)ξ=ξ. The estimate of step 1.2 therefore gives ∥zbt∥≤∥zu(1−et)∥∥u∥→0. For x∈A~, step 1.1 writes x−ϕ(x)1=c+d∗ with c,d∈N. Consequently ∥bt(x−ϕ(x)1)bt∥≤∥bt∥(∥cbt∥+∥dbt∥)→0. This is the required excision for every x∈A, including the nonunital construction with bt∈A.

3.1F1F3step 2.1algebra

Given finitely many norm-bounded tests xj and a positive error, choose b=bt so ∥bxjb−ϕ(xj)b2∥ is small for every test. Put a=b2, so ∥a∥=ϕ(a)=1. For a state ψ, extend it to A~ and suppose ψ(a)>1−δ. Since (1−b)2≤1−b2, Cauchy–Schwarz gives ∣ψ(x)−ψ(bxb)∣≤2∥x∥δ. Thus ∣ψ(xj)−ϕ(xj)∣≤2∥xj∥δ+∥bxjb−ϕ(xj)b2∥+∣ϕ(xj)∣δ. First making the excision errors small, then δ small, puts Ua,δ inside the prescribed neighborhood. Every such set is itself a weak-star open neighborhood of ϕ, proving the basis assertion on all states, not only pure states.

4.1F1F3F4step 3.1A1algebra

Let π be the specified faithful essential irreducible representation. In a nonempty pure-state neighborhood choose a smaller Ua,ϵ∩P(A) from step 3.1 with 0<ϵ<1. Faithfulness gives ∥π(a)∥=1. The spectral range of π(a) for (1−ϵ,1] is infinite dimensional: otherwise the nonzero operator π((a−(1−ϵ))+) would be finite rank and belong to π(A), contradicting essentiality. Choose a unit vector in that range orthogonal to the prescribed finite-dimensional subspace. Its expectation of a is strictly greater than 1−ϵ. Its vector state has norm1 by nondegeneracy and an approximate unit, and is pure because every nonzero vector in an irreducible carrier is cyclic. It therefore lies in the chosen neighborhood.

5.1F2step 2.1step 3.1step 4.1A1∎

This proves the asserted density and all nonunital cases directly with spectral cutoffs in A itself. Internal-unitary transport in [F2] identifies these vector states with the orbit of any cyclic pure vector state in the same irreducible representation. The stated choices are only the approximate unit and finitely prescribed operators/vectors; no class selector or unproved spectral multiplicity model is used.

Depends on

Used by

Dependency tree · two levels

96 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