Alphabeta Math
CorollaryStatement: 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.

Normalized positive type and pointed cyclic unitary representations

Statement

Assume the Axiom of Choice, and let G be a topological group. Consider triples (π,H,ξ) in which H is a complex Hilbert space, π:G→U(H) is a strongly continuous unitary representation, and ξ is a cyclic vector with ∥ξ∥=1. Declare two such triples equivalent when there is a unitary intertwiner U:H→H′ with Uξ=ξ′. The map

[(π,H,ξ)]⟼(g⟼⟨π(g)ξ,ξ⟩)

is a bijection from these equivalence classes to P1(G). Its inverse sends φ∈P1(G) to the equivalence class of its GNS triple. The zero function is excluded from P1(G).

Facts & Assumptions

Given: AC; a topological group G; strongly continuous unitary representations on complex Hilbert spaces; cyclic distinguished vectors; and the first-variable-linear inner-product convention.

[F1]

P(G) is the set of continuous functions of positive type, and P1(G)={φ∈P(G):φ(e)=1} (Continuous positive-type functions and normalization).

[F2]

The matrix coefficient associated to (ξ,η) is cξ,η(g)=⟨π(g)ξ,η⟩; it is continuous for a topological group and a strongly continuous representation (Matrix coefficient of a unitary representation).

[F3]

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

[F4]

A vector is cyclic exactly when its complex-linear representation-orbit span is dense (Cyclic vector and cyclic unitary representation).

[F5]

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).

[F6]

Under AC, every continuous positive-type function has a strongly continuous cyclic GNS triple with coefficient φ and ∥ξφ∥2=φ(e) (GNS construction for a continuous positive-type function).

[F7]

Under AC, two cyclic strongly continuous unitary triples with the same diagonal coefficient have a unique unitary intertwiner carrying one distinguished vector to the other (Uniqueness of the pointed cyclic GNS representation).

[F8]

The complex inner product is linear in its first variable and its induced norm is ∥v∥=⟨v,v⟩ (Real and complex inner-product spaces and their induced length).

[F9]

The induced Hilbert norm is nonnegative and vanishes only at the zero vector (The induced length is a norm).

[F10]

A topological group is a group with a topology for which multiplication and inversion are continuous (Topological group: multiplication and inversion are continuous).

[F11]

AC is the axiom that every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

Bekka–de la Harpe and Bekka–de la Harpe–Valette give the normalized correspondence in Proposition 1.B.8 and the GNS existence-and-uniqueness theorem in Theorem C.4.10, respectively. The displayed proof of Proposition 1.B.8 checks injectivity by comparing orbit-sum Gram norms and says the other verifications are left to the reader. Its formal statement is specifically about P1(G) and unit cyclic vectors. The argument below supplies the well-definedness and surjectivity checks as well as injectivity.

Proof technique: direct.

1.1F1F2F5F10

Let (π,H,ξ) be a strongly continuous unitary triple with ξ cyclic and ∥ξ∥=1, and set φ(g)=⟨π(g)ξ,ξ⟩. By [F2] and [F5], φ is continuous and of positive type. Also [F5] gives φ(e)=∥ξ∥2=1, so φ∈P1(G) by [F1].

1.2F2F3F8algebra

Identity maps, inverses, and compositions of pointed unitary intertwiners show that the stated relation is an equivalence relation. If U:H→H′ is a unitary intertwiner with Uξ=ξ′, then the squared-norm identities ∥u+v∥2−∥u−v∥2=4Re⁡⟨u,v⟩,∥u+iv∥2−∥u−iv∥2=4Im⁡⟨u,v⟩ and [F3, F8] show that U preserves the inner product. Thus, for every g∈G, ⟨π′(g)ξ′,ξ′⟩=⟨Uπ(g)ξ,Uξ⟩=⟨π(g)ξ,ξ⟩. So the map in the statement is well-defined.

1.3F1F4F6F9F11

Let φ∈P1(G). Then φ is continuous and of positive type, and φ(e)=1 by [F1]. By AC and [F6], its GNS triple (πφ,Hφ,ξφ) is strongly continuous and cyclic, has coefficient φ, and satisfies ∥ξφ∥2=φ(e)=1. Nonnegativity of the Hilbert norm [F9] gives ∥ξφ∥=1, so this triple is in the stated domain [F4]. Hence every member of P1(G) is attained.

1.4F4F7

If two domain triples have the same image φ, then they have the same diagonal coefficient at every g∈G. They are cyclic, so [F7] supplies a unique unitary intertwiner taking the first distinguished vector to the second. Thus the triples are equivalent and the coefficient map is injective on equivalence classes.

2.1F1F6step 1.1step 1.2step 1.3step 1.4

Step 1.2 proves the forward assignment is well-defined, step 1.1 places its values in P1(G), step 1.3 constructs a GNS class for every member of P1(G), and step 1.4 proves that class is unique. Therefore the coefficient map and the GNS assignment are inverse bijections. The zero function has value 0 at e, so it is not in P1(G); its zero GNS vector is not a unit vector.

3.1F6F7F11step 1.2step 1.3step 1.4∎

AC is used through the GNS construction [F6] to realize each φ∈P1(G) and through pointed uniqueness [F7] to identify any two cyclic triples with the same coefficient. The coefficient calculation and the invariance under a given unitary intertwiner use no choice.

Depends on

Used by

Dependency tree · two levels

36 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