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.
Diagonal bar coinvariants compute group homology
Statement
Assume DC and the supplied projective-resolution convention for derived group homology. For every left -module , is naturally the homology of , with diagonal left action and alternating vertex-deletion differential. Equivalently it is computed by , where .
Facts & Assumptions
Given: DC, a group G, a left module M, and supplied left projective resolution P of M.
The derived convention computes homology of (Group homology as a derived functor).
The homogeneous bar complex is an augmented free resolution (The bar complex is a free resolution of the trivial module).
Normalization is a chain-homotopy equivalence (Normalized and unnormalized bars are homotopy equivalent).
Projectivity lifts the identity through any epimorphism onto the object (Projective object).
DC is the axiom retained in the supplied derived-resolution convention (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Proof
Turning a left module into a right module by preserves exactness and takes the regular free left module to a free right module (send the basis coordinate g to ). Thus the normalized bar complex is a free right resolution: normalization preserves exactness, and its nondegenerate orbits supply a free basis.
Put and with differential and . Then . Tensor with , a free right module, preserves exactness: each finite-support cycle has a primitive by lifting only its finitely many nonzero coordinates. Each projective is a retract of the free module on its underlying set: lift its identity through the canonical surjection. Tensor with is therefore a retract of tensor with a free left module and preserves exact sequences of right modules. The augmented columns of D are exact with bottom , and augmented rows are exact with left edge .
The map sending to its diagonal orbit class is well-defined: and are in the same orbit. Conversely in the balanced tensor product since . The same formula therefore defines an inverse, and both composites fix every pure tensor. Each vertex deletion commutes with these formulas, including the first and last deletions, giving a chain isomorphism.
Here is the finite comparison argument for either augmentation. For exact augmented columns, place the augmentation in vertical degree -1. In the resulting augmented total complex, a total n-cycle has finitely many components, with . At its largest remaining p, the cycle equation says , because the component from p+1 is zero. Exactness supplies with . Subtract ; the p-component vanishes and the only new component is at p-1. Repeat down to p=0, where h is zero. The cycle has become zero after finitely many boundary subtractions. Thus the augmented total complex is acyclic. The same proof with p and q interchanged works for exact augmented rows, using the largest remaining q. Signs of the primitive are absorbed into w.
The augmented total complex is the cone of the total-to-edge augmentation up to a shift and sign. Acyclicity implies that augmentation induces a homology isomorphism: a cycle on the edge lifts to a total cycle because the corresponding cone cycle bounds; if a total cycle maps to an edge boundary, pairing it with that boundary primitive makes a cone cycle, whose being a boundary says the original cycle bounds. Hence . DC is the inherited resolution-comparison assumption; the finite elimination in step 3.1 adds no arbitrary family of choices.
The augmentations and tensor formulas commute with coefficient maps and with the bar maps induced by group homomorphisms. Maps between supplied resolutions give the same maps on homology by the supplied-resolution convention. Since inverses of isomorphisms are unique, the composite identification is natural. Degree zero gives the usual coinvariants; for all complexes are zero, and for normalized bars vanish in positive degrees.
Depends on
Used by
Dependency tree · two levels
21 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
- Loh, Group Cohomology, Definitions 1.7.12–13 and Theorem 1.7.15 pp.63–64; Theorem 3.2.18 pp.129–132 (standard reference, not scraped)
- Weibel, An Introduction to Homological Algebra, Chapter 6, Sections 6.4–6.8 (standard reference, not scraped)