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

The Fell topology on the unitary dual

Definition

Assume the Axiom of Choice. Let G be a topological group and let R be a set of unitary equivalence classes of strongly continuous unitary representations of G containing the unitary dual G^ (The unitary dual of a locally compact group). For a representation π with class in R, finitely many functions of positive type ϕ1,…,ϕn associated to π (that is, each is a single diagonal matrix coefficient ϕi(g)=⟨π(g)ξi,ξi⟩ of π, Matrix coefficient of a unitary representation, Continuous positive-type functions and normalization), a compact set Q⊆G and ϵ>0, put W(π;ϕ1,…,ϕn,Q,ϵ):={ρ∈R: each ϕi is within ϵ on Q of a finite sum of functions of positive type associated to ρ}. The Fell topology on R, and on the unitary dual G^⊆R in particular, is the topology generated by these sets: a subset is open when it is a union of sets of this form. This is the coefficient topology of [BeH–19, §1.C]; in the notation of Weak containment of unitary representations the condition defining W(π;ϕ,Q,ϵ) is the compact-uniform approximation of ϕ by coefficients of ρ, one function at a time.

Remarks

  • The displayed family is a basis. Every displayed set contains its center. An empty test list gives the whole space. For a nonempty list and ρ in the displayed set, choose its finite coefficient witnesses for each test; insert a zero coefficient if a witness list is empty. Thus N=∑ini>0. Let δ be the minimum of the positive error margins ϵ−sup⁡Q∣ϕi−∑jcηi,j,ηi,j∣. The set centered at ρ testing all these individual coefficients on Q to accuracy δ/N is contained in the original set: the sum of their new errors is strictly less than niδ/N≤δ, which fits each error margin. For finitely many displayed sets containing ρ, first perform this refinement separately for each set. All resulting tests are coefficients of the SAME representation ρ, so their union, the finite union of compact test sets, and the minimum of their tolerances give a displayed set containing ρ inside the intersection. This proves both the refinement and finite-intersection basis axioms without treating tests from unrelated centers as coefficients of one representation.
  • Finite sums as tests. Allowing finite sums of diagonal coefficients as test functions generates the same topology. For a test ∑j=1mcξj,ξj and error ϵ>0, testing its m>0 summands separately with error ϵ/m ensures that their finite-sum witnesses add to a witness for the original test. An empty sum is the zero coefficient. Conversely, every single coefficient is a one-term sum. Thus this enlargement changes the displayed basis but not the topology; it does not make every finite sum a single diagonal coefficient of the given representation.
  • Hausdorffness and discreteness are not asserted. The definition guarantees only that these neighbourhoods form a topology; the companion examples page exhibits a second-countable locally compact group whose dual is not Hausdorff. Nothing here asserts that the Fell topology is discrete, and for non-compact groups it need not be.
  • Choice. The Axiom of Choice is inherited from the construction of the unitary dual and from the GNS machinery used to compare coefficients; the basis verifications above use none (The Axiom of Choice).

Depends on

Used by

Dependency tree · two levels

16 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