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.
Two-out-of-three for a diagram of finite complexes
Example
Compare the cone sequences of and on : Take the vertical maps to be on the left, on the right, and the middle map that is multiplication by in degree and by in degree . The outer maps are obvious quasi-isomorphisms, so the middle one is too.
Facts & Assumptions
Given: The morphism of short exact sequences described in the example.
In a morphism of short exact sequences, any two quasi-isomorphisms force the third (Two-out-of-three for quasi-isomorphisms in a short exact sequence diagram).
Verification
The left and right vertical maps are isomorphisms of stalk complexes, hence quasi-isomorphisms. With the left map also equal to , the middle vertical map commutes with the canonical inclusion and the projection to , so it is a morphism of short exact sequences; it is a chain map because it changes the sign in degree exactly as needed to compare the differentials and .
Both cone complexes have homology in degree and elsewhere, so the middle vertical map induces an isomorphism on homology. This agrees with the prediction of [L1]: once the outer two maps are quasi-isomorphisms, the third must be as well.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Charles A. Weibel, Chapter 1 of An Introduction to Homological Algebra (standard reference, not scraped)