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.
Relative property (T) for a pair and relative Kazhdan pairs
Statement
Let be a topological group and let be any subgroup (Subgroup), not assumed normal or closed. The pair has relative property (T) if every strongly continuous unitary representation of (Strongly continuous unitary representations, invariant linear subspaces and intertwiners) with almost invariant vectors (Almost invariant vectors for a unitary representation) has a nonzero vector fixed by every for .
A pair with and is a relative Kazhdan pair for if every strongly continuous unitary representation of having a -invariant unit vector has a nonzero -invariant vector. A subset is a relative Kazhdan set if is a relative Kazhdan pair for some .
When , these are respectively Kazhdan's property (T), Kazhdan pairs, and Kazhdan sets (Kazhdan's property (T), Kazhdan pairs, Kazhdan sets and Kazhdan constants).
Remarks
- The zero-space representation has no unit vectors and no almost invariant vectors, so it creates no exception to either implication.
- If , every vector is -invariant; hence has relative property (T), and every is a relative Kazhdan pair.
- The subgroup need not be normal for -invariant vectors or for the relative pair definition to make sense. Closedness is a hypothesis in the cited KHV formulation, but the definitions stated here also make sense for a nonclosed subgroup.
- No local compactness, Hausdorffness, countability, or choice assumption is part of these definitions.
Depends on
Used by
Dependency tree · two levels
35 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)
- Emmanuel Breuillard, PCMI Lecture Notes on Property (T), Expander Graphs and Approximate Groups (standard reference, not scraped)