Alphabeta Math
TheoremStatement: 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.

Property (T) is equivalent to the existence of a compact Kazhdan pair

Statement

Assume the Axiom of Choice (The Axiom of Choice) and let G be a topological group (Topological group: multiplication and inversion are continuous). The following are equivalent:

(i) G has Kazhdan's property (T) (Kazhdan's property (T)).

(ii) There are a compact set Q⊆G (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) and ε>0 such that (Q,ε) is a Kazhdan pair (Kazhdan pairs, Kazhdan sets and Kazhdan constants).

(iii) There is a compact Q⊆G with κ(G,Q)>0 (Kazhdan pairs, Kazhdan sets and Kazhdan constants).

Moreover, if (Q,ε) is any Kazhdan pair, π is a strongly continuous unitary representation on a Hilbert space H, and ξ∈H is (Q,δε)-invariant for some 0<δ≤1, then ∥ξ−Pξ∥≤δ∥ξ∥, where P is the orthogonal projection onto the closed subspace HG:={v∈H:π(g)v=v for every g∈G} (Spectral gap for a unitary representation, Orthogonal decomposition by a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

Facts & Assumptions

Given: AC; a topological group G; the property-(T), almost-invariant-vector, and Kazhdan-pair notions; a strongly continuous unitary representation π on H; and, for the quantitative clause, a pair (Q,ε) and ξ∈H that is (Q,δε)-invariant.

[F1]

Property (T) says that every strongly continuous unitary representation with almost invariant unit vectors has a nonzero invariant vector; the zero representation has no almost invariant vectors. Almost invariance tests every compact set and every positive tolerance. (Kazhdan's property (T), Almost invariant vectors for a unitary representation, Strongly continuous unitary representations, invariant linear subspaces and intertwiners, Hilbert space)

[F2]

A Kazhdan pair (Q,ε) means every strongly continuous unitary representation having a (Q,ε)-invariant unit vector has a nonzero invariant vector. Its admissible positive tolerances are downward closed; for compact Q, (Q,ε) is a pair exactly when κ(G,Q)≥ε, and every positive tolerance below κ(G,Q) is admissible. (Kazhdan pairs, Kazhdan sets and Kazhdan constants)

[F3]

A diagonal coefficient of a unitary representation is continuous and of positive type; if its vector is unit, the function is normalized. Conversely, every normalized continuous positive-type function has a pointed cyclic GNS representation, and any pointed cyclic representation with that coefficient is unitarily equivalent to its GNS representation. (Matrix coefficient of a unitary representation, Diagonal unitary coefficients have positive type, Continuous positive-type functions and normalization, Normalized positive type and pointed cyclic unitary representations)

[F4]

Under AC, a set-indexed Hilbert direct sum of strongly continuous unitary representations is strongly continuous, the coordinate inclusions and projections intertwine the actions, and a vector is invariant exactly when each coordinate is invariant. (The Axiom of Choice, Hilbert direct sums of unitary representations)

[F5]

For a unitary representation, M=HG is a closed invariant subspace and M⊥ is closed and invariant; the restricted representation on M⊥ has no nonzero invariant vector. (Spectral gap for a unitary representation, Invariant orthogonal complements in unitary representations, Orthogonality and the orthogonal complement)

[F6]

AC implies Countable Choice; under Countable Choice a closed subspace of a Hilbert space has the orthogonal decomposition H=M⊕M⊥ and its orthogonal projection P satisfies Pξ∈M and ξ−Pξ∈M⊥. (The Axiom of Choice, The Axiom of Countable Choice (ACω), AC implies DC implies countable choice, Orthogonal decomposition by a closed subspace, Hilbert projections are linear, self-adjoint and contractive)

Proof

technique · For property (T) implying a compact Kazhdan pair, use a set-sized family of normalized coefficient functions and their canonical GNS representations. For the quantitative estimate, decompose orthogonally into the invariant subspace and its complement
1.1F1F2

Assume (ii), and let π have almost invariant vectors. Choose the compact Q and ε>0 from (ii). By [F1], π has a (Q,ε)-invariant unit vector, so the pair property [F2] supplies a nonzero invariant vector. Hence G has property (T).

1.2F1F2F3choose

Assume (i) and suppose, for contradiction, that no compact Kazhdan pair exists. Let I be the set of pairs (Q,η) with Q compact in G and η>0. For each i=(Q,η)∈I, let Ci be the subset of the set CG consisting of normalized diagonal coefficients of unit vectors in strongly continuous representations with no nonzero invariant vector that are (Q,η)-invariant. Failure of (Q,η) to be a pair makes Ci nonempty. AC chooses one function φi∈Ci for each i∈I; this is a choice from subsets of the set CG, not from the class of all representations.

1.3F2choose

If (ii) holds for a compact Q and ε>0, [F2] gives κ(G,Q)≥ε>0, so (iii) holds. Conversely, if (iii) holds for a compact Q, choose α>0 strictly below κ(G,Q) (choose α=1 when the threshold is +∞); [F2] says (Q,α) is a Kazhdan pair. Hence (ii) and (iii) are equivalent.

1.4F2F5F6

For the quantitative clause put M=HG. By [F5] it is closed and invariant, its orthogonal complement is invariant, and the restricted representation on M⊥ has no nonzero invariant vector. By [F6], write ξ=Pξ+ξ′′ with ξ′′=ξ−Pξ∈M⊥. If ξ′′=0, the claimed estimate is immediate. If ξ′′≠0 and Q=∅, then ξ′′/∥ξ′′∥ is vacuously (Q,ε)-invariant, so the pair would force an invariant vector in the restricted representation, a contradiction.

2.1F3step 1.2

For each i, let (ρi,Ki,ζi) be the canonical pointed cyclic GNS representation of φi from [F3]. This representation has no nonzero invariant vector: a witness in the definition of Ci has a closed cyclic subspace generated by its unit vector; that subspace has no invariant vector, and its pointed cyclic representation has coefficient φi, so [F3] identifies it unitarily with the GNS representation. In particular, ∥ζi∥=1 and ζi is (Q,η)-invariant in ρi.

2.2F2F5F6step 1.4algebra

Thus in the remaining case Q≠∅ and ξ′′≠0. The unit vector ξ′′/∥ξ′′∥ cannot be (Q,ε)-invariant, because the restricted representation has no nonzero invariant vector and (Q,ε) is a Kazhdan pair. Hence some q∈Q satisfies ∥π(q)ξ′′−ξ′′∥≥ε∥ξ′′∥. Since Pξ∈HG, this displacement equals ∥π(q)ξ−ξ∥, which is strictly less than δε∥ξ∥ by the assumed invariance of ξ. Canceling ε>0 gives ∥ξ−Pξ∥=∥ξ′′∥<δ∥ξ∥, and therefore the stated weak inequality.

3.1F1F4step 2.1construct

Form the set-indexed Hilbert direct sum ρ=⨁^i∈Iρi. Given any compact Q and ϵ>0, the coordinate indexed by (Q,ϵ/2) contains a unit vector that is (Q,ϵ/2)-invariant; its image under the coordinate inclusion is (Q,ϵ)-invariant in ρ. Thus ρ has almost invariant vectors. By (i) it has a nonzero invariant vector, but each coordinate of an invariant vector is invariant in its summand by [F4], and every ρi has no such vector by step 2.1. All coordinates must therefore vanish, a contradiction. This proves (i)⇒(ii).

4.1F3F4F6step 1.2step 3.1step 1.3step 1.4step 2.2∎

Steps 1.1 and 3.1 prove (i)⟺(ii), step 1.3 proves (ii)⟺(iii), and steps 1.4 and 2.2 prove the quantitative clause, including the zero vector, zero representation and empty-Q cases. AC is used for the set-indexed coefficient selection, GNS/direct-sum constructions, and through Countable Choice in the orthogonal-decomposition and projection suppliers; no proper-class selection is used.

Depends on

Used by

Dependency tree · two levels

68 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