Alphabeta Math
Pipeline-generated
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.

31 results · all verified · 14 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Long Exact Sequences in Homology

1 · Prerequisites

2 · Summary

This page builds the homology connecting morphism from the lift-boundary recipe attached to a short exact sequence of complexes and shows how that construction fits the categorical snake-diagram route already published elsewhere in the library.

Once the connecting map is in place, the exactness and naturality of the long exact sequence become the organizing mechanism for cone criteria, relative homology, chain-splitting consequences, and the concrete homological δ-functor carried by homology.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A morphism of short exact sequences of complexes

Definition

A morphism of short exact sequences of complexes is a commutative ladder 0ABC00ABC0 in which each row is a short exact sequence of complexes and each vertical map is a chain map.

Equivalently, it is a triple of chain maps a:AA, b:BB, and c:CC for which the obvious squares with the inclusion and projection maps commute in every degree.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The cycle-boundary diagram associated to a short exact sequence of complexes

Statement

Let 0AiBpC0 be a short exact sequence of complexes in an abelian category, and fix nZ. Write An:=An/Bn(A),Bn:=Bn/Bn(B),Cn:=Cn/Bn(C). Then the differentials induce a commutative diagram AnBnCn00Zn1(A)Zn1(B)Zn1(C) in which the top row is exact at Bn and Cn, and the bottom row is exact at Zn1(A) and Zn1(B).

Facts & Assumptions

Given: The short exact sequence of complexes in the statement and an integer n.

[L1]

A short exact sequence of complexes is exact in each degree in the ambient abelian category (Short exact sequence of complexes).

[L2]

Cycles are kernels of outgoing differentials and boundaries are images of incoming differentials (Cycle and boundary subobjects of a complex).

[L3]

For a morphism of short exact sequences, the induced kernel row is exact at its first two nodes and the induced cokernel row is exact at its last two nodes (The kernel row and cokernel row of a morphism of short exact sequences are exact at two nodes each).

Proof

technique · direct
1.1

Apply [L3] to the commutative square in degree n+1. Using [L2], its cokernel row is exactly AnBnCn0, so the top row is exact at Bn and Cn.

L1L2L3givenconstruct
2.1

Apply [L3] to the commutative square in degree n1. By [L2], the resulting kernel row is 0Zn1(A)Zn1(B)Zn1(C), exact at Zn1(A) and Zn1(B). The two rows are connected by the differentials, and the chain-map equalities from [L1] make the diagram commutative.

L1L2L3step 1.1construct
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The preconnecting arrow on cycles

Definition

Let 0AiBpC0 be a short exact sequence of complexes in an abelian category, and fix nZ. Apply Snake lemma under the weaker Stacks hypotheses to the quotient-kernel diagram of The cycle-boundary diagram associated to a short exact sequence of complexes. The kernel of its right vertical map is canonically Hn(C)=Zn(C)/Bn(C), and the cokernel of its left vertical map is canonically Hn1(A)=Zn1(A)/Bn1(A). Thus the snake construction supplies a canonical morphism δnsnake:Hn(C)Hn1(A).

Let qn:Zn(C)Hn(C) be the homology quotient from Homology object of a chain complex. The preconnecting arrow on cycles is the categorical composite ~n:=δnsnakeqn:Zn(C)Hn1(A).

In a module category, applying this morphism to an element gives the usual lift-and-boundary recipe. The definition above uses only kernels, cokernels, and the canonical snake morphism, so it is valid in every abelian category.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The preconnecting arrow annihilates boundaries

Statement

For a short exact sequence of complexes, the composite Bn(C)Zn(C)~nHn1(A) is zero.

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes and an integer n.

[L1]

The preconnecting arrow is ~n=δnsnakeqn, where qn:Zn(C)Hn(C) is the homology quotient (The preconnecting arrow on cycles).

[L2]

The homology quotient qn is the cokernel of the canonical boundary-to-cycle map βn:Bn(C)Zn(C) (Homology object of a chain complex).

Proof

technique · direct
1.1

Because qn is the cokernel of βn, one has qnβn=0.

L2given
2.1

Using [L1], ~nβn=δnsnakeqnβn=0. Thus the composite from the boundary subobject to Hn1(A) is the zero morphism.

L1step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The connecting morphism in homology

Definition

Fix a short exact sequence of complexes in an abelian category,

0ABC0,

