TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30

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.

Inducing the trivial representation gives the permutation representation on $G / H$

Statement

Let $G$ be a finite group and let $H \leq G$ . Inducing the trivial complex representation of $H$ to $G$ gives the permutation representation of $G$ on the left coset set $G / H$ .

Facts & Assumptions

Given: A finite group $G$ , a subgroup $H \leq G$ , and the trivial complex representation $1_{H}$ of $H$ .

[F1]

The induced module consists of the functions $f : G \to C$ satisfying $f (g h) = h^{- 1} \cdot f (g)$ , with $G$ acting by $(x \cdot f) (g) = f (x^{- 1} g)$ (The induced $R$ -linear $G$ -module ${Ind}_{H}^{G} W$ as $H$ -covariant functions on $G$ ).

[F2]

The left cosets of $H$ are the subsets $g H$ , and the permutation representation on a finite $G$ -set has basis vectors indexed by that set (Left and right cosets $g H$ and $H g$ of a subgroup, The trivial representation, the regular representation, and permutation representations from finite $G$ -sets).

Proof

technique · direct

1.1F1given

In the trivial representation of $H$ , every $h \in H$ acts as the identity on $C$ . So the covariance condition of [F1] becomes $f (g h) = f (g)$ for all $g \in G$ and $h \in H$ . Therefore $f$ is constant on each left coset $g H$ .

2.1F2step 1.1construct

Define $Φ : {Ind}_{H}^{G} 1_{H} ⟶ C^{(G / H)}$ by $Φ (f) (g H) : = f (g)$ . Step 1.1 makes this well defined, and every function on $G / H$ pulls back uniquely to an $H$ -covariant function on $G$ , so $Φ$ is a linear bijection.

3.1F1F2step 2.1algebra

For $x \in G$ , one has $Φ (x \cdot f) (g H) = (x \cdot f) (g) = f (x^{- 1} g) = Φ (f) (x^{- 1} g H)$ , which is exactly the left permutation action of $G$ on the coset set $G / H$ from [F2]. Hence $Φ$ is $G$ -equivariant.

4.1step 2.1step 3.1∎

The bijection of step 2.1 and the equivariance of step 3.1 identify ${Ind}_{H}^{G} 1_{H}$ with the permutation representation of $G$ on $G / H$ .

Depends on

Used by

Dependency tree · two levels

12 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

Peter Webb, A Course in Finite Group Representation Theory, Example 4.3.4 (standard reference, not scraped)
Pavel Etingof et al., Introduction to Representation Theory, Section 4.8 (standard reference, not scraped)

Inducing the trivial representation gives the permutation representation on G/HG/H