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.

Derived Categories

1 · Prerequisites

2 · Summary

This page constructs derived categories as size-controlled roof localizations, proves their triangulated and Verdier-quotient descriptions, develops bounded projective and injective models, and relates total derived functors to Ext, Tor, derived Hom, truncations, and the canonical t-structure.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Multiplicative system in a category

Definition

Let C be a locally small category, using the definable-class convention of Class-sized category theory in ZFC: definable-class schemas, small and locally small categories, and why CAT is not formed. A two-sided multiplicative system S is a class of arrows satisfying:

  1. Every 1X belongs to S, and composites of composable members belong to S.
  2. Given f:UY and t:VY in S, there exist a:WU in S and b:WV with fa=tb. Dually, given f:XU and s:XV in S, there exist a:UW in S and b:VW with af=bs.
  3. For parallel f,g:XY, existence of t:YZ in S with tf=tg is equivalent to existence of s:WX in S with fs=gs.

For the locally small localization construction we additionally require either that C is small or that, for each X, a set SX of denominators into X is supplied such that every s:UX in S admits a:VU with saSX. The map a need not lie in S. These size data are separate from the fraction axioms; local smallness of C alone is insufficient. Objects and arrows have the types prescribed in Category, object, morphism, domain, codomain, identity, composition, and hom-collection.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Localization of a category at a class of morphisms

Definition

For a category C and a class S of its arrows, a localization consists of a category L and a functor Q:CL such that Q(s) is invertible for every sS and every functor F:CE inverting S has a unique factorization F=FQ. We use the strict factorization convention for the same-object roof model. Natural transformations between such functors also descend uniquely; in the equivalence-invariant formulation, precomposition with Q is an equivalence onto the functors inverting S. Functors and natural isomorphisms have the meanings of Covariant functor, identity functor, composite functor, and contravariant functor and Natural isomorphism. All category and functor quantifiers use the standing size convention.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Left roof representing a localized morphism

Definition

For a multiplicative system as in Multiplicative system in a category, a left roof from X to Y is the typed pair (s,f) with s:UX in S and f:UY. Its intended localized value is Q(f)Q(s)1. Thus the common vertex is the source of both arrows. This is a syntactic presentation; existence of the localized category is a subsequent theorem.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Common refinement equivalence of roofs

Definition

Two left roofs (s:UX,f:UY) and (t:UX,g:UY) are common-refinement equivalent if there are a:VU and b:VU such that sa=tbS and fa=gb. Only the composite sa=tb is required to belong to S; neither refinement leg is separately required to do so. Left roofs have the orientation fixed in Left roof representing a localized morphism.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Roof equivalence is an equivalence relation

Statement

For any two objects X,Y of a category with a two-sided multiplicative system S, common refinement is an equivalence relation on left roofs from X to Y.

Facts & Assumptions

Given: For any two objects X,Y of a category with a two-sided multiplicative system S, common refinement is an equivalence relation on left roofs from X to Y.

[F1]

The common-refinement conditions are equality of the composite denominators in S and equality of the numerators (Common refinement equivalence of roofs).

[F2]

The two Ore axioms and the two cancellation directions hold for the given multiplicative system (Multiplicative system in a category).

Proof

1.1

For a roof (s,f), take both refinement legs to be its vertex identity. This gives reflexivity. Interchanging the two refinement legs gives symmetry. These arguments also cover identity roofs and coincident vertices.

F1given
1.2

For transitivity suppose (s,f)(t,g) via a,b and (t,g)(u,h) via c,d. Thus r=sa=tbS and q=tc=udS, while fa=gb and gc=hd. Apply Ore to r and q: obtain v in S and w with rv=qwS.

F1F2
2.1

Now tbv=tcw. Cancellation of the postcomposed denominator t supplies eS such that bve=cwe. Therefore save=udwe=rveS and fave=gbve=gcwe=hdwe. The legs ave,dwe witness (s,f)(u,h). Only v,e, and the displayed composite denominator were asserted to lie in S.

F2step 1.2algebra
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Composition of roofs is well defined

Statement

Given roofs (s:UX,f:UY) and (t:VY,g:VZ), choose a:WU in S, b:WV with fa=tb. Their composite is the class of (sa,gb). This is independent of both representatives and of the Ore square, is associative, and has identity roof (1X,1X).

Facts & Assumptions

Given: Given roofs (s:UX,f:UY) and (t:VY,g:VZ), choose a:WU in S, b:WV with fa=tb. Their composite is the class of (sa,gb). This is independent of both representatives and of the Ore square, is associative, and has identity roof (1X,1X).

[F1]

Common refinement of roofs is an equivalence relation (Roof equivalence is an equivalence relation).

[F2]

Ore squares have a specified leg in S, and post-denominator equality can be cancelled after precomposition by a member of S (Multiplicative system in a category).

Proof

1.1

Ore supplies a,b of the indicated types and saS. To compare any two candidate squares, it is enough to give a common refinement of their output roofs; common refinement is an equivalence relation.

F1F2
1.2

First replace (s,f) by a refinement (sr,fr), where srS. Compare squares fa=tb and fra=tb, with a,aS. Apply Ore to the denominators sa and sra to obtain vS,w with sav=srawS. Cancel s by a further eS to obtain ave=rawe, then cancel t by kS to obtain bvek=bwek. Thus the two composite roofs have equal numerator and denominator after refinement, with common denominator savekS. Taking r=1 proves independence of the square as well.

F2algebra
2.1

Next refine the second roof to (tr,gr), where trS. Compare fa=tb and fa=trb. Ore gives vS,w with av=awS. Cancellation of t in tbv=trbw gives eS with bve=rbwe. Hence the composites have equal numerator gbve=grbwe and common denominator saveS. Arbitrary equivalent representatives share a refinement, so these two refinement checks and transitivity prove full representative independence.

F1F2step 1.2algebra
3.1

For a third roof (u:TZ,h:TR) choose fa=tb as above and ge=uk with eS. Ore applied to b:WV and e gives iS,j with bi=ej. Then gbi=ukj and fai=tej. The two bracketings can therefore both be computed as (sai,hkj). Independence of square choices proves associativity for all choices.

F2step 1.2step 2.1algebra
4.1

Composing with an identity roof on the target uses a=1,b=f; composing with an identity roof on the source uses a=s,b=1. Both recover (s,f) exactly. Thus the operation has both identity laws, including when s itself is an identity.

givenalgebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The calculus of fractions constructs the localization

Statement

Under the smallness or supplied cofinal-denominator hypothesis of the multiplicative-system definition, roof classes with the preceding composition form a locally small localization Q:CS1C, with Q(f)=[(1,f)]. For parallel f,g:XY, Q(f)=Q(g) if and only if fv=gv for some v:WX in S. Every arrow also has a right-roof presentation Q(t)1Q(h), with h:XV and t:YV in S.

Facts & Assumptions

Given: Under the smallness or supplied cofinal-denominator hypothesis of the multiplicative-system definition, roof classes with the preceding composition form a locally small localization Q:CS1C, with Q(f)=[(1,f)]. For parallel f,g:XY, Q(f)=Q(g) if and only if fv=gv for some v:WX in S. Every arrow also has a right-roof presentation Q(t)1Q(h), with h:XV and t:YV in S.

[F1]

The roof composition is well defined, associative, and unital (Composition of roofs is well defined).

[F2]

A localization inverts S and is universal for functors inverting S, including descent of natural transformations (Localization of a category at a class of morphisms).

Proof

1.1

Composition, associativity and identities are supplied by the preceding lemma. Every roof into a fixed source X refines to one with denominator in the supplied set SX; its possible numerators lie in a set of Hom sets. Taking the quotient of this set by refinement gives a set of arrows from X to Y. In a small category the set of all roofs already suffices. This also constructs the empty localization when there are no objects.

F1given
1.2

Identity-denominator roofs show Q(gf)=Q(g)Q(f) and preservation of identities. For s:UX in S, the roof (s,1U) is inverse to Q(s): the products are the identity at U and the roof (s,s), which refines the identity at X. Thus Q inverts S.

F1algebra
2.1

Let F invert S. Set F(s,f)=F(f)F(s)1. For a refinement sa=tb=rS, both F(a)=F(s)1F(r) and F(b)=F(t)1F(r) are invertible, so fa=gb gives equal values. An Ore equality fa=tb gives F(t)1F(f)=F(b)F(a)1, proving preservation of composition. Every roof is Q(f)Q(s)1, forcing uniqueness. A natural transformation descends on the same objects: naturality for s implies naturality for Q(s)1 and hence for each roof. This proves the stated localization property.

F1F2step 1.2algebra
3.1

Equality of (1,f) and (1,g) gives refinement legs a=b=vS with fv=gv; conversely such v is a common refinement. For the dual presentation apply the other Ore axiom to s:UX and f:UY, obtaining t:YV in S and h:XV with tf=hs. Then Q(f)Q(s)1=Q(t)1Q(h). This describes right roofs in the same category and requires no second smallness assertion.

givenstep 1.2algebra
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Quasi isomorphisms contain identities and are closed under composition

Statement

For complexes in an abelian category, identity maps are quasi-isomorphisms and composites of quasi-isomorphisms are quasi-isomorphisms. We use cochain indexing, so Hn=Hn under reindexing.

Facts & Assumptions

Given: For complexes in an abelian category, identity maps are quasi-isomorphisms and composites of quasi-isomorphisms are quasi-isomorphisms. We use cochain indexing, so Hn=Hn under reindexing.

[F1]

A quasi-isomorphism is a complex map inducing an isomorphism in every homology degree (Quasi-isomorphism).

Proof

1.1

In each integer degree Hn(1X)=1Hn(X), including Hn(X)=0. Hence identities induce isomorphisms in every degree.

F1algebra
2.1

For quasi-isomorphisms f:XY,g:YZ, functoriality gives Hn(gf)=Hn(g)Hn(f), an isomorphism with inverse Hn(f)1Hn(g)1. This holds for every n.

F1algebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Two out of three for quasi isomorphisms

Statement

For composable complex maps f:XY and g:YZ, if any two of f,g,gf are quasi-isomorphisms, then so is the third.

Facts & Assumptions

Given: For composable complex maps f:XY and g:YZ, if any two of f,g,gf are quasi-isomorphisms, then so is the third.

[F1]

Identities and composites of quasi-isomorphisms are quasi-isomorphisms (Quasi isomorphisms contain identities and are closed under composition).

Proof

1.1

Fix any degree n and write a=Hn(f) and b=Hn(g). Functoriality gives Hn(gf)=ba. If a,b are invertible then ba is invertible, also when any cohomology object is zero.

F1algebra
2.1

If a,ba are invertible, then b=(ba)a1 is invertible. If b,ba are invertible, then a=b1(ba) is invertible. These are the other two possible pairs, and the argument holds in every degree.

step 1.1algebra
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Quasi isomorphisms admit the roof calculus in the homotopy category

Statement

In the cochain homotopy category K(A) of an abelian category, quasi-isomorphisms form a two-sided multiplicative system. The same assertion holds in K,K+,Kb. These are fraction axioms; local smallness of the localization requires the separate standing size data.

Facts & Assumptions

Given: In the cochain homotopy category K(A) of an abelian category, quasi-isomorphisms form a two-sided multiplicative system. The same assertion holds in K,K+,Kb. These are fraction axioms; local smallness of the localization requires the separate standing size data.

[F1]

Quasi-isomorphisms contain identities and are closed under composition (Quasi isomorphisms contain identities and are closed under composition).

[F2]

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

[F3]

Homology on the homotopy category is homological; in cochain indexing this gives the long cohomology sequence (Homology is a homological functor on the homotopy category).

[F4]

The homotopy category of an abelian category is triangulated (The homotopy category of an abelian category is triangulated).

[F5]

A complex map is a quasi-isomorphism exactly when its cone is acyclic (A chain map is a quasi-isomorphism exactly when its cone is acyclic).

[F6]

Applying either representable Hom functor to a distinguished triangle gives an exact sequence (Long exact Hom sequences of a distinguished triangle).

[F7]

A two-sided multiplicative system satisfies identities/composition, both Ore conditions, and both cancellation directions (Multiplicative system in a category).

Proof

1.1

Cohomology is defined on homotopy classes. Identities, composites, and shifts preserve quasi-isomorphisms, and homotopy equivalences are quasi-isomorphisms. These assertions include the zero complex.

F1F2F3
1.2

For s:XX a quasi-isomorphism and f:XY, take the triangle XfYChX[1]. Complete s[1]h:CX[1] to a triangle XfYCs[1]hX[1]. Rotated TR3 gives t:YY with tf=fs and a morphism of triangles whose other components are s,1C. The two long cohomology sequences show Hn(t) invertible: exactness identifies its kernel and cokernel with zero by the adjacent isomorphisms. Thus t is a quasi-isomorphism, giving the outgoing Ore square. Reversing arrows and rotating gives the incoming Ore square.

F3F4
1.3

If a=fg:XY satisfies at=0 for a quasi-isomorphism t:ZX, the triangle ZtXdCZ[1] has acyclic C. Hom exactness gives a=id for some i:CY. Complete i to CiYjWC[1]. Cohomology exactness makes j a quasi-isomorphism and ja=jid=0. Reversing arrows gives the converse cancellation direction.

