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.

Positive type on a discrete group: the identity mass, characters, and the regular GNS model

Example

For a group Γ with the discrete topology, let δe be the characteristic function of its identity. It is continuous and of positive type, with δe(e)=1. If σ:Γ→U(V) is a unitary representation on a nonzero finite-dimensional complex Hilbert space, its normalized character

χσ(g):=tr⁡(σ(g))dim⁡CV

is continuous and of positive type, with χσ(e)=1.

Assuming AC for the Hilbert-completion and standard ℓ2 identification clause, the GNS representation of δe is unitarily equivalent to the left regular representation on ℓ2(Γ), with cyclic vector δe.

Facts & Assumptions

Given: A group Γ with the discrete topology and identity e; a nonzero finite-dimensional complex Hilbert space V; and a group homomorphism σ:Γ→U(V) into its bijective complex-linear isometries.

[F1]

A function φ:G→C is of positive type when it is continuous and for every n≥1, g1,…,gn∈G and c1,…,cn∈C,

∑i,j=1nci‾cjφ(gi−1gj)≥0.

Repetitions are permitted (Continuous positive-type functions and normalization).

[F2]

For finitely supported f,h on G, the positive-type form is

Bφ(f,h)=∑x,y∈Gf(x)h(y)‾φ(y−1x),

and it induces the GNS inner product after quotienting its null space (Positive-type functions define the GNS pre-Hilbert form).

[F4]

Strong continuity of a unitary representation means that each orbit map g↦σ(g)v is continuous in the norm topology (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).

[F5]

For a strongly continuous unitary representation and each v∈V, g↦⟨σ(g)v,v⟩ is continuous and of positive type (Diagonal unitary coefficients have positive type).

[F6]

Every finite-dimensional inner-product space has a finite orthonormal basis, empty only in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis). The dimension d=dim⁡CV is the natural number equinumerous with a basis, and dimension zero is equivalent to V={0} (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis).

[F7]

If T(ek)=∑ℓaℓkeℓ in an ordered basis, the (ℓ,k) matrix entry is aℓk (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases). The trace of an endomorphism is the trace of its matrix in any ordered basis, and matrix trace is the sum of diagonal entries (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace tr⁡(A) as the sum of the diagonal entries).

[F9]

A nonzero natural is a successor; with 1=σ(0), the recursive addition law and natural order give 1≤d for a nonzero dimension d (The natural numbers N (von Neumann), Every nonzero natural number is a successor, Addition of natural numbers, Order on the natural numbers). The canonical real image of every natural n≥1 is positive, its reciprocal is positive, and finite sums of nonnegative reals remain nonnegative; multiplying a nonnegative real by a positive real preserves nonnegativity. These order facts follow from the real ordered-field structure and the cited sign, zero-product and addition rules (The reals form a totally ordered field, Ordered field, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication, Multiplication by zero: 0⋅a=0, Order is preserved by adding a constant and by adding inequalities).

[F12]

Under Countable Choice every metric space has a norm-metric completion; the published completion of a normed space has a compatible Banach structure, and the completion of an inner-product space is Hilbert with the extended inner product (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, Completion of a normed space, The norm completion of an inner-product space is a Hilbert space, Hilbert space, The induced length is a norm).

[F13]

Under Countable Choice, a bounded linear map into a Banach space extends uniquely across a completion with the same norm bound (Linear map between vector spaces over the same field, Banach space, Bounded linear maps extend uniquely across the completion).

[F14]

Under Countable Choice, the Fourier coefficient map of a Hilbert space with a complete orthonormal family indexed by I is a unitary isomorphism onto the standard square-summable family space ℓ2(I,C) (A Hilbert space with a given orthonormal basis is ℓ2 of the index set, Square-summable families on an arbitrary index set and the space ℓ2(I)).

Verification

Bekka and de la Harpe state in Example 1.B.7(3) that δe is of positive type and that its GNS representation is equivalent to the left regular representation (Chapter 1 §1.B, printed p. 29). Bekka–de la Harpe–Valette's Proposition C.4.3 gives the diagonal-coefficient positivity used for the character calculation (Appendix C §C.4, printed pp. 374–375). The calculations below supply the finite-matrix witness and the completion model explicitly.

Proof technique: direct.

1.1F1F9F10algebra

For n≥1, gi−1gj=e exactly when gi=gj; partitioning the finite list by its distinct values gives ∑i,j=1nci‾cjδe(gi−1gj)=∑h∈{g1,…,gn}∣∑j:gj=hcj∣2≥0. This includes repeated group elements and zero coefficients.

