\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{free crossed module}

In this exposition we will follow the book listed below in writing crossed modules with operations on the right. Thus a [[crossed module]] is in the first instance a morphism $\mu: M \to  P$ of groups together with an operation of the group $P$ on the right of the group $M$ written $(m,p) \mapsto
m^p$, satisfying the following two axioms:

CM1) $\mu (m^p)= p(\mu m)p^{-1}$;

CM2) $mnm^{-1} = n^{\mu m}$;

for all $m,n \in M, p \in P$.

The notion of \emph{free crossed module} was developed by J.H.C. Whitehead in the period 1941-1949 to model algebraically the structure of the second relative homotopy group of an adjunction space $\pi_2(A \cup \{e^2_\lambda\}_{\lambda \in \Lambda},A,x)$ considered as a crossed module over $\pi_1(A,x)$. This work is also related to independent work of Peiffer and Reidemeister on Identities among relations.

It can also be considered as arising from the notion of a resolution for a group, by analogy with resolutions for modules, but in a nonabelian framework. So in combinatorial group theory we consider a presentation $\langle X \mid R \rangle$ of a group $G$. Thus $X$ is a set of generators of the group $G$ and $R$ is a set of relators, that is, $R$ is a subset of $F(X)$, the free group on the set $X$. So we have an epimorphism $\phi: F(X) \to G$ with kernel $N$, say, a normal subgroup of $F(X)$, and $N$ is the normal closure of $R$ in $F(X)$. All this reflect the fact that if $\phi (u) =1$, where $u \in F(X)$, then $\phi (pup^{-1} ) = 1$ for all $p \in F(X)$.

Let $P=F(X)$, and write $\langle R\rangle^P$ for the normal closure of the set $R$ in $P$. The elements of $\langle R\rangle^P$ are all \emph{consequences} of $R$ in $P$, namely all products

\begin{displaymath}
c=(r_{1}^{\epsilon _{1}})^{p_{1}} \dots (r_{m}^{\epsilon
_{m}})^{p_{m}}
\end{displaymath}
where $r_{i} \in R$, $\epsilon _{i} = \pm 1$, $p_{i} \in P$ and $m \geq 1$, and $u^p = pup^{-1}$. An important point is that if $\phi \colon P \to Q$ is any morphism of groups such that $\phi
(R)=\{1\}$, then $\phi (\langle R\rangle^P) =\{1\}$, since Ker $\phi$ is normal. Thus $\phi$ factors as $P \to P/\langle R\rangle^P
\to Q$ where the first morphism is the quotient morphism.

It is also convenient to allow for repeated relators, which, as we shall see, corresponds to attaching several cells by the same map. So we replace the subset $R$ of $P=F(X)$ by a function $\omega: R \to P$.

We now drop the assumption that $P$ is free. We form the free $P$-group $F^P(R)$ on the set $R$: this is the free group on elements $(r,p) \in R \times P$, and has an action of the group $P$ determined by $(r,p)^q=(r,pq)$. There is a morphism of groups $\theta : F^P(R) \to P$ given by $\theta (r,p)= (\omega(r))^p$. Then $\theta$ is a $P$-morphism: $\theta (w^p)= \theta (w)^p$ for all $w \in F^P(R), p \in P$.

We now define for $u,v \in F^P(R)$ the \emph{Peiffer commutator} to be the element

\begin{displaymath}
[\! [ u,v]\! ] = uvu^{-1}(v^{\theta u})^{-1}.
\end{displaymath}
Note that $\theta([ \! [ u,v] \! ] )=1 \in F^P(R)$. It may be proved that the Peiffer commutators generate a normal subgroup called the Peiffer group of $\theta$, and written $[ \! [ F^P(R), F^P(R)]\! ]$. The quotient group $F^P(R)/ [\! [ F^P(R),F^P(R) ]\! ]$ is written $FC(\omega)$ and there is an induced morphism

