Before defining \emph{simplicial abelian groups}, we will first discuss the more general notion of \emph{simplicial sets}. There are generally two definitions of simplicial sets, an abstract one and a very explicit one. We will start with the abstract one, luckily it can still be visualised in pictures, then we will derive the explicit definition.
Before defining \emph{simplicial abelian groups}, we will first discuss the more general notion of \emph{simplicial sets}. There are generally two definitions of simplicial sets, an abstract one and a very explicit one. We will start with the abstract one, luckily it can still be visualised in pictures, then we will derive the explicit definition. The reader who is interested in how these notions developed, should consider reading the introduction by Friedman \cite{friedman}, which also gives nice illustrations.
\subsection{Abstract definition}
\subsection{Abstract definition}
\begin{definition}
\begin{definition}
@ -166,7 +166,7 @@ Note that this is also the definition of the Yoneda embedding $\Delta[n] = y[n]$
\subsection{Other simplicial objects}
\subsection{Other simplicial objects}
Of course the abstract definition of simplicial abelian group can easily be generalized to other categories. For any category $\cat{C}$ we can consider the functor category $\cat{sC}=\cat{C}^{\DELTA^{op}}$. In this thesis we are interested in the category $\sAb=\Ab^{\DELTA^{op}}$ of simplicial abelian groups. So a simplicial abelian group $A$ is a collection of abelian groups $A_n$, together with face and degeneracy maps, which in this case means group homomorphisms $d_i$ and $s_i$ such that the simplicial equations hold.
Of course the abstract definition of simplicial abelian group can easily be generalized to other categories. For any category $\cat{C}$ we can consider the functor category $\cat{sC}=\cat{C}^{\DELTA^{op}}$. In this thesis we are interested in the category $\sAb=\Ab^{\DELTA^{op}}$ of simplicial abelian groups. So a simplicial abelian group $A$ is a collection of abelian groups $A_n$, together with face and degeneracy maps, which in this case means group homomorphisms $d_i$ and $s_i$ such that the simplicial equations hold.
As we are interested in simplicial abelian groups, it would be nice to make these standard $n$-simplices into simplicial abelian groups. We have seen how to make an abelian group out of any set using the free abelian group. We can use this functor $\Z[-] : \Set\to\Ab$ to induce a functor $\Z^\ast[-] : \sSet\to\sAb$ as shown in the following diagram.
As we are interested in simplicial abelian groups, it would be nice to make these standard $n$-simplices into simplicial abelian groups. We have seen how to make an abelian group out of any set using the free abelian group. We can use this functor $\Z[-] : \Set\to\Ab$ to induce a functor $\Z^\ast[-] : \sSet\to\sAb$ as shown in the following diagram.\todo{sAb: Adjunction}
@ -61,7 +61,7 @@ We will call this chain complex $N(A)$ the \emph{normalized chain complex} of $A
So in this example we see that the normalized chain complex is really better behaved than the unnormalized chain complex, given by $C$.
So in this example we see that the normalized chain complex is really better behaved than the unnormalized chain complex, given by $C$.
\end{example}
\end{example}
To see what $N$ exactly does there are some useful lemmas. For the following lemmas let $X \in\sAb$ be an arbitrary simplicial abelian group and $n \in\N$. For these lemmas we will need the subgroups $D(X)_n \subset X_n$ of degenerate simplices, defined as:
To see what $N$ exactly does there are some useful lemmas. These lemmas can also be found in \cite[Chapter~VIII~1-2]{lamotke}, but in this thesis more detail is provided. Some corollaries are provided to give some intuition, or so summarize the lemmas, these results can also be found in \cite[Chapter~8.2-4]{weibel}. For the following lemmas let $X \in\sAb$ be an arbitrary simplicial abelian group and $n \in\N$. For these lemmas we will need the subgroups $D(X)_n \subset X_n$ of degenerate simplices, defined as: