Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-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.

Matrix-coefficient properties of the transversal model of a monomial representation

Statement

Assume AC (The Axiom of Choice). Let G be a topological group. For i∈{1,2}, let Hi≤G be open, let χi:Hi→T be a unitary character, and let Ti be a right transversal for the left cosets Hi\G with e∈Ti. Write the unique factorization tg=αi(t,g)(t⋅ig) from Commensurator, unitary characters and monomial induced representations in the transversal model, and let πi be its transversal representation on ℓ2(Ti). A bounded intertwiner is a bounded linear map S:ℓ2(T1)→ℓ2(T2) (Hilbert space, A bounded linear operator between normed spaces) satisfying Sπ1(g)=π2(g)S for every g∈G. Put f:=Sδe∈ℓ2(T2), where δe is the distinguished basis vector. Then:

  1. f=0 if and only if S=0.
  2. If π1=π2 on the same Hilbert space, then f is a scalar multiple of δe if and only if S is a scalar operator.
  3. For every t∈T2 and h∈H1, χ2(α2(t,h))f(t⋅2h)=χ1(h)f(t).
  4. If t∈T2 has an infinite H1-orbit under t⋅2h, then f(t)=0.
  5. If t∈T2 and h∈H1 satisfy f(t)≠0 and t⋅2h=t, then tht−1∈H2 and χ1(h)=χ2(tht−1).

Facts & Assumptions

Given: AC, the fixed transversal data Ti, their transversal representations πi, and a bounded intertwiner S.

[F1]

AC is inherited from the transversal convention of the preceding definition; the present lemma takes both transversals as data and uses no additional choice (The Axiom of Choice).

[F2]

The transversal action is (πi(g)u)(t)=χi(αi(t,g))u(t⋅ig), πi(t−1)δe=δt, and δe is cyclic (Commensurator, unitary characters and monomial induced representations in the transversal model).

[F3]

For any index set I and u∈ℓ2(I), ∥u∥22=sup⁡F⊆I finite∑s∈F∣u(s)∣2; hence each finite subsum is at most ∥u∥22 (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[F6]

If u∈ℓ2(I) and ε>0, there is a finite F⊆I such that ∑s∈I∖F∣u(s)∣2<ε (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[F4]

The real field is Archimedean, so for every real bound b some natural number n satisfies b<n (Every complete ordered field is Archimedean).

[F5]

Each ℓ2(Ti) is a Hilbert space and a bounded linear map between normed spaces is continuous (Hilbert space, A bounded linear operator between normed spaces).

Proof

technique · direct

Given: AC, G,Hi,χi,Ti,πi, and S as in the Statement.

1.1F1F2F3F6given

For every t∈T1, the transversal action gives π1(t−1)δe=δt. To check density from [F3, F6], take u∈ℓ2(T1) and ε>0. Apply [F6] with tolerance ε2 to obtain a finite F⊆T1 with ∑t∈T1∖F∣u(t)∣2<ε2. The vector uF equal to u on F and 0 elsewhere has finite support and ∥u−uF∥22=∑t∈T1∖F∣u(t)∣2<ε2 by the norm definition [F3], hence ∥u−uF∥2<ε. Thus finite-support vectors are dense, and since each is a finite linear combination of the vectors δt=π1(t−1)δe, δe is cyclic. AC is only the inherited transversal convention; the fixed Ti are given.

1.2F2F5

For h∈H1, the transversal identities give α1(e,h)=h and e⋅1h=e, while s⋅1h≠e for s∈T1∖{e}. Therefore π1(h)δe=χ1(h)δe. Intertwining now gives π2(h)f=Sπ1(h)δe=χ1(h)f; evaluating at t∈T2 with the formula in [F2] yields χ2(α2(t,h))f(t⋅2h)=χ1(h)f(t).

2.1F5step 1.1

If f=0, then for every g∈G, Sπ1(g)δe=π2(g)Sδe=0. By cyclicity from step 1.1, S vanishes on a dense subspace; continuity from [F5] gives S=0. Conversely, S=0 immediately gives f=0.

2.2F5step 1.1

Suppose π1=π2 on the common carrier and f=λδe. For every g∈G, Sπ1(g)δe=π1(g)Sδe=λπ1(g)δe. Step 1.1 makes the orbit span dense, so continuity gives S=λI. Conversely, if S=λI, then f=λδe.

2.3F2F3F4step 1.2

By step 1.2 and ∣χi∣=1, the modulus ∣f∣ is constant on each H1-orbit in T2. If the orbit O of t is infinite and c:=∣f(t)∣>0, choose a natural number n>∥f∥22/c2 by [F4]. There are n distinct points in O; their finite square sum is nc2, contradicting the finite-subsum bound [F3]. Hence f(t)=0.

3.1F2step 1.2∎

Suppose f(t)≠0 and t⋅2h=t. Step 1.2 then gives χ2(α2(t,h))=χ1(h). The factorization th=α2(t,h)(t⋅2h)=α2(t,h)t implies tht−1=α2(t,h)∈H2, and therefore χ1(h)=χ2(tht−1).

Source notes

Bekka–de la Harpe's Lemma 1.F.10, printed pp. 53–54, states exactly the five claims and gives a complete short proof. Each cyclicity, intertwining, coordinate, orbit, and stabilizer calculation is written out above. Blackadar's Part II §10 is only background: pp. 212–213 discuss group C*-algebra functoriality and mention induction while omitting its construction; pp. 219–220 discuss cocycle conjugacy of actions. Those passages do not prove this monomial-transversal lemma and are not used as proof substitutes.

Depends on

Used by

Dependency tree · two levels

35 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