Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Every nonzero unitary representation of a compact group has a finite-dimensional subrepresentation

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let K be a compact Hausdorff group and let π:K→U(H) be a strongly continuous unitary representation on a complex Hilbert space H≠{0} (Strongly continuous unitary representations, invariant linear subspaces and intertwiners). Then H contains a nonzero finite-dimensional closed π(K)-invariant subspace.

Facts & Assumptions

[F1]

The L1 action: for g∈L1(K) and u∈H one has ∥π(g)u∥≤∥g∥1∥u∥; for f∈C(K) with ∫Kf dμ=1 one has ∥π(f)u−u∥≤∫K∣f∣ ∥π(k)u−u∥ dμ(k); and for every u≠0 there is f∈C(K) with f≥0, ∫Kf dμ=1 and π(f)u≠0. (The L1 action of a strongly continuous unitary representation, Submultiplicativity of convolution in the L1 norm)

[F2]

The representative functions R(K) are uniformly dense in C(K,C): for every f∈C(K) and ε>0 there is f1∈R(K) with sup⁡K∣f−f1∣<ε. (Uniform density of representative functions (topological Peter-Weyl theorem))

[F3]

Every element of R(K) is a finite linear combination of matrix coefficients of finite-dimensional continuous unitary representations, and it is closed under left translation: if h is a matrix coefficient of a finite-dimensional continuous unitary representation σ and k∈K, then x↦h(k−1x) is again a matrix coefficient of σ. (Representative functions on a compact group, Representative functions form a self-adjoint translation-invariant algebra)

[F4]

Covariance of the L1 action: π(k)π(h)=π(λ(k)h) for every k∈K and h∈L1(K), where λ is the left regular action. (The L1 action of a strongly continuous unitary representation)

[F5]

A finite-dimensional linear subspace of a Hilbert space is closed, and the image of a finite-dimensional vector space under a linear map is finite dimensional; a linear subspace is by definition closed under addition and scalar multiplication. (A finite-dimensional normed subspace is closed, Linear subspace of a vector space)

Proof

Given: AC, a compact Hausdorff group K, and a strongly continuous unitary representation π on H≠{0}.

1.1F1F2

Fix v∈H with v≠0; by [F1] there is f∈C(K) with π(f)v≠0. Since μ(K)=1 the uniform norm dominates the L1 norm, so uniform density [F2] provides f1∈R(K) with ∥f−f1∥∞<∥π(f)v∥/(2∥v∥) and hence ∥π(f−f1)v∥≤∥f−f1∥1∥v∥≤∥f−f1∥∞∥v∥<∥π(f)v∥/2; therefore ∥π(f1)v∥≥∥π(f)v∥−∥π(f−f1)v∥>0, that is π(f1)v≠0.

2.1F3F4F5step 1.1∎

Write f1 as a finite linear combination of matrix coefficients of finite-dimensional continuous unitary representations π1,…,πr of K, and let E⊆C(K) be the linear span of all matrix coefficients of these representations; then E is finite dimensional because each πj has only dj2 coefficients in an orthonormal basis, and E is invariant under left translation by [F3]; the set F:={π(h)v:h∈E} is the image of the finite-dimensional space E under the linear map h↦π(h)v, so it is a finite-dimensional linear subspace of H containing π(f1)v≠0. For k∈K and h∈E the covariance [F4] gives π(k)(π(h)v)=π(λ(k)h)v∈F, so π(k)F⊆F; replacing k by k−1 gives F⊆π(k)F, hence π(k)F=F for every k, and F is closed by [F5] because it is finite dimensional. Thus F is a nonzero finite-dimensional closed π(K)-invariant subspace of H, which proves the lemma. The Axiom of Choice is inherited through the L1 action and the uniform-density supplier; the finite-dimensional-span argument is choice-free apart from those inputs.

Depends on

Used by

Dependency tree · two levels

60 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