Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Uniqueness of the pointed cyclic GNS representation

Statement

Assume the Axiom of Choice. Let G be a topological group. For j=1,2, let Hj be a complex Hilbert space, let πj:G→U(Hj) be a strongly continuous unitary representation, and let ξj∈Hj be cyclic. Suppose their diagonal coefficients agree:

⟨π1(g)ξ1,ξ1⟩=⟨π2(g)ξ2,ξ2⟩(g∈G).

Then there is a unique unitary intertwiner U:H1→H2 such that Uξ1=ξ2.

Facts & Assumptions

Given: The Axiom of Choice; a topological group G; two strongly continuous unitary representations (πj,Hj) with cyclic vectors ξj; and equality of their diagonal coefficients. All Hilbert pairings are linear in the first variable.

[F1]

A strongly continuous unitary representation is a homomorphism into bijective complex-linear isometries; every orbit map is norm-continuous (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).

[F2]

The diagonal coefficient is g↦⟨π(g)ξ,ξ⟩, with this first-variable-linear convention (Matrix coefficient of a unitary representation).

[F3]

A cyclic vector has dense complex-linear orbit span; the zero-space representation is cyclic (Cyclic vector and cyclic unitary representation).

[F4]

The diagonal coefficient of a strongly continuous unitary representation is continuous and of positive type, and its value at e is ∥ξ∥2 (Diagonal unitary coefficients have positive type).

[F5]

For finitely supported f,h:G→C, Bφ(f,h)=∑x,yf(x)h(y)‾φ(y−1x) is the positive-semidefinite GNS form, and its quotient inner product has Bφ(δx,δy)=φ(y−1x) (Positive-type functions define the GNS pre-Hilbert form).

[F6]

Under AC, the GNS construction supplies Qφ=C(G)/Nφ, its Hilbert completion Hφ and dense isometric embedding κφ, and the representation extending left translations, with cyclic vector ξφ=κφ([δe]) (GNS construction for a continuous positive-type function).

[F7]

Complex inner products are linear in their first variable, conjugate linear in their second, and induce the norm ∥v∥=⟨v,v⟩ (Real and complex inner-product spaces and their induced length).

[F8]

A completion is a Banach space with a dense linear isometric embedding; every complex Hilbert space is Banach. The induced inner-product norm is a norm (Completion of a normed space, Hilbert space, The induced length is a norm).

[F9]

Under Countable Choice, a bounded linear map from a normed space into a Banach space extends uniquely and boundedly to its completion, with the same bound (Bounded linear maps extend uniquely across the completion).

[F10]

A linear map obeys the linearity identities, and it is bounded when ∥Tx∥≤C∥x∥ for some C≥0 (Linear map between vector spaces over the same field, A bounded linear operator between normed spaces).

[F12]

On the GNS quotient, left translation is Lgf(x)=f(g−1x), and its extension to Hφ is the strongly continuous representation πφ (The GNS translation action is unitary and strongly continuous).

Proof

Bekka–de la Harpe–Valette prove the GNS existence and uniqueness theorem in Theorem C.4.10, Appendix C §C.4, printed pp. 376–377: they realize the positive kernel, map its feature vectors to the given cyclic orbit, extend the resulting isometry, and obtain the intertwining relation by cyclic density. Bekka–de la Harpe, Proposition 1.B.8, Chapter 1 §1.B, printed p. 29, computes the matching orbit-vector Gram norms and defines the corresponding map on the finite orbit span; its formal bijection is restricted to normalized positive-type functions and unit cyclic vectors, and the proof leaves the extension checks implicit. The proof here derives the arbitrary-norm statement from the canonical GNS quotient and records those checks, including the zero case.

Proof technique: direct.

1.1F2F4

Let φ(g)=⟨π1(g)ξ1,ξ1⟩. By [F2] and [F4], φ∈P(G) and φ(e)=∥ξ1∥2. Equality of the coefficients gives φ(g)=⟨π2(g)ξ2,ξ2⟩ for all g, so [F4] also gives φ(e)=∥ξ2∥2.

2.1F3step 1.1

If φ=0, then ∥ξ1∥=∥ξ2∥=0 by step 1.1, so both vectors are zero. Their cyclicity [F3] forces H1=H2={0}, where the unique map is the required unitary intertwiner. For the rest of the proof we may assume φ≠0.

2.2F4F6step 1.1

By [F6], form the canonical GNS quotient Qφ, its Hilbert completion Hφ, embedding κφ, and canonical triple (πφ,Hφ,ξφ). The input φ∈P(G) was established in step 1.1.

