\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*{simplicial localization of a homotopical category}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{homotopy_theory}{}\paragraph*{{Homotopy theory}}\label{homotopy_theory}

[[!include homotopy - contents]]

\hypertarget{category_theory}{}\paragraph*{{$(\infty,1)$-Category theory}}\label{category_theory}

[[!include quasi-category theory contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{preparations}{Preparations}\dotfill \pageref*{preparations} \linebreak
\noindent\hyperlink{simplicial_localization_via_the_grothendieck_construction}{Simplicial localization via the Grothendieck Construction}\dotfill \pageref*{simplicial_localization_via_the_grothendieck_construction} \linebreak
\noindent\hyperlink{hammock_localization}{Hammock Localization}\dotfill \pageref*{hammock_localization} \linebreak


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

We give two constructions of the [[simplicial localization]] of a [[homotopical category]].

\hypertarget{preparations}{}\subsection*{{Preparations}}\label{preparations}

We first need the following preparations:

Let $\mathbf{T}$ be the [[zigzag category]]. We define the \emph{categorical realization} of a zigzag $t=(n,t_+,t_-)$ to be the category $[t]$ generated freely by the following [[quiver]] data:

\begin{itemize}%
\item $[t]$ has $n+1$ vertices $t_0,...,t_n$
\item If $i\in t_+$, there is an edge $g_i:t_{i-1}\to t_i$
\item If $i\in t_-$, there is an edge $g_i:t_i\to t_{i-1}$

\end{itemize}
Let $C$ be a [[homotopical category]] with class of weak equivalences $W$. Consider the functor category $Hom_{Cat}([t],C)$. We define the category of \emph{restricted} $t$-zigzags $C^{t}$ to be the subcategory whose objects are zigzags $F$ such that all maps $F(t_i)\to F(t_{i-1})\in W$, and where morphisms are given by object-wise weak equivalences (natural weak equivalences) such that the maps on the initial and terminal vertices are identities. Finally, we define $C^t(X,Y)$ to be the full subcategory of $C^t$ spanned by those objects $F$ such that $F(t_0)=X$ and $F(t_n=Y)$.

Let $f:t\to t'$ be a morphism of $\mathbf{T}$. Then we define the functor $f_*:C^t(X,Y)\to C^{t'}(X,Y)$ to be the functor sending a zigzag $F:[t]\to C$ with connecting maps $g_i$ lying between $t_{i-1}$ and $t_i$ (not necessarily $t_{i-1}\to t_i$) to the zigzag $f_*F:[t']\to C$ with connecting maps $h_j$ defined to be the ordered composite of the maps $g_i$ such that $i\in f^{-1}(j)$ (Note: There should be a better combinatorial way to precisely specify this, but I'm having trouble doing so). Notice that if $f^{-1}(j)$ is empty, this procedure yields the identity map. On morphisms, everything remains well-defined by the naturality condition (implying that the diagrams do in fact commute). This proves that the assignment $C^{(t)}(X,Y):\mathbf{T} \to Cat$ is functorial in $t$.

Notice that this is not actually functorial in $X$ and $Y$, but for a map $Z\to X$, we can give a functor $C^t(X,Y)\to C^{1\vee t}(Z,Y)$. Similarly, for a map $Y\to Z$, we can give a map $C^{t}(X,Y)\to C^{t \vee 1}(X,Z)$. This is a special case of concatenation, which we will describe as follows:

We may concatenate two combinatorial zigzags $t=(n,t_+,t_-)$ and $t'=(m,t'_+,t'_-)$ in the obvious way by taking $t\vee t'$ to be the combinatorial zigzag $(n+m, t_+ \cup n(t'_+), t_- \cup n(t'_-))$ where $n(S):=\{n+i: i\in S\}$ is the map adding $n$ to each index. This is clearly functorial in both coordinates and defines a monoidal product $\vee:\mathbf{T}\times \mathbf{T}\to \mathbf{T}$.

We will lift this to a functor $\vee^{t,t'}_{XYZ}:C^t(X,Y)\times C^{t'}(Y,Z)\to C^{t\vee t'}(X,Z)$. We send a pair of zigzags to their concatenation in the obvious way. On morphisms, we concatenate natural transformation diagrams, the result of which remains natural by the hammock-shape of our natural transformation diagrams (see below), so $\vee^{t,t'}_{XYZ}$ is a functor in both coordinates.

\begin{displaymath}
\begin{matrix}
&&A_1&\to&A_2&\leftarrow&A_3&\to&\ldots&\to &A_{n-3}&\leftarrow &A_{n-2}&\to& A_{n-1}&&\\
&\nearrow&\downarrow&&\downarrow&&\downarrow&&&&\downarrow&&\downarrow&&\downarrow&\searrow&\\
X&&\downarrow&&\downarrow&&\downarrow&&&&\downarrow&&\downarrow&&\downarrow&&Y\\
&\searrow&\downarrow&&\downarrow&&\downarrow&&&&\downarrow&&\downarrow&&\downarrow&\nearrow&\\
&&B_1&\to&B_2&\leftarrow&B_3&\to&\ldots&\to &B_{n-3}&\leftarrow &B_{n-2}&\to& B_{n-1}&&\end{matrix}
\end{displaymath}
(Note that this picture is technically hiding the identity morphisms $X\to X$ and $Y\to Y$. We omit them to show the hammock-shape, as noted below).

We note that we must define everything pointwise for the moment, but it's reasonable expect all of this data to lift to an actual composition functor in the colimit over $\mathbf{T}$, perhaps after some effort.

With this data in hand, we may proceed to actual constructions of the simplicial categories that we want.

Before that, a short note on terminology: Traditionally, only the second construction is called the hammock localization, but this name comes from the shape of a natural transformation between two $t$-zigzags with the same initial and terminal vertices (notice how much the figure above looks like a hammock!), but as we will see, this features in both constructions. We could say that both constructions are ``hammock localizations'', and indeed, they produce weakly equivalent results.

\hypertarget{simplicial_localization_via_the_grothendieck_construction}{}\subsection*{{Simplicial localization via the Grothendieck Construction}}\label{simplicial_localization_via_the_grothendieck_construction}

By the [[Grothendieck construction]], we may present the functor $C^t(X,Y):\mathbf{T}\to Cat$ as a [[fibered category]] $GrC^\mathbf{T}(X,Y)$ over $\mathbf{T}$.

We describe the resulting category $GrC^\mathbf{T}(X,Y)$ explicitly as follows:

\begin{itemize}%
\item The objects are pairs $(t,F)$ with $t\in \mathbf{T}$ and $F\in C^t(X,Y)$.
\item The morphisms are pairs $(f,g):(t,F)\to (t',G)$ where $f:t\to t'$ and $g:f_*F\to G$.
\item Composition is given by the rule $(f',g')\circ (f,g)=(f'\circ f,g'\circ f'_* g)$.

\end{itemize}
In the sequel, we will construct the strict 2-category $GrC$, called the Grothendieck enrichment with the same objects as $C$ and with morphism categories $GrC^\mathbf{T}(X,Y)$.

The first order of business is to show that the $\vee^{t,t'}_{XYZ}$ assemble first to a functor $\vee_{XYZ}:GrC^\mathbf{T}(X,Y)\times GrC^\mathbf{T}(Y,Z)\to GrC^\mathbf{T}(X,Z)$. After that, we must show that all $\vee_{XYZ}$ assemble to an actual law of composition.

We define the functor $\vee_{XYZ}:GrC^\mathbf{T}(X,Y)\times GrC^\mathbf{T}(Y,Z)\to GrC^\mathbf{T}(X,Z)$ as follows: On objects (suppressing subscripts), we have $(t,F)\vee (t',F'):= (t\vee t', F\vee^{t,t'} F')$. This is clearly functorial by way of the results from our earlier preparations.

We now define the strict $2$-category GrC by specifying the following data:

\begin{itemize}%
\item The objects are simply the objects of $C$.
\item The hom-categories are given by $GrC^\mathbf{T}(X,Y)$.
\item The identity morphism $id_X\in GrC^\mathbf{T}(X,X)$ is the unique empty zigzag.
\item We define the law of composition to be $\vee$.

\end{itemize}
It's clear from the definitions that $\vee$ is associative and that $id_X\vee F=F$ whenever the composition makes sense. Then $GrC$ is a $2$-category.

We define the categorical nerve: $N:2\text{-}Cat\to Set_\Delta\text{-}Cat$ to be the canonical functor arising from the ordinary nerve. That is, $N$ is the identity on objects, and sends $GrC^\mathbf{T}(X,Y)\to \nu(GrC^\mathbf{T}(X,Y))$ where $\nu$ denotes the ordinary nerve. This is well defined since $\nu$ is a right adjoint and therefore commutes with products.

We call the simplicial category $N(GrC)$ the simplicial localization of $C$.

\textbf{Theorem}: The categorical nerve $N(GrC)$ sending objects to objects and hom-categories to simplicial sets $\nu(GrC^\mathbf{T}(X,Y))$ equips $N(GrC)$ with the structure of a simplicial category. Further, the morphisms of the homotopy category of this simplicial category coincide with those of the homotopy category arising from the ordinary construction using equivalence relations. That is, $Ho_C(X,Y)\cong \pi_0 (N(GrC(X,Y)))$ naturally in $X$ and $Y$, where $\pi_0(-):=Hom_{Ho(SSet)}(Ho(\Delta^0), Ho(-))$.

\hypertarget{hammock_localization}{}\subsection*{{Hammock Localization}}\label{hammock_localization}

We define $L_H C^\mathbf{T}(X,Y)$ to be $\varinjlim_\mathbf{T} \nu(C^\mathbf{T}(X,Y))$. We define the \emph{Hammock Localization} of $C$ to be the simplicial category $L_H C$ defined by the following data:

\begin{itemize}%
\item The objects of $L_H C$ are precisely the objects of $C$.
\item The hom-spaces are precisely the $L_H C^\mathbf{T}(X,Y)$
\item Composition is given by $\nu(\vee)$
\item The identities $Id_X$ are those maps $\Delta^0\to C^\mathbf{T}(X,X)$ classifying the unique empty zigzag

\end{itemize}
It remains to show that the $\nu(\vee^{t,t'}_{XYZ})$ assemble to a morphism of simplicial sets $\vee_{XYZ}:L_H C^\mathbf{T}(X,Y)\times L_H C^\mathbf{T}(Y,Z)\to L_H C^\mathbf{T}(X,Z)$ ``in the limit'', as it were. By the universality of colimits in $SSet$ and the fact that $\nu$ is a right adjoint, we have that $L_H C^\mathbf{T}(X,Y)\times L_H C^\mathbf{T}(Y,Z)\cong \varinjlim_\mathbf{T} \nu(C^\mathbf{T}(X,Y)\times C^\mathbf{T}(Y,Z)$.

Then to prove that everything assembles correctly, we may need to use some sort of [[coend]], but I'm not too sure.

(\ldots{})



\end{document}