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.
Restriction of injective group modules is injective
Statement
For , induction preserves monomorphisms, and restriction sends injective -modules to injective -modules. A supplied injective resolution over therefore restricts to an injective resolution over . These assertions require no axiom of choice and no selection of all coset representatives.
Facts & Assumptions
Given: A subgroup .
Induction is tensoring with the right -module ; restriction leaves underlying abelian groups unchanged (Restriction, induction, and coinduction).
The induction–restriction adjunction sends to (Induction and coinduction are the two adjoints).
Injectivity is the extension property for monomorphisms (Injective object).
Proof
For a finite set of right cosets , let be the subgroup of supported on their union. It is a right -submodule and a direct summand, by projection on those cosets. Choose representatives for these finitely many nonempty cosets. They identify with a finite direct sum of copies of . Thus for a monomorphism , the map is a finite direct sum of that monomorphism, hence is injective. For both tensors are zero. Finite choice is a theorem of ZF.
An element of is a finite sum of tensors and hence comes from some . If its image in is zero, projecting the latter tensor to shows that its representing element has zero image there. Step 1.1 makes it zero already in . This proves induction preserves monomorphisms, without choosing representatives for any infinite family of cosets.
Given an -map and an -monomorphism , transpose by F2 to a -map . Extend over the monomorphism by F3, and transpose back. Naturality of the adjunction ensures the resulting extends the given map. Hence restriction preserves injectives. Restriction preserves exactness because it changes no groups or maps, so the resolution assertion follows degree by degree. Zero modules and or are included.
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
- Weibel, Sections 6.3 and 6.8; finite-support choice-free induction argument supplied here (standard reference, not scraped)