\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*{compositions in cubical sets}

The [[cubical set|cubical singular complex]] $K X$, or $S^\square X$, of a topological space $X$ has an additional structure of compositions.

Let $(m) = (m_1, \ldots\, , m_n)$ be an $n$-tuple of positive integers and

\begin{displaymath}
\phi_{(m)} : I^n \rightarrow [0, m_1] \times \cdots \times [0,
m_n]
\end{displaymath}
be the map $(x_1 , \ldots \, , x_n) \mapsto (m_1 x_1, \ldots  \, ,
m_n x_n).$ Then a \emph{subdivision of type $(m)$} of a map $\alpha : I^n
\rightarrow X$ is a factorisation $\alpha = \alpha' \circ
\phi_{(m)}$; its \emph{parts} are the cubes $\alpha_{(r)}$ where $(r) = (r_1, \ldots \,, r_n)$ is an $n$-tuple of integers with $1
\leq r_i \leq m_i$, $i = 1, \ldots\, , n,$ and where $\alpha_{(r)} : I^n \rightarrow X$ is given by

\begin{displaymath}
(x_1, \ldots \, , x_n) \mapsto
\alpha'(x_1 + r_1 - 1, \ldots \, , x_n + r_n - 1).
\end{displaymath}
We then say that $\alpha$ is the \emph{composite} of the cubes $\alpha_{(r)}$ and write $\alpha = [\alpha_{(r)}]$. The \emph{domain} of $\alpha_{(r)}$ is then the set $\{(x_1,\ldots,x_n) \in I^n : r_i-1 \leq x_i
\leq r_i, 1 \leq i \leq n\}$.

The composite is \emph{in direction} $j$ if $m_j$ is the only $m_i \gt 1,$ and we then write $\alpha = [\alpha_1 , \ldots\, ,
\alpha_m{_j} ]_j;$ the composite is \emph{in the directions} $j$, $k$ $(j \neq k)$ if $m_j$, $m_k$ are the only $m_i \gt 1,$ and we then write

\begin{displaymath}
\alpha = [ \alpha_{rs}]_{j,k} \quad  or \quad  [ \alpha_{rs}] \quad  _{j}\!\downarrow ^{\textstyle\to ^k}
\end{displaymath}
for $r = 1 , \ldots\, , m_j$ and $s = 1, \ldots \,, m_k.$ The aim is to follow matrix conventions in writing double compositions.

These definitions and notations are useful for showing how the singular cubical complex allows expression for \emph{algebraic inverses to subdivision}, something seemingly very difficult either simplicially or globularly. The implications of this advantage for weak category theory seem not to have been investigated.

A \emph{cubical set with connections and compositions and inverses} is a cubical set $K$ with connections in which each $K_n$ has $n$ partial compositions $+_i$ and $n$ unary operations $-_i$, $i =
1,2,\ldots \, ,n$ satisfying the following axioms.

If $a,b \in K_n$, then $a+_i b$ is defined if and only if $\partial^+_i a=\partial^-_i  b$, and then for $\alpha=\pm$:

\begin{displaymath}
\begin{cases} \partial^-_i (a+_i b) = \partial^-_i a & \\
         \partial^+_i (a+_i b) = \partial^+_i b & \end{cases}
\end{displaymath}
\begin{displaymath}
\partial^\alpha_i (a +_j b) = \begin{cases} \partial^\alpha_i a+_{j-1}\partial^\alpha_i b &(i \lt j) \\
         \partial^\alpha_i a+_j \partial^\alpha_i b& (i \gt j), \end{cases}
\end{displaymath}
If $a \in K_n$, then $-_i a$ is defined and

\begin{displaymath}
\begin{cases}\partial^-_i (-_i a)=\partial^+_i a & \\ \partial^+_i(-_i a)=\partial^-_i a &
\end{cases}
\end{displaymath}
\begin{displaymath}
\partial^\alpha_i(-_j a) = \begin{cases} -_{j-1}\partial^\alpha_i a & (i\lt j) \\
                     -_{j}\partial^\alpha_i a & (i \gt j)
\end{cases}
\end{displaymath}
\begin{displaymath}
\varepsilon_i(a+_j b) = \begin{cases}
      \varepsilon_i a +_{j+1} \varepsilon_i b & (i \leq j) \\
      \varepsilon_i a +_j\varepsilon_i b & (i \gt j) \end{cases}
\end{displaymath}
\begin{displaymath}
\varepsilon_i (-_j b) =
                  \begin{cases}
     -_{j+1} \varepsilon_i a & (i \leq j) \\
     -_j \varepsilon_i a & (i \gt j) \end{cases}
\end{displaymath}
We have for $i \ne j$ and whenever both sides are defined:

\begin{displaymath}
(a+_i b) +_j (c+_i d) = (a+_j c) +_i (b+_j d)
\end{displaymath}
These relations are called the \emph{interchange laws}, and both sides of this equation may be written:

\begin{displaymath}
\begin{bmatrix} a& c\\ b & d  \end{bmatrix} \quad _{i}\!\downarrow ^{\textstyle\to ^j}
\end{displaymath}
Further:

$-_i (a+_j b) = (-_i a) +_j (-_i b)$ and $-_i (-_j a) =
-_j (-_i a)$ if $i \ne j$

