\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*{anabicategory}

An \textbf{anabicategory} is a particular notion of \emph{weak [[2-category]]} appropriate in the absence of the [[axiom of choice]] (including in many [[internal category|internal]] contexts). It is derived from the notion of [[bicategory]] by replacing the [[composition functor]]s $\circ: B(y,z) \times B(x,y) \to B(x,z)$ with [[anafunctor]]s (and therefore the [[associator]]s and [[unitor]]s with [[ananatural transformation]]s).

[[Zoran Škoda]]: I understand that there is a version of $Cat$ using anafunctors, but it is not clear to me what are the axioms for a variant of 2-category which this example belongs to. I do not understand what you mean by replacing hom-functor with anafunctor in that definition: I mean which definition of bicategory is phrased in terms of hom-functors; standard definition talks associators and so on\ldots{}Please be more explicit.

[[Mike Shulman|Mike]]: Is this version clearer?

\emph{Toby}: Or look at the complete definition in the reference that I just added.

If [[Cat]] is defined as consisting of ([[small category|small]]) [[category|categories]], anafunctors, and [[ananatural transformation]]s (as is most appropriate in the absence of choice), then $Cat$ is more naturally an anabicategory rather than any stricter notion.

[[Mike Shulman|Mike]]: Is that only because of the non-canonicity of pullbacks in $Set$? If our version of $Set$ has canonical chosen pullbacks, do we get an ordinary bicategory?

\emph{Toby}: H'm \ldots{} as I recall, you get an ordinary bicategory using canonical pullbacks and general anafunctors, but if you move to \emph{saturated} anafunctors, then you still only get an anabicategory. I should check this and then rewrite (here and at [[Cat]]) to say it correctly. (Of course, if you really use anafunctors, then you should only \emph{want} an anabicategory.)

\hypertarget{explicit_definition}{}\section*{{Explicit definition}}\label{explicit_definition}

An anabicategory $\mathcal{C}$ consists of a set $\mathcal{C}_0$ of objects, a set $\mathcal{C}_1$ of 1-cells, which are relations $\mathcal{C}_0 \times \mathcal{C}_0$, and a set $\mathcal{C}_2$ of 2-cells, which are relations $\mathcal{C}_1 \times \mathcal{C}_1$. (Note that only $\mathcal{C}_2$ needs a defined equality relation, so the other two sets only need to be [[preset]]s.) On these sets are defined several relations; for each relation $R$ if we have $R(x, y)$ $y$ is said to be a \emph{value} of $R$ at $x$. Some pairs $x, y$ with $R(x, y)$ are also said to be \emph{specified values}; generally if $R$ has some value at $x$, at least one such value will be specified. We omit the word ``value'' when it is clear from context.

\begin{enumerate}%
\item There are \emph{source} and \emph{target} relations $\mathcal{C}_1 \times \mathcal{C}_0$ and $\mathcal{C}_2 \times \mathcal{C}_1$, and every 1- or 2- cell $f$ has some specified value for its source and target.
\item There are \emph{2-source} and \emph{2-target} relations $\mathcal{C}_2 \times \mathcal{C}_0$, and every 2- cell $f$ has some specified value for its 2-source and 2-target.
\item There are \emph{identity} relations $Id:\mathcal{C}_0 \times \mathcal{C}_1$ and $\mathcal{C}_1 \times \mathcal{C}_2$, and every object or 1-cell has some specified value for its identity.
\item There is a \emph{composition} relation $\circ:(\mathcal{C}_1 \times \mathcal{C}_1) \times \mathcal{C}_1$; whenever $f_1$ and $f_2$ are such that some specified target of $f_1$ is also a specified source of $f_2$, there is some specified value of the composite of $f_1$ and $f_2$.
\item There is a \emph{1-composition} relation $\circ_1:(\mathcal{C}_2 \times \mathcal{C}_2) \times \mathcal{C}_2$; whenever $f_1$ and $f_2$ are such that some specified 2-target at $f_1$ is also a specified 2-source at $f_2$, there is some specified value of the 1-composite of $f_1$ and $f_2$.
\item There is a \emph{2-composition} relation $\circ_2:(\mathcal{C}_2 \times \mathcal{C}_2) \times \mathcal{C}_2$; whenever $f_1$ and $f_2$ are such that some specified target at $f_1$ is also a specified source at $f_2$, there is some specified value of the 2-composite of $f_1$ and $f_2$.

\end{enumerate}
The relations satisfy the following conditions:

\begin{enumerate}%
\item For any 2-cell $f$, and any values $x$ and $y$ of its source and target (respectively), the set of targets of $x$, of targets of $y$, and of 2-targets of $f$ are all equal (as subsets of $\mathcal{C}_1$), and likewise for sources/2-sources. If $x$ or $y$ is a specified value of either relation, each specified value of its source is a specified value of the 2-source, and likewise for targets/2-targets.
\item Any source of an identity $x$ is also a target of $x$, and vice versa. (However, we do not require the sets of specified values to match.) For any specified identity $y$ of $x$, $x$ should be a specified source and target of $y$.
\item If $h$ is composition of $f \circ g$, the set of targets of $f$ is equal to the set of targets of $h$, and the set of sources of $g$ is equal to the set of sources of $h$. If $h$ is a specified composition, any specified target of $f$ is a specified target of $h$, and any specified source of $g$ is a specified source of $h$. (In general the converses may fail.) Moreover, if the composition $f \circ g$ has any value, the set of targets of $g$ is equal to the set of sources of $f$.
\item If $h$ is a value of the 2-composition $f \circ_2 g$, the set of targets of $f$ is equal to the set of targets of $h$, and the set of sources of $g$ is equal to the set of sources of $h$. If $h$ is a specified value of the 2-composition, any specified target of $f$ is a specified target of $h$, and any specified source of $g$ is a specified source of $h$. Moreover, if the 2-composition $f \circ_2 g$ has any value, the set of targets of $g$ is equal to the set of sources of $f$.
\item If $h$ is a value of the 1-composition $f \circ_1 g$, each source of $h$ is a composition of some source of $f$ and some source of $g$, and each such composition is a source of $h$. For any specified sources of $f$ and $g$, each specified value of their composition is a specified source of $h$. The same results hold with source replaced by target. Moreover, if the 1-composition $f \circ_1 g$ has any value, the set of 2-targets of $g$ is equal to the set of 2-sources of $f$.

