claimroutineinferred_dep
Spectral gap on finite transitive actions
Lazy walk has Dirichlet form ≥ off constants
gives the spectral gap on finite transitive sets
Claim·§6 Conditional averaging in the shared environment·inside lemUniform spectral gap for affine group actions
Statement (paper)
Let be the permutation representation of a finite transitive -set with the uniform probability measure, let , and let . Then is self-adjoint with spectrum in , its invariant functions are exactly the constants, and every orthogonal to constants satisfies , so has a spectral gap bounded below by , depending only on .
In plain English
For the permutation representation of any finite transitive -set, the lazy walk operator is self-adjoint with spectrum in , fixes only constants, and satisfies for all orthogonal to constants.
Why it's here
This is the step that converts the representation-theoretic bound on distance to the invariant subspace into a spectral gap for the walk, which is what the lemma asserts. For orthogonal to constants, transitivity makes the invariant vectors exactly the constants, so the previous claim's bound forces some generator to move by a definite fraction of . That lower-bounds the Dirichlet form by a constant depending only on , uniformly over all finite transitive -sets.
Classified routine:
Standard conversion of an almost-invariant-vector (Kazhdan-type) bound into a spectral gap for the lazy Cayley/Schreier walk via the Dirichlet form identity; follows directly from the preceding claim and transitivity.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §6 Conditional averaging in the shared environment
- Page
- —
- Label
—- Line
sections/averaging.tex:91
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Spectral gap on finite transitive actions" rests on claim-lem-env-affine-2