F3F4F5F6
2.1

All constructions used only finitely many shifts, sums and cones. These preserve each of termwise upper, lower, and two-sided boundedness (with possibly changed finite bounds). Thus both Ore and cancellation constructions stay in each bounded homotopy category and establish exactly the multiplicative-system axioms there.

F4F7step 1.1step 1.2step 1.3
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Derived category of an abelian category

Definition

Let A be an abelian category. We use cochains as in Cochain complex in an abelian category, with X[k]n=Xn+k and dX[k]n=(1)kdXn+k. Thus Hn(X[k])=Hn+k(X). The cochain category K(A) is the reindexed published homotopy category. Put

D(A)=K(A)[qis1],Q:K(A)D(A).

Likewise D,D+,Db initially mean the localizations of the termwise bounded variants of Bounded, bounded below, and bounded above complexes. Roof morphisms exist by Quasi isomorphisms admit the roof calculus in the homotopy category and The calculus of fractions constructs the localization under its standing size hypothesis: a small category of complexes, or supplied small cofinal denominator families. Every assertion of Hom sets is under that hypothesis. In the bounded module models, supplied replacements will separately exhibit those Hom sets. No general local-smallness theorem for unbounded D(A) is asserted.

The cone convention is Cone(f)n=YnXn+1, d(y,x)=(dYy+fx,dXx), and its triangle ends in X[1].

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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 localization functor sends quasi isomorphisms to isomorphisms

Statement

For every quasi-isomorphism s:XY, Q(s) is invertible in the derived category, with inverse represented by the roof YsX1XX.

Facts & Assumptions

Given: For every quasi-isomorphism s:XY, Q(s) is invertible in the derived category, with inverse represented by the roof YsX1XX.

[F1]

The derived category is the roof localization of the homotopy category at quasi-isomorphisms (Derived category of an abelian category).

Proof

1.1

The derived category is the localization at quasi-isomorphisms, so the proposed inverse is the allowed roof (s,1X). This includes s=10 at the zero complex.

F1
2.1

Composing the roof with Q(s) gives the identity roof of X in one order and (s,s) in the other. The latter refines (1Y,1Y) via s and 1X, so both products are identities.

F1algebra
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Cohomology factors through the derived category

Statement

For every integer n, Hn:K(A)A factors uniquely through Q:D(A). More precisely, there is a unique Hn:D(A)A with Hn=HnQ, and Hn(s,f)=Hn(f)Hn(s)1.

Facts & Assumptions

Given: For every integer n, Hn:K(A)A factors uniquely through Q:D(A). More precisely, there is a unique Hn:D(A)A with Hn=HnQ, and Hn(s,f)=Hn(f)Hn(s)1.

[F1]

The derived category is localization at quasi-isomorphisms (Derived category of an abelian category).

[F2]

Homology is a homological functor on the homotopy category (Homology is a homological functor on the homotopy category).

Proof

1.1

Cochain reindexing of homology gives a functor Hn on K(A), and it inverts every quasi-isomorphism by definition. In particular it sends the zero complex to zero.

F1F2
2.1

The localization property therefore gives the unique factorization. On a roof Q(f)Q(s)1 functoriality forces the displayed value. No triangulation of D(A) is needed for this assertion.

F1step 1.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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 complex is zero in the derived category exactly when it is acyclic

Statement

A complex X becomes a zero object in D(A) if and only if Hn(X)=0 for every integer n.

Facts & Assumptions

Given: A complex X becomes a zero object in D(A) if and only if Hn(X)=0 for every integer n.

[F1]

Every quasi-isomorphism becomes invertible in the derived category (The localization functor sends quasi isomorphisms to isomorphisms).

[F2]

Cohomology factors through the derived category (Cohomology factors through the derived category).

Proof

1.1

First Q(0) is a zero object: a roof XU0 represents the ordinary zero map, because its numerator is the composite UX0; dually a right roof out of 0 is zero. Hence both Hom sets involving Q(0) are singletons. If X is acyclic, X0 is a quasi-isomorphism, so Q(X)Q(0).

F1algebra
2.1

Conversely, if Q(X) is a zero object it is isomorphic to Q(0). The factored cohomology functors take this isomorphism to Hn(X)Hn(0)=0 for every n. Thus X is acyclic.

F2step 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Addition of roofs makes an additive localization

Statement

For an additive category C with a two-sided multiplicative system and the standing localization size data, addition of left roofs by a common denominator makes S1C additive. Composition is bilinear, and Q preserves zero objects and finite biproducts.

Facts & Assumptions

Given: For an additive category C with a two-sided multiplicative system and the standing localization size data, addition of left roofs by a common denominator makes S1C additive. Composition is bilinear, and Q preserves zero objects and finite biproducts.

[F1]

Roof localization is a category, and equality of ordinary arrows is detected by a denominator (The calculus of fractions constructs the localization).

[F2]

An additive category is preadditive and has finite biproducts (Additive category).

Proof

1.1

For (s,f),(t,g):XY, choose aS,b with sa=tb=rS and define their sum as (r,fa+gb). If roofs already have denominator r, they agree exactly when their numerators agree after some further refinement e with reS: one implication is immediate; for the other, cancel r between the two refinement legs and then precompose by the resulting denominator.

F1F2algebra
2.1

For two choices of common denominator, refine those denominators once more. Equality of each of the two summands can then be witnessed at that denominator by the previous criterion; applying cancellation successively makes both numerator equalities simultaneous. Their sums are equal there by additivity. This proves choice and representative independence. At a common denominator, associativity, commutativity, zero and negation are precisely the abelian-group laws in C(U,Y).

F1F2step 1.1algebra
3.1

Postcomposition by an ordinary arrow is additive since it acts on numerators. Precomposition by an ordinary arrow is additive: use one Ore square with the common denominator of both summands. Composition with Q(s)1 is the inverse of the additive composition bijection for Q(s), and is therefore additive. Every localized arrow is a product of ordinary arrows and inverse denominators, proving bilinearity.

F1F2step 2.1algebra
4.1

The image of 10=0 shows Q(0) is a zero object: every arrow to or from it is zero by bilinearity and the identity law. For B=XY, the equations pXiX=1, pYiY=1, pXiY=pYiX=0 and iXpX+iYpY=1B survive under the additive Q. They supply unique tuples of incoming and outgoing arrows, hence make Q(B) a biproduct. The empty biproduct is Q(0), and binary ones iterate to finite ones.

F2step 3.1algebra
LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07Open item page →

Finite roof squares and composable pairs can be cleared

Statement

Let f:XY and f:XY be ordinary arrows, and let α:QXQX, β:QYQY satisfy βQf=Qfα. There exist f:XY, k:XX, l:YY, and denominators s:XX, t:YY, such that fk=lf, fs=tf, α=Q(s)1Q(k), β=Q(t)1Q(l). Moreover two composable localized arrows and their composite can simultaneously be represented by ordinary arrows after denominator isomorphisms of the three objects.

Facts & Assumptions

Given: Let f:XY and f:XY be ordinary arrows, and let α:QXQX, β:QYQY satisfy βQf=Qfα. There exist f:XY, k:XX, l:YY, and denominators s:XX, t:YY, such that fk=lf, fs=tf, α=Q(s)1Q(k), β=Q(t)1Q(l). Moreover two composable localized arrows and their composite can simultaneously be represented by ordinary arrows after denominator isomorphisms of the three objects.

[F1]

Every localized arrow has either roof orientation, and equality of ordinary arrows is detected by a denominator (The calculus of fractions constructs the localization).

[F2]

Composition of roof classes is independent of representatives and is associative (Composition of roofs is well defined).

Proof

1.1

Write α=Q(s)1Q(k). The outgoing Ore square for s,f gives t:YY in S and f:XY with fs=tf. Write β=Q(q)1Q(i), and apply Ore to t,q to find r:YY(3) in S and j with rt=jq. Replace f,t by rf,rt and put l=ji. Then β=Q(t)1Q(l) and the right square commutes.

F1F2
2.1

The localized commuting square now gives Q(lf)=Q(fk). Dual equality detection supplies d in S with dlf=dfk. Replace l,f,t by dl,df,dt; both ordinary squares now commute and dtS. This proves the square assertion, including identity or coincident arrows.

F1step 1.1algebra
3.1

For a composable pair α:QXQY, β:QYQZ, write α=Q(s)1Q(f) with s:YY in S. Write βQ(s)1=Q(t)1Q(g) with t:ZZ in S and g:YZ. Thus after the object comparisons 1X,Q(s),Q(t) the pair is Q(f),Q(g) and its composite is Q(gf). The equalities follow from the proved composition law, not from an assumption about arbitrary diagrams.

F1F2algebra
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Localized cone triangles satisfy tr one through tr three

Statement

In D(A) let distinguished triangles mean triangles isomorphic to images of cone triangles in K(A). The cochain shift descends and these triangles satisfy TR1, signed TR2, and TR3.

Facts & Assumptions

Given: In D(A) let distinguished triangles mean triangles isomorphic to images of cone triangles in K(A). The cochain shift descends and these triangles satisfy TR1, signed TR2, and TR3.

[F1]

The derived category is localization at quasi-isomorphisms (Derived category of an abelian category).

[F2]

The roof localization is additive and preserves zero and biproducts (Addition of roofs makes an additive localization).

[F3]

A commuting localized square on two ordinary arrows clears to two ordinary commuting squares with denominator comparisons (Finite roof squares and composable pairs can be cleared).

[F4]

The homotopy category of an abelian category is triangulated (The homotopy category of an abelian category is triangulated).

[F5]

Homology on the homotopy category is homological (Homology is a homological functor on the homotopy category).

[F6]

In a map of exact five-term sequences, isomorphisms in positions one, two, four and five imply an isomorphism in position three (Five lemma in an abelian category).

Proof

1.1

The additive localization exists. Since a quasi-isomorphism remains one after either shift, shifting both arrows of a roof defines mutually inverse additive shifts. The zero complex and identity triangles descend as well.

F1F2
1.2

For any arrow write α=Q(s)1Q(f) with s:YY a quasi-isomorphism. A cone triangle on f:XY descends and transport along Q(s) completes α:XY. Closure under isomorphism is built into the definition. Rotation gives (Y,Z,X[1],v,w,u[1]) because this is the rotation in K; shifting a roof preserves the minus sign. This proves TR1 and both directions of TR2.

F1F4
1.3

For TR3 first replace the two triangles by images of triangles on ordinary maps f,f. Apply the square-clearing lemma to the prescribed first two components. It supplies a third ordinary arrow f and two commuting squares with maps (k,l) and denominator maps (s,t) into f. Complete each square to a morphism of cone triangles in K by its TR3, giving third maps m:CfCf and r:CfCf.

F3F4
2.1

For every n, take the five consecutive terms Hn(X), Hn(Y), Hn(Cf), Hn+1(X), Hn+1(Y) and their counterparts for f. Exactness holds in K; four vertical maps are isomorphisms because s,t are quasi-isomorphisms. The five lemma makes Hn(r) an isomorphism. Hence r is a quasi-isomorphism before any triangulation of D is used.

F5F6step 1.3
3.1

Put the third localized component equal to Q(r)1Q(m). The two morphisms of triangles in K, with the now invertible comparison Q(r), give all three commuting triangle squares and the shifted first component. Transporting back proves TR3 for the original data.

step 1.3step 2.1algebra
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Localized cone triangles satisfy the octahedral axiom

Statement

The distinguished localized cone triangles in D(A) satisfy TR4, the octahedral axiom, with the cochain shift and connecting signs inherited from K(A).

Facts & Assumptions

Given: An abelian category A, its homotopy category with the stated cochain cone convention, and the localization at quasi-isomorphisms under the standing size hypothesis.

[F1]

Composable localized arrows and their composite can be cleared simultaneously (Finite roof squares and composable pairs can be cleared).

[F2]

The homotopy category is triangulated, so the full octahedral axiom holds there (The homotopy category of an abelian category is triangulated).

[F3]

The localized triangles satisfy TR1, signed TR2 and TR3 (Localized cone triangles satisfy tr one through tr three).

Proof

1.1

Clear a composable pair α:QXQY, β:QYQZ simultaneously to ordinary f:XY, g:YZ, using denominator isomorphisms of the objects. This includes zero maps or identity maps. Their composite becomes gf.

F1
1.2

Apply TR4 in K(A) to f,g, using cone triangles with structure maps if,pf and similarly for g,gf. It gives a:CfCgf and b:CgfCg such that aif=igfg on Y, pgfa=pf, bigf=ig, and pgb=f[1]pgf. In particular CfaCgfbCgif[1]pgCf[1] is distinguished. These equations, rather than the cone objects alone, are the octahedral data.

F2
2.1

Apply the additive functor Q to the entire octahedron: every face equation survives, including Q(if[1]pg)=Q(if)[1]Q(pg), and its fourth triangle is distinguished by definition. Transport along the object isomorphisms from the clearing step.

F3step 1.1step 1.2algebra
3.1

If the three triangles specified in TR4 are other completions, TR3 compares each with the constructed completion with identity first two components. Such a comparison has invertible third component: applying either representable Hom and the exact sequences established from TR1–TR3 proves this by the five-term argument, then the Hom criterion for invertibility. Transport the octahedral maps along these triangle isomorphisms. This gives TR4 for the originally prescribed completions with all signs unchanged.

