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.
Direct sum total complex of a double complex
Definition
Let be a homological double complex in an abelian category. Suppose that for every integer the diagonal coproduct below exists, and write its injections as : Define to be the unique arrow with Each right-hand side is the sum of two morphisms with the same source and target. The coproduct universal property supplies a unique from this family; no infinite sum in a morphism group is required.
The resulting direct-sum total complex has differential of degree . Its chain condition is established in The total differential squares to zero ↗. A diagonal with only zero objects has zero coproduct: every family of maps from its objects is the unique zero family. A diagonal with exactly one nonzero object has that object as coproduct. For general infinite diagonals existence is a hypothesis, not an implication of being an abelian category. No choices of elements or representatives enter this construction.
Depends on
Used by
- Sum and product totalisations can differ on infinite diagonals Counterexample
- Sum and product totalisations on an infinite diagonal Counterexample
- Row and column filtrations of a first quadrant double complex Definition
- Acyclic assembly with exact columns Example
- Direct sum and product totalisations are always isomorphic False statement
- The total differential squares to zero Lemma
- Sum and product totalisations agree on finite diagonal double complexes Proposition
Dependency tree · two levels
5 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
- Stacks Project, Definition 12.18.3 (anticommuting convention) (standard reference, not scraped)