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.
The free-presentation homology five-term sequence
Statement
For a free presentation there is a natural exact sequence The last two nonzero arrows are induced by inclusion and quotient; d2 is the filtration transgression defined by . Retain DC and supplied-resolution homology conventions.
Facts & Assumptions
Given: The free presentation and the stated homology conventions.
Total H2 vanishes and the low-degree total and E2 terms have the stated group interpretations (Free-presentation total homology and its degree-one edges).
H2(T) to E20 to E01 to H1(T) to E10 to zero is naturally exact (The low-degree filtration sequence of a first-quadrant bicomplex).
The free-presentation bicomplex has anticommuting component differentials and with the stated total complex and edge maps (The free-presentation Lyndon bar bicomplex).
Proof
Apply F2 to the first-quadrant free-presentation bicomplex. Substitute , , , and from F1. This identifies the groups in the displayed sequence and supplies exactness at the last three nonzero terms; the next two steps define the first arrow by the printed representative formula and prove the two adjacent exactness claims directly.
In the bicomplex of [F3], represent a class in by with for some , and define . This is a vertical cycle because . Replacing by another lift changes by the horizontal boundary of a vertical cycle. Replacing by , with and , permits the compatible replacement and leaves unchanged. Thus the displayed formula is well-defined.
This is injective here. If in , write for a vertical cycle and . Then is a total 2-cycle mapping to . Since by [F1], its class and hence vanish. Moreover the edge map sends a vertical cycle to the total cycle . The equation follows from . Conversely, if , write with , , and . Its components give and , hence . This proves exactness at the first two nonzero terms for the stated representative formula; [F2] supplies exactness at the remaining terms.
The edge computations in F1 identify the next arrows with r mapped into and f mapped to its quotient class. All constructions in steps 1.2–2.1 commute with the vertexwise maps induced by maps of presentations, so the sequence and the displayed transgression are natural. No terminal surjectivity beyond the printed is needed. For R=1 the sequence reduces to zero H2 of F and the identity of its abelianization; for G=1 it reduces to the identity .
Depends on
Used by
Dependency tree · two levels
9 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)