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.
A bounded below complex of injectives is homotopically injective
Statement
A bounded-below cochain complex of injective objects is K-injective. Assume dependent choice for the countable successive homotopy extensions, or supply those extensions as data.
Facts & Assumptions
Given: A bounded-below cochain complex of injective objects is K-injective. Assume dependent choice for the countable successive homotopy extensions, or supply those extensions as data.
An injective object extends maps from a subobject to the ambient object (Injective object).
K-injectivity is vanishing of Hom from every acyclic complex into every shift of the target (Homotopically injective bounded below complex).
DC supplies a sequence extending successive choices on a nonempty set (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Proof
Let be acyclic and a chain map. Choose with for and set equal to zero for . The equation holds below . In particular it is valid for zero complexes.
If the equation holds below , then vanishes on by the chain-map identity. Since is acyclic this image equals , so factors through . Injectivity of extends it to . This establishes the equation in degree .
Apply DC to the set of finite partial homotopies with the entire extension relation, or take the supplied successive extensions. The resulting homotopy makes zero in . Apply the same argument to every shift , which remains bounded below and termwise injective. This is the K-injective condition.