1.2F3F4F6F9F10choose

Every orbit map g↦σ(g)v is continuous because its domain is discrete, so σ is strongly continuous. Choose an orthonormal basis (ek)k<d of V. Since V≠{0}, its dimension d is nonzero; write d=succ⁡(m). From 1=succ⁡(0) and the recursive addition law, induction gives 1+m=succ⁡(m), so 1≤d by the natural-order definition. Its canonical real scalar dR is positive, and its image dC in C is nonzero.

2.1F1F3step 1.1algebra

The function δe is continuous because Γ is discrete, and δe(e)=1. Step 1.1 proves its finite-matrix test, so δe is of positive type.

2.2F5F6F7step 1.2algebra

For k<d set ϕk(g)=⟨σ(g)ek,ek⟩. By [F5], each ϕk is continuous and of positive type. If σ(g)ek=∑ℓ<daℓk(g)eℓ, orthonormality gives ϕk(g)=akk(g); the trace definitions in [F7] consequently give tr⁡(σ(g))=∑k<dϕk(g).

2.3F3F6F7F8F10step 1.2algebra

By [F8], σ(e)=IV; its matrix in this basis is the d by d identity, so [F6, F7] give tr⁡(σ(e))=d. Hence χσ(e)=dC/dC=1 by the field embedding [F10]. Also χσ is continuous, since it is a function from a discrete domain.

3.1F1F5F9F10step 2.2algebra

For any finite test (gi,ci)i=1n with n≥1, step 2.2 gives ∑i,j=1nci‾cjχσ(gi−1gj)=dR−1∑k<d(∑i,j=1nci‾cjϕk(gi−1gj)). Each parenthesized value is a nonnegative real by [F5]; their finite sum is nonnegative, and dR−1>0 by [F9]. The embedding in [F10] identifies this real nonnegative value with the displayed complex quadratic form, so [F1] shows that χσ is of positive type.

3.2F2F9F10step 2.1algebra

For finitely supported f,h:Γ→C, [F2] gives Bδe(f,h)=∑x,yf(x)h(y)‾δe(y−1x)=∑xf(x)h(x)‾. This is positive definite: if f≠0, a nonzero coordinate contributes a strictly positive squared modulus while every other term is nonnegative. Hence the GNS null space is {0}, and the quotient is this finite-support inner-product space.

4.1F11F12F13step 3.2construct

Assume AC. By [F11], Countable Choice holds; [F12] gives a Hilbert completion E^ of the inner-product space in step 3.2, with the finite-support functions embedded densely. On that dense subspace define Lgf(x)=f(g−1x). This is linear, and reindexing x=gy gives ⟨Lgf,Lgh⟩=∑xf(g−1x)h(g−1x)‾=∑yf(y)h(y)‾=⟨f,h⟩. Thus Lg is bounded with norm bound one; by [F13] it extends uniquely to a linear contraction λΓ(g) on E^. This is the completion stage in the GNS construction for δe.

5.1F3F12F13F14step 3.2step 4.1algebra

On the dense finite-support subspace, LgLh=Lgh and LgLg−1=Lg−1Lg=I. The continuous extensions obey the same identities on E^; since each extension and its inverse are contractions, each is an isometry and hence unitary. Therefore g↦λΓ(g) is strongly continuous because Γ is discrete. The point masses (δx)x∈Γ are orthonormal and their span is dense in E^, so they form a complete orthonormal family. By [F14] the Fourier coefficient map U:E^→ℓ2(Γ,C) is unitary and sends δx to the standard coordinate vector ex. For each g,x, UλΓ(g)δx=egx, which is the standard left translation of ex; density and continuity imply that U intertwines λΓ with the left regular representation on ℓ2(Γ). Finally λΓ(g)δe=δg and ⟨λΓ(g)δe,δe⟩=⟨δg,δe⟩=δe(g); the orbit spans a dense subspace, so δe is cyclic and this is its GNS representation.

6.1F11F12F13F14step 1.1step 2.1step 2.3step 3.1step 5.1∎

The positivity and normalization proofs in steps 1.1–3.1 use no choice. AC is used only through Countable Choice in [F12]–[F14] for the Hilbert completion, bounded extensions, and the standard ℓ2 coordinate identification. The extensions and Fourier coefficient map are unique, so the action and unitary equivalence require no further choice. All three claims are established.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

174 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