Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Corestriction after transfer multiplies by the index

Statement

Let H≤G have finite index and M be a left G-module. For every n≥0, the composite Hn(G;M)→Tr⁡Hn(H;M)→i∗Hn(G;M) is multiplication by [G:H]. Here corestriction means the covariant inclusion map in homology; the derived identification retains DC and supplied resolutions.

Facts & Assumptions

Given: The finite-index inclusion, coefficient module, and a finite transversal T.

[F1]

The transfer formula is well-defined on normalized diagonal coinvariants, is a chain map, and induces a transversal-independent homology map (Bar transfer is a chain map independent of the transversal).

[F2]

For right-coset representatives T, write x=r(x)t(x) with r(x)∈H; transfer is the finite sum obtained by applying r to the vertices of (tg0,…,tgn) and using coefficient tm (Finite-index transfer on normalized bar chains).

Proof

1.1F1F2givenalgebra

Put u(x)=x. For each t∈T define the alternating vertex prism Pt,n[(g0,…,gn)⊗m]=∑i=0n(−1)i[(r(tg0),…,r(tgi),tgi,…,tgn)⊗tm]. Expanding the vertex-deletion differential cancels every face away from the switch in pairs; the two endpoint faces that survive give dPt+Ptd=ut,∗−rt,∗, where ut,∗ uses (tg0,…,tgn) and rt,∗ is the t-summand of corestriction after the transfer in [F2]. If tx=httx with ht∈H and tx∈T, then t↦tx permutes T, r(txg)=htr(txg), and both vertex strings and the coefficient txm=httxm change by the same diagonal translation. Hence P=∑t∈TPt descends to G-coinvariants. Equal adjacent input vertices make every prism summand degenerate, so it also descends to normalized chains. Thus dP+Pd=∑t∈Tut,∗−i∗Tr⁡T.

2.1step 1.1algebra∎

Each translated summand is [(g0,…,gn)⊗m] in diagonal G-coinvariants. The sum is therefore [G:H] times that chain in every degree, including zero. Homotopic chain maps give the same map on homology because their difference on a cycle is a boundary. Thus i∗Tr⁡=[G:H]id⁡.

Depends on

Used by

Dependency tree · two levels

4 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