Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Matrix coefficients of finite-dimensional representations separate points of a compact group

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let K be a compact Hausdorff group with normalized Haar probability μ. For all distinct x,y∈K there exist a finite-dimensional continuous unitary representation π of K and vectors v,w in its carrier with ⟨π(x)v,w⟩≠⟨π(y)v,w⟩. Equivalently, the finite-dimensional continuous unitary representations of K separate the points of K.

Facts & Assumptions

[F1]

A topological group has continuous multiplication and inversion; if g≠e there is an open symmetric neighbourhood U of e with g∉U⋅U, because multiplication is continuous at (e,e) and K is Hausdorff. (Topological group: multiplication and inversion are continuous, Left and right translations and inversion in a topological group are homeomorphisms)

[F3]

On the compact group K, every continuous function has compact support, so C(K)=Cc(K). For f,g∈C(K), convolution is (f∗g)(x)=∫Kf(v)g(v−1x) dμ(v), belongs to C(K), and is associative. On the unimodular group K the involution is f∗=f∘ι‾ and satisfies (f∗g)∗=g∗∗f∗. (Compactly supported convolution on a group, Convolution preserves compact support and is associative, The L1 involution is isometric, involutive and reverses convolution)

[F4]

The normalized Haar probability satisfies μ(K)=1 and is invariant under translations and inversion, and μ(U)>0 for every nonempty open U⊆K. (Normalized Haar probability on a compact group, Haar measure is positive on nonempty open sets and finite on compact sets, Integral invariance under measure-preserving maps)

[F5]

For f∈L2(K) the operator Cf is compact and Hilbert–Schmidt; if f∗=f almost everywhere then Cf is self-adjoint, and then each ker⁡(Cf−λI) and ker⁡Cf is invariant under the right regular representation ρ; the nonzero eigenspaces Eλ are finite dimensional with closed linear span (ker⁡Cf)⊥ and L2(K)=ker⁡Cf⊕⨁^λ≠0Eλ. (L² convolution on a compact group is Hilbert–Schmidt, Compact convolution operators commute with right translations and have conjugate-kernel adjoints, Finite-rank spectral pieces of a self-adjoint compact convolution operator)

[F7]

For a self-adjoint bounded operator T and vector z one has ⟨T2z,z⟩=⟨Tz,Tz⟩=∥Tz∥2. (The Hilbert-space adjoint of a bounded operator, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

[F8]

Matrix coefficients of a representation π are the functions cv,wπ(k)=⟨π(k)v,w⟩. (Matrix coefficient of a unitary representation)

[F9]

AC supplies Dependent Choice, the hypothesis under which the published Urysohn lemma is stated. (AC supplies the countable and dependent choices used in Banach integration)

Proof

Given: AC, a compact Hausdorff group K with normalized Haar probability μ, and distinct x,y∈K with g:=y−1x≠e.

1.1F1F2F3F4F5

By [F1] choose an open symmetric neighbourhood U of e with g∉U⋅U and by [F2] a continuous φ0:K→[0,1] with φ0(e)=1 and vanishing outside U; put φ(k):=12(φ0(k)+φ0(k−1)), so φ≥0 is continuous with φ(e)>0, vanishing outside U and φ(k−1)=φ(k), hence φ∗=φ; put ψ:=φ∗φ∈C(K). Then ψ is real and satisfies ψ∗=φ∗ ⁣∗φ∗=ψ by [F3], and ψ=Cφφ because Cφφ(x)=∫Kφ(xv−1)φ(v) dμ(v)=∫Kφ(w)φ(w−1x) dμ(w)=ψ(x) under the substitution w=xv−1, which preserves μ by [F4]; moreover ψ(e)=∫Kφ(v)φ(v−1) dμ(v)=∫Kφ2 dμ>0 because φ is continuous, positive at e and μ is positive on the nonempty open set where φ>0, while ψ(g)=∫Kφ(v)φ(v−1g) dμ(v)=0 since φ(v)φ(v−1g)≠0 would give v∈U and v−1g∈U, hence g∈U⋅U by symmetry of U; finally Cφ and Cψ are compact self-adjoint with the spectral decomposition L2(K)=ker⁡Cφ⊕⨁^λ≠0Eλ into finite-dimensional ρ-invariant pieces by [F5].

2.1F4F5F7step 1.1

Suppose for contradiction that ρ(g) acts as the identity on every nonzero eigenspace Eλ of Cφ. The spectral decomposition from step 1.1 and continuity of ρ(g) imply that it is the identity on (ker⁡Cφ)⊥. Since Cφ is self-adjoint, its range is contained in that orthogonal complement: for z∈ker⁡Cφ, ⟨Cφh,z⟩=⟨h,Cφz⟩=0. Thus ρ(g)Cφ=Cφ, and applying this to φ gives ρ(g)ψ=ψ in L2(K), where ψ=Cφφ from step 1.1. Both functions are continuous. Their almost-everywhere equality is therefore pointwise, since a nonzero continuous difference would be nonzero on a nonempty open set of positive Haar measure [F4]. At e this gives ψ(g)=ψ(e), contradicting ψ(g)=0<ψ(e) from step 1.1. Hence some nonzero eigenspace of Cφ contains ξ with ρ(g)ξ≠ξ.

3.1F2F8F9step 2.1∎

For such λ and ξ put Π(k):=⟨ρ(k)ξ,ρ(g)ξ−ξ⟩ and u(k):=Π(y−1k); then u(x)=Π(g)=∥ρ(g)ξ∥2−⟨ρ(g)ξ,ξ⟩ and u(y)=Π(e)=⟨ξ,ρ(g)ξ⟩−∥ξ∥2, so u(x)−u(y)=⟨ρ(g)ξ−ξ,ρ(g)ξ−ξ⟩=∥ρ(g)ξ−ξ∥2>0 and u(x)≠u(y). On the other hand u(k)=⟨ρ(k)ξ,ρ(y)(ρ(g)ξ−ξ)⟩ for every k, by unitarity of ρ(y), so u is a matrix coefficient of the finite-dimensional continuous unitary representation ρ∣Eλ with the vectors ξ and ρ(y)(ρ(g)ξ−ξ) [F8]; hence the finite-dimensional representations separate x and y, which proves the lemma. Dependent Choice, and with it the Urysohn lemma used in [F2], is supplied by AC through [F9]; no other choice is made in the separation argument itself.

Depends on

Used by

Dependency tree · two levels

109 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