F3step 2.1algebra
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07 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 derived category inherits a triangulated structure

Statement

The derived category, with shift [1] and distinguished triangles the isomorphic images of cone triangles, is triangulated. The localization functor Q is exact. Every such triangle gives a long exact cohomology sequence Hn(X)Hn(Y)Hn(Z)Hn+1(X).

Facts & Assumptions

Given: An abelian category A, the localization Q:K(A)D(A) under the standing size convention, and the declared class of triangles isomorphic to localized cone triangles.

[F1]

Localized cone triangles satisfy TR1–TR3, with descended shift (Localized cone triangles satisfy tr one through tr three).

[F2]

Localized cone triangles satisfy the octahedral axiom (Localized cone triangles satisfy the octahedral axiom).

[F3]

An exact functor is additive, has a specified shift isomorphism, and sends distinguished triangles to distinguished triangles (Exact functor between triangulated categories).

[F4]

Each Hn:K(A)A factors uniquely through the derived localization (Cohomology factors through the derived category).

[F5]

Every cone triangle in the homotopy category carries the cone long exact homology sequence, and cochain reindexing gives the corresponding long exact cohomology sequence (The cone long exact sequence).

[F6]

The roof localization is additive, with bilinear composition and preservation of zero objects and finite biproducts (Addition of roofs makes an additive localization).

Proof

1.1

The additive structure, shift, TR1, signed TR2 and TR3 have been established, including identity triangles and zero objects. TR4 has also been established. These are precisely the triangulated-category axioms.

F1F2F6
2.1

The functor Q is additive, its shift comparison is the identity in the roof model, and it takes every cone triangle to a distinguished triangle by definition. It is therefore exact. By [F4], the cohomology functors are defined on D(A), and on a localized cone triangle their maps are the maps in the cone long exact sequence [F5]. Transporting this sequence by a triangle isomorphism preserves exactness, proving the assertion for every distinguished triangle.

F1F3F4F5F6algebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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 derived category is the verdier quotient by acyclic complexes

Statement

Let Kac(A) be the thick full subcategory of acyclic complexes. Define its Verdier quotient here by inverting maps whose cones are acyclic. Under the standing size assumption this quotient is D(A). An exact functor F:K(A)T annihilating acyclic complexes factors uniquely through an exact functor F:D(A)T; conversely any such factorization annihilates acyclics. The kernel of Q is exactly Kac(A).

Facts & Assumptions

Given: Let Kac(A) be the thick full subcategory of acyclic complexes. Define its Verdier quotient here by inverting maps whose cones are acyclic. Under the standing size assumption this quotient is D(A). An exact functor F:K(A)T annihilating acyclic complexes factors uniquely through an exact functor F:D(A)T; conversely any such factorization annihilates acyclics. The kernel of Q is exactly Kac(A).

[F1]

The acyclic complexes form a thick full subcategory of the homotopy category (The full subcategory of acyclic complexes is thick in the homotopy category).

[F2]

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

[F3]

The derived category is triangulated and its localization functor is exact (The derived category inherits a triangulated structure).

[F4]

A complex is zero in the derived category exactly when it is acyclic (A complex is zero in the derived category exactly when it is acyclic).

[F5]

Both representable Hom sequences of a distinguished triangle are exact (Long exact Hom sequences of a distinguished triangle).

Proof

1.1

The acyclic subcategory is thick, and a map has acyclic cone exactly when it is a quasi-isomorphism. Thus the indicated quotient inverts precisely the denominators used to construct D(A), with its proved triangulation. Its kernel is precisely the complexes with zero cohomology, including the zero complex.

F1F2F3F4
2.1

If exact F kills acyclics, a denominator triangle becomes F(X)F(s)F(Y)0F(X)[1]. Hom exactness implies Hom(W,F(s)) is bijective for every W. Taking W=F(Y) supplies a right inverse; injectivity at W=F(X) shows it is also a left inverse. Thus F(s) is invertible and localization gives a unique factorization.

F5step 1.1algebra
3.1

Its additivity follows from the common-denominator sum formula and additivity of F. The shift comparison descends by naturality for inverse denominators. Each distinguished triangle is an isomorphic image of a K triangle, so its image under F is distinguished because F is exact. Conversely any exact factor through Q takes an acyclic to the image of a zero object, hence to zero.

F3step 1.1step 2.1algebra
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Homotopically projective bounded above complex

Definition

For cochain complexes put Homr(P,A)=nHomA(Pn,An+r), with (du)n=dAun(1)run+1dP. This is the reindexing of The Hom complex of chain complexes. A complex P is homotopically projective, or K-projective, if HomK(P,A[r])=0 for every acyclic complex A and every integer r. Equivalently Hom(P,A) is acyclic: the degree-zero Hom/homotopy identification of Hom in the homotopy category is zero-degree homology of the Hom complex, applied after shifting A, identifies these groups with its cohomology (a boundary differs only by the invertible sign (1)r).

The bounded-above case additionally requires Pn=0 for all sufficiently large n, as in Bounded, bounded below, and bounded above complexes. Boundedness is not part of the general K-projective predicate. Nor is termwise projectivity: a contractible complex has zero Hom from it in K and is K-projective irrespective of its terms.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Homotopically injective bounded below complex

Definition

A cochain complex I is homotopically injective, or K-injective, if HomK(A,I[r])=0 for every acyclic cochain complex A and every integer r. Equivalently, Hom(A,I) is acyclic. This uses the Hom complex and shifted Hom identification fixed in Homotopically projective bounded above complex. A bounded-below K-injective complex additionally has In=0 for all sufficiently negative n. The K-injective property itself neither assumes boundedness nor means termwise injectivity.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A bounded above complex of projectives is homotopically projective

Statement

A bounded-above cochain complex P of projective objects is K-projective. Assume dependent choice for the countable successive homotopy choices, or supply those lifts as data.

Facts & Assumptions

Given: A bounded-above cochain complex P of projective objects is K-projective. Assume dependent choice for the countable successive homotopy choices, or supply those lifts as data.

[F1]

K-projectivity means vanishing of Hom in the homotopy category into every shift of every acyclic complex (Homotopically projective bounded above complex).

[F2]

A projective object lifts maps through every epimorphism (Projective object).

[F3]

