\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*{two-sided bar construction}

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{left_and_right_modules}{Left and right modules}\dotfill \pageref*{left_and_right_modules} \linebreak
\noindent\hyperlink{initial_structure}{Initial structure}\dotfill \pageref*{initial_structure} \linebreak
\noindent\hyperlink{twosided_bar_construction}{Two-sided bar construction}\dotfill \pageref*{twosided_bar_construction} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{classifying_bundle}{Classifying bundle}\dotfill \pageref*{classifying_bundle} \linebreak
\noindent\hyperlink{cofibrant_replacement}{Cofibrant replacement}\dotfill \pageref*{cofibrant_replacement} \linebreak
\noindent\hyperlink{canonical_twosided_bar_construction_of_an_adjunction}{Canonical two-sided bar construction of an adjunction}\dotfill \pageref*{canonical_twosided_bar_construction_of_an_adjunction} \linebreak
\noindent\hyperlink{delooping_machines}{Delooping machines}\dotfill \pageref*{delooping_machines} \linebreak
\noindent\hyperlink{homotopy_colimits}{Homotopy colimits}\dotfill \pageref*{homotopy_colimits} \linebreak


\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

A two-sided bar construction is a [[simplicial object]] associated with the data of a left [[module]] and right module over a [[monad]].

\hypertarget{definition}{}\subsection*{{Definition}}\label{definition}

\hypertarget{left_and_right_modules}{}\subsubsection*{{Left and right modules}}\label{left_and_right_modules}

Let $\mathbf{B}$ be a [[2-category]], and let $M: B \to B$ be a monad with multiplication $m: M M \to M$ and unit $u: 1_B \to M$. Recall that a \textbf{left module} over $M$ consists of a 1-cell $X: A \to B$ and a 2-cell $\alpha: M X \to X$ such that the diagrams

\begin{displaymath}
\itexarray{
M M X & \stackrel{M\alpha}{\to} & M X & & & X & \stackrel{1_X}{\to} & X \\
m X \downarrow & & \downarrow \alpha & & & u X \downarrow & & \downarrow 1_X\\
M X & \underset{\alpha}{\to} & X & & & M X & \underset{\alpha}{\to} & X 
}
\end{displaymath}
commute. A \textbf{right module} over $M$ consists of a 1-cell $Y: B \to C$ and a 2-cell $\beta: Y M \to Y$ such that the diagrams

\begin{displaymath}
\itexarray{
Y M M & \stackrel{\beta M}{\to} & Y M & & & Y & \stackrel{1_Y}{\to} & Y \\
Y m \downarrow & & \downarrow \beta & & & Y u \downarrow & & \downarrow 1_Y\\
Y M & \underset{\beta}{\to} & Y & & & Y M & \underset{\beta}{\to} & Y 
}
\end{displaymath}
commute.

\hypertarget{initial_structure}{}\subsubsection*{{Initial structure}}\label{initial_structure}

With the aid of string diagrams, one may easily visualize the structure $\mathbf{I}$ that is initial amongst 2-categories equipped with the data of monad and left and right modules over the monad. The 2-category has three 0-cells $0$, $1$, and $2$, 1-cells which are of the form

\begin{displaymath}
m^{\circ n}: 1 \to 1 \qquad y m^{\circ n}: 1 \to 2 \qquad m^{\circ n} x: 0 \to 1 \qquad y m^{\circ n} x: 0 \to 2,
\end{displaymath}
and the nonempty hom-categories $hom(i, j) = \mathbf{I}(i, j)$ may be described as follows:

\begin{itemize}%
\item $hom(1, 1)$ is isomorphic to the ``algebraist's $\Delta_a$'' (see [[simplex category]]): the category of finite ordinals and order-preserving maps;


\item $hom(1, 2)$ is isomorphic to $\Delta_{\bot}$: the category of nonempty finite ordinals and order-preserving maps that preserve the bottom element;


\item $hom(0, 1)$ is isomorphic to $\Delta_{\top}$: the category of nonempty finite ordinals and order-preserving maps that preserve the top element;


\item $hom(0, 2)$ is isomorphic to the ``topologist's $\Delta^{op}$'' (the usual simplex category), which is isomorphic to the category $\Delta_{\top, \bottom}$ of \textbf{finite intervals}, whose objects are finite ordinals with at least two elements, and whose morphisms are order-preserving maps that preserve both top and bottom.



\end{itemize}
Note that the structure of $hom(1, 1)$ simply recapitulates the universal property of the algebraist's $\Delta_a$, as initial among strict monoidal categories equipped with a monoid $M$. This result is most easily understood in terms of string diagrams, and the structure of the other hom-categories is guided by similar string diagram considerations.

\hypertarget{twosided_bar_construction}{}\subsubsection*{{Two-sided bar construction}}\label{twosided_bar_construction}

