Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-27
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.

A coset basis makes a monomial representation monomial matrices

Statement

Let G be a finite group, H≤G, and λ:H→C× a linear character. Fix a left transversal T={t1,…,tn} of H in G.

  1. Ind⁡HGλ has a basis f1,…,fn indexed by T (equivalently, by the left cosets G/H), and for every x∈G the matrix of x in that basis is monomial: it has exactly one nonzero entry in each row and exactly one nonzero entry in each column, each of them a value of λ.

  2. Conversely, suppose V is an irreducible finite-dimensional complex G-representation with a basis v1,…,vr such that every x∈G permutes the lines Cvi and acts on each of them by a scalar, that is x⋅vi=ci(x)vσx(i) with ci(x)∈C× and σx a permutation of {1,…,r}. Let H={x∈G:x⋅Cv1=Cv1} be the stabilizer of the line Cv1, with its linear character λ. Then H≤G and V≅Ind⁡HGλ. In particular such a V is monomial.

Facts & Assumptions

Given: For claim 1, a finite group G, a subgroup H≤G, a linear character λ:H→C×, and a left transversal T={t1,…,tn} meeting every left coset gH in exactly one point. For claim 2, an irreducible finite-dimensional complex G-representation V with a basis v1,…,vr which every x∈G permutes up to nonzero scalars.

[F1]

Ind⁡HGW={ f:G→W:f(gh)=h−1⋅f(g) for all g∈G,h∈H } for a complex H-module W, with module structure pointwise and (x⋅f)(g)=f(x−1g). (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F2]

Evaluation on T gives a C-linear isomorphism ev⁡T:Ind⁡HGW→⨁i=1nW, f↦(f(t1),…,f(tn)), and n=[G:H]. (A left transversal identifies Ind⁡HGW with a direct sum of [G:H] copies of W).

[F3]

A left coset is gH={gh:h∈H} (Left and right cosets gH and Hg of a subgroup). Every g belongs to gH, and if gh=g′h′, then g′=gh(h′)−1, so gH=g′H. Thus left cosets partition G; since T meets each coset once, tH=t′H for t,t′∈T holds exactly when t=t′.

[F4]

V is irreducible when V≠0 and 0 and V are its only G-invariant subspaces. (Subrepresentations, direct sums of representations, and irreducibility).

[F5]

λ is a linear character of H, so the one-dimensional H-module Cλ is C with h⋅z=λ(h)z, and Ind⁡HGλ denotes Ind⁡HGCλ. (Monomial representations, monomial characters, and M-groups).

[A1]

Left multiplication by a fixed x∈G maps left cosets bijectively to left cosets: x(gH)=(xg)H, and gH=g′H implies xgH=xg′H.

Proof

technique · direct

The symbols H and λ are local to each claim: in claim 1 they are the given subgroup and character, and in claim 2 they are the line stabilizer and its character from step 1.2. The transversal T is used only for claim 1.

1.1

For t∈T define ft:G→C by ft(th′):=λ(h′)−1 for h′∈H, and ft(g):=0 for g∉tH. This is well defined because a decomposition g=th′ with t∈T, h′∈H is unique ([F3]), and ft lies in Ind⁡HGCλ: for g=th′ and h∈H one has gh=t(h′h) and λ(h′h)−1=λ(h)−1λ(h′)−1, while for g∉tH also gh∉tH and both sides vanish.

F1F3F5construct
1.2

For claim 2 put L:=Cv1 and H:={x∈G:x⋅L=L}. This H is a subgroup of G containing 1, and each x∈H acts on the line L by a nonzero scalar; writing x⋅z=λ(x)z for z∈L defines a group homomorphism λ:H→C×, because the action of G on V is a group action. Thus λ is a linear character of H and L is a one-dimensional H-module.

givenalgebra
1.3

For claim 2 let W be the span of all lines x⋅L=C (x⋅v1) with x∈G. Each spanning line is one of the basis lines Cvi, because the action permutes the basis lines, so W⊆V; and W is G-invariant with W≠0, since y⋅(x⋅L)=(yx)⋅L and L⊆W. Irreducibility of V forces W=V, so every basis line equals some x⋅L and the distinct lines x⋅L, x∈G, are exactly the r basis lines.

F4given
2.1

