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

Elementwise formula for the connecting map in module categories

Statement

Let R be a ring and let 0→A∙→iB∙→pC∙→0 be a short exact sequence of chain complexes of left R-modules. If [c]∈Hn(C) is represented by a cycle c∈Cn, choose a lift b∈Bn with pn(b)=c, and let a∈An−1 be the unique element satisfying in−1(a)=dnB(b). Then ∂n([c])=[a]∈Hn−1(A). This class is independent of the chosen lift b and of the chosen cycle representative c.

Facts & Assumptions

Given: A short exact sequence of chain complexes of left R-modules and a class [c]∈Hn(C).

[L1]

The connecting morphism in homology is the unique map induced from the preconnecting arrow on cycles (The connecting morphism in homology).

[L2]

A short exact sequence of complexes is exact in each degree (Short exact sequence of complexes).

[L3]

The category of left R-modules is abelian, so kernels, images, and cokernels are the usual module ones (Modules over a ring form an abelian category).

Proof

technique · direct
1.1L1L2L3givenconstruct

Because c is a cycle, pn−1(dnBb)=dnC(pnb)=dnC(c)=0. By [L2] and [L3], dnBb lies in the image of in−1, so there is a unique a∈An−1 with in−1(a)=dnBb. The definition in [L1] then gives ∂n([c])=[a].

2.1L2L3step 1.1algebra

If b′ is another lift of the same cycle c, then b−b′=in(u) for some u∈An by [L2] and [L3]. Hence in−1(a−a′)=dnB(b−b′)=dnB(in(u))=in−1(dnAu). Since in−1 is injective, a−a′=dnAu is a boundary, so [a]=[a′].

3.1L1L2L3step 1.1algebra∎

If c′=c+dn+1C(v) is another cycle representative of [c], choose a lift v′∈Bn+1 of v. Then b+dn+1B(v′) lifts c′, and its boundary differs from dnB(b) by dnBdn+1B(v′)=0. Equivalently, the corresponding element of An−1 differs from a by a boundary. So the class from step 1.1 depends only on [c].

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