Now we give the definition. Suppose given a 2-category $\mathbf{B}$ together with a monad $M: B \to B$ in $\mathbf{B}$, together with a left module $X: A \to B$ and a right module $Y: B \to C$. There is a unique 2-functor

\begin{displaymath}
\mathbf{I} \to \mathbf{B}
\end{displaymath}
which preserves the monad and module structures, and this induces a functor

\begin{displaymath}
\Delta^{op} \cong \mathbf{I}(0, 2) \to \mathbf{B}(A, C)
\end{displaymath}
This functor is the \textbf{two-sided bar construction}, denoted $B(Y, M, X)$.

The structure of the two-sided bar construction may be given more concretely as follows:

\begin{itemize}%
\item The $n$-dimensional component of $B(Y, M, X)$ is

\begin{displaymath}
B(Y, M, X)_n = Y M^{\circ n} X
\end{displaymath}

\item The $n+2$ face maps

\begin{displaymath}
d_{n}^{i}: Y M^{n+1} X \to Y M^n X
\end{displaymath}
are $\beta M^n X$ ($i = 0$), $Y M^{i-1} m M^{n-i} X$ ($1 \leq i \leq n$), and $Y M^n \alpha$ ($i = n+1$).


\item The $n+1$ degeneracy maps

\begin{displaymath}
s_{n}^{i}: Y M^n X \to Y M^{n+1} X
\end{displaymath}
are $Y M^i u M^{n-i} X$ ($0 \leq i \leq n$).



\end{itemize}
\hypertarget{examples}{}\subsection*{{Examples}}\label{examples}

Two-sided bar constructions encapsulate a surprising number of constructions, a few of which follow.

\hypertarget{classifying_bundle}{}\subsubsection*{{Classifying bundle}}\label{classifying_bundle}

Consider the cartesian monoidal category $Top$ as a 1-object bicategory $\Sigma Top$ (which we may strictify to a 2-category). A topological [[monoid]] $M$ is the same as a monad in $\Sigma Top$, and the usual meaning of left and right $M$-modules is preserved by thinking of them as modules over the monad.

In particular, $M$ may be regarded as a left or right $M$-module, and the 1-point space $1$ carries a unique structure of left or right $M$-module. As a result we may consider the simplicial space

\begin{displaymath}
B M = B(1, M, 1)
\end{displaymath}
as base space, and the simplicial space

\begin{displaymath}
E M = B(M, M, 1)
\end{displaymath}
as total space, of a simplicial fibration

\begin{displaymath}
B(\pi, M, 1): B(M, M, 1) \to B(1, M, 1)
\end{displaymath}
induced by the unique left module map $\pi: M \to 1$. This is the [[classifying bundle]] of the monoid $M$.

\hypertarget{cofibrant_replacement}{}\subsubsection*{{Cofibrant replacement}}\label{cofibrant_replacement}

If $M$ is a monad and $(X, \alpha: M X \to X)$ is a (left-sided) $M$-algebra, then with $M$ acting upon itself on the right, there is a simplicial object

\begin{displaymath}
B(M, M, X)
\end{displaymath}
which may be regarded as a \emph{cofibrant replacement} of $X$, a simplicial $M$-algebra which as a simplicial object is homotopy-equivalent to the constant simplicial object at $X$. (More should be added here.) See also [[bar construction]].