and an integer n. Let qn:Zn(C)Hn(C) be the homology quotient of Homology object of a chain complex. By The preconnecting arrow annihilates boundaries, the preconnecting arrow ~n:Zn(C)Hn1(A) kills the boundary subobject Bn(C). Therefore the cokernel property of qn gives a unique morphism n:Hn(C)Hn1(A) such that nqn=~n.

This morphism is the connecting morphism in homology attached to the short exact sequence of complexes.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Elementwise formula for the connecting map in module categories

Statement

Let R be a ring and let 0AiBpC0 be a short exact sequence of chain complexes of left R-modules. If [c]Hn(C) is represented by a cycle cCn, choose a lift bBn with pn(b)=c, and let aAn1 be the unique element satisfying in1(a)=dnB(b). Then n([c])=[a]Hn1(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.1

Because c is a cycle, pn1(dnBb)=dnC(pnb)=dnC(c)=0. By [L2] and [L3], dnBb lies in the image of in1, so there is a unique aAn1 with in1(a)=dnBb. The definition in [L1] then gives n([c])=[a].

L1L2L3givenconstruct
2.1

If b is another lift of the same cycle c, then bb=in(u) for some uAn by [L2] and [L3]. Hence in1(aa)=dnB(bb)=dnB(in(u))=in1(dnAu). Since in1 is injective, aa=dnAu is a boundary, so [a]=[a].

L2L3step 1.1algebra
3.1

If c=c+dn+1C(v) is another cycle representative of [c], choose a lift vBn+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 An1 differs from a by a boundary. So the class from step 1.1 depends only on [c].

L1L2L3step 1.1algebra
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Exactness at the homology of the left complex

Statement

For a short exact sequence of complexes 0ABC0, one has im(n+1:Hn+1(C)Hn(A))=ker(Hn(A)Hn(B)).

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes and an integer n.

[L1]

Applying the weaker snake lemma to the quotient-kernel diagram in degree n+1 gives an exact segment Hn+1(C)n+1Hn(A)Hn(B) under the canonical kernel and cokernel identifications (The cycle-boundary diagram associated to a short exact sequence of complexes, Snake lemma under the weaker Stacks hypotheses, The connecting morphism in homology).

Proof

technique · direct
1.1

The three maps in [L1] are exactly the maps appearing in the statement.

L1given
2.1

Exactness of that categorical segment gives im(n+1)=ker(Hn(A)Hn(B)), which is the desired equality.

L1step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Exactness at the homology of the middle complex

Statement

For a short exact sequence of complexes 0ABC0, one has im(Hn(A)Hn(B))=ker(Hn(B)Hn(C)).

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes and an integer n.

[L1]

Applying the weaker snake lemma to the quotient-kernel diagram in degree n gives an exact segment Hn(A)Hn(B)Hn(C) under the canonical kernel identifications (The cycle-boundary diagram associated to a short exact sequence of complexes, Snake lemma under the weaker Stacks hypotheses).

Proof

technique · direct
1.1

The three maps in [L1] are exactly the maps appearing in the statement.

L1given
2.1

Exactness of that categorical segment gives im(Hn(A)Hn(B))=ker(Hn(B)Hn(C)), as required.

L1step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Exactness at the homology of the right complex

Statement

For a short exact sequence of complexes 0ABC0, one has im(Hn(B)Hn(C))=ker(n:Hn(C)Hn1(A)).

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes and an integer n.

[L1]

Applying the weaker snake lemma to the quotient-kernel diagram in degree n gives an exact segment Hn(B)Hn(C)nHn1(A) under the canonical kernel and cokernel identifications (The cycle-boundary diagram associated to a short exact sequence of complexes, Snake lemma under the weaker Stacks hypotheses, The connecting morphism in homology).

Proof

technique · direct
1.1

The three maps in [L1] are exactly the maps appearing in the statement.

L1given
2.1

Exactness of that categorical segment gives im(Hn(B)Hn(C))=ker(n), as required.

L1step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Exactness at the target of the connecting map

Statement

For a short exact sequence of complexes 0ABC0, one has im(n:Hn(C)Hn1(A))=ker(Hn1(A)Hn1(B)).

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes and an integer n.

[L1]

Applying the weaker snake lemma to the quotient-kernel diagram in degree n gives an exact segment Hn(C)nHn1(A)Hn1(B) under the canonical kernel and cokernel identifications (The cycle-boundary diagram associated to a short exact sequence of complexes, Snake lemma under the weaker Stacks hypotheses, The connecting morphism in homology).

Proof

technique · direct
1.1

The three maps in [L1] are exactly the maps appearing in the statement.

L1given
2.1

Exactness of that categorical segment gives im(n)=ker(Hn1(A)Hn1(B)), as required.

L1step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The long exact sequence in homology

Statement

Let 0ABC0 be a short exact sequence of complexes in an abelian category. Then there is an exact sequence Hn(A)Hn(B)Hn(C)nHn1(A)Hn1(B)Hn1(C).

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes.

[L1]

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

The maps Hn(A)Hn(B) and Hn(B)Hn(C) are defined by [L1], and the connecting map n is defined by The connecting morphism in homology. Thus the displayed sequence exists in every degree.

L1givenconstruct
2.1

For each integer n, [L2] gives exactness at Hn(A), Hn(B), Hn(C), and Hn1(A). Therefore every four-term window around n is exact.

L2step 1.1algebra
3.1

Since n was arbitrary, these exact windows concatenate to the displayed bi-infinite exact sequence.

step 2.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Naturality of the homology connecting morphism

Statement

A morphism of short exact sequences of complexes induces a commutative square Hn(C)nHn1(A)Hn(C)nHn1(A) for every nZ.

Facts & Assumptions

Given: A morphism of short exact sequences of complexes.

[L1]

A morphism of short exact sequences of complexes is a commutative three-column ladder of chain maps (A morphism of short exact sequences of complexes).

[L2]

The arrow category of an abelian category is abelian, with kernels, cokernels, and the relevant diagrams computed componentwise (The arrow category of an abelian category).

[L3]

The homology connecting morphism is the connecting morphism attached to the quotient-kernel snake diagram of a short exact sequence of complexes (The connecting morphism in homology).

[L4]

The weaker Stacks snake construction applies in every abelian category (Snake lemma under the weaker Stacks hypotheses).

Proof

technique · direct
1.1

By [L1], each degree of the given ladder is a morphism of short exact sequences. Passing to the quotient-kernel diagrams used on this page therefore gives a morphism between two weaker Stacks snake diagrams. Regard every comparison arrow as an object of the arrow category. By [L2], the resulting diagram is itself weaker Stacks snake data in that abelian category.

L1L2L3givenconstruct
2.1

Apply [L4] in the arrow category to the diagram from step 1.1. Its connecting morphism is an arrow object whose two components are the connecting morphisms of the original weaker snake diagrams; being a morphism in the arrow category says exactly that the square between those components commutes. Under the identifications in [L3], this is the displayed homology connecting square.

L2L3L4step 1.1construct
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The long exact homology sequence is natural

Statement

A morphism of short exact sequences of complexes induces a morphism between the associated long exact homology sequences.

Facts & Assumptions

Given: A morphism of short exact sequences of complexes.

[L1]

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

[L2]

The connecting square commutes under a morphism of short exact sequences (Naturality of the homology connecting morphism).

Proof

technique · direct
1.1

Each ordinary square in the two long exact sequences is induced by one of the three chain maps in the given ladder, so it commutes by [L1].

L1givenconstruct
2.1

The only nonformal squares are the connecting ones, and they commute by [L2]. Therefore every square in the long exact ladder commutes.

L2step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The long exact sequence in cohomology

Statement

Let 0ABC0 be a short exact sequence of cochain complexes in an abelian category. Then there is a natural exact sequence Hn(A)Hn(B)Hn(C)nHn+1(A)Hn+1(B)Hn+1(C).

Facts & Assumptions

Given: A short exact sequence 0ABC0 of cochain complexes.

[L1]

A cochain complex may be read as a reindexed chain complex with (C)n=Cn (Cochain complex in an abelian category).

[L2]

The cohomology object Hn(C) is the homology of that reindexed chain complex in degree n (Cohomology object of a cochain complex).

[L3]

Short exact sequences of chain complexes carry long exact sequences in homology (The long exact sequence in homology).

Proof

technique · direct
1.1

By [L1], the given short exact sequence of cochain complexes is the same data as a short exact sequence of reindexed chain complexes. Applying [L3] gives a long exact sequence in homology for those chain complexes.

L1L3givenconstruct
2.1

Replace each term Hn(X) by Hn(X) using [L2]. Under the same reindexing, the connecting map from degree n homology to degree n1 homology becomes a map n:Hn(C)Hn+1(A). This is the displayed long exact cohomology sequence.

L1L2step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Naturality of the cohomology connecting morphism

Statement

A morphism of short exact sequences of cochain complexes induces a commutative square Hn(C)nHn+1(A)Hn(C)nHn+1(A) for every nZ.

Facts & Assumptions

Given: A morphism of short exact sequences of cochain complexes.

[L1]

A cochain complex is read as a chain complex by the grading-reversal convention (C)n=Cn (Cochain complex in an abelian category).

[L2]

The homology connecting morphism is natural under morphisms of short exact sequences (Naturality of the homology connecting morphism).

[L3]

The cohomology connecting maps are the reindexed homology connecting maps (The long exact sequence in cohomology).

Proof

technique · direct
1.1

Apply [L1] to both rows of the given morphism. This turns the cochain ladder into a morphism of short exact sequences of chain complexes.

L1givenconstruct
2.1

The resulting lower-index connecting square commutes by [L2]. Translating back with [L3] gives the upper-index square in the statement.

L2L3step 1.1algebra
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A short exact sequence with acyclic middle complex identifies neighbouring homology

Statement

If 0ABC0 is a short exact sequence of complexes and B is acyclic, then each connecting morphism n:Hn(C)Hn1(A) is an isomorphism.

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes with B acyclic.

[L1]

The long exact homology sequence exists (The long exact sequence in homology).

[L2]

Acyclic means that every homology object of the complex is zero (Exactness of a complex at a degree and acyclic complexes).

Proof

technique · direct
1.1

By [L1], the degree-n window is Hn(B)Hn(C)nHn1(A)Hn1(B).

L1givenconstruct
2.1

The outer terms in that window are zero by [L2]. Exactness then forces n to be both monic and epic, hence an isomorphism.

L1L2step 1.1algebra
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Two-out-of-three for acyclicity in a short exact sequence of complexes

Statement

In a short exact sequence of complexes 0ABC0, if any two of A, B, and C are acyclic, then so is the third.

Facts & Assumptions

Given: A short exact sequence 0ABC0 of complexes.

[L1]

The sequence carries a long exact sequence in homology (The long exact sequence in homology).

[L2]

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

Proof

technique · direct
1.1

If A and C are acyclic, then for every n the exact window Hn(A)Hn(B)Hn(C) has zero outer terms by [L2]. Exactness from [L1] therefore gives Hn(B)=0 for all n.

L1L2givenalgebra
1.2

If A and B are acyclic, then the exact window Hn(B)Hn(C)Hn1(A) has zero outer terms, so Hn(C)=0 for all n.

L1L2givenalgebra
2.1

If B and C are acyclic, then the exact window Hn(C)Hn1(A)Hn1(B) has zero outer terms, so Hn1(A)=0 for all n. Thus the remaining complex is acyclic in every case.

L1L2givenalgebra
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Two-out-of-three for quasi-isomorphisms in a short exact sequence diagram

Statement

Consider a morphism of short exact sequences of complexes 0ABC0abc0ABC0. If any two of a, b, and c are quasi-isomorphisms, then so is the third.

Facts & Assumptions

Given: A morphism of short exact sequences of complexes.

[L1]

Such a ladder induces a morphism between the associated long exact homology sequences (The long exact homology sequence is natural).

[L2]

In a morphism of long exact sequences, if the four surrounding comparison maps in a five-term window are isomorphisms, then the middle one is an isomorphism (Five lemma for a morphism of long exact sequences).

[L3]

A quasi-isomorphism is a chain map inducing isomorphisms on all homology objects (Quasi-isomorphism).

Proof

technique · direct
1.1

Assume b and c are quasi-isomorphisms. In the long exact ladder from [L1], center the five-term window at Hn(A). The four surrounding comparison maps come from Hn+1(b), Hn+1(c), Hn(b), and Hn(c), so they are isomorphisms by [L3]. Hence Hn(a) is an isomorphism by [L2].

L1L2L3givenalgebra
1.2

Assume a and c are quasi-isomorphisms. Center the five-term window at Hn(B). The surrounding comparison maps come from Hn+1(c), Hn(a), Hn(c), and Hn1(a), so [L2] gives that Hn(b) is an isomorphism.

L1L2L3givenalgebra
2.1

Assume a and b are quasi-isomorphisms. Center the five-term window at Hn(C). The surrounding comparison maps come from Hn(a), Hn(b), Hn1(a), and Hn1(b), so [L2] yields that Hn(c) is an isomorphism. By [L3], the missing map is therefore a quasi-isomorphism in every case.

L1L2L3givenalgebra
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The connecting morphism vanishes for a chain-split short exact sequence

Statement

Let 0AiBpC0 be a short exact sequence of complexes. If it admits either a chain section s:CB with ps=1C or a chain retraction r:BA with ri=1A, then n=0:Hn(C)Hn1(A) for every n.

Facts & Assumptions

Given: A short exact sequence 0AiBpC0 of complexes.

[L1]

A chain map is a degreewise morphism commuting with the differentials (Chain map).

[L2]

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

[L3]

The associated homology sequence is exact (The long exact sequence in homology).

Proof

technique · direct
1.1

Suppose first that there is a chain section s with ps=1C. Functoriality of homology gives Hn(p)Hn(s)=1Hn(C), so Hn(p) is epic. Exactness in [L3] gives ker(n)=im(Hn(p))=Hn(C), hence n=0.

L1L3givenalgebra
2.1

Suppose instead that there is a chain retraction r with ri=1A. Then Hn1(r)Hn1(i)=1Hn1(A), so Hn1(i) is monic. Exactness in [L3] gives im(n)=ker(Hn1(i))=0, and a morphism with zero image in an abelian category is zero. Thus the connecting morphism vanishes in either chain-split situation.

L1L2L3givenalgebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The cone long exact sequence

Statement

For every chain map f:CD in an abelian category, there is an exact sequence Hn(C)Hn(f)Hn(D)Hn(Cone(f))Hn1(C)Hn1(f)Hn1(D).

Facts & Assumptions

Given: A chain map f:CD.

[L1]

The canonical cone sequence 0DCone(f)C[1]0 is degreewise split short exact (The canonical mapping-cone sequence is degreewise split short exact).

[L2]

Homology of a shift satisfies Hn(C[1])Hn1(C) (Homology of a shift is shifted homology).

[L3]

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

[L4]

Every short exact sequence of complexes yields a long exact homology sequence (The long exact sequence in homology).

[L5]

The cone differential on DnCn1 is d(y,x)=(dDy+f(x),dCx) (The mapping cone of a chain map).

[L6]

In the weaker snake construction, the connecting morphism is obtained from a pullback P with maps π:Pker(γ) and r:PU and is characterized by δπ=qαr (Snake lemma under the weaker Stacks hypotheses).

Proof

technique · direct
1.1

Apply [L4] to the short exact sequence from [L1]. This gives an exact sequence Hn(D)Hn(Cone(f))Hn(C[1])δnHn1(D).

L1L4givenconstruct
2.1

Apply the weaker snake construction [L6] to the quotient-kernel diagram of the cone sequence from [L1] in degree n+1. Let zC:Zn(C)Cn be the cycle inclusion and let s:Zn(C)Cone(f)n+1 have components (0,zC). Its projection to C[1]n+1=Cn is zC, so s and the quotient qC:Zn(C)Hn(C) induce a morphism t:Zn(C)P into the pullback used in [L6], with πt=qC. By [L5], dCone(f)s=jnfnzC, and the defining equation for r in the snake construction therefore gives rt=Zn(f). Consequently [L6] yields δn+1qC=δn+1πt=qDrt=qDZn(f)=Hn(f)qC. The last equality is the defining square for [L3]. Since qC is epic, δn+1=Hn(f). Reindexing step 1.1 by [L2] gives the displayed cone long exact sequence.

L1L2L3L5L6step 1.1constructalgebra
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

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

Statement

For the canonical short exact sequence 0DCone(f)C[1]0 of a chain map f:CD in a module category, the connecting morphism n:Hn(C[1])Hn1(D) corresponds under the shift isomorphism Hn(C[1])Hn1(C) to the homology map Hn1(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:CD 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 Hn1(C) using the sign convention fixed for shifts (Homology of a shift is shifted homology).

Proof

technique · direct
1.1

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

L2L3givenalgebra
2.1

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

L1L3step 1.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The cone criterion from the general long exact sequence

Statement

For a chain map f:CD, the cone Cone(f) is acyclic if and only if f is a quasi-isomorphism. This is exactly the same criterion already recorded on the mapping-cone page.

Facts & Assumptions

Given: A chain map f:CD.

[L1]

The cone long exact sequence has the form Hn(C)Hn(f)Hn(D)Hn(Cone(f))Hn1(C) (The cone long exact sequence).

[L2]

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

[L3]

The mapping-cone page already proves the same equivalence (A chain map is a quasi-isomorphism exactly when its cone is acyclic).

Proof

technique · direct
1.1

If Cone(f) is acyclic, then the middle terms in [L1] vanish by [L2]. Exactness therefore makes every Hn(f) both monic and epic, so f is a quasi-isomorphism.

L1L2givenalgebra
2.1

If f is a quasi-isomorphism, then every map Hn(f) in [L1] is an isomorphism. Exactness forces each Hn(Cone(f)) to vanish, so the cone is acyclic by [L2]. This is the same criterion already established in [L3].

L1L2L3givenalgebra
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The long exact sequence of relative homology for a composable pair

Statement

For composable chain maps in an abelian category CfDgE, there is an exact sequence Hn(D,C;f)Hn(E,C;gf)Hn(E,D;g)Hn1(D,C;f).

Facts & Assumptions

Given: Composable chain maps CfDgE in an abelian category.

[L1]

Relative homology of a chain map is the homology of its mapping cone (The relative homology of a chain map).

[L2]

Every chain map has a cone long exact sequence (The cone long exact sequence).

[L3]

For the induced map α:Cone(f)Cone(gf), the cone Cone(α) is chain-homotopy equivalent to Cone(g) (The three-cone calculation for a composite chain map).

[L4]

Every chain-homotopy equivalence is a quasi-isomorphism (A chain homotopy equivalence is a quasi-isomorphism).

[L5]

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

Apply [L2] to the induced chain map α:Cone(f)Cone(gf). This gives an exact sequence Hn(Cone(f))Hn(Cone(gf))Hn(Cone(α))Hn1(Cone(f)).

L2givenconstruct
2.1

Rewrite the first two terms by [L1]. By [L3] there is a chain-homotopy equivalence Φ:Cone(α)Cone(g); [L4] makes Φ a quasi-isomorphism, and [L5] therefore gives isomorphisms on homology. So Hn(Cone(α))Hn(Cone(g)), and rewriting the last term with [L1] yields exactly the displayed long exact sequence of relative homology for the composable pair.

L1L3L4L5step 1.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A chain map between acyclic complexes has an acyclic cone

Statement

If f:CD is a chain map and both C and D are acyclic, then Cone(f) is acyclic.

Facts & Assumptions

Given: A chain map f:CD between acyclic complexes.

[L1]

The cone long exact sequence exists (The cone long exact sequence).

[L2]

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

Proof

technique · direct
1.1

In the cone long exact sequence from [L1], every copy of Hn(C) and Hn(D) is zero by [L2].

L1L2givenalgebra
2.1

Exactness then forces every Hn(Cone(f)) to vanish as well. Hence the cone is acyclic.

L1L2step 1.1algebra
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

An exact functor carries the long exact homology sequence to the corresponding long exact sequence

Statement

Let F:AB be an exact functor between abelian categories. For every short exact sequence of complexes in A, the canonical isomorphisms F(Hn(X))Hn(F(X)) identify the image under F of its long exact homology sequence with the long exact homology sequence of the induced short exact sequence 0F(A)F(B)F(C)0.

Facts & Assumptions

Given: An exact functor F:AB and a short exact sequence 0ABC0 of complexes in A.

[L1]

Exactness means that F preserves the finite limits and colimits relevant to kernels, cokernels, and short exact sequences (Exact functor between abelian categories).

[L2]

Exact functors commute with homology by canonical natural isomorphisms (An exact functor commutes with homology).

[L3]

The long exact homology sequence is natural for morphisms of short exact sequences (The long exact homology sequence is natural).

[L4]

Every short exact sequence of complexes has a long exact homology sequence (The long exact sequence in homology).

Proof

technique · direct
1.1

By [L1], applying F degreewise to the given short exact sequence of complexes produces another short exact sequence of complexes in B. Applying [L4] to both sequences gives two long exact homology sequences.

L1L4givenconstruct
2.1

The canonical isomorphisms from [L2] identify each term F(Hn(X)) with Hn(F(X)), and their naturality identifies the ordinary homology maps on the two sequences.

L2step 1.1algebra
3.1

The connecting morphisms are built from kernels and cokernels of the same degreewise diagram, and [L1] preserves those constructions. Therefore the comparison isomorphisms respect the connecting maps as well, so the whole long exact sequence is transported from one side to the other.

L1L2L3step 2.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Homology of a chain-split direct-sum sequence

Statement

If 0ABC0 is a chain-split short exact sequence of complexes, then for every n there is an isomorphism Hn(B)Hn(A)Hn(C).

Facts & Assumptions

Given: A chain-split short exact sequence 0ABC0 of complexes.

[L1]

In a chain-split short exact sequence, every connecting morphism is zero (The connecting morphism vanishes for a chain-split short exact sequence).

[L2]

Every short exact sequence of complexes has a long exact homology sequence (The long exact sequence in homology).

Proof

technique · direct
1.1

By [L1] and [L2], the long exact homology sequence breaks in each degree into a short exact sequence 0Hn(A)Hn(B)Hn(C)0.

L1L2givenalgebra
2.1

Because the short exact sequence is chain split, the middle complex is degreewise isomorphic to AC with block-diagonal differential. Hence Zn(B)Zn(A)Zn(C),Bn(B)Bn(A)Bn(C), and quotienting cycles by boundaries gives Hn(B)Hn(A)Hn(C).

step 1.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Short five lemma for quasi-isomorphisms

Statement

In a morphism of short exact sequences of complexes, if the left and right vertical maps are quasi-isomorphisms, then the middle vertical map is also a quasi-isomorphism.

Facts & Assumptions

Given: A morphism of short exact sequences of complexes whose outer two vertical maps are quasi-isomorphisms.

[L1]

Any two quasi-isomorphisms in a morphism of short exact sequences force the third to be a quasi-isomorphism (Two-out-of-three for quasi-isomorphisms in a short exact sequence diagram).

Proof

technique · direct
1.1

The hypothesis is exactly one of the three cases covered by [L1].

L1given
2.1

Therefore the middle vertical map is a quasi-isomorphism.

L1step 1.1
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A short exact sequence of complexes gives six-term exact sequences when homology is concentrated in two degrees

Statement

Let 0ABC0 be a short exact sequence of complexes in an abelian category. Fix nZ, and assume that all three complexes have zero homology outside degrees n and n1. Then the long exact sequence collapses to a six-term exact sequence 0Hn(A)Hn(B)Hn(C)nHn1(A)Hn1(B)Hn1(C)0.

Facts & Assumptions

Given: A short exact sequence of complexes in an abelian category whose homology is concentrated in degrees n and n1.

[L1]

Every short exact sequence of complexes yields a long exact homology sequence (The long exact sequence in homology).

Proof

technique · direct
1.1

By [L1], the short exact sequence gives a long exact sequence running through the six displayed terms.

L1givenconstruct
2.1

Every homology term immediately before and after those six terms is zero by the concentration hypothesis. Removing those zero terms leaves the displayed six-term exact sequence.

step 1.1givenalgebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The homological delta-functor carried by homology of complexes

Definition

Fix an abelian category A. For each integer n, let Hn:Ch(A)A be the homology functor of Homology is an additive functor. For every short exact sequence of complexes in A, equip this family with the connecting morphisms n:Hn(C)Hn1(A) of The connecting morphism in homology.

The resulting family (Hn,n)nZ is the homological δ-functor carried by homology of complexes. This page uses it only as this concrete example; the abstract theory is deferred to the later δ-functor page.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Homology of complexes satisfies the delta-functor naturality and exactness laws

Statement

For every abelian category, the family of homology functors together with the connecting morphisms of this page is a homological δ-functor: it sends each short exact sequence of complexes to a long exact sequence, and it is natural under morphisms of short exact sequences.

Facts & Assumptions

Given: An abelian category and a short exact sequence of complexes in it.

[L1]

This page defines the family (Hn,n) as a concrete homological δ-functor candidate (The homological delta-functor carried by homology of complexes).

[L2]

Short exact sequences of complexes carry long exact homology sequences (The long exact sequence in homology).

[L3]

Those long exact sequences are natural under morphisms of short exact sequences (The long exact homology sequence is natural).

Proof

technique · direct
1.1

By [L1], the only axioms left to check are exactness for each short exact sequence and naturality for each morphism of such sequences.

L1given
2.1

Exactness is exactly [L2], and naturality is exactly [L3]. Therefore the family of homology functors with these connecting morphisms satisfies the required δ-functor laws.

L2L3step 1.1algebra

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: the connecting morphism is defined by choosing one lift with no independence proof

Statement

The connecting morphism is defined by choosing one lift of one cycle representative, with no independence proof required.

Facts & Assumptions

Given: A short exact sequence of module complexes.

[A1]

The statement refuted is: the connecting morphism is defined by choosing one lift of one cycle representative, with no independence proof required.

[L1]

The module formula proves independence of the chosen lift and of the chosen cycle representative (Elementwise formula for the connecting map in module categories).

[L2]

The categorical construction leaves no residual choice at all once the universal-property data are fixed (The connecting morphism depends on no choices).

Refutation

technique · direct
1.1

The claim in [A1] ignores exactly the two choice-independence checks named in [L1] and the universal-property uniqueness recorded in [L2]. A single lift can at best produce one candidate value; it does not define a map on homology classes.

A1L1L2givenalgebra
2.1

Since the actual construction either proves independence of all allowed choices or avoids those choices altogether, [A1] contradicts the established definition of the connecting morphism. Therefore [A1] is false.

A1L1L2step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: a degreewise split short exact sequence of complexes has zero connecting map

Statement

Every degreewise split short exact sequence of complexes has zero connecting map.

Facts & Assumptions

Given: The degreewise split cone sequence of the identity map on Z[0].

[A1]

The statement refuted is: every degreewise split short exact sequence of complexes has zero connecting map.

[L1]

Every canonical cone sequence is degreewise split short exact (The canonical mapping-cone sequence is degreewise split short exact).

[L2]

For the identity map, the connecting morphism of the canonical cone sequence is the shifted identity up to sign (The cone connecting map agrees with the shifted identity up to the declared sign).

Refutation

technique · direct
1.1

By [L1], the cone sequence of 1Z[0] is degreewise split short exact.

L1given
2.1

The stalk complex Z[0] has Z in degree 0 and 0 elsewhere, so H0(Z[0])Z. Likewise H1(Z[1])Z. Under these identifications, [L2] says the connecting morphism is ±1 on Z, hence nonzero.

L2step 1.1algebra
3.1

This gives a degreewise split short exact sequence whose connecting morphism is nonzero, contradicting [A1]. Therefore not every degreewise split short exact sequence has zero connecting map.

A1step 1.1step 2.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: the homology functor is exact on short exact sequences of complexes

Statement

The homology functor is exact on short exact sequences of complexes.

Facts & Assumptions

Given: The canonical cone sequence of the identity map on Z[0].

[A1]

The statement refuted is: the homology functor is exact on short exact sequences of complexes.

[L1]

Short exact sequences of complexes give long exact homology sequences with a connecting morphism (The long exact sequence in homology).

[L2]

For the cone sequence of the identity map, the connecting morphism is the shifted identity up to sign, hence nonzero (The cone connecting map agrees with the shifted identity up to the declared sign).

Refutation

technique · direct
1.1

If homology were exact in the short sense claimed in [A1], then the connecting morphism in every long exact sequence from [L1] would be zero.

A1L1givenalgebra
2.1

But [L2] gives a short exact sequence of complexes whose connecting morphism is nonzero. So the homology functor is not exact on short exact sequences of complexes; instead it participates in the long exact sequence of [L1]. Therefore [A1] is false.

A1L1L2step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: the cohomology connecting morphism lowers degree

Statement

The cohomology connecting morphism lowers degree.

Facts & Assumptions

Given: A short exact sequence of cochain complexes.

[A1]

The statement refuted is: the cohomology connecting morphism lowers degree.

[L1]

The cohomology long exact sequence contains maps n:Hn(C)Hn+1(A) (The long exact sequence in cohomology).

Refutation

technique · direct
1.1

The degree shift displayed in [L1] goes from Hn(C) to Hn+1(A), so it raises the upper index by one rather than lowering it.

A1L1givenalgebra
2.1

Therefore [A1] contradicts the actual cohomology long exact sequence and is false.

A1L1step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: naturality of the long exact sequence follows without checking the connecting square

Statement

Naturality of the long exact sequence follows without checking the connecting square.

Facts & Assumptions

Given: A morphism of short exact sequences of complexes.

[A1]

The statement refuted is: naturality of the long exact sequence follows without checking the connecting square.

[L1]

The connecting square itself requires a separate naturality theorem (Naturality of the homology connecting morphism).

[L2]

The long exact ladder is natural only after that connecting square is included (The long exact homology sequence is natural).

Refutation

technique · direct
1.1

The ordinary homology squares commute formally, but [L1] shows that the square involving the connecting morphisms is an additional theorem rather than an automatic byproduct.

A1L1givenalgebra
2.1

Because [L2] depends on that separate connecting-square result, [A1] omits a necessary part of the proof of naturality. Therefore [A1] is false.

A1L1L2step 1.1algebra

Sources