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.
Morphisms from a homotopically projective complex need no roof
Statement
For a K-projective complex and any complex , is bijective, under the standing localization size convention.
Facts & Assumptions
Given: For a K-projective complex and any complex , is bijective, under the standing localization size convention.
K-projectivity annihilates Hom into all acyclic shifts (Homotopically projective bounded above complex).
The cone of a quasi-isomorphism is acyclic (A chain map is a quasi-isomorphism exactly when its cone is acyclic).
Both representable Hom sequences of a distinguished triangle are exact (Long exact Hom sequences of a distinguished triangle).
In the derived localization every morphism is represented by a roof, and for parallel ordinary arrows , equality holds exactly when after precomposition by some quasi-isomorphism (Derived category of an abelian category, The calculus of fractions constructs the localization).
Proof
For a quasi-isomorphism its cone is acyclic. The exact sequence has zero outer terms. Thus postcomposition by is bijective, including when or either Hom group is zero.
Represent an arrow from by . The previous bijection supplies a unique in with , so the roof equals . If for , equality detection gives a quasi-isomorphism with ; take with to get . This proves surjectivity and injectivity.
Depends on
Used by
Dependency tree · two levels
19 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
- 13.19.3–13.19.8; W 10.4.8 for the equivalence (standard reference, not scraped)