Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 limits of discrete series are not square-integrable

Statement

Assume the Axiom of Choice (The Axiom of Choice). Define a square-integrable irreducible unitary representation to mean one for which every matrix coefficient lies in L2(G); this is the discrete-series convention of Frahm's SL(2,R) Plancherel notes. Let D1− and D1+ be the two limits of discrete series of The two limits of discrete series. Neither is square-integrable. In the compact picture of I1,0, the normalized weight-one vector f1(kθ)=eiθ in D1+ has coefficient ⟨Π0(aτ)f1,f1⟩=sech⁡(τ/2),aτ=diag⁡(eτ/2,e−τ/2), and ∫G∣⟨Π0(g)f1,f1⟩∣2 dg=2π∫0∞sech⁡2(τ/2)sinh⁡τ dτ=+∞. Complex conjugation gives the same nonintegrable coefficient modulus on D1−. This statement establishes failure of the all-coefficients criterion; it makes no claim about Plancherel support or occurrence in the regular representation.

Facts & Assumptions

Given: AC; the compact-picture representation I1,0, its two limit summands, the unitary structure of those limits, the weight-one coefficient formula, and the fixed left Haar measure.

[F1]

The odd compact-picture basis has unit vectors fm(kθ)=eimθ; D1+ is the closed positive-weight tail beginning at f1, and D1− is the closed negative-weight tail beginning at f−1. Both are irreducible strongly continuous unitary representations (The two limits of discrete series, Unitarity and irreducibility of the limits of discrete series).

[F2]

At ν=0, the compact-picture action has the form (Π0(g)f)(k)=r(k,g)f(κ(k,g)) with r(k,g) real and positive. Therefore pointwise complex conjugation commutes with Π0(g) and maps f1 to f−1 (The compact picture of the SL2(R) principal series, The two limits of discrete series).

[F3]

In this model, ⟨Π0(aτ)f1,f1⟩=sech⁡(τ/2) for every τ∈R (Matrix-coefficient formulas and decay for the discrete and principal series(b)).

[F4]

For a continuous nonnegative K-bi-invariant function ψ, the fixed Haar measure satisfies ∫Gψ(g) dg=2π∫0∞ψ(aτ)sinh⁡τ dτ (KAK integration formula for K-bi-invariant functions on SL2(R)).

[F5]

A matrix coefficient is cv,w(g)=⟨π(g)v,w⟩ with pairing linear in the first variable; such coefficients are continuous for strongly continuous unitary representations (Matrix coefficient of a unitary representation).

[A1]

AC is assumed and inherited through the normalized principal-series and fixed-Haar constructions (The Axiom of Choice).

Proof

technique · direct

Given: The assumptions and notation of the Statement.

1.1F1F3

Let c+(g):=⟨Π0(g)f1,f1⟩. By [F1], f1 is a unit K-eigenvector in D1+, and [F3] gives c+(aτ)=sech⁡(τ/2).

2.1F1F3F4F5step 1.1algebraA1

Unitarity and the K-character property of f1 imply that ψ+(g):=∣c+(g)∣2 is continuous, nonnegative, and K-bi-invariant. Applying [F4] and using sinh⁡τ=2sinh⁡(τ/2)cosh⁡(τ/2) gives ∫Gψ+(g) dg=2π∫0∞2tanh⁡(τ/2) dτ=+∞: the integrand 2tanh⁡(τ/2) tends to 2, hence is at least 1 for all sufficiently large τ. Thus c+∉L2(G).

3.1F1F2F5step 1.1step 2.1algebra∎

Let Cf=f‾ on L12(K). By [F2], C commutes with Π0(g) and maps the positive tail D1+ onto D1−. Since C is antiunitary, ⟨Π0(g)f−1,f−1⟩=⟨Π0(g)f1,f1⟩‾, so its modulus also fails to lie in L2(G) by step 2.1. The irreducible unitary representations D1± therefore each have a matrix coefficient outside L2(G), which violates the defining requirement that every matrix coefficient be square-integrable.

Depends on

Used by

Dependency tree · two levels

45 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