$-_j(a+_j b)  = (-_j  b)+_j(-_j a)$ and $-_j (-_j a) =a$.

If further $K$ is a cubical set with [[connection on a cubical set|connections]] then we also require

\begin{displaymath}
\Gamma^\alpha _i (a+_j b) = \begin{cases}
      \Gamma_i^\alpha a +_{j+1} \Gamma_i^\alpha b & (i \lt j) \\
      \Gamma_i^\alpha  a +_j\Gamma_i\alpha  b & (i \lt j) \end{cases}
\end{displaymath}
\begin{displaymath}
\Gamma_j^+(a+_j b)= (\Gamma_j^+ a +_{j} \varepsilon_j a) +_{j+1}
    (\varepsilon_{j+1} a +_{j} \Gamma_j^+ b)
\end{displaymath}
\begin{displaymath}
\Gamma_j^-(a+_j b)= (\Gamma_j^- a +_{j} \varepsilon_{j+1}  b) +_{j+1}
    (\varepsilon_{j} b +_{j} \Gamma_j^- b)
\end{displaymath}
These last two equations are called the \emph{transport laws} and the right hand sides are also written respectively

\begin{displaymath}
\begin{bmatrix} \Gamma^+_j a & \varepsilon_j a \\
\varepsilon_{j+1} a & \Gamma^+_j b  \end{bmatrix} \quad _{j+1}\!\downarrow ^{\textstyle\to ^j}
\end{displaymath}
\begin{displaymath}
\begin{bmatrix} \Gamma^-_j a & \varepsilon_{j+1} b \\
\varepsilon_{j} b & \Gamma^-_j b  \end{bmatrix} \quad _{j+1}\!\downarrow ^{\textstyle\to ^j}
\end{displaymath}
They can be interpreted as saying that turning left, or right, with your arm outstretched, is the same as turning left, or right.

It is easily verified that the singular cubical set $KX$ of a space $X$ satisfies these axioms if $+_j , -_j$ are defined by

\begin{displaymath}
(a+_j b)(t_1 ,t_2 ,\ldots \, ,t_n ) = \begin{cases}
   a(t_1 ,\ldots \, , t_{j-1},2t_j,t_{j+1} ,\ldots, ,t_n) &(t_j \leq
   \frac{1}{2})\\
   b(t_1 ,\ldots \, , t_{j-1},2t_j-1,t_{j+1} ,\ldots \, ,t_n) &(t_j \geq
   \frac{1}{2})\\
   \end{cases}
\end{displaymath}
whenever $\partial^+_j a=\partial^-_j b$; and

\begin{displaymath}
(-_j a)(t_1 ,t_2 ,\ldots,t_n ) = a(t_1 ,\ldots,
t_{j-1},1-t_j,t_{j+1} ,\ldots,t_n).
\end{displaymath}
The above list of relations may seem formidable, but they all express simple geometric ideas most of which have been well used in some form or another in algebraic topology.

Notice also that in the singular cubical complex of a space, the interchange and transport laws hold \textbf{exactly}.

We also get a (strict) notion of [[cubical omega-category]] with connections by assuming that all compositions $+_i$ give a category structure with source and target maps $\partial^-_i, \partial^+_i:K_n \to K_{n-1}$ and identity maps $\varepsilon_i: K_{n-1} \to K_n$, and also for all $a$

\begin{displaymath}
\Gamma^+_i a \circ_i\Gamma^-_i a = \varepsilon _{i+1} a, \quad
\Gamma^+_i a \circ_{i+1}\Gamma^-_i a = \varepsilon_{i}a.
\end{displaymath}
These are important \textbf{cancellation} laws for the connections. They can be interpreted as saying that turning left and then right, or vice versa, leaves you facing the same way. They were introduced by C.B. Spencer for double categories (see below).

In the [[omega-groupoid]] case, the $\Gamma^+_i$ can be recovered from the $\Gamma^-_i$, and vice versa, by using the inverses, assumed to arise from the groupoid structure.

The main result of the second paper below is that (strict) cubical omega-groupoids with connections are equivalent to crossed complexes. It is easy to construct a functor from the former to the latter; the hard work is to show that such an omega-groupoid may be functorially reconstructed from the crossed complex it contains.

This work is used in the third paper to construct and apply a strict cubical homotopy groupoid of a filtered space.

The main result of the fourth paper below is that (strict) cubical omega-categories with connections are equivalent to strict globular omega-categories.

For more information, see [[Nonabelian Algebraic Topology]]..

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

\begin{itemize}%
\item C.B. Spencer, ``An abstract setting for homotopy pushouts and pullbacks'', Cahiers Topologie G'eom. Diff'erentielle, 18 (1977), 409-429.


\item R. Brown and P. J. Higgins, The algebra of cubes, \emph{J. Pure Appl. Alg.}, 21 (1981), 233--260.


\item R. Brown and P. J. Higgins, Colimit theorems for relative homotopy groups. \emph{J. Pure Appl. Algebra} 22 (1) (1981) 11--41.


\item F. Al-Agl, R. Brown and R. Steiner, Multiple categories: the equivalence between a globular and cubical approach, \emph{Advances in Mathematics}, 170, (2002), 71--118.



\end{itemize}
[[!redirects cubical omega-category]] [[!redirects cubical ∞-category]]



\end{document}