Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

The integers do not have property (T)

Statement

Assume the Axiom of Choice (The Axiom of Choice), and give the additive group Z (The integers as equivalence classes of pairs of naturals) the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). For every compact subset Q⊆Z (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) and every ε>0, there is a complex number z with ∣z∣=1 and z≠1 such that the character χz(n)=zn defines a strongly continuous unitary representation πz(n)u=znu on the standard complex Hilbert space C (Strongly continuous unitary representations, invariant linear subspaces and intertwiners, Hilbert space) with no nonzero invariant vector, while its unit vector 1 is (Q,ε)-invariant (Almost invariant vectors for a unitary representation): ∣zn−1∣<ε(n∈Q). Consequently, no compact subset of Z is a Kazhdan set, and Z does not have property (T) (Kazhdan's property (T)) by Property (T) is equivalent to the existence of a compact Kazhdan pair. No compact Kazhdan pair exists (Kazhdan pairs, Kazhdan sets and Kazhdan constants).

Facts & Assumptions

Given: AC, the additive group Z with discrete topology, a compact subset Q⊆Z, and a real ε>0.

[F4]

The discrete topology makes every map from Z continuous; the addition map is continuous because Z×Z is discrete in the product topology, and negation is continuous for the same reason. Thus Z is a topological group and every scalar character on it is continuous. The integer operations form an additive group by the commutative ring theorem (The integers as equivalence classes of pairs of naturals, Arithmetic on the integers, The integers form a commutative ring, Group and abelian group); the topology assertions use The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, and Topological group: multiplication and inversion are continuous.

[F5]

The order-preserving embeddings Z↪Q↪R turn the finite set of integer magnitudes from [F1] into a finite linearly ordered subset of R, so it has a maximum M. Also M≥0 and 1>0, hence M+1>0. These facts use the ordered-field structure of R, the integer order and absolute value, and the finite set convention (The integers embed in the rationals, The unique embedding of ℚ into an ordered field, The reals form a totally ordered field, Order on the integers, The integers form a totally ordered ring, Basic properties of the absolute value, Finite, countably infinite, countable, uncountable).

[F6]

Under AC, property (T) implies the existence of a compact Kazhdan pair; this is the forward implication in the property-(T)/Kazhdan-pair equivalence (The Axiom of Choice, Kazhdan's property (T), Kazhdan pairs, Kazhdan sets and Kazhdan constants, Property (T) is equivalent to the existence of a compact Kazhdan pair).

Proof

Proof technique: choose a nontrivial scalar of modulus one explicitly and bound its integer powers on the finite compact test set.

1.1F4

The additive group Z with the discrete topology is a topological group: every subset of Z and of Z×Z is open, so addition and negation are continuous by [F4].

1.2F1F3F5algebra

The compact set Q is finite by [F1]. Let M:=max⁡({0}∪{∣n∣:n∈Q}) in R, using the order-preserving embeddings in [F5]. This maximum exists because the displayed set is finite and linearly ordered; it also gives M=0 when Q=∅. Set t:=ε/(4(M+1))>0 and z:=((1−t2)+2it)/(1+t2). Then ∣z∣2=((1−t2)2+4t2)/(1+t2)2=1, so ∣z∣=1 by nonnegativity of the modulus; the imaginary part 2t/(1+t2) is nonzero, so z≠1. Moreover, ∣z−1∣2=(4t4+4t2)/(1+t2)2=4t2/(1+t2)≤4t2, and hence ∣z−1∣≤2t=ε/(2(M+1)).

2.1F3step 1.2algebra

For every integer n, the geometric-sum identity and [F3] give ∣zn−1∣≤∣n∣ ∣z−1∣: for n=k≥1 factor zk−1=(z−1)(1+z+⋯+zk−1) and use ∣zj∣=1; for n=−k<0, ∣z−k−1∣=∣z−k(1−zk)∣=∣1−zk∣; for n=0 both sides are zero. Therefore, for every n∈Q, ∣zn−1∣≤∣n∣ε/(2(M+1))≤Mε/(2(M+1))<ε. The last strict inequality also holds when M=0.

2.2F2F3F4step 1.1

Since ∣z∣=1, the map χz(n)=zn is a homomorphism from the additive group Z into the unit scalars by [F3], and it is continuous because its domain is discrete by [F4]. On H=C with the inner product from [F2], define πz(n)u:=χz(n)u. Each πz(n) is complex linear by the field laws and preserves the norm since ∣znu∣=∣zn∣∣u∣=∣u∣; its inverse is πz(−n). The homomorphism law for χz gives the representation law, and its orbit maps are continuous by [F4], so πz is a strongly continuous unitary representation.

3.1step 1.2step 2.1step 2.2F2

The vector 1∈C has norm one by [F2] and satisfies ∥πz(n)1−1∥=∣zn−1∣<ε for each n∈Q by step 2.1. If u∈C were invariant under πz, invariance under 1∈Z would give zu=u; since z≠1 and C is a field, this forces u=0. Thus 1 is a (Q,ε)-invariant unit vector in a representation with no nonzero invariant vector.

4.1F1F6step 3.1∎

Since Q and ε>0 were arbitrary, the witness in step 3.1 shows that no compact Q and positive tolerance form a Kazhdan pair. Hence Z has no compact Kazhdan set. By [F6], this rules out property (T). The character construction itself uses no Choice; AC is used only in this final implication.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

137 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