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

Mackey-Shoda irreducibility criterion for monomial representations

Statement

Assume the Axiom of Choice. Let G be a topological group, H≤G an open subgroup and χ a unitary character of H. Assume that for every g∈Comm⁡G(H)∖H the restrictions of χ and of χg to the subgroup H∩g−1Hg do not coincide, where χg(h):=χ(ghg−1). Then Ind⁡HGχ is irreducible. In particular, if H is open and Comm⁡G(H)=H, then Ind⁡HGχ is irreducible for every unitary character χ of H; and if N is an open normal subgroup and χ a unitary character of N, then Ind⁡NGχ is irreducible if and only if χg≠χ for every g∈G∖N.

Facts & Assumptions

Given: AC; a topological group G; an open subgroup H≤G; a unitary character χ:H→T; and the monomial representation π=Ind⁡HGχ in the transversal model of Commensurator, unitary characters and monomial induced representations in the transversal model.

[F1]

AC says that every family of nonempty sets has a choice function, and it implies Countable Choice (The Axiom of Choice, AC implies DC implies countable choice).

[F2]

Fix a right transversal T of the left cosets of H with e∈T. For t∈T and g∈G there are unique α(t,g)∈H and t⋅g∈T with tg=α(t,g)(t⋅g), and π(g)f(t)=χ(α(t,g))f(t⋅g) defines a strongly continuous unitary representation of G on ℓ2(T) with π(t−1)δe=δt and cyclic vector δe; irreducibility means that no closed π(G)-invariant subspace other than {0} and ℓ2(T) exists (Commensurator, unitary characters and monomial induced representations in the transversal model, Strongly continuous unitary representations, invariant linear subspaces and intertwiners).

[F3]

In this transversal model with a bounded map S:ℓ2(T)→ℓ2(T) that intertwines a representation π with itself, the vector f:=Sδe satisfies: f is a scalar multiple of δe exactly when S is a scalar operator; if t∈T has infinite H-orbit, then f(t)=0; and if f(t)≠0 and t⋅h=t for some h∈H, then χ(h)=χ(tht−1) (Matrix-coefficient properties of the transversal model of a monomial representation).

[F4]

Every bounded self-intertwiner of an irreducible strongly continuous unitary representation is a scalar multiple of the identity (Schur lemma for complex unitary representations).

[F5]

Under Countable Choice, every closed linear subspace M of a Hilbert space satisfies H=M⊕M⊥, so every vector has a unique decomposition x=m+n with m∈M and n∈M⊥ (Orthogonal decomposition by a closed subspace).

Proof

technique · contraposition in the transversal model, followed by the two particular clauses; the normal-subgroup converse is proved with an explicit twist intertwiner built in the same model

Given: AC; the topological group G; the open subgroup H; the unitary character χ; a right transversal T with e∈T; and the representation π=Ind⁡HGχ on ℓ2(T).

1.1assume-hypcontrapositive-reduceF1F2F5construct

Assume, toward the contrapositive, that π is not irreducible. Then there is a closed π(G)-invariant subspace K with {0}≠K≠ℓ2(T); let P be the orthogonal projection onto K supplied by the decomposition ℓ2(T)=K⊕K⊥ of [F5], so that ∥x∥2=∥Px∥2+∥x−Px∥2, ∥P∥≤1, and ⟨Px,y⟩=⟨Px,Py⟩=⟨x,Py⟩ for all x,y, so P is self-adjoint. Since π(g) is unitary and π(g)K⊆K, also π(g)(K⊥)⊆K⊥, because ⟨π(g)n,π(g)k⟩=⟨n,k⟩=0 for n∈K⊥ and k∈K; hence Pπ(g)=π(g)P for every g∈G. Since K≠{0} and K≠ℓ2(T), the operator P is neither 0 nor the identity and is therefore not a scalar operator.

2.1F3step 1.1

