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.

Parameter-sign equivalence and its exceptional failures for SL2(R)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let ε∈{0,1}, ν∉Wε (The normalized principal series I(epsilon, nu)), and n0=0 for ε=0 and n0=1 for ε=1. The base-normalized meromorphic intertwiner A^(ν):=A(ν)/cn0(ν) extends through every common scalar pole of numerator and denominator to a continuous K-diagonal isomorphism Iε,νK→Iε,−νK with inverse A^(−ν); hence the smooth compact-picture representations Iε,ν and Iε,−ν are continuously equivalent. At every nonexceptional parameter where the unnormalized A(ν) is regular, cn0(ν) is finite and nonzero, so A(ν) is a nonzero scalar multiple of A^(ν) and is itself an isomorphism.

If ν∈iR∖Wε, then A^(ν) is a unitary intertwiner and ∣c^r(ν)∣=1 for every allowed parity-ε K-type; hence the unitary principal series at ν and −ν are unitarily equivalent. Complex conjugation of the compact picture is also an anti-unitary intertwiner between them. For ε=0 and nonzero imaginary ν, this is the usual normalization A(ν)/c0(ν).

At an exceptional parameter ν∈Wε, ν≠0, write n=∣ν∣. The unnormalized A(ν) is regular but not injective: by K-type eigenvalues of A(nu): recurrence, closed form and nonvanishing, at ν=n it kills the two tail submodules with ∣r∣≥n+1, while at ν=−n it kills the finite-dimensional submodule with ∣r∣≤n−1. Moreover, Iε,n and Iε,−n are not isomorphic as (g,K)-modules, and therefore are not continuously equivalent as smooth G-representations: the former has irreducible tail submodules, whereas the latter has the finite-dimensional submodule as its unique irreducible submodule, and their K-type supports are disjoint. At ε=1,ν=0, the two representations coincide and the odd K-finite module splits into the two limit chains by Generic irreducibility and the exceptional parameter lattice(b). Thus Iε,ν≅Iε,−ν exactly when ν∉Wε∖{0}.

Facts & Assumptions

Given: AC, ε∈{0,1}, the smooth principal-series models Iε,ν, and the normalized parameter lattice Wε.

[F1]

The integral A(ν) and its compact-picture K-type eigenvalues cr(ν) are defined on an initial half-plane (The standard intertwining operator A(nu)). The meromorphic family is continuous K-diagonal on smooth vectors, its proof step 1.1 locates the common simple scalar poles in Pε, and it intertwines Πν with Π−ν at every regular parameter (Meromorphic continuation and intertwining identity for A(nu)).

[F2]

The recurrence (r+1+ν)cr+2(ν)=(r+1−ν)cr(ν), the symmetry c−r(ν)=(−1)rcr(ν), and the exact zeros at ν=±n∈Wε hold for each allowed r. The Gamma formula has simple poles with nonzero residues, no zeros, and reciprocal-Gamma zeros that cancel the common numerator poles outside Pε (K-type eigenvalues of A(nu): recurrence, closed form and nonvanishing).

[F3]

For n∈Wε, n≥1, the finite-dimensional Ln−1 is the unique irreducible quotient at ν=n and the unique irreducible submodule at ν=−n; its K-types are −(n−1),−(n−3),…,n−1. At (ε,ν)=(1,0) the odd module splits into the two limit chains (Generic irreducibility and the exceptional parameter lattice).

[F4]

The compact-picture action is (Πν(g)f)(k)=∣α(p(k,g))∣1+νf(κ(k,g)) in the canonical AN×K factorization (The compact picture of the SL2(R) principal series, The normalized principal series I(epsilon, nu)). For ν∈iR this is a strongly continuous unitary representation (Unitarity of the unitary principal series).

[F5]

On Lε2(K) the vectors fr(kθ)=eirθ, r≡ε(mod2), form a complete orthonormal basis; the finite Fourier sums are precisely the K-finite core (K-type decomposition of the SL2(R) principal series).

[F6]

On the K-type fr, the derived operators are LWfr=rfr, LE+fr=(1+ν+r)fr+2/2, and LE−fr=(1+ν−r)fr−2/2. Differentiating a continuous smooth group intertwining identity along real one-parameter subgroups, then complexifying, gives a (g,K)-module map (Derived action and raising/lowering formulas in the compact picture).

[F7]

A unitary representation is strongly continuous, and an equivalence of unitary representations is a unitary intertwiner (Strongly continuous unitary representations, invariant linear subspaces and intertwiners).

[A1]

AC supplies the normalized Haar probability dk=dθ/(2π) and the Hilbert compact-picture realization through [F4]–[F5], and is stated explicitly at the beginning. The proof makes no additional choices (The Axiom of Choice).

Proof

technique · normalize away the common scalar poles, use the exact K-type recurrence for the inverse, and compare the exceptional composition-series orientations separately
1.1F1F2algebra

