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.
Homotopically projective bounded above complex
Definition
For cochain complexes put , with . This is the reindexing of The Hom complex of chain complexes. A complex is homotopically projective, or K-projective, if for every acyclic complex and every integer . Equivalently is acyclic: the degree-zero Hom/homotopy identification of Hom in the homotopy category is zero-degree homology of the Hom complex, applied after shifting , identifies these groups with its cohomology (a boundary differs only by the invertible sign ).
The bounded-above case additionally requires for all sufficiently large , as in Bounded, bounded below, and bounded above complexes. Boundedness is not part of the general K-projective predicate. Nor is termwise projectivity: a contractible complex has zero Hom from it in and is K-projective irrespective of its terms.
Depends on
Used by
- cex-an-unbounded-complex-of-projectives-that-is-not-k-projective.md Counterexample
- Homotopically injective bounded below complex Definition
- fs-every-complex-of-projectives-is-homotopically-projective.md False statement
- Morphisms from a homotopically projective complex need no roof Proposition
- A bounded above complex of projectives is homotopically projective Theorem
Dependency tree · two levels
11 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
- 6.5.1 and 13.1 (K-injective definition); cochain convention (standard reference, not scraped)