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.
An amenable locally compact group with property (T) is compact
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a locally compact Hausdorff group (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not). If is amenable (Amenable locally compact group) and has property (T) (Kazhdan's property (T)), then is compact. Equivalently, no non-compact locally compact group can be both amenable and a Kazhdan group.
Facts & Assumptions
Given: AC, a locally compact Hausdorff group (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) with a fixed left Haar measure, and the assumptions that is amenable and has property (T).
The group is amenable in the sense of Amenable locally compact group, and under AC the Hulanicki-Reiter criterion identifies this with (The Hulanicki–Reiter weak containment criterion for amenability).
The left regular representation on is a strongly continuous unitary representation (Left and right regular unitary representations of an LCH group). For an LCH group, is equivalent under AC to having almost invariant unit vectors (Weak containment of the trivial representation and almost invariant vectors, Almost invariant vectors for a unitary representation).
Property (T) says that every strongly continuous unitary representation with almost invariant vectors has a nonzero invariant vector (Kazhdan's property (T)).
For a fixed left Haar measure on an LCH group, a nonzero invariant vector of implies that the total Haar measure is finite, and finite total Haar measure implies that is compact (Compactness, finite Haar volume and invariant vectors in the regular representation).
AC is the principle that every family of nonempty sets has a choice function (The Axiom of Choice); it is assumed in the Hulanicki-Reiter and weak-containment suppliers and in the finite-Haar-volume criterion.
Proof
Since is amenable, the Hulanicki-Reiter criterion in [F1] gives . By [F2], the left regular representation therefore has almost invariant unit vectors.
By [F2], is a strongly continuous unitary representation. Its almost invariant vectors from step 1.1 and property (T) in [F3] give a nonzero -invariant vector in .
The nonzero invariant vector from step 2.1 makes the Haar measure finite by [F4], and finite Haar measure forces to be compact by [F4].
Depends on
- Kazhdan's property (T)
- Almost invariant vectors for a unitary representation
- Compactness, finite Haar volume and invariant vectors in the regular representation
- Amenable locally compact group
- The Hulanicki–Reiter weak containment criterion for amenability
- Left and right regular unitary representations of an LCH group
- Weak containment of the trivial representation and almost invariant vectors
- Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
66 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)
- 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)