Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passaudited 2026-09-01
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.

The cone connecting map agrees with the shifted identity up to the declared sign

Statement

For the canonical short exact sequence 0→D∙→Cone⁡(f)∙→C[1]∙→0 of a chain map f:C∙→D∙ in a module category, the connecting morphism ∂n:Hn(C[1])→Hn−1(D) corresponds under the shift isomorphism Hn(C[1])→∼Hn−1(C) to the homology map Hn−1(f). In particular, when f=1C, the connecting morphism is the shifted identity up to the sign built into the shift convention.

Facts & Assumptions

Given: A chain map f:C∙→D∙ of module complexes and an integer n.

[L1]

The cone long exact sequence is obtained from the canonical short exact cone sequence (The cone long exact sequence).

[L2]

In module categories, the connecting map is computed by lifting a cycle and taking its boundary class (Elementwise formula for the connecting map in module categories).

[L3]

The shift isomorphism identifies Hn(C[1]) with Hn−1(C) using the sign convention fixed for shifts (Homology of a shift is shifted homology).

Proof

technique · direct
1.1L2L3givenalgebra

A class in Hn(C[1]) is represented by a cycle x∈Cn−1. In the canonical cone sequence, the element (0,x)∈Cone⁡(f)n lifts that class, and its boundary is (fn−1(x),0). By [L2], the connecting morphism sends [x] to [fn−1(x)]∈Hn−1(D).

2.1L1L3step 1.1algebra∎

Step 1.1 is exactly the formula for Hn−1(f) after identifying Hn(C[1]) with Hn−1(C) via [L3]. Hence the connecting map of the cone sequence agrees with Hn−1(f) under that shift identification. When f=1C, this becomes the shifted identity with precisely the sign encoded in [L3].

Depends on

Used by

Dependency tree · two levels

13 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