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.
A Kazhdan pair for a compact group via Haar averaging
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a compact Hausdorff topological group (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, Topological group: multiplication and inversion are continuous) with normalized Haar probability measure (Normalized Haar probability on a compact group). For every , is a Kazhdan pair (Kazhdan pairs, Kazhdan sets and Kazhdan constants); in particular, is a Kazhdan set and has property (T) (Kazhdan's property (T)).
Explicitly, if is a strongly continuous unitary representation (Strongly continuous unitary representations, invariant linear subspaces and intertwiners) on a Hilbert space (Hilbert space) and is a unit vector with then its Haar average , as in Compact groups have property (T) by Haar averaging, is nonzero and -invariant, with Thus the whole group is a Kazhdan set with tolerance ; the averaging bound is not claimed to be optimal.
Facts & Assumptions
Given: AC, a compact Hausdorff topological group with normalized Haar probability , and a strongly continuous unitary representation .
For every , the preceding compact-group theorem says is a Kazhdan pair. It also gives the Haar average as a nonzero invariant vector with whenever is a unit vector and that supremum is below (Compact groups have property (T) by Haar averaging, Normalized Haar probability on a compact group, The Axiom of Choice).
A pair is Kazhdan when every strongly continuous unitary representation with a -invariant unit vector has a nonzero invariant vector; a compact Kazhdan set with one positive tolerance gives property (T). Almost invariance supplies such unit vectors for every compact test and every positive tolerance. (Kazhdan pairs, Kazhdan sets and Kazhdan constants, Kazhdan's property (T), Almost invariant vectors for a unitary representation).
Proof
Proof technique: apply the earlier Haar-average theorem and specialize its uniform estimate to the compact test set .
If is a unit vector and , then . By [F1], the Haar average is nonzero and -invariant, and .
By [F1], is a Kazhdan pair for every . Taking makes a Kazhdan set; its pair property applied to almost invariant unit vectors gives property (T) by [F2]. A representation on the zero Hilbert space has no unit vector, so the pair implication is vacuous there.
Depends on
- Normalized Haar probability on a compact group
- Almost invariant vectors for a unitary representation
- The Axiom of Choice
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
- Hilbert space
- Kazhdan pairs, Kazhdan sets and Kazhdan constants
- Kazhdan's property (T)
- Strongly continuous unitary representations, invariant linear subspaces and intertwiners
- Topological group: multiplication and inversion are continuous
- Compact groups have property (T) by Haar averaging
Used by
Nothing in the library uses this result yet.
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
- Bachir Bekka, Pierre de la Harpe and Alain Valette, Kazhdan's Property (T) (Cambridge University Press 2008; author-hosted complete text) (standard reference, not scraped)
- Terence Tao, 254B, Notes 2: Cayley graphs and Kazhdan's property (T) (standard reference, not scraped)