\begin{displaymath}
\delta : FC(\omega) \to P
\end{displaymath}
with image $\langle(\omega(R))\rangle^P$. This construction is called the \emph{free crossed module} on $\omega: R \to P$. The kernel of $\delta$ is actually a $P$-module, and is called the \emph{module of identities among relations}.

A useful fact is that this free crossed module may also be described as the pushout in the category of crossed modules

\begin{displaymath}
\begin{matrix}(1 \to F(R))&\to & (1 \to P) \\ \downarrow&& \downarrow \\ (F(R) \to F(R)) &\to& (FC(\omega) \to P)\end{matrix}
\end{displaymath}
where the morphism of groups $i:F(R) \to FC(\omega)$ is given by $i(w) = [(w,1)]$, the class of $(w,1)$ in $FC(\omega)$. This shows the relevance of a Seifert-Van Kampen Theorem for second relative homotopy groups, since the above pushout comes from applying the fundamental crossed module functor $\Pi_2$ on based pairs given by

\begin{displaymath}
\Pi_2(X,A,x)= (\delta: \pi_2(X,A,x) \to \pi_1(A,x))
\end{displaymath}
to the pushout of pairs of spaces defining the based pair $(A \cup \{e^2_\lambda\}_{\lambda \in \Lambda}, A,x)$. This theorem also shows that we can generalise this situation to a pushout of crossed modules

\begin{displaymath}
\begin{matrix}(1 \to S)&\to & (1 \to P) \\ \downarrow&& \downarrow \\ (S \to S) &\to& ( M \to P)\end{matrix}
\end{displaymath}
where $S$ is now any group; the crossed module $M \to P$ then gives the fundamental crossed module of the pair $(A \cup CY,A,x)$ determined by a map $f: Y \to A$ and where $S=\pi_1(Y,y)$. Note that $(A \cup CY,A)$ arises in a pushout diagram of the form

\begin{displaymath}
\begin{matrix}(Y,Y)&\to & (A,A) \\ \downarrow&& \downarrow \\ (CY,Y) &\to& (A \cup CY,A)\end{matrix}
\end{displaymath}
This generalisation of Whitehead's theorem on free crossed modules was discovered as a consequence of the 2-dimensional Seifert-van Kampen Theorem. It has been used to give explicit computations of the crossed module $\pi_2(A \cup CY,A,x)\to \pi_1(A,x)$ in the case the map $Y \to A$ is the map of classifying spaces $BG \to BP$ induced by a morphism $\phi: G \to P$ of groups. It may also be proved that if $G,P$ are finite groups, so also is the group $M$. This gives impetus to calculations, and some of these are best done with a computer.

For more information on these topics see Part I of the book on ``Nonabelian algebraic topology'' listed below.

It is convenient to generalise the above to crossed modules over groupoids, to model the situation of attaching cells at different points. So we assume given $\mu: M \to P$ where $M,P$ are groupoids, $\mu$ is the identity on objects, $M$ is a union of groups $M(x), x \in P_0 = Ob(P)$ and the operation of $P$ on $M$ is such that if $p \in P(x,y), m \in M(x)$, then $m^p \in M(y)$, with the obvious axioms.

\hypertarget{references}{}\subsection*{{References}}\label{references}

\begin{itemize}%
\item Whitehead, J. H.{\tt \symbol{126}}C., ``Combinatorial homotopy. II''. \emph{Bull. Amer. Math. Soc.} 55 (1949) 453--496.


\item Brown, R. and Higgins, P.J., ``On the connection between the second relative homotopy groups of some related spaces'', \emph{Proc. London Math. Soc.} (3) 36 (1978) 193--212.


\item R. Brown, P.J. Higgins, R. Sivera, \emph{Nonabelian algebraic topology: filtered spaces, crossed complexes, cubical homotopy groupoids}, EMS Tracts in Mathematics Vol. 15, 703 pages. (August 2011).



\end{itemize}


\end{document}