Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-13
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 H≤G, induction Z[G]⊗Z[H]− preserves monomorphisms, and restriction sends injective G-modules to injective H-modules. A supplied injective resolution over G therefore restricts to an injective resolution over H. These assertions require no axiom of choice and no selection of all coset representatives.

Facts & Assumptions

Given: A subgroup H≤G.

[F1]

Induction is tensoring with the right Z[H]-module Z[G]; restriction leaves underlying abelian groups unchanged (Restriction, induction, and coinduction).

[F2]

The induction–restriction adjunction sends f:A→I to g⊗a↦gf(a) (Induction and coinduction are the two adjoints).

[F3]

Injectivity is the extension property for monomorphisms (Injective object).

Proof

1.1F1

For a finite set S of right cosets gH, let PS be the subgroup of Z[G] supported on their union. It is a right Z[H]-submodule and a direct summand, by projection on those cosets. Choose representatives for these finitely many nonempty cosets. They identify PS with a finite direct sum of copies of Z[H]. Thus for a monomorphism A↪B, the map PS⊗A→PS⊗B is a finite direct sum of that monomorphism, hence is injective. For S=∅ both tensors are zero. Finite choice is a theorem of ZF.

2.1F1step 1.1

An element of Z[G]⊗A is a finite sum of tensors and hence comes from some PS⊗A. If its image in Z[G]⊗B is zero, projecting the latter tensor to PS⊗B shows that its representing element has zero image there. Step 1.1 makes it zero already in PS⊗A. This proves induction preserves monomorphisms, without choosing representatives for any infinite family of cosets.

3.1F1F2F3step 2.1∎

Given an H-map A→Res⁡I and an H-monomorphism A↪B, transpose by F2 to a G-map Ind⁡A→I. Extend over the monomorphism Ind⁡A↪Ind⁡B by F3, and transpose back. Naturality of the adjunction ensures the resulting B→Res⁡I 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 H=G or H=1 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