The function ft of step 1.1 takes the value 1 at t and the value 0 at every other element of T; hence ev⁡T(fti) is the i-th standard basis vector of ⨁i=1nCλ. By [F2] the map ev⁡T is an isomorphism, so f1,…,fn is a basis of Ind⁡HGλ and n=[G:H].

F2step 1.1
2.2

Fix x∈G and t∈T. By [A1] there are unique t′∈T and h∈H with xt=t′h. For s∈T the value (x⋅ft)(s)=ft(x−1s) is nonzero exactly when x−1s∈tH, that is s∈xtH=t′H, hence exactly when s=t′. At that point x−1t′=th−1 by the relation xt=t′h, so (x⋅ft)(t′)=ft(th−1)=λ(h−1)−1=λ(h)≠0.

F1step 1.1algebra
2.3

For claim 2 choose a left transversal S of the stabilizer H from step 1.2. Such an S exists by choosing one representative from each of the finitely many nonempty cosets in the finite group G; no axiom of choice is needed. The coset argument in [F3] applies to this H and S. The map S→{x⋅L:x∈G}, t↦t⋅L, is a well-defined bijection: it is well defined because th⋅L=t⋅L for h∈H; it is injective because t⋅L=t′⋅L gives t′−1t⋅L=L, that is t′−1t∈H, hence t′=t by [F3]; and it is surjective because every x∈G can be written x=th with t∈S, h∈H, giving x⋅L=t⋅L. By step 1.3 the translates Lt:=t⋅L, t∈S, are exactly the basis lines, and V=⨁t∈SLt, each u∈V having a unique expression u=∑t∈St⋅ut with ut∈L.

F3step 1.3algebra
3.1

Thus the matrix of x in the basis f1,…,fn has its only possibly nonzero entry in the column indexed by t at the row indexed by t′, where xt∈t′H, and that entry equals λ(h)≠0. The map t↦t′ is a permutation of T by [A1], so every row also receives exactly one nonzero entry, namely from the unique t with xt∈t′H. Hence the matrix is monomial with nonzero entries among the values of λ, which proves claim 1.

A1step 2.1step 2.2
3.2

Define Ψ:V→Ind⁡HGL by Ψ(v)(th):=h−1⋅ut for t∈S, h∈H, where v=∑t∈St⋅ut is the unique expression of step 2.3. This is well defined by [F3], it satisfies the covariance law Ψ(v)(gh′)=h′−1⋅Ψ(v)(g) for g=th, h′∈H, and so lies in Ind⁡HGL as in [F1]; the assignment Ψ is C-linear because the coordinates ut depend linearly on v.

F1F3step 2.3construct
4.1

For f∈Ind⁡HGL put Φ(f):=∑t∈St⋅f(t), an element of V by step 2.3, and Φ is C-linear. For v=∑t∈St⋅ut step 3.2 gives Ψ(v)(t)=ut, so Φ(Ψ(v))=v. Conversely, for f∈Ind⁡HGL and t∈S the definition of Φ gives Ψ(Φ(f))(t)=f(t), and both Ψ(Φ(f)) and f satisfy the covariance law [F1], so they agree on G; hence Ψ is surjective and Φ=Ψ−1.

F1step 3.2algebra
4.2

Ψ is G-equivariant. Let v=∑t∈St⋅ut and x∈G; for each t∈S write uniquely xt=t′h with t′∈S, h∈H, so that x⋅v=∑t(xt)⋅ut=∑tt′⋅(λ(h)ut) has Lt′-component λ(h)ut. By step 3.2, Ψ(v)(x−1t′)=Ψ(v)(th−1)=λ(h)ut, while the function x⋅Ψ(v) takes the value Ψ(v)(x−1t′) at t′ by [F1]; as t runs over S so does t′, so Ψ(x⋅v) and x⋅Ψ(v) agree on S and both satisfy the covariance law, hence they agree on G.

F1step 3.2algebra
5.1

Steps 4.1 and 4.2 exhibit Ψ:V→Ind⁡HGL=Ind⁡HGλ as a G-equivariant C-linear bijection, where λ is the linear character of step 1.2, so V is monomial in the sense of [F5]. Together with step 3.1 this proves both assertions.

F5step 1.2step 3.1step 4.1step 4.2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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