Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

GNS representation of a continuous unitary character

Example

Assume the Axiom of Choice. Let G be a topological group and let χ:G→C be a continuous group homomorphism with ∣χ(g)∣=1 for every g∈G. Put φ=χ. Then φ∈P1(G). On C, use the first-variable-linear inner product ⟨z,w⟩=zw‾ and define πχ(g)z=χ(g)z. The triple (πχ,C,1) is a pointed cyclic strongly continuous unitary representation with coefficient φ, and is unitarily equivalent by the unique pointed intertwiner to the canonical GNS triple of φ. In the algebraic GNS quotient, [δg]=χ(g)[δe] for every g∈G.

Facts & Assumptions

[A1]

A topological group has an identity and satisfies the group laws (Topological group: multiplication and inversion are continuous).

[A3]

The metric on C is dC(z,w)=∣z−w∣; continuity of χ is with respect to this metric (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane).

[A4]

Complex inner products are linear in the first variable, their induced length is a norm, and C with ⟨z,w⟩=zw‾ is complete, hence a complex Hilbert space (Real and complex inner-product spaces and their induced length, The induced length is a norm, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts, Hilbert space).

[A5]

A unitary representation is a homomorphism into bijective complex-linear isometries with continuous vector orbits, and a vector is cyclic when its orbit span is dense (Linear map between vector spaces over the same field, Strongly continuous unitary representations, invariant linear subspaces and intertwiners, Cyclic vector and cyclic unitary representation).

[A6]

Positive type is the finite-matrix condition for (φ(gi−1gj))i,j, and the GNS form on finitely supported functions is Bφ(f,h)=∑x,y∈Gf(x)h(y)‾φ(y−1x), with null space Nφ={f:Bφ(f,f)=0} (Continuous positive-type functions and normalization, Positive-type functions define the GNS pre-Hilbert form).

[A7]

Under AC, left translation on the quotient extends to the canonical strongly continuous GNS representation, and the GNS theorem supplies its cyclic vector and diagonal coefficient. Two cyclic strongly continuous representations with the same coefficient have a unique pointed unitary intertwiner (The GNS translation action is unitary and strongly continuous, GNS construction for a continuous positive-type function, Uniqueness of the pointed cyclic GNS representation).

[A8]

AC implies DC and Countable Choice; the local GNS completion and uniqueness theorem use Countable Choice for Hilbert completion and bounded extension (The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)).

Verification

Given: G, χ, and the conventions and facts in [A1]–[A8]. All sums below are finite when applied to finitely supported functions.

Proof technique: direct.

1.1A7A8∎

The homomorphism law gives χ(e)=χ(e)2. Since ∣χ(e)∣=1, the value is nonzero, so cancellation gives χ(e)=1. Applying the homomorphism law to g−1g=e gives χ(g−1)=χ(g)−1=χ(g)‾ by [A2]. [A1, A2] 2.1 For any n≥1, any g1,…,gn∈G (including repetitions), and any c1,…,cn∈C, the matrix quadratic form is ∑i,j=1nci‾ χ(gi−1gj)cj=∣∑j=1ncjχ(gj)∣2≥0. Thus the matrix is positive semidefinite. The given continuity of χ and χ(e)=1 show φ∈P1(G); zero coefficients are covered by the same identity. [A2, A6, step 1.1, algebra] 2.2 The pairing ⟨z,w⟩=zw‾ is the stated complex inner product, its induced norm is ∣z∣, and the complex plane is complete; hence C is a complex Hilbert space by [A4]. For each g, multiplication by χ(g) is complex-linear by [A5] and is an isometry because ∣χ(g)z∣=∣z∣; multiplication by χ(g−1) is its inverse. The homomorphism law makes πχ a representation. For fixed z and g0, ∥πχ(g)z−πχ(g0)z∥=∣χ(g)−χ(g0)∣ ∣z∣⟶0 as g→g0, by continuity in [A3]. Thus it is strongly continuous. Since πχ(e)1=1, the orbit span contains 1 and is all of C; also ⟨πχ(g)1,1⟩=χ(g)=φ(g). [A3, A4, A5, step 1.1] 2.3 Define Lχ(f)=∑xf(x)χ(x) on finitely supported f. Using [A2] and step 1.1, Bχ(f,h)=∑x,yf(x)h(y)‾χ(y)−1χ(x)=Lχ(f) Lχ(h)‾. Therefore Bχ(f,f)=∣Lχ(f)∣2 and Nχ=ker⁡Lχ. The map [f]↦Lχ(f) is a well-defined linear isometry from the quotient onto C: it is onto because Lχ(zδe)=z. For each g, Lχ(δg)=χ(g) and Lχ(χ(g)δe)=χ(g), so injectivity on the quotient gives [δg]=χ(g)[δe]. Left translation satisfies Lχ(Lgf)=χ(g)Lχ(f), in agreement with the scalar action πχ(g) from [A7]. [A2, A6, A7, step 1.1, algebra] 3.1 By step 2.1, φ meets the input hypotheses of the GNS construction in [A7]. Its canonical triple is cyclic, strongly continuous, and has diagonal coefficient φ. Step 2.2 gives the same properties and coefficient for (πχ,C,1). The pointed uniqueness theorem in [A7] therefore gives the unique unitary intertwiner carrying the vector 1 to the canonical GNS vector. [A5, A7, step 2.1, step 2.2] 4.1 The only choice used is AC, declared in the example, through the GNS completion/action and pointed uniqueness inputs in [A7]; [A8] identifies the precise reduction AC ⇒ DC ⇒ Countable Choice used for completion and bounded extensions. The finite matrix, scalar representation, and quotient calculations in steps 1.1–3.1 use no choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

68 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