DC supplies a sequence through an entire relation on a nonempty set from a prescribed starting point (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

1.1

Let A be acyclic and f:PA a chain map; shifting the target will give the same argument for any A[r]. Choose an upper bound b for P, and set hn=0 for n>b. We seek hn:PnAn1 satisfying fn=dAn1hn+hn+1dPn. The zero complex permits all choices to be zero.

F1given
2.1

Suppose the equation holds in degrees above n. Put un=fnhn+1dPn. The chain-map equation and the equation at n+1 give dAnun=0. Acyclicity makes An1Zn(A) epic, so projectivity of Pn lifts un to hn. This establishes the equation in degree n, including the initial degree b.

F2step 1.1algebra
3.1

The partial homotopies form a nonempty set of finite sequences of maps (all relevant Hom collections are sets), with an entire extension relation. DC, or the supplied successive lifts, gives the infinite descending homotopy. Thus every PA[r] is nullhomotopic for every r, which is K-projectivity. The recursion requires an upper bound; no assertion for arbitrary unbounded projectives follows.

F1F3step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A bounded below complex of injectives is homotopically injective

Statement

A bounded-below cochain complex I of injective objects is K-injective. Assume dependent choice for the countable successive homotopy extensions, or supply those extensions as data.

Facts & Assumptions

Given: A bounded-below cochain complex I of injective objects is K-injective. Assume dependent choice for the countable successive homotopy extensions, or supply those extensions as data.

[F1]

An injective object extends maps from a subobject to the ambient object (Injective object).

[F2]

K-injectivity is vanishing of Hom from every acyclic complex into every shift of the target (Homotopically injective bounded below complex).

[F3]

Proof

1.1

Let A be acyclic and f:AI a chain map. Choose a with In=0 for n<a and set hn:AnIn1 equal to zero for na. The equation fn=dIhn+hn+1dA holds below a. In particular it is valid for zero complexes.

givenalgebra
2.1

If the equation holds below n, then un=fndIn1hn vanishes on imdAn1 by the chain-map identity. Since A is acyclic this image equals kerdAn, so un factors through imdAnAn+1. Injectivity of In extends it to hn+1:An+1In. This establishes the equation in degree n.

F1step 1.1algebra
3.1

Apply DC to the set of finite partial homotopies with the entire extension relation, or take the supplied successive extensions. The resulting homotopy makes f zero in K. Apply the same argument to every shift I[r], which remains bounded below and termwise injective. This is the K-injective condition.

F2F3step 2.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Morphisms from a homotopically projective complex need no roof

Statement

For a K-projective complex P and any complex X, Q:HomK(P,X)HomD(P,X) is bijective, under the standing localization size convention.

Facts & Assumptions

Given: For a K-projective complex P and any complex X, Q:HomK(P,X)HomD(P,X) is bijective, under the standing localization size convention.

[F1]

K-projectivity annihilates Hom into all acyclic shifts (Homotopically projective bounded above complex).

[F2]

The cone of a quasi-isomorphism is acyclic (A chain map is a quasi-isomorphism exactly when its cone is acyclic).

[F3]

Both representable Hom sequences of a distinguished triangle are exact (Long exact Hom sequences of a distinguished triangle).

[F4]

In the derived localization every morphism is represented by a roof, and for parallel ordinary arrows b,c:PX, equality Q(b)=Q(c) holds exactly when bv=cv after precomposition by some quasi-isomorphism v:VP (Derived category of an abelian category, The calculus of fractions constructs the localization).

Proof

1.1

For a quasi-isomorphism s:UV its cone C is acyclic. The exact sequence HomK(P,C[1])HomK(P,U)HomK(P,V)HomK(P,C) has zero outer terms. Thus postcomposition by s is bijective, including when P or either Hom group is zero.

F1F2F3
2.1

Represent an arrow from P by PsUfX. The previous bijection supplies a unique a:PU in K with sa=1P, so the roof equals Q(fa). If Q(b)=Q(c) for b,c:PX, equality detection gives v:VP a quasi-isomorphism with bv=cv; take a:PV with va=1P to get b=c. This proves surjectivity and injectivity.

F4step 1.1algebra
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Morphisms into a homotopically injective complex need no roof

Statement

For a K-injective complex I and any complex X, Q:HomK(X,I)HomD(X,I) is bijective. Moreover, if s:IJ is a quasi-isomorphism, its cone triangle is split in K: JICone(s) with s corresponding to the inclusion.

Facts & Assumptions

Given: For a K-injective complex I and any complex X, Q:HomK(X,I)HomD(X,I) is bijective. Moreover, if s:IJ is a quasi-isomorphism, its cone triangle is split in K: JICone(s) with s corresponding to the inclusion.

[F1]

K-injectivity annihilates Hom from every acyclic complex into each shift of I (Homotopically injective bounded below complex).

[F2]

The cone of a quasi-isomorphism is acyclic (A chain map is a quasi-isomorphism exactly when its cone is acyclic).

[F3]

Both representable Hom sequences of a distinguished triangle are exact (Long exact Hom sequences of a distinguished triangle).

[F4]

The derived category has both roof presentations and denominator detection of equality (Derived category of an abelian category).

Proof

1.1

For any quasi-isomorphism s:UV, the cone and its shifts are acyclic. Apply HomK(,I) to its triangle: the two adjacent cone Hom groups vanish by K-injectivity. Thus precomposition by s gives a bijection HomK(V,I)HomK(U,I). This includes all zero objects.

F1F2F3
2.1

Given a left roof XsUfI, the bijection gives a unique b:XI with bs=f in K, so the roof equals Q(b). An equality Q(b)=Q(c) is witnessed by bs=cs for a denominator s and the same bijection gives b=c. Equivalently a right-roof denominator out of I has a retraction and therefore also eliminates the roof.

F4step 1.1algebra
2.2

For s:IJ the bijection gives r:JI with rs=1I in K. Let C=Cone(s) and let p:CI[1] be its projection. K-injectivity gives p=0 in K. Hom exactness supplies v:CJ with iv=1C, where i:JC. Replace v by vsrv, so also rv=0. Then 1Jsrvi is killed by i and hence factors as su by Hom exactness. Applying r gives u=0. Consequently (s,v):ICJ and (r,i) are inverse in K.

F1F3step 1.1algebra
3.1

The cone signs can also be checked on matrices. Choose a representative homotopy rs1I=dIh+hdI. The degree-minus-one map H:CnI[1]n1 given by H(j,x)=rj+hx satisfies dI[1]H+HdC=p. Thus the split connecting map is zero with the specified cone convention, rather than after an unrecorded change of sign.

step 2.2algebra
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Brutal truncation of a complex

Definition

For a cochain complex X and nZ, the brutal truncations are (σnX)i=Xi for in and zero otherwise, and (σnX)i=Xi for in and zero otherwise. Retain the differentials between retained terms and use zero for all other differentials. The former is a quotient XσnX; the latter is a subcomplex σnXX. These are functorial constructions of cochain complexes as in Cochain complex in an abelian category; no kernel or cokernel correction is made at the cut.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Canonical truncation of a complex

Definition

For a cochain complex X, define the canonical truncations by

(τnX)i={Xii<n,kerdXni=n,0i>n,(τnX)i={0i<n,cokerdXn1i=n,Xii>n.

The differential into kerdXn is the factorization of dXn1; the differential out of cokerdXn1 is induced by dXn. All other retained differentials are those of X. There are natural maps τnXXτnX. Unlike Brutal truncation of a complex, these constructions correct the boundary using the cycle and boundary objects of Cohomology object of a cochain complex.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Canonical truncation is a complex and has the claimed cohomology

Statement

Canonical truncations are functorial on complexes and on the homotopy category, with Hi(τnX)=Hi(X) for in and zero for i>n, and Hi(τnX)=Hi(X) for in and zero for i<n. They preserve quasi-isomorphisms and descend to functors on the derived category.

Facts & Assumptions

Given: Canonical truncations are functorial on complexes and on the homotopy category, with Hi(τnX)=Hi(X) for in and zero for i>n, and Hi(τnX)=Hi(X) for in and zero for i<n. They preserve quasi-isomorphisms and descend to functors on the derived category.

[F1]

Canonical upper truncation uses the kernel at its cut, and lower truncation uses the cokernel at its cut (Canonical truncation of a complex).

Proof

1.1

Since dndn1=0, the prescribed factors through the kernel and cokernel exist. Their adjacent composites are zero by the same equation, while all other composites are unchanged or zero. Maps of complexes preserve kernels and images, hence induce the truncation maps and preserve identities and composition. This also gives zero truncations of the zero complex.

F1algebra
1.2

For the upper truncation the cycles in degree n are kerdXn and the boundaries are imdXn1; degree n1 has the same kernel because the target inclusion is monic. Other retained degrees are unchanged. For the lower truncation the kernel at n is (kerdXn)/(imdXn1) and there are no incoming boundaries; in degree n+1 the boundary image is unchanged because the map to the cokernel is epic. Deleted degrees have zero cohomology.

F1algebra
1.3

If fg=dh+hd, truncate h unchanged where both adjacent terms remain. For τn restrict hn to kerdXn and set higher components to zero; the homotopy identity at the boundary holds because dXn vanishes there. For τn compose hn+1 with the quotient onto the target cokernel and set lower components to zero; the degree-n identity follows modulo target boundaries. Thus homotopic maps remain homotopic.

F1algebra
2.1

The cohomology formulas imply that truncating a quasi-isomorphism is a quasi-isomorphism in every retained or deleted degree. Composing truncation on K with localization therefore inverts denominators, and the localization universal property descends it to D. The natural truncation maps descend as well.

step 1.2step 1.3algebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Canonical truncations fit a distinguished triangle

Statement

Every short exact sequence 0AiBqC0 of cochain complexes gives a natural distinguished triangle ABCA[1] in D(A). In particular, for every integer n there are canonical distinguished triangles

τnXXτn+1X(τnX)[1],

τnXτn+1XHn+1(X)[n1](τnX)[1],

Hn(X)[n]τnXτn+1XHn(X)[n+1].

Facts & Assumptions

Given: Every short exact sequence 0AiBqC0 of cochain complexes gives a natural distinguished triangle ABCA[1] in D(A). In particular, for every integer n there are canonical distinguished triangles

τnXXτn+1X(τnX)[1],

τnXτn+1XHn+1(X)[n1](τnX)[1],

Hn(X)[n]τnXτn+1XHn(X)[n+1].

[F1]

Canonical truncations preserve the stated cohomology degrees and give natural truncation maps (Canonical truncation is a complex and has the claimed cohomology).

[F2]

The derived category is triangulated, its localization is exact, and images of cone triangles are distinguished (The derived category inherits a triangulated structure).

[F3]

A short exact sequence of complexes in an abelian category gives a long exact homology sequence (The long exact sequence in homology).

Proof

1.1

Define e:Cone(i)C by e(b,a)=q(b). It is a termwise epimorphic complex map. Its kernel identifies with Cone(1A) via (a,a)(i(a),a); the homotopy h(a,a)=(0,a) contracts this kernel, including when A=0. The long exact sequence for kernel, cone and quotient makes e a quasi-isomorphism.

F3algebra
2.1

The cone triangle is distinguished and Q(e) is invertible. Transporting it gives the short-exact-sequence triangle with connecting map Q(p)Q(e)1, where p(b,a)=a maps to A[1]. A map of short exact sequences induces (b,a)(vb,ua) on cones, commuting with e and p; this proves naturality with the stated signs.

F2step 1.1algebra
3.1

Apply this construction to 0τnXXR0. The quotient has Rn=Xn/kerdnimdn, Ri=Xi for i>n and zero below. The natural Rτn+1X is zero at n, the quotient at n+1, and identity above. Its kernel is the two-term identity complex on imdn, so it is a quasi-isomorphism. This yields the first triangle.

F1step 2.1algebra
4.1

Apply the first triangle to τn+1X at cut n; its lower tail has just Hn+1(X) in degree n+1. Apply it to τnX at cut n; its upper head is just Hn(X) in degree n. The cohomology formulas and natural comparison maps identify the remaining truncations, giving the second and third triangles.

F1step 3.1algebra
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Bounded derived localizations embed fully faithfully

Statement

The canonical functors D(A),D+(A),Db(A)D(A) are fully faithful and exact. Their essential images consist exactly of complexes with cohomology respectively bounded above, bounded below, or bounded on both sides.

Facts & Assumptions

Given: An abelian category A and the four derived localizations under their standing size hypotheses.

[F1]

Canonical truncations preserve cohomology on their retained sides (Canonical truncation is a complex and has the claimed cohomology).

[F2]

Bounded derived categories are initially localizations of termwise bounded homotopy categories with both roof orientations (Derived category of an abelian category).

[F3]

The derived category has cone triangulation and long exact cohomology sequences (The derived category inherits a triangulated structure).

Proof

1.1

If cohomology vanishes above b, the map τbXX is a quasi-isomorphism. If it vanishes below a, XτaX is one. When both bounds hold take ab and combine them, obtaining a zigzag to τaτbX, which is termwise bounded. Acyclic and zero complexes allow any such bounds.

F1
1.2

For termwise bounded-above endpoints, any left-roof vertex is cohomologically bounded above, so replace it by its upper canonical truncation. This proves fullness from D. To test equality, first put two roofs at a common vertex and then use an equalizing denominator; upper-truncate this witness too. The equality already holds in D. For bounded-below endpoints use right roofs and lower truncation of the target vertices and equality witnesses.

F1F2algebra
2.1

For bounded endpoints first work in D, as just proved. Use right roofs there and lower-truncate their vertices and equality witnesses; they remain bounded above, so are now bounded. This proves full faithfulness of DbDD. The cohomology functors show that every object in each essential image has the claimed bounds, while step 1.1 proves the reverse inclusion.

F1F2step 1.1step 1.2
3.1

Shifts and cones preserve each cohomological boundedness condition by the long exact sequence. Cone triangles in the bounded models map to cone triangles in D, so each inclusion is exact and the described full subcategories are triangulated.

F3step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Bounded above complexes admit projective replacements

Statement

If A has enough projectives and Xn=0 for n>b, there is a termwise epic quasi-isomorphism p:PX with each Pn projective and Pn=0 for n>b. Assume DC for the successive objectwise choices, or supply the successive projective epimorphisms. If only Hn(X)=0 for n>b, a quasi-isomorphism with this upper bound still exists, without the termwise-epic assertion.

Facts & Assumptions

Given: If A has enough projectives and Xn=0 for n>b, there is a termwise epic quasi-isomorphism p:PX with each Pn projective and Pn=0 for n>b. Assume DC for the successive objectwise choices, or supply the successive projective epimorphisms. If only Hn(X)=0 for n>b, a quasi-isomorphism with this upper bound still exists, without the termwise-epic assertion.

[F1]

Enough projectives means every object is a quotient of a projective (A category with enough projectives and with enough injectives).

[F2]

The pullback of an epimorphism in an abelian category is an epimorphism (The pullback of an epimorphism is an epimorphism).

[F3]
[F4]

Upper canonical truncation preserves cohomology through its cut and kills higher cohomology (Canonical truncation is a complex and has the claimed cohomology).

Proof

1.1

Start with Pj=0 for j>b; this includes X=0. At stage n maintain the complex and map in degrees jn, epic terms, an epimorphism Zn(P)Zn(X), and cohomology isomorphisms above n. The initial stage n=b+1 has these properties.

givenalgebra
2.1

Form E=Xn1×Zn(X)Zn(P), where Xn1Zn(X) is its differential. Choose a projective epimorphism Pn1E. Its two components define pn1 and dPn1, giving pndPn1=dXn1pn1 and dPndPn1=0. The projection EXn1 is epic by pullback stability, hence so is pn1.

F1F2step 1.1
3.1

The subobject of E with second coordinate zero is Zn1(X); its inverse image in Pn1 is exactly Zn1(P). Pullback stability therefore makes the map on cycles epic. Moreover the image of dPn1 is precisely the inverse image of Bn(X) inside Zn(P): this follows by pulling the epimorphism Xn1Bn(X) back along Zn(P)Zn(X). Consequently Hn(P)Hn(X) is an isomorphism. Higher degrees stay fixed.

F2step 2.1algebra
4.1

These stages have extensions at every step. For a definable class of possible object choices, first make a set of admissible partial constructions: starting with the initial node, bound ranks of extensions of each node by the least rank with an extension, use Replacement to bound these ranks over each set of nodes, and take all extensions within that bound. The union over the countably many stages is a set with an entire extension relation. DC gives a branch, or supplied epimorphisms give it directly. Every degree stabilizes after finitely many stages and step 3.1 proves that the resulting map is a quasi-isomorphism. This is objectwise existence, not a class-indexed replacement assignment.

F3step 2.1step 3.1
5.1

Under a cohomological upper bound, first replace X by τbX. Its natural map to X is a quasi-isomorphism; compose with the construction above. The kernel term at the cut explains why the composite need not be epic onto Xb.

F4step 4.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Bounded below complexes admit injective replacements

Statement

If A has enough injectives and Xn=0 for n<a, there is a termwise monic quasi-isomorphism j:XI with each In injective and In=0 for n<a. Assume DC for the successive objectwise choices, or supply the successive injective monomorphisms. If only Hn(X)=0 for n<a, a quasi-isomorphism to such an I still exists, without the termwise-monic assertion.

Facts & Assumptions

Given: If A has enough injectives and Xn=0 for n<a, there is a termwise monic quasi-isomorphism j:XI with each In injective and In=0 for n<a. Assume DC for the successive objectwise choices, or supply the successive injective monomorphisms. If only Hn(X)=0 for n<a, a quasi-isomorphism to such an I still exists, without the termwise-monic assertion.

[F1]

Enough injectives means every object embeds in an injective (A category with enough projectives and with enough injectives).

[F2]

The pushout of a monomorphism in an abelian category is a monomorphism (The pushout of a monomorphism is a monomorphism).

[F3]

DC supplies successive choices on a nonempty set with an entire extension relation (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F4]

Lower canonical truncation preserves cohomology at and above the cut and kills lower cohomology (Canonical truncation is a complex and has the claimed cohomology).

Proof

1.1

Start with Ij=0 below a. Maintain the complex and monic map through degree n, cohomology isomorphisms below n, and a monomorphism cokerdXn1cokerdIn1. At n=a1 all these data are zero.

givenalgebra
2.1

Form the pushout E=Xn+1⨿cokerdXn1cokerdIn1, using the map to Xn+1 induced by dXn. Choose EIn+1 injective. The component Xn+1In+1 is monic by pushout stability, and IncokerdIn1In+1 is the differential. The square commutes and consecutive differentials compose to zero.

F1F2step 1.1
3.1

The pushout kernel and cokernel identities give a monomorphism on the next cokernels and an isomorphism on Hn: explicitly this is the arrow-reversal of the pullback identities for cycles and boundaries, with kernels exchanged for cokernels, epis for monos, and degree n exchanged for n. The pushout identifies the quotient of the new ambient cokernel by the old one with the corresponding quotient for X; its kernel identity gives equality of the remaining cohomology subquotients. Thus the maintained conditions hold at n+1.

F2step 2.1algebra
4.1

DC produces the ascending sequence of stages, or the supplied embeddings do. If object choices form a definable class, recursively bound ranks of extensions of each node by the least rank admitting one, bound over the set of nodes using Replacement, and take the set of all bounded extensions at the next stage. The union of these stage sets is a set to which DC applies. Every fixed degree then stabilizes and its cohomology comparison is an isomorphism. Finally XτaX handles a merely cohomological lower bound before this construction. No class-indexed choice of IX is inferred.

F3F4step 3.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Projective complexes model the bounded above derived category

Statement

With supplied bounded-above projective replacements pX:PXX (and DC or supplied homotopy lifts), the functor K(ProjA)D(A) is an equivalence of triangulated categories with a quasi-inverse determined by those data. In particular its Hom collections are sets whenever A is locally small.

Facts & Assumptions

Given: With supplied bounded-above projective replacements pX:PXX (and DC or supplied homotopy lifts), the functor K(ProjA)D(A) is an equivalence of triangulated categories with a quasi-inverse determined by those data. In particular its Hom collections are sets whenever A is locally small.

[F1]

A bounded-above projective complex is K-projective under DC or supplied lifts (A bounded above complex of projectives is homotopically projective).

[F2]

Hom out of a K-projective needs no roof (Morphisms from a homotopically projective complex need no roof).

[F3]

Enough projectives gives an objectwise bounded-above replacement under DC or supplied epimorphisms (Bounded above complexes admit projective replacements).

[F4]

Bounded derived localizations embed fully faithfully and exactly (Bounded derived localizations embed fully faithfully).

Proof

1.1

Every bounded-above projective complex is K-projective. The no-roof theorem and the fully faithful bounded embedding identify its Hom in K with Hom in D. This proves full faithfulness, including the zero complex.

F1F2F4
2.1

Enough projectives gives objectwise replacements under the stated choice hypothesis; here pX are supplied simultaneously. Put R(X)=PX. For u:XY in D, full faithfulness gives a unique homotopy class R(u):PXPY with Q(R(u))=Q(pY)1uQ(pX). Uniqueness gives identity and composition laws. The maps Q(pX) and their unique lifts provide the natural isomorphisms for a quasi-inverse.

F3step 1.1algebra
3.1

Finite sums of projectives are projective by lifting their component maps. Hence shifts and cones of maps of bounded-above projectives stay in the model. Its cone triangulation is the restricted one from K; the inclusion is exact. A triangle transported by R is isomorphic to a model cone triangle: lift its first arrow, take its cone, and use TR3 plus the two-isomorphism argument to compare completions. Thus the equivalence is exact. Its Hom sets are the ordinary homotopy-class quotients of sets of complex maps.

F4step 1.1step 2.1algebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Injective complexes model the bounded below derived category

Statement

With supplied bounded-below injective replacements jX:XIX (and DC or supplied homotopy extensions), K+(InjA)D+(A) is an equivalence of triangulated categories. For a bounded-below complex I, K-injectivity can be tested using only bounded-below acyclic inputs.

Facts & Assumptions

Given: With supplied bounded-below injective replacements jX:XIX (and DC or supplied homotopy extensions), K+(InjA)D+(A) is an equivalence of triangulated categories. For a bounded-below complex I, K-injectivity can be tested using only bounded-below acyclic inputs.

[F1]

A bounded-below injective complex is K-injective under DC or supplied extensions (A bounded below complex of injectives is homotopically injective).

[F2]
[F3]

Enough injectives gives an objectwise bounded-below injective replacement under DC or supplied embeddings (Bounded below complexes admit injective replacements).

[F4]

Canonical truncation realizes the fully faithful bounded embeddings and their cohomological essential images (Bounded derived localizations embed fully faithfully).

Proof

1.1

Bounded-below injective complexes are K-injective; their Hom groups into each other agree in K and D by the no-roof theorem and in D+ by its fully faithful embedding. This proves full faithfulness, including the zero complex.

F1F2F4
2.1

Enough injectives supplies objectwise replacements under the stated choices. For the simultaneously supplied jX, assign R(X)=IX and let R(u) be the unique homotopy class whose image is Q(jY)uQ(jX)1. Full faithfulness proves functoriality and the quasi-inverse identities. Finite sums, cones and shifts stay in bounded-below injectives; cone triangles therefore give exactness of the equivalence, by lifting first arrows and comparing triangle completions.

F3F4step 1.1algebra
3.1

For the testing assertion suppose Ij=0 below a. Fix an acyclic A and an integer r. The three terms in degrees r1,r,r+1 of Hom(A,I), and their differentials, depend only on terms of A strictly above c=ar3. Thus replacing A by τcA leaves these terms and maps unchanged: any factor involving the modified cut has target Ij=0. This truncation is bounded below and acyclic. Its Hom cohomology in degree r vanishes by the restricted test, so the original Hom cohomology does too. Since r was arbitrary, I is K-injective. The converse is immediate by restricting the acyclic inputs.

F4algebra
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07 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.

Ext is hom in the derived category

Statement

Assume the Axiom of Dependent Choice. Let M,N be objects of an abelian category and n0. With enough projectives and supplied projective resolutions, or with enough injectives and supplied injective resolutions, there is a natural isomorphism Extn(M,N)HomD(A)(M[0],N[n]). The Ext group is the classical construction relative to the supplied data. Either resolution hypothesis suffices; when both apply the two comparisons agree through the mixed Hom complex.

Facts & Assumptions

Given: The Axiom of Dependent Choice, objects M,N of an abelian category, an integer n0, and one of the two stated supplied one-sided resolution systems.

[F1]

Hom out of a K-projective is computed in the homotopy category (Morphisms from a homotopically projective complex need no roof).

[F2]

Hom into a K-injective is computed in the homotopy category (Morphisms into a homotopically injective complex need no roof).

[F3]

Bounded-above complexes of projectives are K-projective under DC (A bounded above complex of projectives is homotopically projective).

[F4]

Bounded-below complexes of injectives are K-injective under DC (A bounded below complex of injectives is homotopically injective).

[F5]

Hom in the homotopy category is degree-zero homology of the Hom complex (Hom in the homotopy category is zero-degree homology of the Hom complex).

[F6]

Classical projective Ext is cohomology of the resolution Hom complex with differential given by precomposition (Ext via a projective resolution of the first variable).

[F7]

Classical injective Ext is cohomology of the resolution Hom complex with differential given by postcomposition (Ext via an injective resolution of the second variable).

Proof

1.1

In the projective case take PM[0] with Pi=0 for i>0. By [F3], P is K-projective. Replacing the source and removing roofs gives HomD(M,N[n])=HomK(P,N[n]). Reindexing the degree-zero Hom theorem gives the latter as HnHom(P,N). This applies also to M=0 or N=0.

F1F3F5
1.2

In the injective case take N[0]I with Ii=0 below zero. By [F4], I and each shift I[n] are K-injective. Replacing the target and removing roofs gives HomD(M,N[n])=HomK(M,I[n])=HnHom(M,I). Here the differential is exactly the classical injective Ext differential, so no correction is needed.

F2F4F5F7
2.1

The classical projective Ext differential is precomposition with the resolution differential, whereas the cochain Hom differential on degree q maps into N[0] is (1)q+1 times precomposition. Multiplication in degree q by (1)q(q+1)/2 is a complex isomorphism from the classical complex to this Hom complex. It identifies their cohomology in all n0, with sign +1 in degree zero.

F6step 1.1algebra
3.1

For a morphism of objects, the corresponding comparison between their supplied resolutions is the unique homotopy class representing that morphism after localization: existence and uniqueness follow from [F1] on the projective side and [F2] on the injective side. Consequently the Hom identifications are natural in both objects. When both resolutions exist, put T=Hom(P,I). The maps Hom(P,N)THom(M,I) induce cohomology isomorphisms: by [F5], each degree-n map is the map on homotopy Hom, which [F1] or [F2] identifies with composition by the corresponding invertible resolution map in D. Composing this span with the classical-projective sign isomorphism of step 2.1 defines the mixed-complex identification of the two classical Ext constructions. Their maps to derived Hom agree under this identification, since the two localized composites agree. In degree zero every sign is +1 and ordinary morphisms, including identities, are preserved.

F1F2F5step 2.1step 1.2algebra
PropositionStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07 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.

Yoneda product is composition in the derived category

Statement

Assume DC, set-sized extension classes, and enough projectives with supplied resolutions, or dually enough injectives with supplied resolutions. Normalize the image of a short extension to be its connecting arrow in the cone convention of this page, and the image of a higher extension to be the shifted composite of the connecting arrows of its short exact pieces. With this normalization the Yoneda-class bijection is YExtn(M,N)HomD(M,N[n]) for n1. If αYExtp(M,L) and βYExtq(L,N), their splice corresponds to β[p]α:MN[p+q]; degree-zero maps act by pullback and pushout, with identity units.

In particular, for e:0AZB0 and e:0BuZC0, the splice is zero in Ext2(C,A) if and only if there is an extension 0AWZ0 whose pullback along u is e. Equivalently there is a commutative diagram of these two rows, with vertical maps 1A,ZW,u, whose middle and right columns are 0ZWC0 and 0BZC0.

Facts & Assumptions

Given: The Axiom of Dependent Choice, set-sized extension classes, and either enough projectives with supplied resolutions or enough injectives with supplied resolutions; objects and extension classes as in the statement.

[F1]

Classical Ext identifies naturally with derived-category Hom via the chosen one-sided resolutions (Ext is hom in the derived category).

[F2]

A short exact sequence of complexes gives a distinguished triangle via its cone-to-quotient map (Canonical truncations fit a distinguished triangle).

[F4]

Under DC, set-sized extension classes, and the stated one-sided resolution data, higher Yoneda Ext agrees with that classical Ext (Higher Yoneda Ext agrees with derived Ext).

[F5]

Both representable Hom sequences of a distinguished triangle are exact (Long exact Hom sequences of a distinguished triangle).

Proof

1.1

For an extension 0NEn1E0M0, let K0=M, Kn=N, and use its successive images to form short exact sequences ej:0Kj+1EjKj0 for 0j<n. Let bj:KjKj+1[1] be the connecting arrow from [F2]. Define Θ(E)=bn1[n1]b1[1]b0. Naturality of [F2] gives a commuting diagram of these arrows for any map of extensions fixing the endpoints, so Θ is constant on the generated Yoneda equivalence relation. The same naturality gives endpoint pullback and pushout compatibility. Direct sums of the short exact pieces give direct sums of their arrows; diagonal pullback and codiagonal pushout therefore make Θ additive for Baer addition.

F2F4algebra
1.2

Here is the degree-one comparison explicitly in the projective lane. For 0NiEM0, lift P0M to v:P0E and write vd1=ic with c:P1N. The cone of i has N in degree 1, E in degree zero, and differential i. The map PCone(i) with components c,v in degrees 1,0 is a complex map over M. Projection to N[1] gives the cocycle c. Thus the connecting arrow is the roof of c, and in particular is exactly the degree-one map used to define Θ, without an unproved appeal to the abstract Ext/Hom isomorphism. In the injective lane extend NI0 to w:EI0 and factor dw=tq through q:EM. The identity ptq after mapping N[1]I[1] is witnessed on the cone by the homotopy with component w:EI0; hence the connecting arrow is represented by t:MI[1]. This explicit sign is part of our normalization.

F1F2F4algebra
2.1

We verify bijectivity without assuming that an arbitrary natural Ext/Hom identification preserves products. In the projective lane let Kj=ΩjM in the supplied resolution. Exactness of [F5] for K1P0MK1[1] gives HomD(M,N[1]) as the quotient of Hom(K1,N) by restrictions from P0, because positive Ext from the projective P0 vanishes by [F1]. The quotient map sends h to h[1]b0. By the pushout construction in [F4], this is exactly Θ of the pushout extension. In degree n, that same construction identifies Yoneda classes with Hom(Kn,N) modulo restrictions from Pn1: a resolution cocycle factors through Kn, and a coboundary is precisely such a restriction. The degree-one quotient for 0KnPn1Kn10, followed by the connecting isomorphisms HomD(Kj,N[r])HomD(Kj1,N[r+1]) for r>0, identifies this quotient bijectively with HomD(M,N[n]). Each isomorphism follows from [F5] and the vanishing of both adjacent positive Hom groups from Pj1 by [F1]. Their composite is exactly the formula in step 1.1 for the pushout extension.

F1F4F5step 1.1step 1.2algebra
2.2

In the injective lane put C0=N and Cj+1=coker(CjIj) in the supplied coresolution. The dual construction in [F4] identifies degree-n Yoneda classes with Hom(M,Cn) modulo maps factoring through In1Cn. Apply [F5] to Cn1In1CnCn1[1] to identify this quotient with HomD(M,Cn1[1]). The subsequent connecting isomorphisms identify it with HomD(M,N[n]), since both neighboring positive Hom groups into each injective vanish by [F1]. On the pullback extension supplied by [F4], naturality of [F2] makes the composite exactly Θ. Thus the same intrinsic Θ is bijective in either lane, including when both are available.

F1F2F4F5step 1.1algebra
3.1

The short exact pieces of a splice are the pieces of its two factors in order. The definition in step 1.1 therefore gives Θ(βα)=Θ(β)[p]Θ(α), using associativity of composition and [p][q]=[p+q]. This also shows that the bijection is independent of the resolution used to prove its bijectivity. Degree-zero endpoint maps act by pullback and pushout by step 1.1, and identities act as units.

step 1.1step 2.1step 2.2algebra
4.1

Apply HomD(,A[1]) to the triangle BZCB[1] of e. Its connecting arrow is Θ(e) by definition and step 1.2. By [F5] the kernel of the map from HomD(B,A[1]) to HomD(C,A[2]) is the image of restriction from Z; the map is shifted composition with Θ(e), up to an irrelevant overall rotation sign. By step 3.1 its kernel is precisely the zero-splice condition. Bijectivity and pullback naturality of Θ give the asserted extension over Z, in both directions. Its pullback middle object is isomorphic to Z by equivalence of short extensions. The kernel of WZC is that pullback and the composite is epic, yielding 0ZWC0. Conversely exactness of the stated diagram identifies Z with this kernel and hence with the pullback.

F2F5step 1.2step 2.1step 2.2step 3.1algebra
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Canonical t structure on a derived category

Definition

For a triangulated category T with shift [1], a t-structure is a pair of strictly full subcategories (T0,T0) such that T0[1]T0, T0[1]T0, HomT(T0,T1)=0, and every X has a distinguished triangle AXBA[1] with AT0 and BT1. Here T1=T0[1] and Tn=T0[n], Tn=T0[n]. Its heart is T0T0.

For the triangulation of The derived category inherits a triangulated structure, the canonical candidate is D0={X:Hi(X)=0 for i>0} and D0={X:Hi(X)=0 for i<0}, using Cohomology factors through the derived category.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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 canonical pair is a t structure

Statement

The canonical pair is a t-structure on D(A) and on each of D,D+,Db by intersection. More generally if Hi(X)=0 for i>a and Hj(Y)=0 for j<b, then HomD(X,Y[n])=0 for n<ba, and naturally HomD(X,Y[ba])HomA(HaX,HbY).

Facts & Assumptions

Given: The canonical pair is a t-structure on D(A) and on each of D,D+,Db by intersection. More generally if Hi(X)=0 for i>a and Hj(Y)=0 for j<b, then HomD(X,Y[n])=0 for n<ba, and naturally HomD(X,Y[ba])HomA(HaX,HbY).

[F1]

The t-structure axioms consist of shift inclusions, orthogonality, and a decomposition triangle (Canonical t structure on a derived category).

[F2]

Canonical truncations preserve exactly the cohomology degrees on their retained sides (Canonical truncation is a complex and has the claimed cohomology).

[F3]

Canonical truncations fit distinguished triangles (Canonical truncations fit a distinguished triangle).

[F4]

The bounded derived localizations are fully faithful exact subcategories with the specified cohomological supports (Bounded derived localizations embed fully faithfully).

Proof

1.1

Replace Y by τbY and in any left roof out of X replace its vertex L by τaL. These replacements are quasi-isomorphisms, including when all cohomology vanishes. A map LY[n] is zero if n<ba, since every degree has either zero source or zero target.

F2algebra
2.1

At n=ba only degree a can be nonzero. The chain-map equations say exactly that this component kills imdLa1 and lands in kerdY[n]a, so it is a map HaLHbY. Homotopies cannot alter this component: their possibly contributing terms have source above a or target below a. A denominator induces an isomorphism on Ha, so roof refinements give the same map HaXHbY. Conversely such a map defines a chain map from τaX into (τbY)[ba] by quotient then inclusion. The two constructions are inverse, by replacing a roof vertex as in step 1.1; all maps are the specified cohomology maps, hence natural.

F2step 1.1algebra
2.2

The identity Hi(X[1])=Hi+1(X) gives the two shift inclusions. Step 1.1 with a=0,b=1,n=0 gives orthogonality. The triangle τ0XXτ1X gives the required decomposition with the prescribed cohomology supports. These verify all axioms.

F1F2F3step 1.1
3.1

Canonical truncations preserve every one-sided or two-sided cohomological boundedness condition. The bounded embeddings are full and exact, so the same Hom vanishing and the same decomposition triangles lie in each bounded category. This proves the restricted t-structures.

F4step 2.2
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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 heart of the canonical t structure is equivalent to the original abelian category

Statement

The degree-zero functor AD(A) identifies A with the heart of the canonical t-structure. The inverse equivalence is H0.

Facts & Assumptions

Given: The degree-zero functor AD(A) identifies A with the heart of the canonical t-structure. The inverse equivalence is H0.

[F1]

The canonical t-structure has the boundary Hom formula (The canonical pair is a t structure).

[F2]

Canonical truncations have the claimed cohomology and natural maps (Canonical truncation is a complex and has the claimed cohomology).

Proof

1.1

For objects M,N in degree zero the boundary Hom formula with a=b=0 gives HomD(M[0],N[0])=HomA(M,N), and the identification takes a map to its degree-zero cohomology map. This proves full faithfulness, including zero objects and identity maps.

F1
2.1

If X is in the heart, the natural zigzag Xτ0Xτ0τ0X=H0(X)[0] consists of quasi-isomorphisms. It is functorial, and H0(M[0])=M. These natural isomorphisms give the inverse equivalence and essential surjectivity.

F2step 1.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Left total derived functor on the bounded above derived category

Definition

Let A and B be abelian categories and let F:AB be additive. Supply bounded-above projective replacements pX:PXX and the hypotheses for Projective complexes model the bounded above derived category. Write T=QBK(F). The left total derived functor is LF:D(A)D(B) with LF(X)=QBF(PX), its maps obtained from the unique homotopy classes between projective models. Its augmentation is ϵ:LFQAT, induced by F(pX).

The defining universal property is terminal: for every functor G:D(A)D(B) and natural γ:GQAT, there is a unique natural μ:GLF with ϵ(μQA)=γ. Additive has the meaning of Additive functor.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Left total derived functor is independent up to a unique augmentation-compatible natural isomorphism

Statement

Two supplied projective replacement systems for the same additive F give a natural isomorphism of left total derived functors, unique among natural comparisons commuting with the augmentations. This is not uniqueness of unrestricted natural automorphisms.

Facts & Assumptions

Given: Two supplied projective replacement systems for the same additive F give a natural isomorphism of left total derived functors, unique among natural comparisons commuting with the augmentations. This is not uniqueness of unrestricted natural automorphisms.

[F1]

The replacement construction has augmentation QF(pX) (Left total derived functor on the bounded above derived category).

[F2]

Hom out of a K-projective complex needs no roof (Morphisms from a homotopically projective complex need no roof).

Proof

1.1

Write pX:PXX and pX:PXX. The no-roof bijection gives a unique map cX:PXPX in K such that pXcX=pX in K. The opposite comparison is inverse by the same uniqueness. This works for zero complexes and identity replacements. Applying additive F preserves these homotopy identities.

F1F2
2.1

For a derived arrow u:XY the two paths between the chosen projective models have the same localized image, hence coincide in K by the no-roof bijection. Thus QF(cX) is a natural isomorphism commuting with augmentations.

F2step 1.1
3.1

On any projective complex P, the augmentation of either construction is invertible: its replacement map is a homotopy equivalence by step 1.1 applied to the identity replacement. Therefore augmentation compatibility forces a comparison at P to be (ϵP)1ϵP. Naturality along the isomorphism Q(pX):QPXQX then forces its value at every X. This proves precisely the stated uniqueness.

F1step 1.1step 2.1algebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Existence of the bounded above left total derived functor

Statement

For additive F:AB and supplied bounded-above projective replacements with the model-equivalence hypotheses, the replacement construction is a functor LF:D(A)D(B) with the terminal universal property in its definition. Right exactness of F is not needed for existence.

Facts & Assumptions

Given: For additive F:AB and supplied bounded-above projective replacements with the model-equivalence hypotheses, the replacement construction is a functor LF:D(A)D(B) with the terminal universal property in its definition. Right exactness of F is not needed for existence.

[F1]

Supplied projective models and the augmentation specify the left total derived construction (Left total derived functor on the bounded above derived category).

[F2]

Projective replacement comparisons are unique relative to augmentations (Left total derived functor is independent up to a unique augmentation-compatible natural isomorphism).

[F3]

An additive functor induces an exact functor on homotopy categories (An additive functor on abelian categories induces an exact functor on homotopy categories).

Proof

1.1

Compose the supplied quasi-inverse D(A)K(ProjA) with K(F) and QB. These are functors, so this gives LF on all arrows, including identities and zero complexes. The homotopy equality pYu~=upX for an ordinary map makes QF(pX) a natural augmentation.

F1F3
2.1

Given (G,γ), for a projective complex P put μQP=ϵP1γP; the augmentation here is invertible by replacement comparison with PP. For general X define μQX=LF(QpX)μQPXG(QpX)1. This is meaningful since both functors take QpX to isomorphisms. For a derived arrow, lift its conjugate between projective models; naturality of γ on that ordinary homotopy-class map gives naturality of μ after conjugation.

F2step 1.1algebra
3.1

Naturality of ϵ along pX and of γ gives ϵXμQX=γX. Conversely this equation determines μ on projective complexes because ϵP is invertible, and naturality along QpX forces the formula at every object. Thus the universal comparison exists uniquely. All uses of F required only additivity and preservation of homotopies.

step 1.1step 2.1algebra
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Right total derived functor on the bounded below derived category

Definition

Let F:AB be additive and supply bounded-below injective replacements jX:XIX under the hypotheses of Injective complexes model the bounded below derived category. Put T=QBK(F). The right total derived functor is RF:D+(A)D+(B) with RF(X)=QBF(IX) and maps induced by the injective model equivalence. It has coaugmentation η:TRFQA induced by F(jX).

Its universal property is initial: for every G:D+(A)D+(B) and natural γ:TGQA there is a unique natural ν:RFG such that (νQA)η=γ. Here F is additive in the sense of Additive functor.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Existence of the bounded below right total derived functor

Statement

The supplied injective replacement construction for additive F gives RF:D+(A)D+(B) with its initial universal property. It is independent of the replacement system up to unique natural isomorphism compatible with coaugmentations. Before localization in the target it factors through K+(B); its values agree with these models under the bounded embedding into D(B).

Facts & Assumptions

Given: The supplied injective replacement construction for additive F gives RF:D+(A)D+(B) with its initial universal property. It is independent of the replacement system up to unique natural isomorphism compatible with coaugmentations. Before localization in the target it factors through K+(B); its values agree with these models under the bounded embedding into D(B).

[F1]

The injective-model equivalence defines the right total construction and its coaugmentation (Right total derived functor on the bounded below derived category).

[F2]
[F3]

An additive functor induces an exact functor on homotopy categories (An additive functor on abelian categories induces an exact functor on homotopy categories).

Proof

1.1

Compose the supplied injective-model quasi-inverse with K(F) and then QB. This constructs the functor, and also its factorization before QB. The identity u~jX=jYu in K proves naturality of ηX=QF(jX). The construction includes zero complexes.

F1F3
2.1

For a second system jX:XIX, the no-roof bijection supplies a unique homotopy class cX:IXIX with cXjX=jX. The reverse comparison is inverse by uniqueness. The same uniqueness on conjugated derived arrows gives naturality after F. For an injective complex I, jI is therefore a homotopy equivalence and ηI is invertible.

F2step 1.1algebra
3.1

Given (G,γ) put νQI=γIηI1 on injective complexes. On X put νQX=G(QjX)1νQIXRF(QjX). Conjugating any derived arrow to its unique injective-model homotopy class proves naturality. Naturality along jX gives νQXηX=γX. Any such comparison must have the prescribed value on injectives and then on X, so it is unique. Applying this property to two replacement functors proves uniqueness of the isomorphism relative to coaugmentations.

F2step 2.1algebra
4.1

The factorization in step 1.1 takes values in bounded-below complexes because F preserves zero objects. The target localization and then the fully faithful bounded embedding send precisely this complex to its unbounded derived class. Thus the two descriptions agree; neither asserts an unbounded injective replacement theorem.

F1step 1.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Total derived functors send distinguished triangles to distinguished triangles

Statement

The bounded total derived functors LF and RF are exact functors of triangulated categories, with shift comparisons transported through their model equivalences. If F is exact as a functor of abelian categories, its termwise functor already descends to the derived category and the respective derived augmentation or coaugmentation is an isomorphism.

Facts & Assumptions

Given: The bounded total derived functors LF and RF are exact functors of triangulated categories, with shift comparisons transported through their model equivalences. If F is exact as a functor of abelian categories, its termwise functor already descends to the derived category and the respective derived augmentation or coaugmentation is an isomorphism.

[F1]

The left derived functor is the composite through the bounded projective model and K(F) (Existence of the bounded above left total derived functor).

[F2]

The right derived functor is the composite through the bounded injective model and K(F) (Existence of the bounded below right total derived functor).

[F3]

The localization is exact for the derived cone triangulation (The derived category inherits a triangulated structure).

Proof

1.1

In either model, shifts and cones stay in the bounded projective or injective subcategory. Additive F preserves their finite biproduct formulas and signs, hence their cone triangles and shift identifications. The model equivalence and the target localization are exact, so their composite sends every distinguished triangle to a distinguished triangle. This includes split triangles and zero objects.

F1F2F3
2.1

If F is exact, it preserves the kernel-image sequences defining cohomology, giving Hn(FX)F(HnX). Consequently it preserves quasi-isomorphisms, so termwise F descends by localization. In particular each F(pX) or F(jX) is a quasi-isomorphism, making the derived comparison invertible. This verifies the asserted comparison without an extra exactness hypothesis in the existence theorem.

F1F2step 1.1algebra
PropositionStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07 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.

Classical derived functors are the cohomology objects of the total derived functor

Statement

Assume the Axiom of Dependent Choice. Let F:AB be additive between abelian categories. On the left assume enough projectives and supplied bounded-above projective replacements, and on the right enough injectives and supplied bounded-below injective replacements. On the respective domains D(A) and D+(A), Hn(LF(M[0]))=LnF(M) and Hn(RF(M[0]))=RnF(M) for n0, relative to the same resolution data, naturally. To compare the classical cycle-lifting connecting maps with the triangle connecting maps for the page's cone convention, multiply these degree-n identifications by (1)n; the resulting natural isomorphisms commute with connecting maps. The left comparison with F in degree zero is an isomorphism when F is right exact; the right comparison is an isomorphism when F is left exact. Conversely such a natural degree-zero comparison isomorphism forces that side-exactness.

The functor LF preserves upper cohomological bounds and RF preserves lower bounds. The truncation maps induce HiLF(X)HiLF(τaX) for ia, and HiRF(τaX)HiRF(X) for ia. On objects of A, H0LF is right exact and H0RF is left exact.

For left exact F, call M right F-acyclic when F(M)[0]RF(M[0]) is invertible. This holds iff RnF(M)=0 for all n>0. In 0ABC0, right acyclicity of (A,C) implies that of B; that of (A,B) implies that of C; that of (B,C) together with epic F(B)F(C) implies that of A. In each case 0F(A)F(B)F(C)0 is exact. Dually, for right exact F, left acyclicity is equivalent to LnF(M)=0 for n>0: the pairs (A,C) and (B,C) imply respectively B and A, while (A,B) implies C provided F(A)F(B) is monic, again with the resulting short exact sequence. Under DC, both supplied object-resolution data, and the respective enough-projective/right-exact or enough-injective/left-exact hypotheses, these are the classical universal delta functors.

Facts & Assumptions

Given: The Axiom of Dependent Choice, abelian source and target categories, an additive functor F, and the stated supplied projective or injective replacement data.

[F1]

The left total construction uses supplied bounded-above projective models (Existence of the bounded above left total derived functor).

[F2]

The right total construction uses supplied bounded-below injective models (Existence of the bounded below right total derived functor).

[F3]

Classical left derived objects are homology of the image of the supplied deleted resolution (Left derived objects relative to supplied projective resolution data).

[F4]

Classical right derived objects are cohomology of the image of the supplied deleted resolution (Right derived objects relative to supplied injective resolution data).

[F5]

Under DC and both supplied data, the respective exactness and enough-objects hypotheses give universal classical delta functors (Derived functors are universal delta functors).

[F6]

Total derived functors preserve distinguished triangles (Total derived functors send distinguished triangles to distinguished triangles).

[F7]

Given projective resolutions of the endpoints of a short exact sequence, the projective horseshoe lemma supplies a degreewise split short exact sequence of resolutions; dually the injective horseshoe lemma supplies injective resolutions with biproduct middle terms (The horseshoe lemma for projective resolutions, The horseshoe lemma for injective resolutions).

[F8]

The opposite category is abelian (The opposite of an abelian category is abelian).

[F9]

Replacements can retain any given cohomological upper or lower bound (Bounded above complexes admit projective replacements, Bounded below complexes admit injective replacements).

[F10]

Short exact sequences and canonical truncations give distinguished triangles (Canonical truncations fit a distinguished triangle).

Proof

1.1

For M[0] choose a resolution supported in degrees 0 on the projective side or 0 on the injective side. Up to the comparison homotopy equivalence with the supplied replacement, the model complex is precisely the image of the deleted classical resolution, after Pn=Pn. Its cohomology is therefore exactly the stated classical derived object, including M=0 and n=0. Comparison maps are the same homotopy classes on both constructions.

F1F2F3F4
1.2

A complex with cohomology below a zero admits an injective model zero below a; its image under F retains this support. The projective construction gives the dual upper-bound assertion. Apply exact RF to the truncation triangle: the tail RF(τa+1X) has zero cohomology in degrees a, and its preceding degree is zero too. The long exact sequence gives the stated isomorphism for ia. The dual argument with the head supported at most a1 gives the LF isomorphism for ia.

F1F2F6F9F10algebra
2.1

For a short exact sequence choose projective horseshoes using [F7]. For the injective side apply the projective assertion of [F7] to 0CBA0 in the abelian category Aop of [F8]: the supplied injective resolutions become projective resolutions there. Reversing all arrows gives chain maps 0IAJBIC0 and a splitting in every degree. Thus both sides have a degreewise split short exact sequence of resolutions, not merely biproduct middle objects. Applying additive F preserves this splitting. Comparison homotopy equivalences identify the auxiliary middle resolution with the supplied one.

F1F2F7F8step 1.1
3.1

Write either image sequence in cochain form 0EiGqH0. Choose degreewise splittings s:HG and π:GE. The off-diagonal map t=πdGs:HjEj+1 satisfies dGssdH=it and dEt+tdH=0. It induces the classical cycle-lifting boundary [t]. The map HCone(i) given by (s,t) is a complex map, and its composite with e(g,e)=q(g) is identity. Since e is the quasi-isomorphism used in [F10], the triangle arrow pe1 induces [t], with p(g,e)=e. Consequently the identity cohomology identifications intertwine boundaries up to minus one. Multiplication in degree n by (1)n fixes this on both sides: (1)n+1(1)=(1)n on the right and (1)n1(1)=(1)n on the left. The formulas are biproduct-morphism identities, valid in any abelian category. Splitting changes give homotopic maps, and the replacement comparisons are natural, so these are natural comparisons of delta functors with identity comparison at degree zero.

F6F10step 2.1algebra
3.2

On objects the support result and the exact triangle of a short exact sequence give 0H0RF(A)H0RF(B)H0RF(C) and H0LF(A)H0LF(B)H0LF(C)0. Hence these degree-zero functors have the stated side-exactness. If F is left exact, 0F(M)F(I0)F(I1) is exact, identifying F(M) with H0RF(M). Right exactness similarly identifies the cokernel H0LF(M) with F(M). Conversely an isomorphic functor inherits the corresponding exactness.

step 1.1step 2.1step 1.2algebra
4.1

Under the stated side-exactness the comparison already induces an isomorphism in degree zero, and both complexes have zero cohomology on the opposite side. It is therefore a quasi-isomorphism iff all positive right derived objects (or all positive left derived objects) vanish. This proves both implications of each acyclic-object criterion.

step 1.2step 3.2algebra
5.1

In the right-hand long exact sequence 0F(A)F(B)F(C)R1F(A)R1F(B)R1F(C), vanishing for (A,C) gives vanishing for B degree by degree, and vanishing for (A,B) gives vanishing for C. For (B,C) all degrees of A above one vanish and R1F(A)=coker(F(B)F(C)); this is exactly the extra epic condition. Each case also makes the displayed F sequence short exact. Reversing arrows and reindexing gives the three left cases; the last obstruction is L1F(C)=ker(F(A)F(B)).

step 2.1step 4.1algebra
6.1

Finally impose DC and both supplied object-resolution data, exactly as in the published universality theorem, together with the appropriate enough-objects and side-exactness hypothesis. That theorem gives universality of the classical delta functor. The natural object identifications and sign-adjusted connecting comparisons in steps 1.1 and 3.1 transfer it to the cohomology description. No universality assertion with weaker assumptions is inferred from that citation.

F5step 1.1step 3.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Bounded above flat tensor complexes preserve quasi isomorphisms

Statement

Let R be a ring. Tensoring a bounded-above acyclic left R-complex A with a bounded-above complex P of flat right R-modules gives an acyclic total complex. The assertion also holds with the sides exchanged. Thus a bounded-above flat complex preserves quasi-isomorphisms between bounded-above complexes in the other variable. The common two-flat-replacement model gives the balancing isomorphism whenever the replacement maps are supplied.

Facts & Assumptions

Given: Let R be a ring. Tensoring a bounded-above acyclic left R-complex A with a bounded-above complex P of flat right R-modules gives an acyclic total complex. The assertion also holds with the sides exchanged. Thus a bounded-above flat complex preserves quasi-isomorphisms between bounded-above complexes in the other variable. The common two-flat-replacement model gives the balancing isomorphism whenever the replacement maps are supplied.

[F1]

The tensor total differential has the Koszul sign and uses the direct sum over each degree diagonal (The tensor product of a right and a left chain complex is totalized by direct sums with the Koszul differential).

[F2]

Flatness means exactness of tensor on the appropriate module side (Left and right flat modules over an arbitrary ring).

[F3]

A chain map is a quasi-isomorphism iff its cone is acyclic, reindexed here to cochains (A chain map is a quasi-isomorphism exactly when its cone is acyclic).

[F4]

The column assembly lemma concerns exact augmented columns of a first-quadrant double cochain complex (Acyclic assembly by exact columns).

[F5]

The row assembly lemma concerns exact augmented rows of a first-quadrant double cochain complex (Acyclic assembly by exact rows).

Proof

1.1

Use total differential d(xy)=dPxy+(1)ixdAy for xPi. If Pi=0 for i>b and Aj=0 for j>c, put p=bi,q=cj. This is a first-quadrant double chain complex: both differentials lower their new index. Every total degree has a finite diagonal. Each vertical column is exact because Pbp is flat and A is acyclic. Empty diagonals and zero terms contribute zero.

F1F2
2.1

For a cycle of chain total degree k, choose its largest horizontal index p with a nonzero component. Its component at (p,kp) is a vertical cycle, since no component at horizontal index p+1 contributes. Exactness of that column supplies a lift in (p,kp+1) (absorbing the invertible sign (1)bp). Subtract its total boundary. This kills that component and can introduce only one at horizontal index p1. Descending through p,p1,,0 terminates; at zero the extra horizontal term is zero. The cycle is a boundary. The case k<0 has no terms.

step 1.1algebra
3.1

This is the arrow-reversal of the finite-diagonal elimination in the published cochain column-assembly proof, with augmentation zero: reversing arrows in abelian groups interchanges kernels and cokernels, while finite products and sums agree. Interchanging the two indices gives the row version and proves the assertion for a flat left complex as well. The original assembly statements concern first-quadrant cochains; step 2.1 supplies the chain argument explicitly instead of applying those statements outside their domain.

F4F5step 2.1
4.1

For a quasi-isomorphism s, its cone is acyclic and bounded above. Tensoring with a flat complex makes this cone acyclic by step 2.1 or step 3.1. Tensor of the cone identifies with the cone of the tensored map: on a shifted second-factor summand multiply by (1)i for first-factor degree i; a shifted first-factor summand requires no correction. Direct substitution in the differential verifies these signs. The cone criterion proves invariance. For replacements PNN and PMM, both arrows PNPMNPM and PNPMPNM are quasi-isomorphisms. Their localized zigzag is the natural balancing isomorphism.

F3step 2.1step 3.1algebra
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Derived tensor product in the bounded above setting

Definition

For bounded-above right and left R-complexes N and M, supply bounded-above projective replacements PNN and PMM, and the homotopy lifts required for their model functors. The derived tensor product NRLMD(Ab) is the object represented by Tot(PNRM), equivalently Tot(NRPM). If existence of enough module projectives is invoked, assume AC as in Module categories have enough projectives.

Use the cochain reindexing of The tensor product of a right and a left chain complex is totalized by direct sums with the Koszul differential. Projectives are flat by Projective left and right modules are flat over an arbitrary ring. Consequently Bounded above flat tensor complexes preserve quasi isomorphisms gives the natural quasi-isomorphisms PNRPMPNRM and PNRPMNRPM. This fixes the balancing identification. Homotopy comparison maps between projective replacements, as in Existence of the bounded above left total derived functor, induce tensor maps; chain homotopies induce total homotopies with the same Koszul rule. Quasi-isomorphisms in the other variable are inverted by the flat-tensor lemma, so localization gives a bifunctor D(Mod ⁣-R)×D(R ⁣-Mod)D(Ab), independent of the supplied representatives up to these comparisons.

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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 the derived tensor product is tor

Statement

For a right R-module N, a left R-module M, and n0, with supplied projective resolutions, Hn(N[0]RLM[0])TornR(N,M) naturally in both modules.

Facts & Assumptions

Given: For a right R-module N, a left R-module M, and n0, with supplied projective resolutions, Hn(N[0]RLM[0])TornR(N,M) naturally in both modules.

[F1]

The derived tensor is represented using either projective replacement with the two-replacement balancing zigzag (Derived tensor product in the bounded above setting).

[F2]

Balanced Tor is resolution tensor homology, with maps induced by comparison maps (The balanced Tor bifunctor).

Proof

1.1

Represent the derived tensor by NRPM with the projective resolution reindexed by PMi=(PM)i. Its degree n cohomology is exactly Hn(NR(PM)), including n=0 and zero modules.

F1
2.1

This homology is the definition of balanced Tor on the left-resolution side. The common two-resolution tensor complex gives the same balance on the other side, and comparison maps on resolutions induce exactly the maps used in that definition. Thus the identification is natural and compatible with either supplied resolution.

F2step 1.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Derived hom in the bounded setting

Definition

Let MD(A) and ND+(A), with termwise bounded representatives. With supplied bounded-above projective models under Projective complexes model the bounded above derived category, define RHom(M,N)=QHom(PM,N). Alternatively, with supplied bounded-below injective models under Injective complexes model the bounded below derived category, use QHom(M,IN). The target is D+(Ab).

Here the cochain form of The Hom complex of chain complexes has degree-r term iHom(Mi,Ni+r) and differential du=dNu(1)rudM. If Mi=0 above b and Nj=0 below a, nonzero factors require arib, a finite interval, and the whole term is zero for r<ab.

This construction is a bifunctor on the declared derived categories. Indeed homotopies in either variable induce Hom-complex homotopies. Replacing a projective model by a homotopy equivalent one therefore changes its Hom complex by a homotopy equivalence. A quasi-isomorphism in the target has acyclic cone, whose Hom from PM is acyclic by K-projectivity; hence the Hom map is a quasi-isomorphism. This also follows degree by degree from Morphisms from a homotopically projective complex need no roof, which identifies each Hom-complex cohomology with the corresponding derived Hom. The injective argument uses Morphisms into a homotopically injective complex need no roof and reverses the roles of source and target. Thus both variables descend through localization. When both systems exist, the quasi-isomorphisms Hom(PM,N)Hom(PM,IN)Hom(M,IN) give their natural identification. Either one-sided resolution hypothesis suffices.

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Cohomology of derived hom is ext

Statement

In the mixed bounded range of derived Hom, HnRHom(M,N)HomD(A)(M,N[n]) for every integer n. For objects M,N in degree zero and n0 this is classical Extn(M,N) under the supplied one-sided resolution hypothesis.

Facts & Assumptions

Given: In the mixed bounded range of derived Hom, HnRHom(M,N)HomD(A)(M,N[n]) for every integer n. For objects M,N in degree zero and n0 this is classical Extn(M,N) under the supplied one-sided resolution hypothesis.

[F1]

Derived Hom in the mixed bounded range uses a projective source or injective target, with no-roof cohomology comparisons and a mixed comparison zigzag (Derived hom in the bounded setting).

[F2]

Classical Ext identifies with derived Hom from M[0] to N[n] for n0 (Ext is hom in the derived category).

Proof

1.1

In the projective construction, cycles of degree n in Hom(PM,N) are chain maps PMN[n]. Boundaries are their nullhomotopies, since multiplying a homotopy by (1)n converts the shifted homotopy formula into du=dNu(1)n1udP. Hence the cohomology is HomK(PM,N[n]). The no-roof comparison built into the derived Hom construction identifies it with HomD(M,N[n]). The same calculation for Hom(M,IN) uses the injective no-roof comparison. Zero objects and every integer n are allowed.

F1algebra
2.1

For degree-zero inputs, the classical Ext comparison identifies the last Hom group with the supplied resolution Ext for n0. The identifications use the same cocycles and comparison maps, so they are natural in both variables. The mixed Hom zigzag makes the two one-sided descriptions agree when both are available.

F2step 1.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

Splitting a bounded complex by vanishing higher Ext

Statement

Assume the standing supplied projective or injective resolution hypotheses and let X have cohomology in a finite interval. If Extp(HiX,HjX)=0 for every p2 and i>j, then XiHi(X)[i], a finite sum. The isomorphism is not asserted canonical. If Ext2(M,N)=0 for every pair, all cohomologically bounded complexes split this way; for this corollary impose also DC and set-sized extension classes as in the Yoneda comparison.

Facts & Assumptions

Given: Assume the standing supplied projective or injective resolution hypotheses and let X have cohomology in a finite interval. If Extp(HiX,HjX)=0 for every p2 and i>j, then XiHi(X)[i], a finite sum. The isomorphism is not asserted canonical. If Ext2(M,N)=0 for every pair, all cohomologically bounded complexes split this way; for this corollary impose also DC and set-sized extension classes as in the Yoneda comparison.

[F1]

Under supplied one-sided resolutions, classical Ext is the corresponding shifted derived Hom (Ext is hom in the derived category).

[F2]

Canonical truncations give distinguished triangles and isolate single cohomology layers (Canonical truncations fit a distinguished triangle).

[F3]

Under its DC, size, and one-sided resolution hypotheses, Yoneda extensions represent all positive derived Ext classes and splicing is shifted composition (Yoneda product is composition in the derived category).

[F4]

Representable Hom applied to a distinguished triangle is exact (Long exact Hom sequences of a distinguished triangle).

[F5]

The canonical biproduct triangle is distinguished (Zero and split triangles are distinguished).

[F6]

Two isomorphism components of a triangle morphism force the third to be an isomorphism (Two isomorphism components of a morphism of triangles force the third).

Proof

1.1

First let AuBvCwA[1] be distinguished with w=0. Hom exactness supplies s:CB with vs=1C. The split triangle maps to this triangle by (1A,(u,s),1C): the middle square uses vu=0,vs=1, and the last square uses w=0. Two isomorphism components force (u,s) to be an isomorphism. Conversely such a split-triangle isomorphism forces w=0. This includes zero vertices.

F4F5F6algebra
1.2

Choose ab bounding the cohomology. For empty cohomological support the object is zero, and for a single degree the canonical truncation maps identify X with Ha(X)[a]. If a<b, use the triangle τb1XXHb(X)[b](τb1X)[1]. Induction on ba identifies its head with ai<bHi(X)[i].

F2algebra
2.1

The connecting map lies in the finite direct sum of groups HomD(HbX[b],HiX[i+1])=Extbi+1(HbX,HiX). Since i<b, every exponent is at least two, so each group vanishes by hypothesis. The splitting criterion in step 1.1 completes the induction. Its section s was chosen and need not be unique.

F1step 1.1step 1.2algebra
3.1

Under the additional Yoneda hypotheses, any positive-degree Ext class is a Yoneda extension class. For p>2, break its exact extension at the image after the last two arrows toward its quotient endpoint. It becomes a splice of a two-extension and a (p2)-extension. If all two-extension groups vanish, composition compatibility makes the splice zero. Thus all Ext groups of degree at least two vanish for all pairs, and step 2.1 applies.

F3step 2.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

fs-localization-identifies-a-quasi-isomorphism-with-an-identity-morphism.md

Statement

For every quasi-isomorphism s, its image Q(s) in the derived category is literally an identity morphism.

Facts & Assumptions

Given: For every quasi-isomorphism s, its image Q(s) in the derived category is literally an identity morphism.

[F1]

Localization sends quasi-isomorphisms to invertible arrows (The localization functor sends quasi isomorphisms to isomorphisms).

[F2]

Cohomology factors through the derived category (Cohomology factors through the derived category).

Refutation

1.1

Take s=1:Z[0]Z[0]. Its degree-zero map is invertible, and all other cohomology groups are zero, so it is a quasi-isomorphism. Thus Q(s) is invertible.

F1algebra
2.1

The descended H0 sends Q(s) to multiplication by 1, whereas it sends the identity to 1. These maps differ on 1Z. A functor preserves equality, so Q(s) is not the identity. Invertibility, which is what localization asserts, does not imply literal equality with the identity.

F2step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

fs-two-roofs-are-equal-whenever-their-right-hand-arrows-are-equal.md

Statement

Two roofs between the same objects are equal in the derived category whenever their right-hand arrows are equal.

Facts & Assumptions

Given: Two roofs between the same objects are equal in the derived category whenever their right-hand arrows are equal.

[F1]

A roof represents numerator composed with the inverse of its denominator (The calculus of fractions constructs the localization).

[F2]

Cohomology factors through localization (Cohomology factors through the derived category).

Refutation

1.1

On X=Z[0], compare (X1X1X) and (X1X1X). Both denominators are quasi-isomorphisms and the numerator in each is the identity. The roof formula gives the morphisms 1 and 1 respectively. All other degrees are zero.

F1algebra
2.1

The functor H0 sends the two morphisms to 1 and 1 on Z, unequal at the element 1. Hence the roofs are unequal despite identical numerators. The denominator is essential data.

F2step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

fs-the-derived-category-is-the-same-category-as-the-homotopy-category.md

Statement

For every abelian category, Q:K(A)D(A) is an equivalence of categories.

Facts & Assumptions

Given: For every abelian category, Q:K(A)D(A) is an equivalence of categories.

[F1]

A complex is zero in the derived category iff it is acyclic (A complex is zero in the derived category exactly when it is acyclic).

Refutation

1.1

In abelian groups take X0=Z, X1=Z, X2=Z/2, with d0=2, d1 reduction modulo two, and other terms zero. The first map is monic, its image is the kernel of the second, and the second is epic. Thus X is acyclic and QX=0.

F1algebra
2.1

A contraction would satisfy 1X2=d1h2, giving a section h2:Z/2Z. Every such homomorphism is zero because Z has no nonzero element killed by two. Thus 1X0 in K, whereas Q(1X)=0 in D. The functor is not faithful and cannot be an equivalence. This is a direct verification of the familiar acyclic-but-not-contractible obstruction.

step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

fs-every-complex-of-projectives-is-homotopically-projective.md

Statement

Every complex of projective modules, without any boundedness hypothesis, is K-projective.

Facts & Assumptions

Given: Every complex of projective modules, without any boundedness hypothesis, is K-projective.

[F1]

K-projectivity requires vanishing of Hom into every acyclic shift (Homotopically projective bounded above complex).

[F2]

A projective module lifts maps through epimorphisms (Projective modules and the lifting property).

Refutation

1.1

Let R=Z/4 and Pi=R for every integer i, with all differentials multiplication by two. Then d2=4=0 and ker(2)=2R=im(2), so P is acyclic. Each term is projective: a map out of R lifts through any epimorphism by choosing a preimage of the value at 1.

F2algebra
2.1

Every R-linear hi:RR is multiplication by some ai. If 1P=dh+hd, degree i gives 1=2ai+2ai+1 in R, impossible after reduction modulo two. Thus HomK(P,P) contains a nonzero identity although its target P is acyclic. This violates K-projectivity.

F1step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

fs-brutal-and-canonical-truncation-are-the-same.md

Statement

Brutal and canonical truncation of a complex at the same degree always coincide, even up to derived isomorphism.

Facts & Assumptions

Given: Brutal and canonical truncation of a complex at the same degree always coincide, even up to derived isomorphism.

[F1]

Brutal truncation retains the original boundary term (Brutal truncation of a complex).

[F2]

Canonical upper truncation replaces its boundary term by the kernel of the outgoing differential (Canonical truncation of a complex).

Refutation

1.1

Take X=(Z2Z) in degrees 0,1, zero elsewhere. Brutal upper truncation at zero is σ0X=Z[0]. Canonical upper truncation has degree-zero term ker(2:ZZ)=0, hence τ0X=0.

F1F2algebra
2.1

Their degree-zero cohomology groups are Z and zero, so they are neither equal complexes nor isomorphic derived objects. The endpoint kernel correction changes the answer.

step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

fs-an-unbounded-total-derived-functor-exists-from-enough-injectives-alone.md

Statement

Enough injectives alone licenses the unbounded right-derived-functor recipe using an arbitrary quasi-isomorphism into any termwise injective complex.

Facts & Assumptions

Given: Enough injectives alone licenses the unbounded right-derived-functor recipe using an arbitrary quasi-isomorphism into any termwise injective complex.

[F1]

K-injectivity requires vanishing of Hom from every acyclic source into the target shifts (Homotopically injective bounded below complex).

[F2]

The defined right total derived functor uses bounded-below injective replacements (Right total derived functor on the bounded below derived category).

[F3]

Assuming AC, Baer characterizes injectives by extension of maps from all left ideals (Baer's criterion for injective modules).

Refutation

1.1

Assume AC and put R=Z/4. Its ideals are 0,2R,R. An R-map 2RR sends 2 to 0 or 2, so it extends by multiplication by 0 or 1. Maps on 0 and R extend trivially. Baer's criterion therefore makes R injective. The doubly infinite complex Ii=R,di=2 is termwise injective and acyclic since kernel and image of two both equal 2R.

F3algebra
2.1

For F=HomR(R/2,), each F(Ii) is 2RZ/2, and its differential is zero. Thus F(I) is not acyclic. The quasi-isomorphism 0I is a termwise-injective replacement of the zero complex, but this recipe sends it to a nonzero derived object, while replacement by zero gives zero. The unbounded recipe is therefore not well defined.

step 1.1algebra
3.1

Indeed I is not K-injective: if its identity were nullhomotopic, the degreewise equation would be 1=2ai+2ai+1, impossible modulo two. An acyclic complex must have zero Hom into a K-injective target, so taking the source to be I violates that condition. The bounded-below construction avoids this example through its boundedness hypothesis. This refutes the arbitrary-replacement assertion, not existence of unbounded derived functors by other methods.

F1F2step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07 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.

fs-a-derived-functor-is-canonical-without-supplied-replacement-data.md

Statement

A projective replacement model for a total derived functor is literally canonical without supplied replacement data.

Facts & Assumptions

Given: A projective replacement model for a total derived functor is literally canonical without supplied replacement data.

[F1]

The left total derived construction includes supplied projective models (Left total derived functor on the bounded above derived category).

[F2]

Independence means unique natural isomorphism relative to augmentations (Left total derived functor is independent up to a unique augmentation-compatible natural isomorphism).

[F3]

Contractibility means a nullhomotopic identity, reindexed here to cochains (A contractible complex).

Refutation

1.1

For F=1Ab and X=0, use either the zero projective complex or C=(Z1Z) in degrees 1,0. Both map quasi-isomorphically to zero. The homotopy with degree-zero component 1:ZZ and other components zero contracts C. Their literal terms are different.

F1F3algebra
2.1

Applying F leaves these different complexes unchanged, although their derived objects are isomorphic. More generally PCX changes any supplied model PX in the same way. Replacement independence gives a unique natural comparison relative to augmentation data, not an equality of all chosen representatives.

F2step 1.1algebra

5 · Examples, counterexamples and false statements

None yet.

Sources