Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

GNS Hilbert reconstruction with invariant operator domain

Operator conventions

Let H be a complex Hilbert space with inner product linear in its first variable. An operator on H is a linear map T:D(T)→H whose domain D(T) is a linear subspace of H; it is densely defined when D(T) is dense in H. It is bounded when some C≥0 satisfies ∥Tx∥≤C∥x∥ for all x∈D(T), and unbounded when no such C exists. No boundedness of the operators πω(a) is assumed here.

For a complex vector space E, End⁡(E) denotes the set of complex-linear maps from E to itself. The product norm on H×H is ∥(x,y)∥×:=(∥x∥2+∥y∥2)1/2.

For a densely defined T, define its Hilbert-space adjoint by

D(T∗):={y∈H:there is z∈H such that (Tx,y)=(x,z) for every x∈D(T)},T∗y:=z.

The vector z is unique because D(T) is dense. The graph of T is G(T):={(x,Tx):x∈D(T)}⊆H×H. The operator T is symmetric when D(T)⊆D(T∗) and T∗x=Tx for every x∈D(T); it is self-adjoint when D(T)=D(T∗) and the same equality holds there. It is closable when the closure of G(T) in the product norm on H×H is the graph of an operator, denoted T‾. A symmetric operator is essentially self-adjoint when it is closable and T‾ is self-adjoint.

Statement

Let A be a complex vector space with a complex-bilinear associative product, unit 1A, and conjugate-linear involution satisfying (ab)∗=b∗a∗, (a∗)∗=a and 1A∗=1A. Let ω:A→C be complex-linear with ω(1A)=1 and real nonnegative ω(a∗a) for every a∈A. Assume the Axiom of Countable Choice ACω: every countable family of nonempty sets has a choice function. Put Nω:={a∈A:ω(a∗a)=0} and Dω:=A/Nω, with

([a],[b])ω:=ω(b∗a),

using the first-variable-linear convention. Let Hω be the Hilbert completion of this inner-product space, and identify Dω with its canonical dense image in Hω. For each a∈A define left multiplication on the common domain Dω by πω(a)[b]:=[ab]. Then πω is a unital algebra representation of A on the invariant dense domain Dω, and

Dω⊆D(πω(a)∗),πω(a)∗∣Dω=πω(a∗).

Each πω(a) is closable, meaning that the closure of its graph in Hω×Hω is the graph of an operator. The vector Ωω:=[1A] is a unit cyclic vector, πω(A)Ωω=Dω, and ω(a)=(πω(a)Ωω,Ωω). For uniqueness, let K be a Hilbert space, D′⊆K a dense linear subspace invariant under every operator ρ(a), and ρ:A→End⁡(D′) a unital algebra representation satisfying (ρ(a)x,y)=(x,ρ(a∗)y) for all a∈A and x,y∈D′. If Ω′∈D′, D′=ρ(A)Ω′, and ω(a)=(ρ(a)Ω′,Ω′), then there is a unique unitary V:Hω→K with VΩω=Ω′ and Vπω(a)x=ρ(a)Vx for all a∈A and x∈Dω. This theorem supplies neither a C*-norm nor essential self-adjointness of πω(a) when a=a∗.

Facts & Assumptions

Given: A unital complex star algebra A, a positive normalized state ω, and Countable Choice ACω as stated above.

[F1]

Positive-state Cauchy–Schwarz and left radical: (a,b)ω=ω(b∗a) is a Hermitian positive semidefinite form, its radical is Nω={a∈A:(a,b)ω=0 for every b∈A}, and Nω is a left ideal; also ∣ω(b∗a)∣2≤ω(a∗a)ω(b∗b), including zero-norm cases.

[F2]

The norm completion of an inner-product space is a Hilbert space: assuming Countable Choice, the norm completion of a real or complex inner-product space has a unique extended inner product inducing the completion norm and is a Hilbert space. Its proof uses Countable Choice to select countably many approximants; no full Axiom of Choice is assumed here.

Proof

technique · direct
1.1F1given

By [F1], Nω is a subspace and every element of it pairs to zero with every element of A. Thus ([a],[b])ω=ω(b∗a) is independent of both representatives; it is Hermitian and nonnegative, and ([a],[a])ω=0 holds exactly when a∈Nω, so the quotient pairing is positive definite.

1.2F1givenalgebra

For a,b∈A, replacing b by b+n with n∈Nω changes ab by an∈Nω because Nω is a left ideal by [F1]; hence πω(a)[b]=[ab] is well defined. Bilinearity, associativity and 1A give πω(a+b)=πω(a)+πω(b), πω(λa)=λπω(a), πω(ab)=πω(a)πω(b) and πω(1A)=IDω, and left multiplication keeps Dω invariant.

2.1F2givenstep 1.1

Apply [F2] to the quotient inner-product space Dω; under the stated Countable Choice assumption this gives the Hilbert completion Hω and a dense isometric embedding of Dω, which we identify with its image. This is the only completion invoked.

2.2step 1.1step 1.2algebra

For a,b,c∈A, the quotient form gives (πω(a)[b],[c])ω=ω(c∗ab)=([b],πω(a∗)[c])ω. By the definition of the Hilbert-space adjoint, this identity for all [b]∈Dω shows [c]∈D(πω(a)∗) and πω(a)∗[c]=πω(a∗)[c].

2.3givenstep 1.1step 1.2

Since ([1A],[1A])ω=ω(1A)=1, Ωω is a unit vector. Also πω(a)Ωω=[a] for every a∈A, so its algebraic orbit is exactly Dω and is dense. Finally (πω(a)Ωω,Ωω)ω=([a],[1A])ω=ω(a), recovering the state.

2.4givenF1step 1.1step 1.2

Let (H′,D′,ρ,Ω′) be another algebraically cyclic *-representation of A with common invariant dense domain D′=ρ(A)Ω′, ρ(a∗)=ρ(a)∗∣D′, and ω(a)=(ρ(a)Ω′,Ω′). Define U[a]:=ρ(a)Ω′. If [a]=[0], then ∥ρ(a)Ω′∥2=ω(a∗a)=0, so U is well defined; and for a,b∈A, (U[a],U[b])=ω(b∗a)=([a],[b])ω by the representation's adjoint identity. Thus U is an isometry from Dω onto the dense subspace D′.

3.1step 2.2given

Suppose xn∈Dω, xn→0 in Hω, and πω(a)xn→y in Hω. For each z∈Dω, step 2.2 gives (y,z)ω=lim⁡n(πω(a)xn,z)ω=lim⁡n(xn,πω(a∗)z)ω=0. Density forces y=0. Therefore the closed graph relation of πω(a) contains no two distinct outputs over one input: their difference would be a nonzero pair (0,y). The graph closure is a graph, so πω(a) is closable. In particular, if a=a∗ then πω(a) is symmetric on Dω; this does not prove essential self-adjointness.

4.1step 2.3step 2.4step 1.2∎

The isometry extends uniquely from the dense domain to a unitary U‾:Hω→H′ because its range D′ is dense. It sends Ωω to Ω′ and, for [b]∈Dω, U‾πω(a)[b]=ρ(ab)Ω′=ρ(a)U‾[b]; hence it intertwines the representations on the common domains. Uniqueness follows because every vector of Dω has the form πω(a)Ωω.

Depends on

Dependency tree · 2 levels

Sources