Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

The universal Weyl norm is finite and has the C*-completion property

Statement

Let A0(V,ω,λ), its positive unital functional set, and ∥⋅∥u be as in The universal Weyl C*-algebra. Under Countable Choice, the twisted multiplication and involution make A0 a unital ∗-algebra, the displayed supremum is a finite nonzero C*-seminorm, and its kernel quotient completion is the universal C*-algebra generated by unitaries uv with uvuw=e−iλω(v,w)/2uv+w,uv∗=u−v. Every unital ∗-representation of the algebraic relations extends uniquely to a bounded ∗-representation of this completion. No strong continuity of v↦uv is part of this universal property.

Facts & Assumptions

Given: A finite-dimensional real symplectic space (V,ω), a real λ, the finite-support space A0(V,ω,λ), and Countable Choice.

[F1]

The construction in The universal Weyl C*-algebra uses mλ(v,w)=e−iλω(v,w)/2, basis symbols δv, δvδw=mλ(v,w)δv+w, δv∗=δ−v, the positive unital functionals, and the universal seminorm defined from their GNS representations.

[F2]

A complex C*-algebra is a complete normed ∗-algebra satisfying ∥a∗a∥=∥a∥2; bounded ∗-homomorphisms use the operator norm (C star algebra, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F3]

For every nonzero complex Hilbert space K, B(K) with the operator norm and Hilbert adjoint is a C*-algebra; in particular ∥T∗T∥=∥T∥2 (Bounded Hilbert operators form a C star algebra).

[A1]

Countable Choice permits the metric completions of the GNS pre-Hilbert spaces and the universal norm quotient; the inner-product and norm-completion results give the required Hilbert and Banach structures (The Axiom of Countable Choice (ACω), Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences, The metric completion of a normed space carries a unique compatible Banach-space structure, The norm completion of an inner-product space is a Hilbert space).

Proof

technique · direct

Given: The construction and hypotheses in the Statement.

1.1F1algebra

Bilinearity gives mλ(v,w)mλ(v+w,z)=mλ(w,z)mλ(v,w+z), so the two parenthesizations of δvδwδz agree. Also mλ(0,v)=mλ(v,0)=1, so δ0 is a two-sided unit. Since ω(v,−v)=0, δv∗δv=δvδv∗=δ0. Finally, mλ(v,w)‾=mλ(−w,−v), which gives (δvδw)∗=δw∗δv∗; by bilinearity and conjugate-linearity these identities extend to all finite sums.

1.2F1givenalgebra

For any positive unital φ, the form Bφ(a,b)=φ(b∗a) is positive semidefinite. Positivity of Bφ(a+tb,a+tb) for every complex t gives ∣Bφ(a,b)∣2≤Bφ(a,a)Bφ(b,b): if Bφ(b,b)>0, minimize the quadratic in t; if it is zero, varying the phase and magnitude of t forces Bφ(a,b)=0. Therefore its null space Nφ={a:Bφ(a,a)=0} is orthogonal to every vector and the quotient has the inner product specified in [F1].

2.1F1step 1.1algebra

Write a=∑vavδv with finite support and define φ0(a)=a0. The coefficient of δ0 in a∗a is ∑vav‾avmλ(−v,v)=∑v∣av∣2, because ω(v,−v)=0. Thus φ0(a∗a)≥0 and φ0(δ0)=1; the positive unital functional set in [F1] is nonempty.

2.2A1F1F2step 1.1step 1.2algebraconstruct

Left multiplication by δv is an isometry on this quotient: Bφ(δva,δva)=φ(a∗δv∗δva)=φ(a∗a)=Bφ(a,a). Hence it preserves the null space. For a finite sum a=∑vavδv, the triangle inequality gives ∥La[b]∥≤(∑v∣av∣)∥[b]∥. Left multiplication therefore extends to a bounded operator on the Hilbert completion of the quotient, and its adjoint is La∗ because Bφ(ab,c)=Bφ(b,a∗c). Associativity from step 1.1 makes πφ(a):=La a unital ∗-representation.

3.1F1F2F3step 2.1step 2.2algebra

The supremum in [F1] is over a set of functionals (a subset of the function set CA0), is nonempty by step 2.1, and is finite since step 2.2 gives ∥πφ(a)∥≤∑v∣av∣ for every φ. Each GNS Hilbert space is nonzero because ∥[δ0]∥2=φ(δ0)=1, so [F3] applies to every πφ. Since each πφ is a ∗-representation, ∥a∗a∥u=sup⁡φ∥πφ(a)∗πφ(a)∥=sup⁡φ∥πφ(a)∥2=∥a∥u2. Submultiplicativity and ∥a∗∥u=∥a∥u follow by the same operator-norm calculation. Thus ∥⋅∥u is a nonzero C*-seminorm; its kernel is a ∗-ideal, and the induced norm on A0/ker⁡∥⋅∥u is a C*-norm.

4.1A1F1F2step 2.2step 3.1construct

Let ρ:A0→B(K) be any unital ∗-representation. If K={0}, the unique zero representation extends; assume otherwise and choose a unit vector ξ∈K. The vector functional φξ(a)=⟨ρ(a)ξ,ξ⟩ is positive and unital. The map [a]↦ρ(a)ξ preserves the inner product on the GNS quotient, extends to a unitary from its completion onto the cyclic subspace ρ(A0)ξ‾, and intertwines πφξ with the restriction of ρ. Therefore ∥ρ(a)ξ∥≤∥πφξ(a)∥≤∥a∥u; taking the supremum over unit vectors gives ∥ρ(a)∥≤∥a∥u.

5.1A1F1F2step 2.1step 3.1step 4.1algebra∎

The quotient completion in [F1] is a C*-algebra: multiplication and ∗ extend continuously by submultiplicativity and isometry, and the C*-identity passes to limits. Step 4.1 makes every unital ∗-representation contractive for ∥⋅∥u, so it extends uniquely to the completion; conversely each representation of the completion restricts to one of A0. The state φ0 from step 2.1 sends δ0 to a unit vector in its GNS space, so ∥δ0∥u=1 and the completion is nonzero. This proves the universal property and all claims.

Depends on

Used by

Cited to discharge well-definedness by The universal Weyl C*-algebra.

Dependency tree · two levels

60 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