claimroutine
Almost-invariant vectors are near translation-invariant
Generator-almost-invariant vectors are within of translation-fixed vectors
first step toward the spectral gap
Claim·§6 Conditional averaging in the shared environment·inside lemUniform spectral gap for affine group actions
Statement (paper)
Let be the orthogonal projection onto the subspace of -vectors fixed by all translations , and let . Then for every unitary representation of and every vector , with , one has .
In plain English
For any unitary representation of and any vector moved by at most by each generator in , the distance from to the subspace of translation-fixed vectors is at most , where .
Why it's here
This is the first step in showing that near-invariance under the generators forces near-invariance under the full group. It shows that a vector moved little by the generators is already close to the translation-fixed subspace, with a constant depending only on . The follow-up claim then combines this with a Kazhdan-type bound on the part to reach the full invariant subspace.
Classified routine:
A quantitative form of relative property (T) for the pair , known from Kazhdan–Margulis and Burger's spectral argument (with quantitative versions by Shalom). Here it is restated with an explicit constant , presumably via a standard generator-by-generator argument.
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §6 Conditional averaging in the shared environment
- Page
- —
- Label
—- Line
sections/averaging.tex:42
Leannot aligned
Phase 2 aligns this node to a Lean declaration.