Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

Zero cocycles in the Hom complex are chain maps

Statement

Let u=(un)n be a degree-0 element of Hom(C,D)0. Then u=0 if and only if u:CD is a chain map.

Facts & Assumptions

Given: A degree-0 graded morphism u=(un)n:CD.

[L1]

In degree 0, the Hom-complex differential is (u)n=dnDunun1dnC (The Hom complex of chain complexes).

[L2]

A chain map is a degreewise family satisfying dnDun=un1dnC for every n (Chain map).

Proof

technique · direct
1.1

By [L1], the equality u=0 means exactly that dnDunun1dnC=0 for every nZ.

L1givenalgebra
2.1

Rewriting the equality in step 1.1 gives dnDun=un1dnC for every n, and [L2] is precisely this condition. Thus u=0 if and only if u is a chain map.

L2step 1.1algebra

Depends on

Used by

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