Alphabeta Math
TheoremStatement: 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.

A chain map is a quasi-isomorphism exactly when its cone is acyclic

Statement

Let f:CD be a chain map in an abelian category. Then f is a quasi-isomorphism if and only if Cone(f) is acyclic.

Facts & Assumptions

Given: A chain map f:CD and an integer n.

[L1]

A quasi-isomorphism is a chain map inducing isomorphisms Hn(f):Hn(C)Hn(D) for all n (Quasi-isomorphism).

[L2]

The cone differential is dnCone(f)(y,x)=(dnD(y)+fn1(x),dn1C(x)) (The mapping cone of a chain map).

[L3]

Acyclic means vanishing homology in every degree (Exactness of a complex at a degree and acyclic complexes).

[L4]

Every chain map induces a well-defined map on homology (A chain map induces a well-defined map on homology).

Proof

technique · direct
1.1

Assume Cone(f) is acyclic. If [x]Hn1(C) satisfies Hn1(f)([x])=0, choose yDn with dnD(y)=fn1(x). Then (y,x) is an n-cycle of the cone by [L2], so [L3] gives (y,x)=dn+1Cone(f)(z,w) for some (z,w). Hence x=dnC(w), so Hn1(f) is injective. Likewise, if yZn(D), then (y,0) is an n-cycle of the cone, so acyclicity gives (y,0)=dn+1Cone(f)(z,w). Thus y=dn+1D(z)+fn(w), and Hn(f) is surjective.

L2L3L4givenalgebra
2.1

Conversely, assume f is a quasi-isomorphism. Let (y,x) be an n-cycle of Cone(f). Then xZn1(C) and fn1(x)=dnD(y) is a boundary in D, so [L1] gives x=dnC(w) for some wCn. Then y+fn(w) is an n-cycle in D, so [L1] again gives zZn(C) and vDn+1 with y+fn(w)=fn(z)+dn+1D(v). Therefore (y,x)=dn+1Cone(f)(v,zw), so every cone cycle is a boundary. By [L3], Cone(f) is acyclic, and together with [L1] this proves the equivalence.

L1L2L3givenalgebra

Depends on

Used by

Dependency tree · two levels

14 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