Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Finite-group induction is coinduction, hence biadjoint to restriction

Statement

Let H≤G be finite groups and let k be any field. For every left kH-module M the map ΦM: Ind⁡HGM=kG⊗kHM⟶Coind⁡HGM=Hom⁡kH(kG,M),ΦM(g⊗m)(x)={(xg)m,xg∈H,0,xg∉H, is a natural isomorphism of kG-modules (Restriction, induction, and coinduction). Consequently Ind⁡HG≅Coind⁡HG naturally, so induction is both a left and a right adjoint of restriction (Induction and coinduction are the two adjoints) and is exact. No hypothesis on the characteristic of k, on splitting fields, or on the prime 2 is needed, and the argument is choice-free: it uses only the finite selection of least representatives of the finitely many left cosets.

Facts & Assumptions

Given: Finite groups H≤G, a field k, a left kH-module M, and a set T⊆G containing exactly one representative of each left coset gH (a left transversal), chosen as the set of least elements for a fixed linear order of G.

[F1]

Ind⁡HGM=kG⊗kHM is the tensor product of the (kG,kH)-bimodule kG with M, with g⋅(x⊗m)=gx⊗m; the elements of G form a k-basis of kG, and the defining relations are xh⊗m=x⊗hm for h∈H. The coinduced module Coind⁡HGM=Hom⁡kH(kG,M) consists of the k-linear maps φ with φ(hx)=hφ(x) for all h∈H, x∈G, with (gφ)(x)=φ(xg) (Restriction, induction, and coinduction).

[F2]

Induction is left adjoint and coinduction is right adjoint to restriction (Induction and coinduction are the two adjoints).

[F3]

kG is free as a right kH-module on any left transversal, so kG⊗kH−, that is induction, preserves exactness; a supplied transversal is the only choice input (The group ring is free over a subgroup ring).

[F4]

Every element of G is uniquely th with t∈T, h∈H, and G is the disjoint union of the cosets gH, g∈G; H is a finite group and every product in kG is a finite sum.

Proof

technique · direct
1.1givenF1

ΦM is a well-defined kG-linear map. For fixed g,m the formula defines a function on G: if xg∈H then (xg)m∈M, otherwise 0. It is k-linear in x by definition, and it is kH-linear: for h∈H and x∈G, ΦM(g⊗m)(hx)=((hx)g)m if hxg∈H and 0 otherwise; since hxg=(hx)g and hxg∈H  ⟺  xg∈H (as h,h−1∈H), this equals h((xg)m)=hΦM(g⊗m)(x) in the first case and 0 in the second. Hence ΦM(g⊗m)∈Coind⁡HGM. The map is k-linear and in the second tensor variable balanced: for h∈H, the functions ΦM(gh⊗m) and ΦM(g⊗hm) both send x to ((xg)h)m=(xg)(hm) when xg∈H and to 0 otherwise; so ΦM is well defined on the tensor product. Finally it is kG-linear: ΦM(g0g⊗m)(x)=((xg0)g)m if xg0g∈H and 0 otherwise, and (g0ΦM(g⊗m))(x)=ΦM(g⊗m)(xg0)=((xg0)g)m if xg0g∈H and 0 otherwise, the two conditions being the same.

1.2givenF1F4

The inverse on coinduced maps. For φ∈Coind⁡HGM, define ΨM(φ)=∑t∈Tt⊗φ(t−1). This is a finite sum and a k-linear map. Inverting the left cosets tH shows that the right cosets Ht−1 partition G. If a representative is replaced by t′=th with h∈H, then t′⊗φ(t′−1)=th⊗φ(h−1t−1)=th⊗h−1φ(t−1)=t⊗φ(t−1), by kH-linearity and the balancing relation. Thus the inverse formula is independent of the finite transversal.

2.1step 1.1step 1.2F1F4

ΦMΨM=id. For x∈G, there is exactly one t0∈T for which x∈Ht0−1, equivalently xt0∈H. Write x=ht0−1. Then ΦM(ΨM(φ))(x)=∑t∈T, xt∈H(xt)φ(t−1)=hφ(t0−1)=φ(x), using the right-coset partition from step 1.2 and kH-linearity. Equality on the group basis gives equality on kG.

2.2step 1.1step 1.2F1F4

ΨMΦM=id. For g∈G and m∈M, write uniquely g=t0h with t0∈T and h∈H. Then ΨM(ΦM(g⊗m))=∑t∈T, t−1g∈Ht⊗(t−1g)m=t0⊗hm=g⊗m, by the left-coset partition and tensor balancing. Since such elementary tensors span the induced module, this proves the second inverse identity.

3.1step 2.1step 2.2F2F3∎

Naturality and consequences. If f:M→M′ is a kH-map, then for all g,m,x one has ΦM′(g⊗f(m))(x)=f(ΦM(g⊗m)(x)), because the formula is evaluated by multiplication in M or M′ and f is linear; hence Φ is a natural transformation, and by steps 2.1 and 2.2 each ΦM is an isomorphism with natural inverse ΨM. Therefore Ind⁡HG≅Coind⁡HG as functors, and [F2] yields that induction is both a left and a right adjoint of restriction: the left adjunction is its induction adjunction, and the right adjunction is transported across this natural isomorphism from the coinduction adjunction. Induction kG⊗kH− is right exact, and coinduction Hom⁡kH(kG,−) is left exact; a natural isomorphism between the two functors therefore makes induction exact, in agreement with the freeness of kG over kH recorded in [F3]. No hypothesis on k, on characteristic, or on splitting is used, and the only selection made is the finite transversal T of least representatives.

Remarks

  • Freyd's adjoint functor heuristics. The isomorphism is the finite-group relative Frobenius map; it is the reason the modular branching page can use the biadjunction of restriction, and the two adjunctions are not identified by hand: the right adjunction is obtained by transporting the coinduction adjunction along Φ.
  • Finiteness of G/H is what is used. The argument needs the finiteness of T in step 1.2 and the total vanishing of all but one term in steps 2.1 and 2.2; for infinite G/H these fail in general. The finite transversal is selected by least elements, so no choice principle enters.

Depends on

Used by

Nothing in the library uses this result yet.

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