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.
One-step extension of a partial projective resolution
Statement
Let be an augmented chain complex that is exact at every displayed term except possibly at . Let be the kernel of the previous displayed map, so and for .
If is an epimorphism from a projective object , then composing with the kernel inclusion extends the complex by one term and makes it exact at .
Facts & Assumptions
Given: The displayed partial augmented complex and a chosen epimorphism with projective.
Exactness at a degree means that the image of the incoming differential is the kernel subobject of the outgoing differential (Exactness of a complex at a degree and acyclic complexes).
An augmented chain complex records the extra map to the resolved object (Augmented chain complexes over an object).
Projective objects are the allowable terms in a projective resolution (Projective object).
Proof
Let be the kernel inclusion, and define the new differential by Because lands in the kernel of the previous displayed map, the composite of the new differential with that previous map is zero, so the extended row is again an augmented chain complex in the sense of [L2].
The image of is the image of , which is exactly because is epic. By [L1], this is precisely the exactness condition at . The new term is projective by the given hypothesis and [L3].
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
- Charles A. Weibel, An Introduction to Homological Algebra (standard reference, not scraped)
- Romyar Sharifi, Homological Algebra (standard reference, not scraped)