Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 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.

Kernel of an induced representation is the intersection of the conjugates of the kernel of the inducing representation

Statement

Let G be a finite group, let H≤G, and let W≠0 be a finite-dimensional complex representation of H with kernel ker⁡W={ h∈H:h⋅w=w for all w∈W }. Then the kernel of the induced representation Ind⁡HGW is

ker⁡(Ind⁡HGW)=⋂g∈Gg(ker⁡W)g−1⊆Core⁡G(H)=⋂g∈GgHg−1≤H.

In particular, if W=1H is the trivial representation, then ker⁡(Ind⁡HG1H)=Core⁡G(H), which is the kernel of the permutation action of G on the left cosets G/H. By The kernel of a complex character agrees with the kernel of any representation affording it the same formula computes the kernel ker⁡χ of the induced character χ=Ind⁡HGχW.

Facts & Assumptions

Given: A finite group G, a subgroup H≤G, a nonzero finite-dimensional complex H-representation W with kernel ker⁡W and character χW, a left transversal T for the left cosets G/H, and V=Ind⁡HGW.

[F1]

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

[F2]

Evaluation on T is a linear isomorphism ev⁡T:V→⨁t∈TW, f↦(f(t))t∈T; hence the tuples (f(t))t∈T run through all of ⨁t∈TW, independently in each coordinate. (A left transversal identifies Ind⁡HGW with a direct sum of [G:H] copies of W).

[F3]

ker⁡W is the kernel of the homomorphism H→GL⁡(W) defining W, hence a normal subgroup of H; and the kernel ker⁡χW of the character equals ker⁡W. (The kernel and image of a group homomorphism, The image of a group homomorphism is a subgroup and its kernel is a normal subgroup, The kernel of a complex character agrees with the kernel of any representation affording it, The kernel of a complex character).

[F4]

Left multiplication on G/H is a permutation action whose kernel is Core⁡G(H)=⋂g∈GgHg−1. (Left multiplication on G/H is transitive, has stabiliser H at H, and has kernel Core⁡G(H), The core Core⁡G(H)=⋂g∈GgHg−1 of a subgroup).

[F5]

Inducing the trivial representation 1H gives the permutation representation of G on G/H. (Inducing the trivial representation gives the permutation representation on G/H).

Proof

1.1

Conjugation by any x∈G permutes the set { g(ker⁡W)g−1:g∈G }, so N:=⋂g∈Gg(ker⁡W)g−1 satisfies xNx−1=N; hence N⊴G. Since ker⁡W≤H by [F3], each conjugate g(ker⁡W)g−1 lies in gHg−1, so N⊆⋂g∈GgHg−1=Core⁡G(H)≤H.

F3F4given
1.2

If t′=th with t∈T and h∈H, then t′(ker⁡W)t′−1=t(h(ker⁡W)h−1)t−1=t(ker⁡W)t−1 by normality of ker⁡W in H, so the conjugate depends only on the coset. As T meets every left coset exactly once, ⋂t∈Tt(ker⁡W)t−1=⋂g∈Gg(ker⁡W)g−1=N.

F3given
1.3

By [F2] the map ev⁡T is injective, so x∈G acts as the identity on V exactly when (x⋅f)(t)=f(t) for all f∈V and all t∈T. Fix t∈T and write x−1t=t∗k with t∗∈T and k∈H. Then f(x−1t)=f(t∗k)=k−1⋅f(t∗) by the covariance rule of [F1], so x acts as the identity exactly when k−1⋅f(t∗)=f(t) for every f∈V and every t∈T.

F1F2given
2.1

If t∗≠t for some t∈T, choose by [F2] an element f∈V with f(t∗)=w≠0 and f(t)=0; then k−1⋅w≠0=f(t), so the condition of step 1.3 fails. Hence an element x∈G acts as the identity on V only if x−1t∈tH for every t∈T, that is, t∗=t for every t∈T.

F2step 1.3
3.1

Suppose then that x−1t=tkt with kt∈H for every t∈T. By step 1.3 the element x acts as the identity if and only if kt−1⋅w=w for all w∈W, that is, if and only if kt∈ker⁡W for every t∈T; equivalently t−1x−1t∈ker⁡W for every t∈T, which says x∈t(ker⁡W)t−1 for every t∈T.

F3step 1.3step 2.1
4.1

Steps 2.1 and 3.1 together characterise the kernel: ker⁡(Ind⁡HGW)=⋂t∈Tt(ker⁡W)t−1=N, which by step 1.1 lies in Core⁡G(H)≤H.

step 1.1step 1.2step 3.1
5.1

For W=1H one has ker⁡W=H, so step 4.1 gives ker⁡(Ind⁡HG1H)=⋂g∈GgHg−1=Core⁡G(H), which by [F4] and [F5] is the kernel of the permutation action on G/H; and by [F3] the same formula computes the kernel of the induced character Ind⁡HGχW in general. ∎

F3F4F5step 4.1

Depends on

Used by

Dependency tree · two levels

28 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