The Stacks project

Definition 13.37.1. Let $\mathcal{D}$ be a triangulated category. Let

\[ X_ n \to X_{n - 1} \to \ldots \to X_0 \]

be a complex in $\mathcal{D}$. A Postnikov system is defined inductively as follows.

  1. If $n = 0$, then it is an isomorphism $Y_0 \to X_0$.

  2. If $n = 1$, then it is a choice of a distinguished triangle

    \[ Y_1 \to X_1 \to Y_0 \to Y_1[1] \]

    where $X_1 \to Y_0$ composed with $Y_0 \to X_0$ is the given morphism $X_1 \to X_0$.

  3. If $n > 1$, then it is a choice of a Postnikov system for $X_{n - 1} \to \ldots \to X_0$ and a choice of a distinguished triangle

    \[ Y_ n \to X_ n \to Y_{n - 1} \to Y_ n[1] \]

    where the morphism $X_ n \to Y_{n - 1}$ composed with $Y_{n - 1} \to X_{n - 1}$ is the given morphism $X_ n \to X_{n - 1}$.

Given a morphism

13.37.1.1
\begin{equation} \label{derived-equation-map-complexes} \vcenter { \xymatrix{ X_ n \ar[r] \ar[d] & X_{n - 1} \ar[r] \ar[d] & \ldots \ar[r] & X_0 \ar[d] \\ X'_ n \ar[r] & X'_{n - 1} \ar[r] & \ldots \ar[r] & X'_0 } } \end{equation}

between complexes of the same length in $\mathcal{D}$ there is an obvious notion of a morphism of Postnikov systems.


Comments (0)


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 0D7Z. Beware of the difference between the letter 'O' and the digit '0'.