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.
Kazhdan pairs, Kazhdan sets and Kazhdan constants
Statement
Let be a topological group. For and , the pair is a Kazhdan pair for if every strongly continuous unitary representation of having a -invariant unit vector (Almost invariant vectors for a unitary representation) has a nonzero -invariant vector. A subset is a Kazhdan set if is a Kazhdan pair for some .
For any and unitary representation on a Hilbert space , define and where in the extended real line (The extended real line , its order, and the arithmetic that is left undefined, Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ). Thus when , and it is when . Define the Kazhdan threshold
For every , a Kazhdan pair implies , every is a Kazhdan parameter, and each unitary representation without nonzero invariant vectors satisfies . If is compact, then the endpoint is included: Also, where the infimum is over unitary representations of without nonzero invariant vectors, including the zero-space representation with value . For noncompact , no endpoint equivalence is asserted.
Facts & Assumptions
Given: A topological group , a subset , a real , and a strongly continuous unitary representation .
A unit vector is -invariant exactly when for every ; an invariant vector is a nonzero vector fixed by every group element (Almost invariant vectors for a unitary representation). A unitary representation is strongly continuous when each orbit map is norm-continuous (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).
The induced Hilbert norm is a norm over either scalar field, and every unitary operator preserves it (The induced length is a norm, Strongly continuous unitary representations, invariant linear subspaces and intertwiners). Applying the triangle inequality to and gives .
A continuous real-valued function on a nonempty compact topological space attains a maximum and a minimum (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Continuity of a map of topological spaces at a point and globally, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism).
Every nonempty real set bounded below has an infimum, and every nonempty real set bounded above has a supremum (Every nonempty set bounded below has an infimum, Complete ordered field (least-upper-bound property), Greatest lower bound (infimum)).
Every subset of the extended real line has a supremum and infimum there; in particular and (The extended real line , its order, and the arithmetic that is left undefined, Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ).
Proof
The definitions of Kazhdan pair and Kazhdan set apply to every subset , including . When , every unit vector is -invariant, so the pair condition requires every representation with a unit vector to have a nonzero invariant vector.
Kazhdan-pair parameters are downward closed: if is a pair and , then each -invariant unit vector is also -invariant, so is a pair. Thus, with the zero adjoined in the definition, is a well-defined extended-real threshold, equals if there is no positive Kazhdan parameter, and equals if every positive parameter is Kazhdan.
For a unit vector , each displacement is at most by [F2]. If , its displacement values form a nonempty subset of and have a real supremum by [F4]; if , by definition. Thus for . If , there are no unit vectors, so the declared extended-real empty-infimum convention gives .
If is compact and nonempty, for every unit vector the function is continuous: the orbit map is continuous by [F1], and the norm is continuous by the reverse triangle inequality in [F2]. Its image on is compact and therefore has a maximum by [F3]. For , the explicitly assigned displacement serves as its maximum convention.
By the definition of extended-real supremum, every pair parameter satisfies , and if then some pair parameter has . Downward closure from step 1.2 makes a pair.
For compact , a unit vector is -invariant exactly when : in the nonempty case this follows because the continuous displacement attains its maximum, and in the empty case both conditions hold for every . Consequently, for a representation on a nonzero Hilbert space with no invariant vector, it has no such unit vector exactly when .
Suppose has no nonzero invariant vector and is a Kazhdan pair. For every unit vector , : otherwise every would have displacement , making a -invariant unit vector and forcing a nonzero invariant vector. This includes , where such a representation cannot exist on a nonzero Hilbert space. Taking the infimum over unit vectors, then the supremum over pair parameters, gives .
The zero-space representation has no unit vectors and value , so it never obstructs a Kazhdan pair. For compact , step 2.2 therefore says that is a pair exactly when every representation without nonzero invariant vectors has displacement constant at least , equivalently when their extended-real infimum is at least . Taking the supremum of together with the admissible pair parameters yields .
Steps 2.1 and 3.1 establish the threshold statements for arbitrary ; steps 1.4–3.2 establish the endpoint equivalence and the infimum formula for compact , with empty and the zero-space representation handled by the stated conventions.
Depends on
- Almost invariant vectors for a unitary representation
- Strongly continuous unitary representations, invariant linear subspaces and intertwiners
- Hilbert space
- Topological group: multiplication and inversion are continuous
- Greatest lower bound (infimum)
- Complete ordered field (least-upper-bound property)
- Every nonempty set bounded below has an infimum
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Continuity of a map of topological spaces at a point and globally
- The induced length is a norm
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
Used by
- The integers do not have property (T) Counterexample
- Relative property (T) for a pair and relative Kazhdan pairs Definition
- A Kazhdan pair for a compact group via Haar averaging Example
- Property (T) for finite groups via normalized counting measure Example
- SL2(R) does not have property (T) Proposition
- Compact groups have property (T) by Haar averaging Theorem
- Property (T) is a uniform spectral gap over all representations Theorem
- Property (T) is equivalent to the existence of a compact Kazhdan pair Theorem
- SLn(R) has property (T) for n at least three Theorem
Dependency tree · two levels
70 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)