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.
FALSE: a degreewise split short exact sequence of complexes has zero connecting map
Statement
Every degreewise split short exact sequence of complexes has zero connecting map.
Facts & Assumptions
Given: The degreewise split cone sequence of the identity map on .
The statement refuted is: every degreewise split short exact sequence of complexes has zero connecting map.
Every canonical cone sequence is degreewise split short exact (The canonical mapping-cone sequence is degreewise split short exact).
For the identity map, the connecting morphism of the canonical cone sequence is the shifted identity up to sign (The cone connecting map agrees with the shifted identity up to the declared sign).
Refutation
By [L1], the cone sequence of is degreewise split short exact.
The stalk complex has in degree and elsewhere, so . Likewise . Under these identifications, [L2] says the connecting morphism is on , hence nonzero.
This gives a degreewise split short exact sequence whose connecting morphism is nonzero, contradicting [A1]. Therefore not every degreewise split short exact sequence has zero connecting map.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Charles A. Weibel, Chapter 1 of An Introduction to Homological Algebra (standard reference, not scraped)