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 be a compact Hausdorff group and let be a strongly continuous unitary representation on a complex Hilbert space (Strongly continuous unitary representations, invariant linear subspaces and intertwiners). Then contains a nonzero finite-dimensional closed -invariant subspace.
Facts & Assumptions
The action: for and one has ; for with one has ; and for every there is with , and . (The L1 action of a strongly continuous unitary representation, Submultiplicativity of convolution in the L1 norm)
The representative functions are uniformly dense in : for every and there is with . (Uniform density of representative functions (topological Peter-Weyl theorem))
Every element of is a finite linear combination of matrix coefficients of finite-dimensional continuous unitary representations, and it is closed under left translation: if is a matrix coefficient of a finite-dimensional continuous unitary representation and , then is again a matrix coefficient of . (Representative functions on a compact group, Representative functions form a self-adjoint translation-invariant algebra)
Covariance of the action: for every and , where is the left regular action. (The L1 action of a strongly continuous unitary representation)
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 , and a strongly continuous unitary representation on .
Fix with ; by [F1] there is with . Since the uniform norm dominates the norm, so uniform density [F2] provides with and hence ; therefore , that is .
Write as a finite linear combination of matrix coefficients of finite-dimensional continuous unitary representations of , and let be the linear span of all matrix coefficients of these representations; then is finite dimensional because each has only coefficients in an orthonormal basis, and is invariant under left translation by [F3]; the set is the image of the finite-dimensional space under the linear map , so it is a finite-dimensional linear subspace of containing . For and the covariance [F4] gives , so ; replacing by gives , hence for every , and is closed by [F5] because it is finite dimensional. Thus is a nonzero finite-dimensional closed -invariant subspace of , which proves the lemma. The Axiom of Choice is inherited through the action and the uniform-density supplier; the finite-dimensional-span argument is choice-free apart from those inputs.
Depends on
- The L1 action of a strongly continuous unitary representation
- Uniform density of representative functions (topological Peter-Weyl theorem)
- Representative functions form a self-adjoint translation-invariant algebra
- Representative functions on a compact group
- Strongly continuous unitary representations, invariant linear subspaces and intertwiners
- Submultiplicativity of convolution in the L1 norm
- Linear subspace of a vector space
- The Axiom of Choice
- A finite-dimensional normed subspace is closed
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
- Emmanuel Kowalski, An Introduction to the Representation Theory of Groups (author-hosted draft, 338 pp.) (standard reference, not scraped)