Let Pε={−m:m∈Z≥0, m≡ε(mod2)} be the common scalar pole set from [F1]. It is disjoint from Wε. For ν∉Wε∪Pε, [F2] shows that cn0(ν) is finite and nonzero, so A^(ν)=A(ν)/cn0(ν) is a continuous K-diagonal map. At ν0=−m∈Pε, the Gamma formula in [F2] has one numerator Gamma factor with a simple pole of nonzero residue, while both denominator arguments are half-integers and hence finite and nonzero for every allowed r. Thus every cr, including cn0, has the same simple pole and h(ν)cn0(ν) is holomorphic and nonzero at ν0, where h(ν)=ν−ν0. By [F1], hA(ν) is holomorphic in the smooth operator topology there. Therefore A^=(hA)/(hcn0) extends continuously through that pole as a K-diagonal map.

1.2F1F2algebra

Let ν∈Wε∖{0} and write n=∣ν∣≥1. The pole set Pε has parity ε and is disjoint from Wε, so A(ν) is regular. If ν=n, [F2] gives cr(n)=0 on every allowed type with ∣r∣≥n+1; if ν=−n, it gives cr(−n)=0 for ∣r∣≤n−1. In either case a nonzero K-type is killed, so A(ν) is not injective.

2.1F2step 1.1algebra

For every allowed r, normalize the recurrence in [F2] to obtain c^r+2(ν)=c^r(ν)(r+1−ν)/(r+1+ν) and c^−r(ν)=(−1)rc^r(ν), with c^n0=1. If ν∉Wε, neither r+1+ν nor r+1−ν vanishes for any allowed r, since r+1 has the opposite parity. Thus every multiplier is finite and nonzero, including at Pε by step 1.1.

3.1A1F1F2F5step 2.1

Applying the recurrence at ν and −ν gives c^r+2(ν)c^r+2(−ν)=c^r(ν)c^r(−ν); the base value is 1 and the symmetry handles negative indices. Therefore A^(−ν)A^(ν) is the identity on every K-type. Both operators are continuous and K-diagonal by step 1.1; for smooth f, every Fourier coefficient of (A^(−ν)A^(ν)−I)f is zero, so [F5] makes that vector zero in L2. A smooth function that is zero almost everywhere is zero everywhere, since a nonzero value would by continuity give a nonempty open arc on which its modulus is bounded below, and every open arc has positive normalized Haar measure. The same argument applies in the reverse order, proving that the maps are continuous inverses on Cε∞(K).

4.1F1F2F4step 1.1step 3.1

For ν∉Wε∪Pε, [F1] gives the G-intertwining identity for the regular operator A(ν), and [F2] gives 0≠cn0(ν); division yields the identity for A^(ν). At a pole ν0∈Pε, take regular νj→ν0 outside Wε∪Pε∪(−Pε); step 1.1 gives convergence of A^(νj) in the smooth-operator topology. For fixed g, the compact formula in [F4] depends continuously on ν in every smooth seminorm, because log⁡∣α(p(k,g))∣ is smooth and bounded on compact K. Passing to the limit in the intertwining identity gives it at ν0 as well. Consequently the inverse maps of step 3.1 give Iε,ν≅Iε,−ν for every ν∉Wε. When in addition the unnormalized A(ν) is regular, [F2] gives finite nonzero cn0(ν), so A(ν)=cn0(ν)A^(ν) is an isomorphism.

5.1A1F2F4F5F7step 2.1step 4.1

Suppose ν∈iR∖Wε. Every recurrence factor (r+1−ν)/(r+1+ν) has modulus one, and the base multiplier is c^n0=1; the symmetry gives ∣c^r(ν)∣=1 on every allowed K-type. Thus the Fourier multiplier preserves the L2 norm on finite Fourier sums and its inverse multiplier does too; by density [F5] it extends to a unitary operator on Lε2(K). Step 4.1 makes it a smooth G-intertwiner, so continuity of the two unitary actions and density extend the intertwining identity to all of Lε2(K). Separately, for Cf=f‾, the compact-picture formula [F4] gives CΠν(g)=Π−ν(g)C because ∣α(p(k,g))∣ is positive real and ν‾=−ν; thus C is an anti-unitary intertwiner.

6.1F3F5F6step 1.2∎

Let n≥1 lie in Wε. In Iε,nK put T+=⨁j≥0Cfn+1+2j. By [F6], LE−fn+1=0, while E+ preserves these weights and both arrows are nonzero between every adjacent pair above the boundary; K also preserves T+. Hence T+ is a nonzero (g,K)-submodule. It is simple: for any nonzero submodule choose a nonzero finite Fourier sum; a kθ∈K can be chosen with distinct eigenvalues on its finite set of K-types, since only finitely many angles cause a collision, and a polynomial in its action isolates one nonzero K-type. The nonzero ladder arrows then generate all of T+. If a (g,K)-module isomorphism T existed from Iε,nK to Iε,−nK, it would send T+ to an irreducible submodule at −n, which [F3] says must be Ln−1. But Ln−1 has only K-types −(n−1),−(n−3),…,n−1, disjoint from the support of T+, contradicting K-equivariance. Thus the K-finite modules are not isomorphic. Any continuous G-equivalence of the smooth compact-picture representations restricts to a K-finite module isomorphism: continuity lets one differentiate TΠn(g)=Π−n(g)T along real one-parameter subgroups, while K-commutation preserves K-finiteness. Therefore no continuous G-equivalence exists; exchanging n and −n gives the same conclusion in the reverse direction. The odd case ν=0 is excluded: there ν∈W1 and [F3] gives a direct sum of the two limit chains.

Depends on

Used by

Dependency tree · two levels

115 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