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 be finite groups and let be any field. For every left -module the map is a natural isomorphism of -modules (Restriction, induction, and coinduction). Consequently 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 , on splitting fields, or on the prime 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 , a field , a left -module , and a set containing exactly one representative of each left coset (a left transversal), chosen as the set of least elements for a fixed linear order of .
is the tensor product of the -bimodule with , with ; the elements of form a -basis of , and the defining relations are for . The coinduced module consists of the -linear maps with for all , , with (Restriction, induction, and coinduction).
Induction is left adjoint and coinduction is right adjoint to restriction (Induction and coinduction are the two adjoints).
is free as a right -module on any left transversal, so , that is induction, preserves exactness; a supplied transversal is the only choice input (The group ring is free over a subgroup ring).
Every element of is uniquely with , , and is the disjoint union of the cosets , ; is a finite group and every product in is a finite sum.
Proof
is a well-defined -linear map. For fixed the formula defines a function on : if then , otherwise . It is -linear in by definition, and it is -linear: for and , if and otherwise; since and (as ), this equals in the first case and in the second. Hence . The map is -linear and in the second tensor variable balanced: for , the functions and both send to when and to otherwise; so is well defined on the tensor product. Finally it is -linear: if and otherwise, and if and otherwise, the two conditions being the same.
The inverse on coinduced maps. For , define . This is a finite sum and a -linear map. Inverting the left cosets shows that the right cosets partition . If a representative is replaced by with , then , by -linearity and the balancing relation. Thus the inverse formula is independent of the finite transversal.
. For , there is exactly one for which , equivalently . Write . Then , using the right-coset partition from step 1.2 and -linearity. Equality on the group basis gives equality on .
. For and , write uniquely with and . Then , by the left-coset partition and tensor balancing. Since such elementary tensors span the induced module, this proves the second inverse identity.
Naturality and consequences. If is a -map, then for all one has , because the formula is evaluated by multiplication in or and is linear; hence is a natural transformation, and by steps 2.1 and 2.2 each is an isomorphism with natural inverse . Therefore 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 is right exact, and coinduction is left exact; a natural isomorphism between the two functors therefore makes induction exact, in agreement with the freeness of over recorded in [F3]. No hypothesis on , on characteristic, or on splitting is used, and the only selection made is the finite transversal 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 is what is used. The argument needs the finiteness of in step 1.2 and the total vanishing of all but one term in steps 2.1 and 2.2; for infinite 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
- Charles A. Weibel, An Introduction to Homological Algebra, §6.3 (induced and coinduced modules, the relative Frobenius isomorphism for finite-index subgroups), printed pp. 164-166 (standard reference, not scraped)
- Peter Webb, A Course in the Theory of Groups, or equivalently Webb's finite group representation notes, Chapter 7 (the natural isomorphism Ind_H^G M = kG tensor_{kH} M -> Hom_{kH}(kG,M) for finite G) (standard reference, not scraped)