Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

K-finite vectors detect nonzero closed invariant subspaces

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let ε∈{0,1} and ν∈C, and set H=Lε2(K) with normalized Haar measure. The smooth compact-picture action of The compact picture of the SL2(R) principal series extends uniquely to a strongly continuous representation on H; unitarity is not asserted when ν∉iR. With this action:

  • the K-finite vectors of H are smooth for the action and are stable under the derived action, so Iε,νK is a (g,K)-submodule of the smooth vectors;
  • every nonzero closed subspace W⊆H invariant under the K-action contains a nonzero K-finite vector: for n≡ε(mod2), let Pn be the isotypic projection onto the K-type Cfn of K-type decomposition of the SL2(R) principal series. Then Pn(W)⊆W for every such n, and v=∑n≡ε (2)Pnv for every v∈H, so v≠0 forces Pnv≠0 for some n;
  • consequently, for every closed G-invariant subspace W, the space W∩Iε,νK is a (g,K)-submodule of Iε,νK, and W≠{0} if and only if W∩Iε,νK≠{0}.

Facts & Assumptions

Given: AC, ε∈{0,1}, ν∈C, the compact-picture Hilbert space H=Lε2(K), and a closed subspace W⊆H when specified.

[F1]

The compact-picture action is (Πν(g)f)(k)=∣α(p(k,g))∣1+νf(κ(k,g)), where kg=p(k,g)κ(k,g) is the unique AN×K factorization; both the cocycle and its coordinates are smooth in (k,g). Its restriction to K is right translation. The normalized inducing character fixes the positive-base complex-power convention and gives ∣∣α∣1+ν∣2=∣α∣2+2Re⁡ν (The compact picture of the SL2(R) principal series, The normalized principal series I(epsilon, nu)).

[F2]

The unique Iwasawa coordinates are smooth (Iwasawa decomposition and Haar integration formula for SL2(R)); the subgroup K={kθ:θ∈R/2πZ} is the compact circle (Iwasawa and minimal-parabolic data for SL2(R)).

[F3]

The vectors fn(kθ)=einθ with n≡ε(mod2) form an orthonormal basis of H, have K-character einϕ, and their finite linear combinations are exactly the K-finite vectors (K-type decomposition of the SL2(R) principal series).

[F4]

The derived action has LWfn=nfn and LE±fn=(1+ν±n)fn±2/2, preserving finite Fourier sums (Derived action and raising/lowering formulas in the compact picture).

[F5]

For a strongly continuous unitary K-representation and one-dimensional character σn(kϕ)=einϕ, the compact-group definition constructs the bounded Bochner averaging map Pnv=∫Kσn(k)‾ Π(k)v dk; the integral is a norm limit of finite linear combinations of its range values (Compact-group isotypic projection).

[F6]

Under kθ↔[θ/(2π)]∈R/Z, normalized Haar measure is dk=dθ/(2π): the torus integral is normalized translation-invariant Lebesgue measure, and its pushforward is the unique normalized Haar measure on compact K (Iwasawa and minimal-parabolic data for SL2(R), The one-dimensional torus and its normalized Haar integral, Normalized Haar measure on a compact Lie group).

[F7]

An orientation-preserving diffeomorphism of the compact oriented circle changes a top-form integral by its positive angular Jacobian (Change of variables on oriented manifolds).

[F8]

A continuous real-valued function on compact metric K is bounded and attains its maximum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[A1]

AC supplies normalized Haar measure on K for the compact-picture and Fourier arguments. AC implies ACω through The Axiom of Countable Choice (ACω), used by the Fourier approximation in [F3], the Bochner-integral construction in [F5], and the one-parameter/exponential input in [F4]. The witness v∈W∖{0} in step 6.1 follows from the stated nonzero hypothesis and uses no choice axiom (The Axiom of Choice).

Proof

technique · extend the smooth cocycle by a Jacobian bound, then use its compact-group Fourier averages and closedness
1.1A1F1F2F6F7algebra

