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

Induction is transitive along subgroup chains

Statement

Let K≤H≤G be subgroups of a finite group G, and let W be an R-linear K-module over a commutative ring R. Then

Ind⁡HG(Ind⁡KHW)≅Ind⁡KGW

as R-linear G-modules.

Facts & Assumptions

Given: A commutative ring R, a finite group G, subgroups K≤H≤G, and an R-linear K-module W.

[F1]

For a subgroup L≤M, the induced module Ind⁡LM is the space of functions f:M→W satisfying f(ml)=l−1⋅f(m), with the left action by translation (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F2]

The notation K≤H≤G means that K, H, and G are subgroup related in the stated order (Subgroup).

Proof

technique · constructive
1.1F1F2givenconstruct

For F∈Ind⁡HG(Ind⁡KHW), define Ψ(F)(g):=F(g)(e). If k∈K, then since k∈H as well by [F2], Ψ(F)(gk)=F(gk)(e)=(k−1⋅F(g))(e)=F(g)(k)=k−1⋅F(g)(e), so Ψ(F)∈Ind⁡KGW.

2.1F1step 1.1construct

For f∈Ind⁡KGW, define Φ(f)(g)(h):=f(gh) for g∈G and h∈H. If k∈K, then Φ(f)(g)(hk)=f(ghk)=k−1⋅f(gh), so Φ(f)(g)∈Ind⁡KHW; and if h0∈H, then Φ(f)(gh0)(h)=f(gh0h)=Φ(f)(g)(h0h), which is the covariance condition for Ind⁡HG(Ind⁡KHW). Thus Φ(f) lies in that induced module.

3.1step 2.1algebra

For f∈Ind⁡KGW, Ψ(Φ(f))(g)=Φ(f)(g)(e)=f(g), so Ψ∘Φ=id⁡.

3.2F1step 1.1step 2.1algebra

For F∈Ind⁡HG(Ind⁡KHW) and h∈H, one has Φ(Ψ(F))(g)(h)=Ψ(F)(gh)=F(gh)(e)=(h−1⋅F(g))(e)=F(g)(h), so Φ(Ψ(F))=F as functions G→Ind⁡KHW.

4.1step 3.1step 3.2discharge-construct∎

Steps 3.1 and 3.2 show that Φ and Ψ are inverse G-equivariant R-module isomorphisms. Therefore induction is transitive along K≤H≤G.

Depends on

Used by

Dependency tree · two levels

8 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