Put f:=Pδe∈ℓ2(T). By the scalar criterion of [F3] applied to the self-intertwiner P, the vector f is not a scalar multiple of δe; hence there is t∈T∖{e} with f(t)≠0. By the orbit criterion of [F3], every element of T with nonzero f-value has finite H-orbit, so the H-orbit of t is finite.

3.1F2step 2.1

For h∈H we have t⋅h=t exactly when tht−1=α(t,h)∈H, by the unique factorization th=α(t,h)(t⋅h) of [F2]; hence the stabiliser of t in H is exactly H∩t−1Ht, and finiteness of the orbit gives [H:H∩t−1Ht]<∞. Moreover t∉H, because t∈T∖{e} and T meets the coset H=He exactly in e.

4.1F2F3step 3.1

Put t∗:=e⋅t−1∈T. The model formula of [F2] gives π(t)δe=χ(α(t∗,t))δt∗: indeed π(t)δe=∑s∈Tχ(α(s,t))δe(s⋅t), and s⋅t=e holds for the unique s∈T with st∈H, namely s=t∗. Since ∣χ(α(t∗,t))∣=1, the vectors Pδt∗=χ(α(t∗,t))−1π(t)f and π(t)f have equal norms; using that P is self-adjoint, we get ∣f(t∗)∣=∣⟨δe,Pδt∗⟩∣=∣⟨δe,π(t)f⟩∣=∣⟨π(t)∗δe,f⟩∣=∣⟨δt,f⟩∣=∣f(t)∣≠0. The orbit criterion of [F3] applied to the point t∗ therefore shows that t∗ has finite H-orbit.

5.1F2step 4.1

The stabiliser of t∗ in H is H∩(t∗)−1Ht∗ by the same computation as step 3.1. Since t∗=e⋅t−1 lies in the coset Ht−1, there is h1∈H with t∗=h1t−1, so (t∗)−1Ht∗=tHt−1 and H∩(t∗)−1Ht∗=H∩tHt−1. Step 4.1 therefore gives [H:H∩tHt−1]<∞; conjugating by t gives [t−1Ht:t−1Ht∩H]<∞, so with step 3.1 we obtain t∈Comm⁡G(H)∖H.

6.1F3step 5.1discharge-contrapositive

Let h∈H∩t−1Ht; then h∈H and tht−1∈H, so t⋅h=t by step 3.1, while f(t)≠0. The stabiliser criterion of [F3] therefore gives χ(h)=χ(tht−1)=χt(h): the characters χ and χt coincide on H∩t−1Ht, although t∈Comm⁡G(H)∖H by step 5.1. This contradicts the hypothesis of the Statement; the contrapositive is proved, so Ind⁡HGχ is irreducible.

7.1step 6.1algebra

If Comm⁡G(H)=H, the assumed condition is vacuous and the irreducibility just proved applies to every unitary character of H. If N⊴G is open, then N∩g−1Ng=N has finite index in N for every g, so Comm⁡G(N)=G; the criterion therefore gives that Ind⁡NGχ is irreducible whenever χg≠χ for every g∈G∖N, since here N∩g−1Ng=N and the restriction of χg to N is χg itself.

8.1step 7.1F2construct

For the converse direction in the normal case, assume χg0=χ for some g0∈G∖N; we shall construct a non-scalar bounded self-intertwiner of π. Every x∈G has a unique factorization x=nt with n∈N and t∈T, because G=⨆t∈TNt. Define Hd:={F:G→C: F(nt)=χ(n)F(t) for all n∈N, t∈T, and ∑t∈T∣F(t)∣2<∞} with norm ∥F∥d2:=∑t∈T∣F(t)∣2, and define Φ:ℓ2(T)→Hd by (Φf)(nt):=χ(n)f(t). Then Φ is a linear bijection with ∥Φf∥d=∥f∥ for all f, because every F∈Hd is determined by its restriction to T.

9.1step 8.1F2algebra