Fix g∈G and write kθg=at(θ)nx(θ)kψ(θ) in the unique smooth ANK coordinates. In a local lift of the angle ψ, the bottom row is v(θ)=e−t(θ)/2(−sin⁡ψ(θ),cos⁡ψ(θ)). It is also (−sin⁡θ,cos⁡θ)g, so det⁡(v,v′)=det⁡ ⁣(−sin⁡θcos⁡θ−cos⁡θ−sin⁡θ)det⁡g=1. The first expression gives det⁡(v,v′)=e−tψ′, hence ψ′=et=∣α(p(kθ,g))∣2>0. Thus κ(⋅,g) is an orientation-preserving circle diffeomorphism; uniqueness of the ANK factorization gives inverse κ(⋅,g−1). By [F6], dk=dθ/(2π), and the compactly supported top-form change of variables [F7] applies because K is compact; it gives Haar Jacobian dk′=∣α(p(k,g))∣2dk.

2.1F1F3F8step 1.1algebra

For smooth f, [F1] and step 1.1 give ∥Πν(g)f∥22=∫K∣α(p(k,g))∣2+2Re⁡ν∣f(κ(k,g))∣2 dk=∫K∣α(p(κ−1(k′),g))∣2Re⁡ν∣f(k′)∣2 dk′≤Cg∥f∥22, where Cg:=max⁡k∈K∣α(p(k,g))∣2Re⁡ν<∞ by [F8]; this is the same supremum because κ(⋅,g) is a diffeomorphism. Thus each smooth operator extends uniquely to a bounded operator on H, since smooth Fourier sums are dense by [F3].

3.1F1F2F3step 2.1algebra

The bounded extensions satisfy the group law because the original smooth action does and smooth Fourier sums are dense by [F3]. The coefficient ∣α(p(k,g))∣2Re⁡ν is jointly continuous in (k,g); compactness of K and a finite subcover near any fixed g0 give a local uniform bound M for the operator norms. For smooth f, [F1] gives a jointly smooth function Πν(g)f(k); compactness of K makes every parameter derivative continuous uniformly in k, so its orbit map is smooth into H. For arbitrary h∈H, approximate by a smooth Fourier sum f and use ∥Πν(g)h−Πν(g0)h∥2≤M∥h−f∥2+∥Πν(g)f−Πν(g0)f∥2+∥Πν(g0)(f−h)∥2 near g0; this proves strong continuity. For ν∉iR no unitarity of the G-action is asserted.

4.1F1F3F4step 3.1algebra

By [F1] and [F3], Πν(kϕ)fn=einϕfn. Since these vectors are an orthonormal basis, the K-action extends to a unitary action on H; it is strongly continuous by step 3.1. Every K-finite vector is a finite Fourier sum by [F3]. Joint smoothness in [F1] and compactness of K show that its orbit map is C∞ as an H-valued map. The formulas in [F4] preserve finite Fourier sums, and the K-action does too; hence Iε,νK is a (g,K)-submodule of the smooth vectors.

5.1A1F3F5step 4.1algebra

For n≡ε(mod2), let σn(kϕ)=einϕ. By step 4.1 the representation of K on H is strongly continuous and unitary, so [F5] defines Pn. For each basis vector fm, [F3] gives Pnfm=(∫Kei(m−n)ϕ dk)fm=⟨fm,fn⟩fm=δnmfm. Boundedness of Pn and the orthonormal-basis expansion in [F3] therefore give Pnv=⟨v,fn⟩fn and v=∑n≡ε (2)Pnv in Hilbert norm.

6.1A1F3F5step 5.1

If W is K-invariant and v∈W, every value σn(k)‾Π(k)v in the integrand of [F5] belongs to W. The simple-function approximants to its Bochner integral are finite linear combinations of such values, and their norm limit lies in W because W is closed. Thus Pnv∈W for every allowed n. If W≠{0}, take any v∈W∖{0}; the expansion in step 5.1 has a nonzero term, so Pnv≠0 for some n, and this vector is K-finite. For W={0} every projection is zero. This proves detection for closed K-invariant subspaces.

7.1F1F4step 6.1algebra∎

If W is closed and G-invariant, then it is K-invariant, so step 6.1 proves W≠{0} iff W∩Iε,νK≠{0}, including W={0} where both sides are false. For w∈W∩Iε,νK and real X∈g, the difference quotients (Πν(exp⁡(tX))w−w)/t lie in W; their limit LXw also lies in W because W is closed, and is K-finite by [F4]. The K-action preserves the intersection, so it is a (g,K)-submodule.

Depends on

Used by

Dependency tree · two levels

144 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