Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck 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 spherical complementary series destroys property (T) for SL2(R)

Statement refuted

SL2(R) has property (T) (Kazhdan's property (T)).

Facts & Assumptions

[F1]

For 0<ν<1, the completion of I0,ν in the normalized complementary-series form is an irreducible strongly continuous unitary representation, and f0=1 has norm one (Unitarity of the complementary series).

[F2]

The smooth even Fourier vectors f2j have pairwise distinct right K-characters e2ijϕ. For 0<ν<1, the normalized complementary form has Bν(f2j,f2j)=a2j(ν)>0, so these nonzero K-lines survive in its weighted Hilbert completion; no ordinary-L2 norm is transferred (K-type decomposition of the SL2(R) principal series, Unitarity of the complementary series).

[F3]

The normalized spherical coefficient φν(g)=⟨Πν(g)f0,f0⟩ tends to 1 uniformly on compact sets as ν↑1 (The spherical complementary series converge to the trivial representation).

[F4]

The classes [I0,ν] converge to the trivial class in the Fell topology as ν↑1 (The spherical complementary series converge to the trivial representation, The Fell topology on the unitary dual).

[F5]

For the unit vector f0 in a unitary representation, ∥Πν(g)f0−f0∥2=2(1−Re⁡φν(g)) by expansion of the squared norm.

[F6]

The A-page proposition proves directly that G fails property (T) by one direct-sum representation built from a cofinal sequence of complementary-series parameters (SL2(R) does not have property (T), Kazhdan's property (T)).

[F7]

A unit vector is (Q,ε)-invariant when its displacement is strictly less than ε at every point of Q (Almost invariant vectors for a unitary representation).

[A1]

AC is the principle that every family of nonempty sets has a choice function (The Axiom of Choice); it is assumed by the in-run representation suppliers.

Counterexample

Given: AC, G=SL2(R), and the family of parameters 0<ν<1.

Proof technique: use the compact-uniform spherical coefficient limit and the earlier A-page failure theorem.

1.1F1F2algebra

By [F1], each fixed I0,ν is irreducible and strongly continuous unitary; [F2] gives a nonzero vector f2 with Πν(kπ/2)f2=−f2, so it is not the trivial representation. Its fixed subspace is closed and invariant, hence irreducibility implies that it is zero.

1.2F1F3F5F7choosealgebra

Fix any compact Q⊆G and ε>0. If Q=∅, every unit vector is (Q,ε)-invariant. If Q is nonempty and compact, [F3] lets us choose ν close enough to 1 that sup⁡g∈Q∣φν(g)−1∣<ε2/2; [F1] supplies the unit vector f0, and [F5] gives ∥Πν(g)f0−f0∥<ε for every g∈Q. Thus the same fixed-parameter family has nontrivial representations with near-invariant vectors for every compact test and tolerance.

2.1F4step 1.1

By [F4], the nontrivial classes from step 1.1 converge to the trivial class in the Fell topology as ν↑1. No fixed I0,ν is asserted to weakly contain the trivial representation; the convergence is a parameter-family statement.

3.1F6A1step 1.1step 1.2step 2.1∎

The A-page proposition in [F6] constructs the direct sum over an explicit cofinal sequence νj↑1, which has almost invariant vectors and no invariant vector; hence G fails property (T), refuting the statement above. AC is inherited as in [A1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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