\end{enumerate}
There are also conditions defining equivalence relations on $\mathcal{C}_0$ and $\mathcal{C}_1$. (The equivalence relation for $\mathcal{C}_2$ is simply equality.) All the relations defined above are required to be invariant under the appropriate equivalence relations (note, however, that their specified values do not need to be invariant). So in particular, the identity relation $\mathcal{C}_1\times \mathcal{C}_2$ and the 1- and 2- composition relations $(\mathcal{C}_2 \times \mathcal{C}_2) \times \mathcal{C}_2$ are functional: any two values of the identity on some 1-cell $x$, or any two values of one of the compositions on some 2-cells $f$ and $g$, must be equal (as elements of $\mathcal{C}_2$.)

\begin{itemize}%
\item A 2-cell $f$ is said to be an \emph{isomorphism} (between any of its sources and any of its targets) if there are some 2-cell $g$ and 1-cell $x$ such that the 2-composition of $f$ and $g$ is the identity on $x$. We say that $g$ is an \emph{inverse} of $f$.
\item Two 1-cells $f$ and $g$ are \emph{isomorphic} if there is a 2-cell isomorphism $h$ with $f$ as a source and $g$ as a target (or equivalently, vice versa). This is the chosen equivalence relation for $\mathcal{C}_1$.
\item A 1-cell $f$ is said to be an \emph{equivalence} (between any of its sources and any of its targets) if there are some 1-cell $g$ and object $x$ such that some composition of $f$ and $g$ in either direction is isomorphic to an identity on $x$.
\item Two objects $x$ and $y$ are \emph{equivalent} if there is a 1-cell equivalence $g$ with $x$ as a source and $y$ as a target (or equivalently, vice versa). This is the chosen equivalence relation for $\mathcal{C}_0$.

\end{itemize}
Finally there are coherence relations:

\begin{enumerate}%
\item Let $f$ be an identity 2-cell (in other words, a value of the identity relation for some 1-cell), and $g$ be any 2-cell. Then, if there is a 2-composition $f \circ_2 g$ or $g \circ_2 f$, any such value is equal to $g$. It follows (by considering their 2-composition) that identities on isomorphic 1-cells are equal, and that when two 1-cells are isomorphic, this fact will be witnessed by the identity on either object.
\item Let $f$ and $g$ be identity 2-cells on, say, $x$ and $y$ respectively, and suppose that $f \circ_1 g$ exists. Then it is an identity 2-cell on any value of $x \circ y$. Equivalently: the 1-composition of isomorphisms is an isomorphism.
\item Let $f$ be an identity 1-cell, and let $g$ be any 1-cell. Then, if there is a composition $f \circ g$ or $g \circ f$, any such value is isomorphic to $g$. It follows (by considering their composition) that identities on equivalent objects are isomorphic, and that when two objects are equivalent, this fact will be witnessed by the identity on either object.
\item Let $f$, $g$, and $h$ be 2-cells. If $F = f \circ_2 g$, and $G = g \circ_2 h$, then $F \circ_2 h = f \circ_2 G$. (The latter values exist because the set of targets of $G$ and $g$ are equal, as are the set of sources of $g$ and $F$.)
\item Let $f$, $g$, and $h$ be 2-cells. If $F = f \circ_1 g$, and $G = g \circ_1 h$, then $F \circ_1 h = f \circ_1 G$. (The latter values exist because the set of 2-targets of $G$ and $g$ are equal, as are the set of 2-sources of $g$ and $F$.) It follows that composition of 1-cells is also associative, up to isomorphism.
\item Let $f_1$, $f_2$, $g_1$, and $g_2$ be 2-cells. If $F = f_1 \circ_1 f_2$, $G = g_1 \circ_1 g_2$, $H_1 = f_1 \circ_2 g_1$, and $H_2 = f_2 \circ_2 g_2$, then $F \circ_1 G = H_1 \circ_2 H_2$. (It follows from the preceding relations that these compositions exist.)

\end{enumerate}
So every anabicategory is ``ana[[skeletal]]'' (every equivalence is an identity), and ``[[strict category|anastrict]]:'' its associators and unitors are also identities.

Every [[bicategory]] can be made into an anabicategory; we simply make the source, target, identity, and composition maps into relations with the original functions as specified values, then define the full values by isomorphism and equivalence. This will satisfy the coherence relations because the original bicategory satisfied the bicategory coherence relations.

On the other hand, we can also assume that every value of the defining relations is specified; then the anabicategory is said to be \emph{saturated}. Any such anabicategory is clearly [[anafunctors|anaequivalent]] to a strict 2-category (just map each object or 1-cell to its equivalence class, and vice versa). For there to be a weak equivalence between the anabicategory and the 2-category, however, we would need the [[Axiom of Choice]] (to pick out a single element of each equivalence class to serve as its image).

\hypertarget{reference}{}\section*{{Reference}}\label{reference}

\begin{itemize}%
\item [[Michael Makkai]]; Avoiding the axiom of choice in general category theory; section 3 (which is part 4 \href{http://www.math.mcgill.ca/makkai/anafun/}{here}).

\end{itemize}


\end{document}