Lemma 4.2.13. Let \(f\colon X \to Y\) be a morphism in a stable \(\infty \)-category. Then there is an isomorphism \(\cofib (f) \cong \fib (f)[1]\).

Proof. Since \([n]\) is an equivalence, it preserves finite limits and colimits, hence exact sequences. The second statement follows from the following pushout/pullback diagrams:

Commutative diagram involving X, Y, 0, Z, X[1], with arrows labeled f, g.
Commutative diagram involving Z[-1], X, 0, Y, Z, with arrows labeled f, g.

Here we used the pasting law for pushouts/pullbacks to identify the objects \(X[1]\) and \(Z[-1]\). โ–ก