We describe the most primitive way to create filtered complexes.
Let $C$ be a chain complex and consider a list of chain complex maps $\{\phi_n, \phi_{n - 1}, \dots, \phi_0 \}$ with properties that $C$ is the target of $\phi_i$, for $0 \leq i \leq n$, and the image of $\phi_{i-1}$ is a subchain complex of the image of $\phi_i$, for $1 \leq i \leq n$. Given this input data we produce an ascending filtered chain complex $FC$ with the properties that $F_k C = C$ for $k \geq n + 1$ and $F_k C = image \phi_k$, for $k = 0, \dots, n$.
We now illustrate how this is done in two easy examples. We first make three chain complexes $C$, $D$, and $E$, two chain complex maps, $d : D \rightarrow C$ and $e : E \rightarrow C$, and then compute the resulting filtration of $C$.
Let's make our chain complexes $C$, $D$, and $E$.
|
|
|
|
|
|
|
|
|
|
|
|
We now make our chain complex maps.
|
|
We can check that these are indeed chain complex maps:
|
|
Now, given the list of chain complex maps $\{d, e\}$, we obtain a filtration of $C$ by:
|
If we want to specify a minimum filtration degree we can use the Shift option.
|
|