Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Literature-sourcedPipeline-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.

Weak containment of unitary representations

Definition

Let G be a topological group and let π and ρ be strongly continuous unitary representations on Hilbert spaces Hπ and Hρ (Strongly continuous unitary representations, invariant linear subspaces and intertwiners). Write π≺ρ and say that π is weakly contained in ρ if every continuous function of positive type associated to π can be approximated, uniformly on every compact subset of G, by finite sums of functions of positive type associated to ρ: for every ξ∈Hπ, every compact Q⊆G and every ϵ>0 there exist finitely many η1,…,ηn∈Hρ with sup⁡g∈Q∣⟨π(g)ξ,ξ⟩−∑i=1n⟨ρ(g)ηi,ηi⟩∣<ϵ. Write π∼ρ when both π≺ρ and ρ≺π.

Remarks

  • Coefficient form. The vector ξ of the definition is arbitrary, so the functions tested are exactly the diagonal matrix coefficients cξ,ξ(g)=⟨π(g)ξ,ξ⟩ of π (Matrix coefficient of a unitary representation); each is continuous and of positive type (Diagonal unitary coefficients have positive type), and so is each of the approximating functions (Continuous positive-type functions and normalization). Containment of a representation in another, when defined by subrepresentations, plainly implies weak containment; no multiplicity or dimension hypotheses are imposed, and the zero representation is allowed on either side.
  • Reflexivity and invariance of the relation. Taking n=1 and η1=ξ shows π≺π. If U:Hπ→Hπ′ is a unitary intertwiner and V:Hρ→Hρ′ is one, then V carries every diagonal coefficient of ρ to a diagonal coefficient of ρ′, so π≺ρ implies π′≺ρ′: the relation is well defined on unitary equivalence classes.
  • Transitivity. If π≺ρ and ρ≺σ, then π≺σ. Indeed, fix ξ∈Hπ, compact Q and ϵ>0. Since π≺ρ, choose η1,…,ηn∈Hρ with sup⁡Q∣cξ,ξ−∑jcηj,ηj∣<ϵ/2. Applying ρ≺σ to each of the finitely many vectors ηj on the same compact Q with tolerance ϵ/(2n) produces, for each j, finitely many vectors ζj,k∈Hσ with sup⁡Q∣cηj,ηj−∑kcζj,k,ζj,k∣<ϵ/(2n); summing the n inequalities gives a finite family of vectors of Hσ whose coefficient sum differs from cξ,ξ on Q by less than ϵ.

Depends on

Used by

Dependency tree · two levels

11 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