Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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 G be a topological group. For Q⊆G and ε>0, the pair (Q,ε) is a Kazhdan pair for G if every strongly continuous unitary representation of G having a (Q,ε)-invariant unit vector (Almost invariant vectors for a unitary representation) has a nonzero G-invariant vector. A subset Q⊆G is a Kazhdan set if (Q,ε) is a Kazhdan pair for some ε>0.

For any Q⊆G and unitary representation π on a Hilbert space H, define dQ(π,ξ):={0,Q=∅,sup⁡x∈Q∥π(x)ξ−ξ∥,Q≠∅,for ∥ξ∥=1, and κ(G,Q,π):=inf⁡∥ξ∥=1dQ(π,ξ)∈R‾, where inf⁡∅=+∞ in the extended real line (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R). Thus κ(G,Q,π)∈[0,2] when H≠{0}, and it is +∞ when H={0}. Define the Kazhdan threshold κ(G,Q):=sup⁡R‾({0}∪{ε>0:(Q,ε) is a Kazhdan pair for G}).

For every Q, a Kazhdan pair (Q,ε) implies κ(G,Q)≥ε, every 0<ε<κ(G,Q) is a Kazhdan parameter, and each unitary representation π without nonzero invariant vectors satisfies κ(G,Q,π)≥κ(G,Q). If Q is compact, then the endpoint is included: (Q,ε) is a Kazhdan pair⟺κ(G,Q)≥ε. Also, κ(G,Q)=inf⁡πκ(G,Q,π), where the infimum is over unitary representations of G without nonzero invariant vectors, including the zero-space representation with value +∞. For noncompact Q, no endpoint equivalence is asserted.

Facts & Assumptions

Given: A topological group G, a subset Q⊆G, a real ε>0, and a strongly continuous unitary representation π:G→U(H).

[F1]

A unit vector ξ is (Q,ε)-invariant exactly when ∥π(x)ξ−ξ∥<ε for every x∈Q; 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 x↦π(x)ξ is norm-continuous (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).

[F2]

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 ∣∥ξ∥−∥η∥∣≤∥ξ−η∥.

[F4]

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)).

Proof

technique · monotonicity, displacement bounds, and compact attainment
1.1givenF1

The definitions of Kazhdan pair and Kazhdan set apply to every subset Q⊆G, including Q=∅. When Q=∅, every unit vector is (Q,ε)-invariant, so the pair condition requires every representation with a unit vector to have a nonzero invariant vector.

1.2F1F5

Kazhdan-pair parameters are downward closed: if (Q,δ) is a pair and 0<ε≤δ, then each (Q,ε)-invariant unit vector is also (Q,δ)-invariant, so (Q,ε) is a pair. Thus, with the zero adjoined in the definition, κ(G,Q) is a well-defined extended-real threshold, equals 0 if there is no positive Kazhdan parameter, and equals +∞ if every positive parameter is Kazhdan.

1.3F2F4F5

For a unit vector ξ, each displacement is at most 2 by [F2]. If Q≠∅, its displacement values form a nonempty subset of [0,2] and have a real supremum by [F4]; if Q=∅, dQ(π,ξ)=0 by definition. Thus κ(G,Q,π)∈[0,2] for H≠{0}. If H={0}, there are no unit vectors, so the declared extended-real empty-infimum convention gives κ(G,Q,π)=+∞.

1.4F1F2F3

If Q is compact and nonempty, for every unit vector ξ the function x↦∥π(x)ξ−ξ∥ is continuous: the orbit map is continuous by [F1], and the norm is continuous by the reverse triangle inequality in [F2]. Its image on Q is compact and therefore has a maximum by [F3]. For Q=∅, the explicitly assigned displacement 0 serves as its maximum convention.

2.1F5step 1.2

By the definition of extended-real supremum, every pair parameter ε satisfies ε≤κ(G,Q), and if 0<ε<κ(G,Q) then some pair parameter δ has δ>ε. Downward closure from step 1.2 makes (Q,ε) a pair.

2.2F1step 1.4

For compact Q, a unit vector is (Q,ε)-invariant exactly when dQ(π,ξ)<ε: in the nonempty case this follows because the continuous displacement attains its maximum, and in the empty case both conditions hold for every ε>0. Consequently, for a representation on a nonzero Hilbert space with no invariant vector, it has no such unit vector exactly when κ(G,Q,π)≥ε.

3.1F1F5step 2.1step 1.3

Suppose π has no nonzero invariant vector and (Q,ε) is a Kazhdan pair. For every unit vector ξ, dQ(π,ξ)≥ε: otherwise every x∈Q would have displacement <ε, making ξ a (Q,ε)-invariant unit vector and forcing a nonzero invariant vector. This includes Q=∅, where such a representation cannot exist on a nonzero Hilbert space. Taking the infimum over unit vectors, then the supremum over pair parameters, gives κ(G,Q,π)≥κ(G,Q).

3.2F1F5step 2.1step 1.3step 2.2

The zero-space representation has no unit vectors and value +∞, so it never obstructs a Kazhdan pair. For compact Q, step 2.2 therefore says that (Q,ε) 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 {0} together with the admissible pair parameters yields κ(G,Q)=inf⁡πκ(G,Q,π).

4.1step 2.1step 3.1step 1.4step 2.2step 3.2∎

Steps 2.1 and 3.1 establish the threshold statements for arbitrary Q; steps 1.4–3.2 establish the endpoint equivalence and the infimum formula for compact Q, with empty Q and the zero-space representation handled by the stated conventions.

Depends on

Used by

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