3.1F1F6F7step 2.2algebra

A complex-linear norm isometry W between inner-product spaces preserves inner products: expanding squared norms gives ∥u+v∥2−∥u−v∥2=4Re⁡⟨u,v⟩,∥u+iv∥2−∥u−iv∥2=4Im⁡⟨u,v⟩. Both differences are unchanged under W, so ⟨Wu,Wv⟩=⟨u,v⟩. Thus every πj(g) preserves the inner product by [F1], and the same calculation applies to each πφ(g), which is a complex-linear norm isometry by [F6].

4.1F1F5F7F10step 2.2step 3.1algebra

For j=1,2 and finitely supported f:G→C, set V~j(f):=∑x∈Gf(x)πj(x)ξj. The sum is finite. Using step 3.1, the homomorphism law, and equality of the diagonal coefficients, we obtain ∥V~j(f)∥2=∑x,yf(x)f(y)‾⟨πj(x)ξj,πj(y)ξj⟩=∑x,yf(x)f(y)‾⟨πj(y−1x)ξj,ξj⟩=∑x,yf(x)f(y)‾φ(y−1x)=Bφ(f,f)=∥[f]∥Qφ2. Consequently, if [f]=[h], then Bφ(f−h,f−h)=0 and V~j(f)−V~j(h)=0. Thus V~j factors through a well-defined linear isometry Vj:Qφ→Hj with bound 1, including the zero vector.

5.1F8F9F11step 4.1choose

The space Qφ is normed by its quotient inner-product norm [F5, F8], and Hj is Banach [F8]. Step 4.1 makes Vj a bounded linear map with bound 1 [F10]. By AC and [F11], Countable Choice holds, so [F9] gives a unique bounded extension V^j:Hφ→Hj with V^jκφ=Vj. To see it is isometric, use Countable Choice and density of κφ[Qφ] to choose, for any z∈Hφ, a sequence κφ([fn])→z. Continuity and the norm identity in step 4.1 give ∥V^jz∥=lim⁡n∥Vj([fn])∥=lim⁡n∥κφ([fn])∥=∥z∥. Thus V^j is an isometry.

6.1F3F5F6F8F12step 2.2step 5.1

For every g∈G, the canonical GNS action extends left translation, so V^jκφ([δg])=Vj([δg])=πj(g)ξj. By [F12], πφ(g)ξφ=κφ([δg]). The classes of point masses span Qφ and their images under κφ are dense in Hφ [F5, F6, F8]. The range of V^j therefore contains the dense cyclic orbit span of ξj [F3].

7.1F6F8F11step 5.1step 6.1choose

The range of V^j is closed. Indeed, for any η in its closure, Countable Choice [F11] selects zn∈Hφ with ∥V^jzn−η∥<1/(n+1). The isometry in step 5.1 makes (zn) Cauchy. Completeness of Hφ gives a limit z, and continuity of V^j yields V^jz=η. Therefore the range is both dense and closed by step 6.1, hence is all of Hj.

7.2F1F5F6F8F12step 5.1step 6.1

For k,g∈G, the left-translation action [F12] and step 6.1 give V^jπφ(k)κφ([δg])=V^jκφ([δkg])=πj(kg)ξj=πj(k)V^jκφ([δg]). The point-mass span is dense and both sides are continuous linear maps, so V^jπφ(k)=πj(k)V^j on Hφ. Also, V^jξφ=ξj by the point-mass case g=e. Thus V^j is a surjective unitary intertwiner carrying the canonical vector to ξj.

8.1F1step 7.1step 7.2construct

Define U=V^2V^1−1:H1→H2. The inverse exists by step 7.1, and step 7.2 shows U is unitary, intertwines π1 with π2, and satisfies Uξ1=ξ2.

9.1F1F3step 8.1

If U′ is another pointed unitary intertwiner, then for every g∈G, U′π1(g)ξ1=π2(g)ξ2=Uπ1(g)ξ1. The two bounded maps agree on the dense orbit span of ξ1 by linearity, and hence agree on all of H1 by continuity and [F3]. This proves uniqueness.

10.1F6F9F11F12step 5.1step 7.1∎

The construction uses AC for the GNS triple and translation action [F6, F12]. AC implies DC and Countable Choice by [F11]; Countable Choice is used for the completion extensions [F9] and for the sequences in steps 5.1 and 7.1. The finite Gram identity, the specified point-mass calculations, and uniqueness on the given dense cyclic span use no further choice.

Depends on

Used by

Dependency tree · two levels

53 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