Rather more generally, if in addition $(Y, \beta: Y M \to Y$ is a right $M$-module, we may denote the coequalizer of the pair

\begin{displaymath}
Y M X \stackrel{\overset{\beta X}{\to}}{\underset{Y \alpha}{\to}} Y X
\end{displaymath}
(if it exists) by $Y \circ_M X$, and think of it as the \emph{tensor product} (over $M$) of $Y$ and $X$. The general principle is that the simplicial object $B(Y, M, X)$ is canonically augmented by $Y \circ_M X$, and serves as a cofibrant replacement of $Y \circ_M X$ when the latter is regarded as a constant simplicial object. See also homotopy colimits, below.

\hypertarget{canonical_twosided_bar_construction_of_an_adjunction}{}\subsubsection*{{Canonical two-sided bar construction of an adjunction}}\label{canonical_twosided_bar_construction_of_an_adjunction}

Suppose given any [[adjoint pair]] $(F: B \to A) \dashv (U: A \to B)$ in a 2-category $\mathbf{B}$, with counit $\varepsilon: F U \to 1_A$. There is an associated monad $M = U F: B \to B$, and a canonical left $M$-action on $U$:

\begin{displaymath}
\alpha = U \varepsilon: U F U \to U,
\end{displaymath}
and a canonical right $M$-action on $F$:

\begin{displaymath}
\beta = \varepsilon F: F U F \to F.
\end{displaymath}
We may then form the canonical simplicial object $B(F, M, U)$. By general abstract nonsense, the tensor product $F \circ_M U$ is $1_A$, so if we regard $1_A$ as a constant simplicial object $\Delta^{op} \to \mathbf{B}(A, A)$, the cofibrant replacement result above specializes as follows.

\begin{uprop}
The canonical simplicial map $B(F, M, U) \to 1_A$ is a simplicial [[homotopy equivalence]].

\end{uprop}
\hypertarget{delooping_machines}{}\paragraph*{{Delooping machines}}\label{delooping_machines}

The classic application of this two-sided bar construction was given by Peter May, after work of Jon Beck. Let $\Omega = Top_{*}(S^1, -): Top_{*} \to Top_{*}$ be the loop space functor on pointed spaces, with left adjoint the suspension functor $S = S^1 \wedge -: Top_{*} \to Top_{*}$. For each $n \geq 1$, the adjunction $S^n \dashv \Omega^n$ induces a monad $\Omega^n S^n$ which acts (on the left) on $n$-fold loop spaces $\Omega^n X$, and acts on the right on $S^n$.

\begin{uprop}
The canonical simplicial map $B(S^n, \Omega^n S^n, \Omega^n X) \to X$ is a simplicial [[homotopy equivalence]].

\end{uprop}
So if $Y$ is an $n$-fold loop space, the two-sided bar construction $B(S^n, \Omega^n S^n, Y)$ provides its $n$-fold delooping.

Continuing this train of thought: suppose given a monad $C_n$ equipped with a monad map $\phi: C_n \to \Omega^n S^n$ (which is [[mate]]d to an action $C_n \Omega^n \to \Omega^n$) such that $\phi$ is objectwise a homotopy equivalence. Then $\phi$ induces a homotopy equivalence

\begin{displaymath}
B(S^n, \phi, \Omega^n): B(S^n, C_n, \Omega^n) \to B(S^n, \Omega^n S^n, \Omega^n)
\end{displaymath}
The classic example of this is where $C_n$ is the little $n$-cubes operad, which acts canonically on $\Omega^n = Top_{*}(S^n, -)$. The advantage is that the monad $C_n$ is much more tractable than $\Omega^n S^n$.

Continuing this thought still further, we have the following recognition theorem of May:

\begin{uthm}
Suppose $Y$ is a connected space with a $C_n$-action. Then $Y$ is homotopy equivalent to an $n$-fold loop space, and indeed there is a canonical span

\begin{displaymath}
\Omega^n B(S^n, C_n, Y) \leftarrow B(\Omega^n S^n, C_n, Y) \to B(\Omega^n S^n, \Omega^n S^n, Y) \simeq Y
\end{displaymath}
where each of the arrows is a homotopy equivalence.

\end{uthm}
I'm going on sheer memory here of May's Geometry of Iterated Loop Spaces, and it's quite possible that I'm missing hypotheses in some directions and that hypotheses could be weakened in other directions, e.g., replacing the connectedness assumption with a group completion assumption. This is in need of expert attention.

[[JCMcKeown]] : Hi, Todd (five years later); hmm. The first thing that comes to mind is that $C_n$ the monad-of-the-operad $E_{(n)}$ of little-$n$-cubes isn't objectwise homotopy-equivalent to $\Omega^n S^n$; it's a big wedge, rather: $C_n X = \bigvee_k E^{k}_{(n)}((X^k))$ for some sensible idea of $E^k_{(n)}((-))$. The idea one gets from trying to read May is that: the particular operad/monad/algebraic theory doesn't matter, so long as it has the right category of Algebras --- and in this light, it may help that little-$n$-cubes is closely related to the Snaith Splitting: $S^n \Omega^n S^n$ \emph{is} a big wedge of decorated configuration spaces. But I don't really understand all the mechanics involved. Will Keep Thinking.

\hypertarget{homotopy_colimits}{}\subsubsection*{{Homotopy colimits}}\label{homotopy_colimits}

Suppose that $C$ is a small category and $F: C \to Top$ is a functor. We may regard $C$ as a monad $C: C_0 \to C_0$ in the bicategory of [[span]]s in $Top$, where $C_0$ is the set of objects with the discrete category, and we may regard $F$ as a left module over the monad $C$.

As always, the terminal object $1$ carries a unique right module structure. The usual colimit, $colim F$, may be described as the tensor product

\begin{displaymath}
colim F \cong 1 \circ_C F
\end{displaymath}
As a result, we have the cofibrant replacement $B(1, C, F)$ of $colim F$. The geometric realization of the simplicial space $B(1, C, F)$ is none other than the \textbf{[[homotopy colimit]]} of $F$.

[[!redirects two-sided bar constructions]] [[!redirects two sided bar construction]] [[!redirects two sided bar constructions]]



\end{document}