Define (DF)(x):=F(g0x) for F∈Hd. For x=nt write g0t=mtτ(t) with τ(t)∈T and mt=g0t τ(t)−1∈N; then g0x=(g0ng0−1)mt τ(t) with g0ng0−1∈N by normality, so DF satisfies the covariance identity of Hd: for n′∈N, (DF)(n′x)=F(g0n′x)=χ(g0n′g0−1)F(g0x)=χ(n′)(DF)(x), using χg0=χ. Since t↦g0t induces the bijection Nt↦Ng0t of the coset space, with inverse induced by g0−1, the map τ is a bijection of T; hence ∥DF∥d2=∑t∈T∣F(g0t)∣2=∑t∈T∣F(τ(t))∣2=∥F∥d2, and D is a surjective isometry of Hd.

10.1step 9.1F2algebra

The operator D commutes with every right translation: with (g⋅F)(x):=F(xg) we get (g⋅(DF))(x)=(DF)(xg)=F(g0xg)=(g⋅F)(g0x)=D(g⋅F)(x) for all x∈G. Moreover Φ intertwines the right-translation action with π, since Φ(π(g)f)(nt)=χ(n)χ(α(t,g))f(t⋅g) and (g⋅Φf)(nt)=(Φf)(n α(t,g) (t⋅g))=χ(nα(t,g))f(t⋅g) agree by the cocycle identity of [F2]. Hence S:=Φ−1DΦ is a surjective isometry of ℓ2(T) satisfying Sπ(g)=π(g)S for every g∈G.

11.1F4step 10.1algebra∎

With Fe:=Φδe, so that Fe(nt)=χ(n)δe(t), we get (Sδe)(e)=(DFe)(e)=Fe(g0). Writing g0=n0t0 with n0∈N, t0∈T, we have t0≠e because g0∉N, so Fe(g0)=χ(n0)δe(t0)=0≠1=δe(e). If S=λI then λ=(Sδe)(e)=0, contradicting that S is a surjective isometry; thus S is a non-scalar bounded self-intertwiner of π. By the contrapositive of Schur's lemma [F4], π is not irreducible. This proves the converse direction, and with step 7.1 the stated equivalence for open normal subgroups follows.

Boundary cases

If G=H, then T={e}, the representation is the one-dimensional character χ, the commensurator condition is vacuous, and irreducibility holds; no t∈T∖{e} exists, so the contrapositive hypothesis is never met. If H={e}, then Comm⁡G(H)=G, and the criterion reduces to the statement that the left regular representation on ℓ2(G) is irreducible exactly when G is trivial; this is consistent with step 6.1, because for nontrivial G every t≠e has trivial stabiliser, so χ and χt coincide on the trivial group, the hypothesis fails, and the induced representation is the reducible left regular representation. For the normal case with G=N the condition on G∖N is vacuous. The case of a one-element orbit, [H:H∩t−1Ht]=1, is included in step 3.1. No endpoint parameter occurs. The Choice content is that recorded in [F1]: the transversal is chosen by AC, and Countable Choice is inherited by the orthogonal-decomposition supplier of [F5].

Source qualifications

Bekka-de la Harpe, Theorem 1.F.11 with its proof, printed pp. 54-55, is the origin of the contrapositive argument of steps 1.1-6.1; the source invokes Lemma 1.F.10(2) and (4)-(5) for the scalar, support, and stabiliser conclusions, which is exactly the use made of [F3] here. Corollary 1.F.13 records the self-commensurating specialisation. Corollary 1.F.15 proves the normal-subgroup equivalence, but proves its converse with the covariant model rather than the transversal model; step 8.1-11.1 therefore reconstructs the twist operator inside the transversal model used on this page. The source takes the transversal as given; the construction of T from AC is recorded in Commensurator, unitary characters and monomial induced representations in the transversal model. The auxiliary space Hd is a proof device only, and no representation-theoretic assertion is made about it.

Depends on

Used by

Dependency tree · two levels

33 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