Commit 10f0a70f authored by Leonard Guetta's avatar Leonard Guetta
Browse files

idem

parent 598b64ca
......@@ -1347,7 +1347,7 @@ In practice, we will use the following criterion to detect discrete Conduché $n
F^{-1}(\Sigma):=\left\{ x \in C_n \vert F(x) \in \Sigma\right\}.
\]
\fi
\begin{theorem}\label{thm:conduche}
\begin{theorem}\label{thm:conduche}\label{THM:CONDUCHE}
Let $F : C \to D$ be a discrete Conduché $\oo$\nbd{}functor.
\begin{enumerate}
\item If $D$ is free then so is $C$.
......@@ -1369,7 +1369,7 @@ In practice, we will use the following criterion to detect discrete Conduché $n
\]
\end{enumerate}
\end{paragr}
\section{Proof of Theorem \ref{thm:conduche}: part I}
\section{Proof of Theorem \ref{THM:CONDUCHE}: part I}
This first part of the proof of Theorem \ref{thm:conduche} consists of several technical results on words. They lay a preliminary foundation on which the key arguments of the proof will later rely.
\emph{For the whole section, we fix a cellular $n$\nbd{}extension $\E=(C,\Sigma,\sigma,\tau)$. A ``word'' always means an element of $\W[\E]$ and a ``well formed word'' always means an element of $\T[\E]$.}
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment