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.

SLn(R) has property (T) for n at least three

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every integer n≥3, the group SLn(R) with its embedded matrix Lie group topology (General and special linear Lie groups) has Kazhdan's property (T) (Kazhdan's property (T)).

Facts & Assumptions

Given: AC; an integer n≥3; the matrix group SLn(R); the relative-(T) supplier for SL2(R)⋉R2; the quantitative normal-relative property-(T) inequalities; and bounded generation by elementary transvections.

[F2]

The external semidirect product has multiplication (A,v)(A′,v′)=(AA′,v+Av′) and is a group. Its translation subgroup is closed and normal, and the four-element set in Relative property (T) for SL2(R) semidirect R2 is a relative Kazhdan pair for this group and subgroup. ( The external semidirect product N⋊αH, The semidirect-product multiplication makes N×H a group, Subgroup, Relative property (T) for a pair and relative Kazhdan pairs)

[F3]

The second quantitative inequality of the normal-relative supplier is used: for a relative Kazhdan pair (Q,δ) for (G,N), sup⁡v∈N∥π(v)ξ−ξ∥≤2δ−1ΔQπ(ξ). (Normal relative property (T) controls the distance to the invariant subspace)

[F4]

Use the bounded-generation supplier's row and column labels 1,…,n: ei is the coordinate vector with zero-based index i−1, and eij has zero-based matrix indices (i−1,j−1). Every g∈SLn(R) is a product of at most M(n)=2n2+6n elementary transvections Eij(t)=In+teij. (Bounded elementary generation of SLn(R) by transvections, Elementary matrices obtained by applying one elementary row operation to an identity matrix)

[F5]

Each π(g) is a norm-isometric homeomorphism with inverse π(g−1); a product of r factors each moving ξ by at most c moves it by at most rc (telescoping and the triangle inequality). (Strongly continuous unitary representations, invariant linear subspaces and intertwiners, Hilbert space, The inner-product norm is definite, homogeneous, and satisfies the triangle inequality)

[F7]

Under Countable Choice, every nonempty closed convex subset of a Hilbert space has a unique nearest point to 0; under AC this applies by the declared AC-to-Countable-Choice implication. (The Axiom of Choice, The Axiom of Countable Choice (ACω), AC implies DC implies countable choice, Projection onto a nonempty closed convex set)

[F8]

A compact Kazhdan pair applied to a representation with almost invariant vectors yields a nonzero invariant vector: almost invariance provides a witnessing unit vector on its compact first set. (Kazhdan pairs, Kazhdan sets and Kazhdan constants, Almost invariant vectors for a unitary representation, Kazhdan's property (T))

[F9]

AC implies Countable Choice through the declared theorem; the semidirect and normal-relative suppliers also use AC for their set-indexed constructions. (The Axiom of Choice, The Axiom of Countable Choice (ACω), AC implies DC implies countable choice, Relative property (T) for SL2(R) semidirect R2, Normal relative property (T) controls the distance to the invariant subspace)

Proof

technique · Embed finitely many copies of the relative-(T) semidirect product, use their translation subgroups to control every elementary transvection, then find a nonzero fixed vector as the least-norm point of a bounded closed convex orbit hull
1.1F1F2F4construct

Fix distinct indices i,j and k∉{i,j} in {1,…,n}, using [F4]'s coordinate labels. In the coordinate order (ei,ek,ej), define θij,k(A,v) to have block (Av01) and to fix all other basis vectors. Its determinant is det⁡A=1, and block multiplication gives θ(A,v)θ(A′,v′)=θ(AA′,v+Av′). The map and its inverse (coordinate restriction) are continuous by [F1], so its image Gij,k is a topological subgroup isomorphic to SL2(R)⋉R2. Its translation subgroup Nij,k=θij,k({I}×R2) is closed and normal, and contains Eij(t) as v=(t,0).

2.1F2step 1.1construct

Let (Qrel,δ) be the relative Kazhdan pair supplied by [F2], and let Qij,k=θij,k(Qrel). Each (Qij,k,δ) is a relative Kazhdan pair for (Gij,k,Nij,k). Let Q∗:=⋃i≠j, k∉{i,j}Qij,k; this is a finite set and hence compact. Every transvection Eij(t) belongs to at least one Nij,k, since for each i≠j there is a remaining index k.

3.1F3F4step 2.1

Put M=M(n) from [F4] and ε=δ/(4M). Let π be a strongly continuous unitary representation of SLn(R) with a (Q∗,ε)-invariant unit vector ξ. For each triple, Qij,k⊆Q∗ gives ΔQij,kπ(ξ)≤ε. Applying the second inequality [F3] to the restriction of π to Gij,k yields sup⁡v∈Nij,k∥π(v)ξ−ξ∥≤2ε/δ=1/(2M). Hence every elementary transvection moves ξ by at most 1/(2M).

4.1F4F5F6step 3.1construct

Every g∈SLn(R) is a product of at most M transvections by [F4]. Telescoping along such a product and using [F5] gives ∥π(g)ξ−ξ∥≤M/(2M)=1/2. Therefore the orbit π(G)ξ lies in the closed ball of radius 1/2 centered at ξ. Let C be the intersection of all closed convex subsets of H containing this orbit. By [F6], C is nonempty, closed and convex, and it is contained in that closed ball.

5.1F2F7F8F9step 4.1∎

For each g∈G, the set π(g)C is closed and convex and contains the orbit, so minimality of the intersection gives π(g)C⊇C; applying the same argument to g−1 gives equality. By [F7], C has a unique point η of least norm. Since C is G-invariant and π(g) preserves norms, uniqueness implies π(g)η=η for every g. Moreover ∥η−ξ∥≤1/2, so the reverse triangle inequality and ∥ξ∥=1 give ∥η∥≥1/2>0. Thus every representation with a (Q∗,ε)-invariant unit vector has a nonzero invariant vector; almost invariance provides such a vector because Q∗ is compact, so G has property (T) by [F8]. AC is used through the relative-(T), normal-distance, and least-norm suppliers as stated in the axiom audit.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

157 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