Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

Each vector has at most countably many nonzero isotypic components

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let K be a compact Hausdorff group and let π be a strongly continuous unitary representation of K on a complex Hilbert space H, with isotypic decomposition H=⨁^σ∈K^H(σ) (Unitary representations of compact groups are discrete Hilbert sums of irreducibles). For every v∈H the set {σ∈K^:v(σ)≠0} of classes whose isotypic component meets v nontrivially is at most countable, where v(σ) is the orthogonal projection of v to H(σ). In particular each single f∈L2(K) has nonzero components in at most countably many isotypic summands of the Peter-Weyl decomposition (Peter-Weyl decomposition of the regular representation). No countability of K^ and no countability of a Hilbert basis of H is asserted.

Facts & Assumptions

[F1]

The isotypic decomposition of an arbitrary representation: H=⨁^σ∈K^H(σ) is a Hilbert direct sum of pairwise orthogonal closed invariant subspaces, the H(σ) are the ranges of the orthogonal projections Pσ, and every σ with H(σ)≠{0} occurs as the class of a subrepresentation. (Unitary representations of compact groups are discrete Hilbert sums of irreducibles, Hilbert direct sums of unitary representations)

[F2]

For a family (xi)i∈I in a Hilbert space whose squared norms have finite finite-subset-supremum S=∑i∥xi∥2<∞, the set {i:xi≠0} is at most countable: for each n≥1 the set Fn={i:∥xi∥>1/n} is finite, because a nonempty finite subset F⊆Fn contributes more than ∣F∣/n2 to S while a finite subsum never exceeds S, so every finite subset of Fn has at most n2S elements and hence Fn itself is finite; the support is the countable union of the Fn, at most countable by Countable Choice supplied by AC. (Square-summable families on an arbitrary index set and the space ℓ2(I), Hilbert space)

[F3]

For v in the Hilbert direct sum, the components satisfy ∥v∥2=∑i∥vi∥2 in the finite-subset-supremum convention, and the component in the summand H(σ) is the orthogonal projection v(σ)=Pσv. (Hilbert direct sums of unitary representations, Unitary representations of compact groups are discrete Hilbert sums of irreducibles)

[F4]

The regular representation λ of K on L2(K) has Peter-Weyl decomposition L2(K)=⨁^π∈K^Mπ, where Mπ is the span of the matrix coefficients of π and λ∣Mπ≅dππ‾, so the same countable-support conclusion applies to the components of a single L2 class. (Peter-Weyl decomposition of the regular representation, Parseval equivalences for an orthonormal family)

Proof

Given: AC, a compact Hausdorff group K, a strongly continuous unitary representation π of K on H, and a vector v∈H.

1.1F2

Let (xi)i∈I be any family in a Hilbert space with ∑i∥xi∥2<∞ in the finite-subset-supremum convention [F2]; for each n≥1 put Fn={i:∥xi∥>1/n} and let F⊆Fn be a nonempty finite subset with m elements: then ∑i∈F∥xi∥2>m/n2, while every finite subsum is at most the supremum S=∑i∥xi∥2, so m<n2S; consequently every finite subset of Fn has at most n2S elements, which forces Fn to be finite (an infinite Fn would contain a finite subset with at least n2S+1 elements), and the support {i:xi≠0}=⋃n≥1Fn is at most countable by Countable Choice supplied by AC.

2.1F1F3F4step 1.1∎

Applying step 1.1 to the components of v in the Hilbert direct sum H=⨁^σ∈K^H(σ) is legitimate because ∑σ∥v(σ)∥2=∥v∥2<∞ by [F3], so the set of σ with v(σ)≠0 is at most countable and the component is the orthogonal projection Pσv; and applying it to the components of a class f∈L2(K) in the Peter-Weyl decomposition L2(K)=⨁^π∈K^Mπ of [F4] gives the stated special case, because the squared norms of the components have finite sum equal to ∥f∥22. No countability of the index sets K^ or of a Hilbert basis is used or asserted. The Axiom of Choice is inherited through the decomposition theorems and the cited suppliers.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 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