\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*{category object in an (infinity,1)-category}

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

\hypertarget{internal_categories}{}\paragraph*{{Internal $(\infty,1)$-Categories}}\label{internal_categories}

[[!include internal infinity-categories contents]]

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

[[!include quasi-category theory contents]]

\hypertarget{topos_theory}{}\paragraph*{{$(\infty,1)$-Topos Theory}}\label{topos_theory}

[[!include (infinity,1)-topos - contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{MotivationAndIntroduction}{Motivation and introduction}\dotfill \pageref*{MotivationAndIntroduction} \linebreak
\noindent\hyperlink{Definition}{Definition}\dotfill \pageref*{Definition} \linebreak
\noindent\hyperlink{SimplicialObjects}{Simplicial objects}\dotfill \pageref*{SimplicialObjects} \linebreak
\noindent\hyperlink{PreCategoryInTopos}{Pre-category objects}\dotfill \pageref*{PreCategoryInTopos} \linebreak
\noindent\hyperlink{GroupoidObjects}{Groupoid objects}\dotfill \pageref*{GroupoidObjects} \linebreak
\noindent\hyperlink{GroupoidObjectDefinition}{Definition}\dotfill \pageref*{GroupoidObjectDefinition} \linebreak
\noindent\hyperlink{CoreflectionOfGroupoidsIntoPrecategories}{Coreflection into pre-category objects}\dotfill \pageref*{CoreflectionOfGroupoidsIntoPrecategories} \linebreak
\noindent\hyperlink{category_objects}{Category objects}\dotfill \pageref*{category_objects} \linebreak
\noindent\hyperlink{CategoryObjectInTopos}{In an $(\infty,1)$-topos}\dotfill \pageref*{CategoryObjectInTopos} \linebreak
\noindent\hyperlink{ChoiceOfGroupoidObjects}{Relative core -- Choice of groupoid objects}\dotfill \pageref*{ChoiceOfGroupoidObjects} \linebreak
\noindent\hyperlink{CategoryObjectsInC}{In a general $(\infty,1)$-category}\dotfill \pageref*{CategoryObjectsInC} \linebreak
\noindent\hyperlink{InternalnCategories}{Iterated internalization -- Internal $n$-categories}\dotfill \pageref*{InternalnCategories} \linebreak
\noindent\hyperlink{enriched_categories_as_internal_categories}{Enriched categories as internal categories}\dotfill \pageref*{enriched_categories_as_internal_categories} \linebreak
\noindent\hyperlink{properties}{Properties}\dotfill \pageref*{properties} \linebreak
\noindent\hyperlink{ModelCategoryPresentations}{Model category presentations}\dotfill \pageref*{ModelCategoryPresentations} \linebreak
\noindent\hyperlink{HomotopyTypeTheoryFormulation}{Homotopy type theory formulation}\dotfill \pageref*{HomotopyTypeTheoryFormulation} \linebreak
\noindent\hyperlink{HCategoryTypes}{H-Category types}\dotfill \pageref*{HCategoryTypes} \linebreak
\noindent\hyperlink{0CategoryTypes}{$(0,1)$-Category types}\dotfill \pageref*{0CategoryTypes} \linebreak
\noindent\hyperlink{1CategoryTypes}{$(1,1)$-Category types}\dotfill \pageref*{1CategoryTypes} \linebreak
\noindent\hyperlink{Examples}{Examples}\dotfill \pageref*{Examples} \linebreak
\noindent\hyperlink{the_relative_contexts}{The relative contexts}\dotfill \pageref*{the_relative_contexts} \linebreak
\noindent\hyperlink{OrdinaryInfinityCategories}{Ordinary $(\infty,1)$-categories}\dotfill \pageref*{OrdinaryInfinityCategories} \linebreak
\noindent\hyperlink{categories}{$(\infty,n)$-categories}\dotfill \pageref*{categories} \linebreak
\noindent\hyperlink{InternalBaseTopos}{The internal self-reflection / internal base $(\infty,1)$-topos}\dotfill \pageref*{InternalBaseTopos} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak
\noindent\hyperlink{general}{General}\dotfill \pageref*{general} \linebreak
\noindent\hyperlink{ReferencesFormalizationInHomotopyTypeTheory}{Formalization in homotopy type theory}\dotfill \pageref*{ReferencesFormalizationInHomotopyTypeTheory} \linebreak


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

The notion of \emph{[[(∞,1)-category]]} may be formulated [[internalization|internally]] to any other $(\infty,1)$-category with sufficient properties (with a rich enough [[internal logic]]). This generalizes the notion of \emph{[[internal category]]} from [[category theory]] to [[(∞,1)-category theory]]. In fact, an internal category in an $(\infty,1)$-category is automatically, externally, itself an [[(∞,1)-category]].

A category internal to some given $(\infty,1)$-category $\mathcal{C}$ is a [[simplicial object in an (∞,1)-category]] $A : \Delta^{op} \to \mathcal{C}$ in $\mathcal{C}$, where the object in degree $k$ is to be thought of as ``the object of $k$-tuples of composable morphisms'' in $A$. This is formalized by requiring the canonical morphisms $A_k \to A_1 \times_{A_0} \cdots \times_{A_0} A_1$ (into the iterated [[(∞,1)-pullback]] over the [[source]] and [[target]] maps) to be an [[equivalence in an (∞,1)-category|equivalence in]] $\mathcal{C}$ (the ``[[Segal category|Segal condition]]'').

If $\mathcal{C}$ happens to be just a 1-category, then this already makes $A$ an [[internal category]]. Generally, however, $\mathcal{C}$ comes with its own notion of [[homotopy]], and one must ask in addition that the notion of [[equivalence in an (∞,1)-category|equivalence]] in $A$ is compatible with that in $\mathcal{C}$ (the ``[[complete Segal space|completeness condition]]'').

A general abstract way of formalizing this is given in \hyperlink{Lurie}{Lurie, sections 1.1, 1.2}. For historical reasons, the notion of \emph{internal $(\infty,1)$-category} there goes by the name \emph{complete Segal space object}, in honor of the notion of a \emph{[[complete Segal space]]} (due to [[Charles Rezk]] and in turn chosen in honor of the [[Segal conditions]] for ordinary categories), which is an internal $(\infty,1)$-category in $\mathcal{C} =$ [[∞Grpd]]. But more generally we can consider internal category in a more general [[(∞,1)-topos]], and these are [[(∞,2)-sheaves]] of [[(∞,1)-categories]]

There are a variety of [[model category]] structures that [[presentable (infinity,1)-category|present]] the $(\infty,1)$-category of all internal $(\infty,1)$-categories in a suitable $\mathcal{C}$, which typically go as models for \emph{complete Segal space objects}. The soundness of these models is discussed below in \emph{\hyperlink{ModelCategoryPresentations}{Model category presentations}} (\hyperlink{Lurie}{Lurie, section 1.5}).

\hypertarget{MotivationAndIntroduction}{}\subsection*{{Motivation and introduction}}\label{MotivationAndIntroduction}

Before coming to the formal definitions below in \emph{\hyperlink{Definition}{Definition}}, here are some words for the reader looking for introduction and orientation into the general problem of formulating categories internally in [[homotopy theory]].

Whatever exactly the right or desired nature of a \emph{category internal to an $(\infty,1)$-category/[[homotopy theory]]} is (and we will see that there are some subtleties to beware of and some variants to account for), the bare minimum must be that it consists of

\begin{enumerate}%
\item a \emph{collection} $X_0$ of [[objects]] -- but we shouldn't say [[set]] of objects, of course, instead the generic terminology is: a \emph{[[type]] of objects} and so we should write

$\vdash \; X_0 \colon Type$;


\item for each [[pair]] $x_0, x_1 \colon X_0$ of objects, an \emph{$(x_0,x_1)$-[[dependent type]] of [[morphisms]]} $X_1(x_0,x_1)$ ``from $x_0$ to $x_1$,

$x_0, x_1 \colon X_0 \;\vdash \; X_1(x_0, x_1)$.



\end{enumerate}
(One might decide to collect these all together to a single type $X_1 \coloneqq \underset{x_0,x_1 \colon Type}{\sum} X_1(x_0,x_1)$, but the theory flows much more naturally if we do keep the dependency on the objects explicit.)

At this point one might be tempted to proceed in close analogy to traditional formulations in [[internal category]] theory in non-homotopic 1-[[category theory]] and consider an explicit [[composition]] [[function]]

\begin{displaymath}
x_0, x_1, x_2 \colon X_0 \;\vdash\; comp_{x_0,x_1,x_2} \colon X_1(x_0,x_1) \times X_1(x_1, x_2) \to X_1(x_0, x_2)
\end{displaymath}
to be thought of as taking a [[pair]] $(g,f)$ of composable morphisms to their composite morphism $g \circ f$, and demand that it satisfies [[associativity]] up to [[homotopy]]. This approach is explored below in the section \emph{\hyperlink{HCategoryTypes}{H-category types}}, where it is also discussed that this is \emph{not} the correct notion of category objects internal to a homotopy-theoretic context.

To get a hint for what the correct formulation should be, it is useful to turn this around and investigate which internal-homotopy-theory structure an \emph{ordinary} [[small category]] ([[internal category|internal to]] [[Set]]) gives rise to.

Namely, bare [[homotopy theory]] is about [[groupoids]] and then [[n-groupoids]] and [[∞-groupoids]], and so it should be relevant that a groupoid is itself a category and that, conversely, every category $C \in Cat(Set)$ already contains some ``homotopy theory'', namely its maximal groupoid, its \emph{[[core]]} $i_C \colon core(C) \to C$. This groupoid is ``the [[homotopy theory]] of the [[objects]] of $C$'' in the sense that is contains all the information about the objects and their [[equivalences]]. Therefore it is natural to regard this as the ``type of objects'' and declare $X_0 \coloneqq core(C)$, regarded as an object of objects in the ambient [[(∞,1)-category]] [[Grpd]] $\hookrightarrow$ [[∞Grpd]].

But once we take that perspective, it is clear what the type $X_1$ of morphisms should be: it should be the [[comma object]] of the core inclusion with itself: $X_1 \coloneqq (i_C/i_C)$.

This exposition is further developed in \emph{\hyperlink{Segal%20space#ConstructionFromACategory}{Segal space -- construction from a category}}. There it is discussed how proceeding this way, one finds from $C$ a homotopy-theoretic kind of [[nerve]] which is now not a [[simplicial object]] in [[Set]] anymore (a [[simplicial set]]) as the nerve in ordinary [[category theory]] is, but which is now a [[simplicial object in an (∞,1)-category]], namely in [[Grpd]] $\hookrightarrow$ [[∞Grpd]]. In degree $k \in \mathbb{N}$ it contains not the \emph{set} of sequences of composable morphisms, but the ``space'' of such sequences, which just as the ``space'' $X_0$ of objects knows all the [[homotopies]], namely all the [[equivalences]] between such sequences of composable morphisms.

One then recalls a basic fact of traditional [[category theory]]: a [[simplicial set]] is the [[nerve]] of a [[category]] precisely if it satisfies the [[Segal conditions]]: which say that it is built from certain iterated [[fiber products]] of the 1-[[simplices]] over the [[vertices]]. Accordingly, here one should expect that the simplicial groupoid $X_\bullet$ is built in degree $k$ by a $k$-fold [[homotopy fiber product]] of the space of 1-simplices over the space of vertices, and indeed one finds that it is.

In traditional category theory a simplicial set is the nerve of a category if and only if it satisfies the [[Segal conditions]]. Does the converse already hold here? The above inspection shows that instead of the core inclusion $i_C \colon core(C) \to C$ we could have started with \emph{any} [[functor]] $i \colon K \to C$ and $X_n \coloneqq i^{/^n}$ would still defined a simplicial groupoid that satisfies the [[Segal conditions]]. So in homotopy theory the Segal conditions, which witness the fact that we formed a nerve by iterated [[homotopy fiber product]], need to be accompanied by one more condition which ensures that we are indeed forming the homotopy fiber product not of any map, but of the [[core]]-inclusion (this is often, but somewhat undescrptively, called the ``[[complete Segal space|compleness]] condition'', and more recently also called a [[univalence]] condition).

Finally, the [[nerve]] of a category in fact contains lots of redundant information. It is [[coskeleton|2-coskeletal]] and hence in a precise sense already its [[skeleton|2-skeleton]] $X_2 \stackrel{\to}{\stackrel{\to}{\to}} X_1 \stackrel{\to}{\to} X_0$ contains all the relevant information. Therefore we may decide to write this out explicitly in terms of a further [[dependent type]] $X_2$ of [[compositions]]. This explicit 2-skeletal formulation of internal [[(1,1)-categories]] in [[homotopy theory]] is spelled out below in \emph{\hyperlink{1CategoryTypes}{(1,1)-Category types}}.

But of course the point of category objects internal ot an $(\infty,1)$-category is to speak about structures of higher homotopical degree, hence about untruncated [[simplicial objects in an (∞,1)-category]] and the appropriate conditions on them to qualify as internal categories. The comprehensive discussion of this definition we turn to in \emph{\hyperlink{Definition}{Definition}}.

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

We define category objects internal to an [[(∞,1)-category]] $\mathcal{C}$ (and with respect to a choice of ``inclusion of groupoids'' $\mathbf{H}\hookrightarrow \mathcal{C}$) by a sequence of full ([[coreflective subcategory|co]])[[reflective sub-(∞,1)-categories]]

\begin{displaymath}
\mathbf{H}
   \hookrightarrow
  Cat_{\mathbf{H}}(\mathcal{C})
   \hookrightarrow
  PreCat_{\mathbf{H}}(\mathcal{C})
    \hookrightarrow 
  \mathcal{C}^{\Delta^{op}}
\end{displaymath}
of that of

\begin{itemize}%
\item \hyperlink{SimplicialObjects}{Simplicial objects in an (∞,1)-category}.

\end{itemize}
The definition makes recourse to the notion of [[groupoid object in an (∞,1)-category]], and so we first review that in

\begin{itemize}%
\item \hyperlink{GroupoidObjects}{Groupoid objects in an (∞,1)-category}.

\end{itemize}
Then we discuss the definition of

\begin{itemize}%
\item \hyperlink{CategoryObjectInTopos}{Internal categories in an (∞,1)-topos}.

\end{itemize}
The canonical example here is the archtypical [[(∞,1)-topos]] $\mathbf{H} =$ [[∞Grpd]] of [[∞-groupoids]]: a category object internal to that is essentially what is also called a [[complete Segal space]]. But the definition works for any other [[(∞,1)-topos]], hence for general [[(∞,1)-categories of (∞,1)-sheaves]] (of [[∞-stacks]]).

More generally, given a [[full and faithful (∞,1)-functor|fully faithful inclusion]] $\mathbf{H} \hookrightarrow \mathcal{C}$ of an [[(∞,1)-topos]] into some other [[(∞,1)-category]], we can define

\begin{itemize}%
\item \hyperlink{InAnInfinity1Category}{Internal categories in an (∞,1)-category}.

\end{itemize}
The archetypical example here is the case where again $\mathbf{H} =$ [[∞Grpd]] $=: (\infty,0)Cat$ and where then, by [[induction]] on $n$, the inclusion is $\infty Grpd \hookrightarrow (\infty,n)Cat$ that of $\infty$-groupoids into [[(∞,n)-categories]]. The resulting internal category objects are then externally essentially [[n-fold complete Segal spaces|(n+1)-fold complete Segal spaces]], hence $(\infty,n+1)$-categories.

But again, more generally, $\mathbf{H}$ can be an [[(∞,1)-category of (∞,1)-sheaves]] and $\mathcal{C}$ for instance an [[(∞,2)-topos]] of [[(∞,2)-sheaves]], yielding $(\infty,3)$-sheaves, and so on.

\hypertarget{SimplicialObjects}{}\subsubsection*{{Simplicial objects}}\label{SimplicialObjects}

Let $\mathcal{C}$ be an [[(∞,1)-category]]. We discuss in the following a sequence of [[reflective sub-(∞,1)-categories]] of that of [[simplicial objects in an (∞,1)-category]] $\mathcal{C}^{\Delta^{op}}$ in $\mathcal{C}$, see there for more details.

We frequently refer to the [[powering]] of a simplicial object $X_\bullet$ by a [[simplicial set]], into an object in $\mathcal{C}$, denoted $X(K)$. For details on this see at \emph{\href{simplicial+object+in+an+%28infinity%2C1%29-category#Powering}{simplicial object in an (∞,1)-category -- Powering}} .

\begin{remark}
\label{RemarkNoNeedForLocalization}\hypertarget{RemarkNoNeedForLocalization}{}
It is noteworthy that category objects internal to $\mathcal{C}$, as defined below, will form a \emph{full} [[sub-(∞,1)-category]] of that of [[simplicial objects in an (∞,1)-category]]. In traditional theory of [[internal categories]]a major issue is that in general there are not enough [[internal functors]]: the full subcategory of internal [[graphs]] on the internal categories needs to be further [[localization|localized]], in general. But this turns out to be an artefact of the ambient category being an [[(n,1)-category]] for $n$ too low.

For a discussion of how for plain [[internal categories]] (those that also externally are [[1-categories]]) the traditional localization becomes superfluous if the ambient context is a [[(2,1)-category]] (instead of just a [[1-category]]) see at [[2-topos]] the section \emph{\href{2-topos#InTermsOfInternalCategories}{In terms of internal categories}}. The following may be thought of as a generalization of that discussion.

\end{remark}
\hypertarget{PreCategoryInTopos}{}\subsubsection*{{Pre-category objects}}\label{PreCategoryInTopos}

Let $\mathcal{C}$ be an [[(∞,1)-category]] with [[finite limit|finite]] [[(∞,1)-limits]]

\begin{defn}
\label{PreCategoryObject}\hypertarget{PreCategoryObject}{}
An \textbf{internal precategory} $X$ in $\mathcal{C}$ is a [[simplicial object in an (∞,1)-category]]

\begin{displaymath}
X : \Delta^{op} \to \mathcal{C}
\end{displaymath}
such that it satifies the \emph{[[Segal condition]]}, hence such that for all $n \in \mathbb{N}$, $X$ exhibits $X([n])$ as the [[(∞,1)-limit]] / iterated [[(∞,1)-pullback]]

\begin{displaymath}
X([n]) \simeq 
  \underbrace{
    X(\{0,1\}) \underset{X([0])}{\times} \cdots \underset{X[0]}{\times} X(\{n-1,n\})
  }_{n \; factors}
  \,.
\end{displaymath}
Write $PreCat(\mathcal{C})$ for the $(\infty,1)$-category of internal pre-categories in $\mathcal{C}$, the [[full sub-(∞,1)-category]] of the [[simplicial objects]] on the internal precategories.

\end{defn}
This is called a \emph{category object} in (\hyperlink{Lurie}{Lurie, def. 1.1.1}). Here we reserve that term for those objects that behave more like category objects should, which are the \emph{[[complete Segal space]] objects}, below.

\begin{remark}
\label{}\hypertarget{}{}
By the discussion at \emph{\href{Segal%20condition#InTermsOfSheafConditionForSimplicialObjects}{Segal conditions -- In terms of sheaf conditions}}, this means that $PreCat(\mathcal{C})$ sits in an [[(∞,1)-pullback]] square in [[(∞,1)Cat]]

\begin{displaymath}
\itexarray{
    PreCat(\mathcal{C}) &\hookrightarrow& \mathcal{C}^{\Delta^{op}}
    \\
    \downarrow && \downarrow
    \\
    Graphs(\mathcal{C})
    &\hookrightarrow&
    \mathcal{C}^{\Delta_0^{op}}
  }
  \,,
\end{displaymath}
where $\Delta_0^{op} \to \Delta$ is the [[wide subcategory]] of the [[simplex category]] on the injective maps that moreover send elementary edges to elementary edges (morphisms of linear [[graphs]]), and the bottom morphism is the functor that sends a [[graph]] object $X_1 \stackrel{\overset{\partial_1}{\to}}{\underset{\partial_0}{\to}} X_0$ to the object which in degree $n$ is $\underbrace{ X_1 \underset{X_0}{\times} \cdots \underset{X_0}{\times} X_1}_{n\; factors}$.

\end{remark}
\begin{remark}
\label{CompositionInPreCategory}\hypertarget{CompositionInPreCategory}{}
The [[Segal conditions]] imply that for $X_\bullet$ a pre-category object, there is a [[composition]] map

\begin{displaymath}
X_1 \times_{X_0} X_1
  \underoverset{\simeq}{(\partial_0, \partial_2)^{-1}}{\to}
  X_2
  \stackrel{\partial_1}{\to}
  X_1
\end{displaymath}
which satisfies [[associativity]] and the [[unit law]] up to higher [[coherence|coherent]] [[homotopy]]. A [[subobject in an (∞,1)-category]] $Y \hookrightarrow X_1$ on such that restricted along this inclusion this composition becomes invertible we call a subobject of equivalences.

\end{remark}
\begin{defn}
\label{Equivalences}\hypertarget{Equivalences}{}
For $X_\bullet$ a pre-category object, def. \ref{PreCategoryObject}, write

\begin{displaymath}
Equiv(X_1) \hookrightarrow X_1
\end{displaymath}
for the maximal [[subobject in an (∞,1)-category]] of the object of 1-morphisms on those which are [[equivalences]] with respect to the [[composition]] of remark \ref{CompositionInPreCategory}.

\end{defn}
\hypertarget{GroupoidObjects}{}\subsubsection*{{Groupoid objects}}\label{GroupoidObjects}

A \emph{groupoid object} is a pre-category object, def. \ref{PreCategoryObject} whose composition operation according to remark \ref{CompositionInPreCategory} is invertible. This is discussed in more detail at \emph{[[groupoid object in an (∞,1)-category]]}. Here we briefly recall the

\begin{itemize}%
\item \hyperlink{GroupoidObjectDefinition}{Definition}

\end{itemize}
and then discuss the crucial property for the further developments here, which is the

\begin{itemize}%
\item \hyperlink{CoreflectionOfGroupoidsIntoPrecategories}{Coreflection of gropoid objects into pre-category objects}.

\end{itemize}
\hypertarget{GroupoidObjectDefinition}{}\paragraph*{{Definition}}\label{GroupoidObjectDefinition}

Let $\mathcal{C}$ be an [[(∞,1)-category]] with finite $(\infty,1)$-limits.

\begin{defn}
\label{GroupoidObject}\hypertarget{GroupoidObject}{}
A \emph{[[groupoid object in an (∞,1)-category|groupoid object]]} in $\mathcal{C}$ is a [[simplicial object in an (∞,1)-category]]

\begin{displaymath}
X : \Delta^{op} \to \mathcal{C}
\end{displaymath}
satisfying the following equivalent conditions

\begin{enumerate}%
\item $X_\bullet$ satisfies the \emph{groupoidal [[Segal conditions]]}, meaning that for all $n \in \mathbb{N}$ and all partitions $[n] \simeq S \cup S'$ that share a single element $S \cap S' = \{s\}$, the [[(∞,1)-functor]] $X$ exhibits an [[(∞,1)-pullback]]

\begin{displaymath}
X([n]) \simeq X(S) \times_{X(S \cap S')} X(S')
  \,;
\end{displaymath}

\item $X_\bullet$ is a pre-category object, def. \ref{PreCategoryObject}, and the morphism

\begin{displaymath}
X(\Delta^2) \to X(\Lambda^2_0)
\end{displaymath}
is an [[equivalence in an (∞,1)-category|equivalence]] in $\mathcal{C}$.



\end{enumerate}
Write $Grpd(\mathcal{C})$ for the [[(∞,1)-category]] of groupoid objects in $\mathcal{C}$, the [[full sub-(∞,1)-category]] of [[simplicial object in an (∞,1)-category|simplicial objects]] on the groupoid objects.

\end{defn}
The equivalence follows with [[HTT|HTT prop. 6.1.2.6]], see at \emph{\href{groupoid+object+in+an+%28infinity%2C1%29-category#EquivalentCharacterizations}{groupoid object -- equivalent characterizations}}.

\begin{remark}
\label{}\hypertarget{}{}
For $\mathcal{C} = \infty Grpd$, a \emph{[[groupoid object in an (∞,1)-category|groupoid object]]} $X$ in $\mathcal{C}$ is a pre-category object $X_\bullet \in PreCat(\mathcal{C}) \hookrightarrow \mathcal{C}^{\Delta^{op}}$, def. \ref{PreCategoryObject}, such that the full inclusion

\begin{displaymath}
Equiv(X_1) \hookrightarrow X_1
\end{displaymath}
is an [[equivalence in an (∞,1)-category]].

\end{remark}
\begin{remark}
\label{}\hypertarget{}{}
We are to think of $X([0])$ as the \emph{$\mathcal{C}-$[[object]] of [[objects]]} of a groupoid internal to $\mathcal{C}$, and of $X([1])$ as its \emph{$\mathcal{C}$-[[object]] of [[morphisms]]}. In terms of this the above condition says two things:

\begin{enumerate}%
\item for $S \cup S'$ an order-preserving partition (meaning that for all $s \in S$, $s' \in S'$ we have $s \leq s'$) it says that $X([n])$ may be identified with the \emph{object of sequences of lenght $n$ of [[composition|composable]] [[morphisms]]};


\item for $S \cup S'$ not order-preserving, it says that morphisms have [[inverses]]. For instance for the partition of $[2]$ given by $S = \{0,1\}$ and $S' = \{0,2\}$ the above says intuitively that [[diagrams]] in the internal groupoid of the form

\begin{displaymath}
\itexarray{
     && b
     \\
     & \nearrow && \searrow
     \\
     a &&&& c
  }
\end{displaymath}
(an [[inner Kan fibration|inner]] [[horn]]) are equivalent to those of the form

\begin{displaymath}
\itexarray{
     && b
     \\
     & \nearrow && 
     \\
     a &&\to&& c
  }
\end{displaymath}
(an [[Kan fibration|outer]] [[horn]]).

The equivalence defines and is defined by forming the [[inverse]] of the morphism $b \to c$.



\end{enumerate}
\end{remark}
Accordingly, below a \emph{category object} is defined analogously, but demanding the above condition only for ordered decompositions.

There will be one additional condition on category objects (``completeness''). In order to see where this comes from, notice the following.

\begin{prop}
\label{EmbeddingOfConstantGroupoidObjects}\hypertarget{EmbeddingOfConstantGroupoidObjects}{}
There is a [[full and faithful (∞,1)-functor]]

\begin{displaymath}
const : \mathcal{C} \hookrightarrow Grpd(\mathcal{C})
\end{displaymath}
sending an [[object]] $X$ of $\mathcal{C}$ to the corresponding constant [[simplicial object]] $(const X) : [n] \mapsto X$.

If $\mathcal{C}$ has [[small (∞,1)-category|small]] [[(∞,1)-colimits]], then this is a [[reflective sub-(∞,1)-category|reflective embedding]], whose reflector

\begin{displaymath}
\lim_\to : Grpd(\mathcal{C}) \to \mathcal{C}
\end{displaymath}
forms the [[(∞,1)-colimit]] in $\mathcal{C}$ over the simplicial diagram underlying a groupoid object.

\end{prop}
See (\hyperlink{Lurie}{Lurie, example 1.1.4}).

\hypertarget{CoreflectionOfGroupoidsIntoPrecategories}{}\paragraph*{{Coreflection into pre-category objects}}\label{CoreflectionOfGroupoidsIntoPrecategories}

In order to state the [[complete Segal space|completeness condition]] on a precategory object, def. \ref{PreCategoryObject}, we need to reflect, or rather \emph{coreflect}, it onto its [[core]] groupoid object, def. \ref{GroupoidObject}.

We first consider this for the ambient [[(∞,1)-topos]] $\mathbf{H}$ being [[∞Grpd]], then we use that to deal with the general case.

\begin{defn}
\label{HomotopyCategoryOfPreCategoryObject}\hypertarget{HomotopyCategoryOfPreCategoryObject}{}
For $X_\bullet \in \infty Grpd^{\Delta^{op}}$ a precategory object, def. \ref{PreCategoryObject}, its corresponding \textbf{[[H-category]]} is, up to [[equivalence of categories|equivalence]], the [[Ho(∞Grpd)]]-[[enriched category]] $h X_\bullet$ with

\begin{itemize}%
\item the [[objects]] are the points of $X_0$ (more invariantly: the objects are any [[set]] of points in $X_0$ containing at least one point in each connected components);


\item the [[homotopy type]] of morphisms for any pair $(x_0,x_1)$ of objects is that of the of the [[(∞,1)-pullback]]

\begin{displaymath}
h X(x_0,X1) \coloneqq \{x_0\} \underset{X_0}{\times} X_1 \underset{X_0}{\times} \{x_1\}
  \in \infty Grpd \to Ho(\infty Grpd)
\end{displaymath}

\item the [[composition]] $comp_{x_0,x_1, x_2}$ is given by the morphism

\begin{displaymath}
\begin{aligned}
    h X(x_0,x_1) \times h X(x_1, x_2) 
    & \simeq \{x_0\} \underset{X_0}{\times} \{x_1\} \underset{X_0}{\times} X_1 \underset{X_0}{\times} \{x_2\}
    \\
    & \to \{x_0\} \underset{X_0}{\times} X_1 \underset{X_0}{\times} X_1 \underset{X_0}{\times} \{x_2\}
    \\
    & \stackrel{\simeq}{\to}
     \{x_0\} \underset{X_0}{\times} X_2 \underset{X_0}{\times} \{x_1\}
    \\
    & \stackrel{\partial_1}{\to}
     \{x_0\} \underset{X_0}{\times} X_1 \underset{X_0}{\times} \{x_2\}      
    \\
    & = h X(x_0,x_2)
  \end{aligned}
  \,,
\end{displaymath}


\end{itemize}
where the second map is an isomorphism in [[Ho(∞Grpd)]] which is the inverse of the [[equivalence]] in [[∞Grpd]] that exists by the [[Segal conditions]] assumed to be satisfied by $X_\bullet$.

\end{defn}
(In (\hyperlink{Lurie}{Lurie}) this is def. 1.1.6.)

\begin{defn}
\label{Equivalences}\hypertarget{Equivalences}{}
For $X_\bullet \in \infty Grpd^{\Delta^{op}}$ a pre-category object, we say that a point $f \colon * \to X_1$ in the degree-1 object is an [[equivalence]] if it is an [[isomorphism]] in the category $h X$, def. \ref{HomotopyCategoryOfPreCategoryObject}. For $n \in \mathbb{N}$, $n \geq 1$, write

\begin{displaymath}
Equiv(X_n) \hookrightarrow X_n
\end{displaymath}
for the [[1-monomorphism]] that includes the full-sub-$\infty$-groupoid on the sequences of equivalences. Write furthermore

\begin{displaymath}
Core(X)_\bullet \in Grpd(\infty Grpd) \hookrightarrow \infty Grpd^{\Delta^{op}}
\end{displaymath}
for the [[simplicial object]] with

\begin{displaymath}
Core(X)_0 \coloneqq X_0
\end{displaymath}
and

\begin{displaymath}
Core(X)_n \coloneqq Equiv(X_n)
  \,.
\end{displaymath}
This is evidently a [[groupoid object in an (infinity,1)-category|groupoid object]], def. \ref{GroupoidObject}, called the \textbf{[[core]]} of the pre-category object $X_\bullet$.

\end{defn}
\begin{remark}
\label{}\hypertarget{}{}
This is a more abstract formulation of what equivalently is [[presentable (infinity,1)-category|presented]] by the corresponding discussion for [[Segal spaces]] and [[complete Segal space]], see at \emph{\href{http://ncatlab.org/nlab/show/complete+Segal+space#Definition}{complete Segal space -- Definition}}.

\end{remark}
In order to state the completeness condition on pre-category objects that make them be genuine category objects, we need this [[core]]-construction exhibits groupoid objects as a [[coreflective sub-(∞,1)-category]] of pre-category objects.

\begin{prop}
\label{CoreOnPreCategoryObjects}\hypertarget{CoreOnPreCategoryObjects}{}
Let $\mathbf{H}$ be an [[(∞,1)-topos]]. Every [[groupoid object in an (∞,1)-category|groupoid object in]] $\mathbf{H}$ is canonically an internal pre-category. Under this inclusion $i \colon Grpd(\mathbf{H}) \hookrightarrow PreCat(\mathbf{H})$ the groupoid objects form a [[coreflective sub-(∞,1)-category]] of that of pre-catgegory objects,

\begin{displaymath}
(i \dashv core)
  \colon
  Grpd(\mathbf{H})
  \stackrel{\hookrightarrow}{\underset{Core}{\leftarrow}}
  PreCat(\mathbf{H})
  \,.
\end{displaymath}
The coreflection is the \emph{[[core]]} operation that discards non-invertible morphisms.

\end{prop}
This is (\hyperlink{Lurie}{Lurie, prop. 1.1.14}).

\begin{proof}
With def. \ref{Equivalences} it is direct to establish the statement for the case that $\mathcal{C} \simeq$ [[∞Grpd]], (\hyperlink{Lurie}{Lurie, cor. 1.1.11}), for instance by using the standard theory of [[Segal spaces]]. From this it follows also for the case that $\mathbf{H} \simeq PSh_\infty(\mathcal{D})$ is an [[(∞,1)-category of (∞,1)-presheaves]] by arguing objectwise over objects in $\mathcal{D}$. In the general case, $\mathbf{H}$ is a [[reflective sub-(∞,1)-category]] of such, $\mathcal{C} \hookrightarrow PSh_\infty(\mathcal{D})$. It is then sufficient to show that the core operation on the presheaf $\infty$-toposes respects these inclusions, so that we have

\begin{displaymath}
\itexarray{
    Grpd(\mathbf{H}) &\hookrightarrow& Grpd(PSh_\infty(\mathcal{D}))
    \\
    \downarrow \uparrow^{\mathrlap{Core}} && \downarrow \uparrow^{\mathrlap{Core}_{PSh}}
    \\
    PreCat(\mathbf{H}) &\hookrightarrow& PreCat(PSh_\infty(\mathcal{D}))
  }
  \,.
\end{displaymath}
This means that we need to show that if $X_\bullet$ is degreewise in $\mathbf{H} \hookrightarrow PSh_\infty(\mathcal{D})$ and is a pre-category object, then $Core_{PSh}(X_\bullet)$ is degreewise in $\mathbf{H}$. By the pre-category condition and since the refletive inclusion is [[right adjoint]] and hence preserves the fiber products, for this it is sufficient that $Core_{Psh}(X)_0$ and $Core_{PSh}(X)_1$ are in $\mathbf{H}$. To complete the proof it is sufficient to show that the first of these is $X_0$ and (again since the inclusion preserves limits) the second is equivalent to the \href{simplicial%20object%20in%20an%20%28infinity,1%29-category#Powering}{powering} $X(K)$, where

\begin{displaymath}
K \coloneqq \Delta^0 \coprod_{\Delta^{\{0,2\}}} \Delta^3 \coprod_{\Delta^{\{1,3\}}} \Delta^
  \;\;\;
  \in 
  sSet
\end{displaymath}
is the [[simplicial set]] obtained from the [[simplex|3-simplex]] by collapsing the $(0,2)$-edge and the $\{1,3\}$-edge. Write $K^0 \coloneqq \{1,2\} \hookrightarrow K$ for the image of the $(1,2)$-edge of $\Delta^3$. Schematically:

\begin{displaymath}
K =
  \left\{
    \itexarray{
      1 &\stackrel{K^0}{\to}& 0
      \\
      \uparrow &\nearrow_{\mathrlap{id}}& \downarrow
      \\
      0 &\to& 1
    }
    \;\;\; \Rightarrow \;\;\;
    \itexarray{
      1 &\stackrel{K^0}{\to}& 0
      \\
      \uparrow &\searrow^{\mathrlap{id}}& \downarrow
      \\
      0 &\to& 1
    }   
  \right\}
  \,.
\end{displaymath}
We claim generally that

\begin{enumerate}%
\item for $X \in PreCat(\mathbf{H})$ the canonical morphism $Core(X)(K) \to X(K)$ is an equivalence;


\item for $Y \in Grpd(\mathbf{H})$ the canonical morphism $Y(K) \to Y(K^0)$ is an equivalence.



\end{enumerate}
(This is (\hyperlink{Lurie}{Lurie, prop. 1.1.13}).)

Here

\begin{displaymath}
X(K) \simeq  X_0 \underset{X(\{0,2\})}{\times} X_3 \underset{X(\{1,3\})}{\times} X_0
\end{displaymath}
etc. By construction, $Core(X)(K) \to X(K)$ is fully faithful. Hence to see that it is an equivalence, hence in addition essentially surjective, it is sufficient to observe that

\begin{displaymath}
X(K)
  \simeq
  X_0 \underset{X_{\{0,1\}}}{\times} X_3 \underset{X_{\{1,3\}}}{\times} X_0
\end{displaymath}
is the space of those 3-simplices in $X_\bullet$ for which the $\{0,1\}$-edges is a weak inverse to the $\{2,3\}$-edge. Hence $Core(X)(K) \to X(K)$ is an equivalence. Moreover $K^0 \hookrightarrow K$ is a weak equivalence, and hence so is $Core(X)(K) \to Core(X)({K^0}) \simeq Core(X)_1$, by \href{simplicial+object+in+an+%28infinity%2C1%29-category#SlicingOverPoweringOfSimplicialObjects}{this proposition} at \emph{[[simplicial object in an (∞,1)-category]]}.

\end{proof}
\hypertarget{category_objects}{}\subsubsection*{{Category objects}}\label{category_objects}

\hypertarget{CategoryObjectInTopos}{}\paragraph*{{In an $(\infty,1)$-topos}}\label{CategoryObjectInTopos}

Let $\mathbf{H}$ be an [[(∞,1)-topos]]. Then every object of $\mathbf{H}$ may already be thought of as being an [[groupoid object in an (∞,1)-category|internal groupoid]], which facilitates the definition of internal categories. This we discus here. The more general case where the ambient $(\infty,1)$-category is not necessarily an [[(∞,1)-topos]] is discussed further \hyperlink{InAnInfinity1Category}{below}.

\begin{defn}
\label{CategoryObject}\hypertarget{CategoryObject}{}
An \textbf{internal category} in an [[(∞,1)-topos]] $\mathbf{H}$ is an internal pre-category $X_\bullet \in \mathbf{H}^{\Delta^{op}}$, def. \ref{PreCategoryObject}, such that its [[core]] $Core(X)$ is in the image of the inclusion $const \colon \mathbf{H} \hookrightarrow Grpd(\mathbf{H})$ of prop. \ref{EmbeddingOfConstantGroupoidObjects}.

\end{defn}
This is called a \emph{[[complete Segal space]] object} in (\hyperlink{Lurie}{Lurie, def. 1.2.10}).

\begin{remark}
\label{}\hypertarget{}{}
A groupoid object, def. \ref{GroupoidObject}, is always a pre-category object, but is a category object only and precisely if it is in the image of the constant inclusion $Const \colon \mathbf{H} \to Grpd(\mathbf{H})$.

In a sense these are the genuine groupoid objects, while the others are groupoid objects \emph{equipped with an atlas} (\ldots{}).

\end{remark}
For internalizing in an $(\infty,1)$-category $\mathcal{C}$ which is not an [[(∞,1)-topos]], we need to specify what the constant groupoid objects in $\mathcal{C}$ are supposed to be. This is the topic of

\begin{itemize}%
\item \hyperlink{ChoiceOfGroupoidObjects}{Relative core -- Choice of groupoid objects}.

\end{itemize}
Once one has this, the definition of

\begin{itemize}%
\item \hyperlink{CategoryObjectsInC}{Category objects}

\end{itemize}
works essentially as before in an $(\infty,1)$-topos. The key point is that the ambient [[(∞,1)-topos]] $\mathbf{H}$ serves itself naturally as the collection of groupoid objects inside its [[(∞,1)-category]] of inernal categories and so this yields a natural notion of

\begin{itemize}%
\item \hyperlink{InternalnCategories}{Iterated internalization -- Internal n-categories}.

\end{itemize}
Internal to the archetypical base $(\infty,1)$-topos [[∞Grpd]] these are, externally, the bare [[(∞,n)-categories]]. Internal to an [[(∞,1)-category of (∞,1)-sheaves]] over some [[(∞,1)-site]], these are the [[(∞,n)-sheaves|(∞,n+1)-sheaves]] on that site. More on this is in the

\begin{itemize}%
\item \emph{\hyperlink{Examples}{Examples}}

\end{itemize}
below.

\hypertarget{ChoiceOfGroupoidObjects}{}\paragraph*{{Relative core -- Choice of groupoid objects}}\label{ChoiceOfGroupoidObjects}

The structure necessary to formulate the [[complete Segal space|completeness]] condition, which in an [[(∞,1)-topos]] is def. \ref{CategoryObject}, internal to a more general [[(∞,1)-category]] $\mathcal{C}$ is the following.

\begin{defn}
\label{ChoiceOfInternalGroupoids}\hypertarget{ChoiceOfInternalGroupoids}{}
For $\mathcal{C}$ an [[presentable (∞,1)-category]], a \textbf{choice of internal groupoids} is a choice of [[full sub-(∞,1)-category]] inclusion $\mathbf{H} \hookrightarrow \mathcal{C}$ of an [[(∞,1)-topos]] $\mathbf{H}$ such that

\begin{itemize}%
\item the inclusion is closed under small [[(∞,1)-limits]] and [[(∞,1)-colimits]], hence (by the [[adjoint (∞,1)-functor theorem]]) the inclusion is one of ``[[discrete objects]]'', given by an [[adjoint triple]]

\begin{displaymath}
(\Pi \dashv Disc \dashv \Gamma)
  \colon
  \mathcal{C}
   \stackrel{\overset{\Pi}{\to}}{\stackrel{\overset{Disc}{\hookleftarrow}}{\underset{\Gamma}{\to}}}
  \mathbf{H}
  \,;
\end{displaymath}

\item [[base change]] $f^* : \mathbf{H}_{/X} \to \mathcal{C}_{/Y}$ along morphisms $f : Y \to X$ with $X \in \mathbf{H}$ preserves [[(∞,1)-colimits]];


\item the [[codomain fibration]] of $\mathcal{C}$ is an [[(∞,2)-sheaf]] when restricted to $\mathbf{H}$: its [[(∞,1)-Grothendieck construction|classifying functor]] $\chi : \mathcal{C}^{op} \to$ [[(∞,1)Cat]] preserves [[(∞,1)-limits]] when restricted along $\mathbf{H} \hookrightarrow \mathcal{C}$

(a \emph{[[van Kampen colimit]]-condition}, see \href{van+Kampen+colimit#InHigherCategories}{there} for more)



\end{itemize}
\end{defn}
This is the definition of ``distributor'' in (\hyperlink{Lurie}{Lurie, def. 1.2.1}), where we are making use of (\hyperlink{Lurie}{Lurie, remark 1.2.6}) which identifies $\mathbf{H}$ here as being necessarily an [[(∞,1)-topos]], by the [[Giraud theorem|(∞,1)-Giraud theorem]].

\begin{example}
\label{}\hypertarget{}{}
The identity $\mathbf{H} \simeq \mathcal{C}$ is a choice of internal groupoids in $\mathbf{H}$, by the [[Giraud theorem|(∞,1)-Giraud theorem]]. For this choice the following theory of category objects in $\mathcal{C}$ relative to $\mathbf{H}$ reduces to that of category objects in $\mathbf{H}$, as discussed \hyperlink{CompleteCategoryInTopos}{above}.

\end{example}
For the discussion of [[(∞,n)-categories]], the central property of such \emph{choices of internal groupoids}, def. \ref{ChoiceOfInternalGroupoids} is that they behave well with forming internal categories, this is cor. \ref{InductiveChoicesOfInternalGroupoids} below.

This corresponds to (\hyperlink{Lurie}{Lurie, notation 1.2.9}).

\hypertarget{CategoryObjectsInC}{}\paragraph*{{In a general $(\infty,1)$-category}}\label{CategoryObjectsInC}

In the following, let $\mathcal{C}$ be a [[presentable (∞,1)-category]] eqipped with a choice of internal groupoids $\mathbf{H} \hookrightarrow \mathcal{C}$, def. \ref{ChoiceOfInternalGroupoids}.

\begin{defn}
\label{PreCategoryObject}\hypertarget{PreCategoryObject}{}
An \textbf{internal precategory} $X$ in $\mathcal{C}$ relative to the choice of internal groupoids $\mathbf{H} \hookrightarrow \mathcal{C}$ is a [[simplicial object in an (∞,1)-category|simplicial object]]

\begin{displaymath}
X : \Delta^{op} \to \mathcal{C}
\end{displaymath}
such that

\begin{enumerate}%
\item for all $n \in \mathbb{N}$ the functor $X$ exhibits $X_n$ as the [[(∞,1)-limit]] / iterated [[(∞,1)-pullback]]

\end{enumerate}
\begin{displaymath}
X([n]) \simeq X(\{0,1\}) \times_{X([0])} \cdots \times_{X[0]} X(\{n-1,n\})
\end{displaymath}
\begin{enumerate}%
\item such that the object of objects lies in the inclusion of $\mathbf{H}$

\begin{displaymath}
X_0 \in \mathbf{H} \hookrightarrow \mathcal{C}\,.
\end{displaymath}


\end{enumerate}
Write $PreCat_{\mathbf{H}}(\mathcal{C})$ for the $(\infty,1)$-category of internal pre-categories in $\mathcal{C}$ relative to $\mathbf{H}$, the [[full sub-(∞,1)-category]] of the [[simplicial objects]] on the internal precategories.

\end{defn}
This is the definition of \emph{Segal object} in (\hyperlink{Lurie}{Lurie, def. 1.2.7}).

\begin{prop}
\label{HCore}\hypertarget{HCore}{}
The inclusion

\begin{displaymath}
Grpd(\mathbf{H}) \hookrightarrow PreCat(\mathbf{H}) \hookrightarrow
  PreCat_{\mathbf{H}}(\mathcal{C})
\end{displaymath}
has a [[right adjoint|right]] [[adjoint (∞,1)-functor]]

\begin{displaymath}
Core_{\mathbf{H}} : PreCat_{\mathbf{H}}(\mathcal{C}) \to Grpd(\mathbf{H})
  \,.
\end{displaymath}
\end{prop}
\begin{proof}
The left morphism has a right adjoint by prop. \ref{CoreOnPreCategoryObjects}. The right adjoint of the right functor is implied by the first of the axioms on the choice of groupoids $Disc \colon \mathbf{H} \hookrightarrow \mathcal{C}$, by which $Disc$ has a right adjoint $\Gamma$ and is itself a right adjoint. This means that their prolongations to simplicial objects both preserve pre-category objects and hence induce an adjunction of pre-category objects. Moreover, since $Disc$ is in addition fully faithful, $\Gamma$ takes objects in the inclusion back to themselves, and hence this preserves also $(\mathbf{H}\hookrightarrow \mathcal{C})$-relative precategory objects.

\end{proof}
\begin{defn}
\label{HInternalCategory}\hypertarget{HInternalCategory}{}
An internal pre-category $X_\bullet \mathcal{C}^{\Delta^{op}}$, def. \ref{PreCategoryObject}, is called an \textbf{internal category} if its $\mathbf{H}$-Core, def. \ref{HCore}, is an essentially constant groupoid object, hence if

\begin{displaymath}
Core_{\mathbf{H}}(A) \in \mathbf{H} \stackrel{const}{\hookrightarrow} Grpd(\mathbf{H})
  \,.
\end{displaymath}
Write

\begin{displaymath}
Cat_{\mathbf{H}}(\mathcal{C}) \hookrightarrow PreCat_{\mathbf{H}}(\mathcal{C})
\end{displaymath}
for the [[full sub-(∞,1)-category]] of internal precategories on the internal categories.

\end{defn}
This is (\hyperlink{Lurie}{Lurie, def. 1.2.10}).

\begin{prop}
\label{}\hypertarget{}{}
The inclusion of pre-category objects, def. \ref{HInternalCategory} into category objects is [[reflective sub-(infinity,1)-category|reflective]]

\begin{displaymath}
Cat_{\mathbf{H}}(\mathcal{C})
  \stackrel{\overset{L}{\leftarrow}}{\hookrightarrow}
  PreCat_{\mathbf{H}}(\mathcal{C})
  \,.
\end{displaymath}
\end{prop}
This is (\hyperlink{Lurie}{Lurie, remark 1.2.11}).

\begin{proof}
By prop. \ref{EmbeddingOfConstantGroupoidObjects} and by the first axiom in def. \ref{ChoiceOfInternalGroupoids}, we have a reflective inclusion

\begin{displaymath}
\mathbf{H} \stackrel{const}{\hookrightarrow} \mathbf{H}^{\Delta^{op}} \stackrel{Disc^{\Delta^{op}}}{\hookrightarrow} \mathcal{C}^{\Delta^{op}}
  \,.
\end{displaymath}
From this the [[right adjoint]] [[core]], prop. \ref{HCore}, induces the claimed inclusion by using the statement of \emph{\href{reflective+sub-%28infinity,1%29-category#TransportOfReflectiveSubcategories}{reflective sub-(∞,1)-category -- Transport of reflective subategories}}, which says that $Cat_{\mathbf{H}}(\mathcal{C}) \simeq Core^{-1}(\mathbf{H})(PreCat_{\mathbf{H}}(\mathcal{C}))$ is a reflective inclusion

\begin{displaymath}
\itexarray{
    \mathbf{H} &\stackrel{const}{\hookrightarrow}& \mathcal{C}^{\Delta^{op}}
    \\
    {}^{\mathllap{Core}}\uparrow\downarrow^{\mathrlap{incl}}
    && 
    {}^{\mathllap{Core}}\uparrow\downarrow^{\mathrlap{incl}}
    \\
    Cat_{\mathbf{H}}(\mathcal{C})
    &\hookrightarrow&
    PreCat_{\mathbf{H}}(\mathcal{C})
  }
  \,.
\end{displaymath}
\end{proof}
In summary we have:

\begin{cor}
\label{ReflectiveInclusionOfCategoryObjectsIntoSimplicialObjects}\hypertarget{ReflectiveInclusionOfCategoryObjectsIntoSimplicialObjects}{}
In summary we have a reflective inclusion

\begin{displaymath}
Cat_{\mathbf{H}}
  \hookrightarrow
  PreCat_{\mathbf{H}}(\mathcal{C})
  \hookrightarrow
  \mathcal{C}^{\Delta^{op}}
  \,.
\end{displaymath}
\end{cor}
\begin{remark}
\label{}\hypertarget{}{}
So far we have only ever used the first axiom in def. \ref{ChoiceOfInternalGroupoids}. We now describe the reflector $PreCat_{\mathbf{H}}(\mathcal{C}) \to Cat_{\mathbf{H}}(\mathcal{C})$ in more detail, and for that we use the other two axioms.

\end{remark}
The corresponding reflector is ``Segal completion''. We now describe this in more detail.

\begin{defn}
\label{CategoricalEquivalence}\hypertarget{CategoricalEquivalence}{}
For $X_\bullet, Y_\bullet \in PreCat_{\mathcal{H}}(\mathcal{C})$, a [[morphism]] $f_\bullet \colon X_\bullet \to Y_\bullet$ of pre-category objects (hence of the underlying [[simplicial object in an (infinity,1)-category|simplicial objects]]) is a \textbf{categorical equivalence} if

\begin{enumerate}%
\item \textbf{[[essentially surjective functor|essential surjectivity]]} -- $\underset{\to}{\lim}(core(X_\bullet)) \to \underset{\to}{\lim} (core(Y_\bullet))$ is an [[equivalence in an (∞,1)-category|equivalence]] in $\mathbf{H}$;


\item \textbf{[[full and faithful functor|full faithfulness]]} -- the [[diagram]]

\begin{displaymath}
\itexarray{
    X_1 &\stackrel{f_1}{\to}& Y_1
    \\
    \downarrow^{\mathrlap{(\partial_0,\partial_1)}} && \downarrow^{\mathrlap{(\partial_0,\partial_1)}}
    \\
    X_0 \times X_0 &\stackrel{(f_0,f_0)}{\to}& Y_0 \times Y_0
  }
\end{displaymath}
is an [[(∞,1)-pullback]] diagram in $\mathcal{C}$.



\end{enumerate}
\end{defn}
\begin{prop}
\label{}\hypertarget{}{}
The inclusion $Cat_{\mathbf{H}}(\mathcal{C}) \hookrightarrow PreCat_{\mathbf{H}}(\mathcal{C})$ of def. \ref{HInternalCategory} is [[reflective sub-(∞,1)-category|reflective]]. The [[localization of an (∞,1)-category|reflector]]

\begin{displaymath}
L \colon PreCat_{\mathbf{H}}(\mathcal{C}) \to Cat_{\mathbf{H}}(\mathcal{C})
\end{displaymath}
inverts precisely the categorical equivalences, def. \ref{CategoricalEquivalence}.

\end{prop}
This is (\hyperlink{Lurie}{Lurie, theorem 1.2.13}).

\begin{remark}
\label{}\hypertarget{}{}
In particular, by reflectivity, this means that a morphism $f_\bullet \colon X_\bullet \to Y_\bullet$ in $Cat_\mathbf{H}(\mathcal{C})$ is an equivalence (hence an equivalence in $\mathcal{C}^{\Delta^{op}}$) precisely if it is a categorical equivalence.

\end{remark}
\hypertarget{InternalnCategories}{}\paragraph*{{Iterated internalization -- Internal $n$-categories}}\label{InternalnCategories}

A central point of the formulation of internal category objects is that it can be iterated to yields categories objects internal to category objects \ldots{} internal to an $(\infty,1)$-topos.

\begin{prop}
\label{}\hypertarget{}{}
Let $\mathbf{H} \hookrightarrow \mathcal{C}$ be a choice of internal groupoids, def. \ref{ChoiceOfInternalGroupoids}. Then also the constant inclusion

\begin{displaymath}
\mathbf{H} \hookrightarrow Cat_{\mathbf{H}}(\mathcal{C})
\end{displaymath}
into the $(\infty,1)$-category of the corresponding category objects is a choice of internal groupoids.

\end{prop}
This is (\hyperlink{Lurie}{Lurie, prop.1.3.2}).

\begin{proof}
We consider the first of the three axioms, that the inclusion preserves limits and colimits: The constant inclusion

\begin{displaymath}
\mathbf{H} 
    \stackrel{const}{\to} 
  \mathbf{H}^{\Delta^{op}} 
    \stackrel{Disc^{\Delta^{op}}}{\to}
  \mathcal{C}^{\Delta^{op}}
\end{displaymath}
is [[full and faithful (∞,1)-functor|fully faithful]], since $\Delta^{op}$ is a contractible $(\infty,1)$-category . The first inclusion preserves limits and colimits since in presheaf categories these are computed objectwise, similarly for the second, using the condition that already $Disc \colon \mathbf{H} \to \mathcal{C}$ preserves limits and colimits. Moreover, this inclusion clearly factors through $Cat_{\mathbf{H}}(\mathcal{C}) \hookrightarrow \mathcal{C}^{\Delta^{op}}$, by def. \ref{HInternalCategory}, and since that is also fully faithful, also $\mathbf{H} \to Cat_{\mathbf{H}}(\mathcal{C})$ preserves limits and colimits.

\end{proof}
In particular therefore we have the following:

\begin{cor}
\label{InductiveChoicesOfInternalGroupoids}\hypertarget{InductiveChoicesOfInternalGroupoids}{}
For $\mathbf{H}$ an [[(∞,1)-topos]], the canonical inclusion

\begin{displaymath}
\mathbf{H} \stackrel{const}{\hookrightarrow} Grpd(\mathbf{H}) \hookrightarrow Cat(\mathbf{H})
\end{displaymath}
is a choice of internal groupoids in $Cat(\mathbf{H})$, in the sense of def. \ref{ChoiceOfInternalGroupoids}. Moreover, by [[induction]], each of the induced constant inclusions

\begin{displaymath}
\mathbf{H} \stackrel{const}{\hookrightarrow} Cat(Cat(\cdots (Cat(\mathbf{H}))))
\end{displaymath}
is a choice of internal groupoids.

\end{cor}
This is (\hyperlink{Lurie}{Lurie, corollary 1.3.4, variant 1.3.8}).

Therefore it makes sense to write:

\begin{defn}
\label{nCategoriesByRecursiveInternalization}\hypertarget{nCategoriesByRecursiveInternalization}{}
Let $\mathbf{H}$ be an [[(∞,1)-topos]]. For $n = 0$ set

\begin{displaymath}
0 Cat(\mathbf{H}) \coloneqq \mathbf{H}
  \,.
\end{displaymath}
Then by [[induction]] on $n \in \mathbb{N}$ set

\begin{displaymath}
(n+1)Cat(\mathbf{H}) \coloneqq Cat_{\mathbf{H}}(n Cat(\mathbf{H}))
  \,.
\end{displaymath}
We call $n Cat(\mathbf{H})$ the $(\infty,1)$-category of \textbf{[[(∞,n)-categories]]} in $\mathbf{H}$, or of \textbf{[[(∞,n)-sheaves|(∞,n+1)-sheaves]]} or (-\textbf{[[stacks]]) of $(\infty,n)$-categories} on (the [[(∞,1)-site]] of definition of) $\mathbf{H}$.

\end{defn}
See also at \emph{[[n-category object in an (∞,1)-category]]}.

\hypertarget{enriched_categories_as_internal_categories}{}\subsubsection*{{Enriched categories as internal categories}}\label{enriched_categories_as_internal_categories}

The 1-categorical notion of [[enriched category]] is similar to that of [[internal category]], a main difference being that an internal category has an \emph{object of objects} in the ambient category $\mathcal{C}$, whereas an enriched category has a [[set]]/[[class]] of objects. If, however, $\mathcal{C}$ is equipped with a notion of [[discrete objects]], thought of as the inclusion of sets into $\mathcal{C}$, then $\mathcal{C}$-enriched categories may be thought of as those categories internal to $\mathcal{C}$ such that their object of objects is discrete.

Accordingly, if for $\mathcal{C}$ a [[presentable (∞,1)-category]] equipped with a \emph{choice of internal groupoids} $\mathbf{H} \hookrightarrow \mathcal{C}$, def. \ref{ChoiceOfInternalGroupoids}, for $\mathbf{H} \simeq$ [[∞Grpd]], then an $A \in Cat_{\mathbf{H}}(\mathcal{C})$ by definition has a bare (external / [[discrete ∞-groupoid|discrete]]) $\infty$-groupoid ``of objects''. The underlying simplicial object is thus more like a [[Segal category]] object (though still different from that).

In (\hyperlink{Lurie}{Lurie, def. 1.3.3}) such an choice of internal groupoids $\infty Grpd \hookrightarrow \mathcal{C}$ is called an ``absolute distributor''.

\begin{prop}
\label{}\hypertarget{}{}
For $\mathcal{C} = \mathbf{H}$ an [[(∞,1)-topos]] over [[∞Grpd]], the [[inverse image]] of its [[global section]] [[geometric morphism]] $\infty Grpd \to \mathbf{H}$ is a \emph{choice of internal groupoids}, def. \ref{ChoiceOfInternalGroupoids}, precisely if $\mathbf{H}$ is [[locally ∞-connected (∞,1)-topos|locally]] and [[∞-connected (∞,1)-topos|globally ∞-connected]].

\begin{displaymath}
(\Pi \dashv \Disc \dashv \Gamma)
  :
  \mathbf{H}
   \stackrel{\stackrel{\Pi}{\to}}{\stackrel{\overset{Disc}{\hookleftarrow}}{\underset{\Gamma}{\to}}}
   \infty Grpd
\end{displaymath}
\end{prop}
\hypertarget{properties}{}\subsection*{{Properties}}\label{properties}

\hypertarget{ModelCategoryPresentations}{}\subsubsection*{{Model category presentations}}\label{ModelCategoryPresentations}

We discuss here [[presentable (infinity,1)-category|presentations]] of category objects internal to an $(\infty,1)$-category by [[model category]] theory methods.

\begin{prop}
\label{}\hypertarget{}{}
Let $C$ be a [[left proper model category|left proper]] [[combinatorial model category]] that [[presentable (∞,1)-category|presents]] the [[(∞,1)-category]] $\mathcal{C}$ in that $\mathcal{C} \simeq C^\circ$.

Then the category $[\Delta^{op}, C]$ of [[simplicial objects]] in $C$ admits a [[left proper model category|left proper]] [[combinatorial model category]] structure characterized by the following properties:

\begin{enumerate}%
\item it is a [[Bousfield localization of model categories|left Bousfield localization]] of the injective or projective or [[Reedy model structure|Reedy]] [[model structure on functors]] $[\Delta^{op}, C]_{proj/inj/Reedy}$;


\item an object $\Delta^{op} \to C$ is [[fibrant object|fibrant]] precisely if it is fibrant in $[\Delta^{op}, C]_{proj/inj/Reedy}$ and if the corresponding simplicial object $\Delta^{op}\to C^\circ$ in the [[(∞,1)-category]] [[presentable (∞,1)-category|presented]] by $C$ is an internal category.



\end{enumerate}
\end{prop}
This is stated as (\hyperlink{Lurie}{Lurie, prop. 1.5.4}).

\begin{proof}
By the discussion at [[model structure on functors]]. Either of $[\Delta^{op}, C]_{proj/inj/Reedy}$ is a [[presentable (∞,1)-category|presentation]] of $\mathcal{C}^{op}$; and moreover, by the discussion at \href{reflective+sub-%28infinity%2C1%29-category#ModelCategoryPresentation}{reflective sub-(∞,1)-category -- model category presentation} the reflective inclusion $Cat_{\mathbf{H}}(\mathcal{C}) \hookrightarrow \mathcal{C}^{\Delta^{op}}$ of cor. \ref{ReflectiveInclusionOfCategoryObjectsIntoSimplicialObjects} is presented by the [[Bousfield localization of model categories|left Bousfield localization]] as claimed.

\end{proof}
\begin{example}
\label{}\hypertarget{}{}
For $C = sSet_{Quillen}$ the standard [[model structure on simplicial sets]], this gives in particular rise to the standard [[model structure for complete Segal spaces]].

\end{example}
\hypertarget{HomotopyTypeTheoryFormulation}{}\subsubsection*{{Homotopy type theory formulation}}\label{HomotopyTypeTheoryFormulation}

For $\mathbf{H}$ an [[(∞,1)-topos]], another way of saying that we have an internal category object in $\mathbf{H}$ should be to say that we formulate it in the [[internal language]] of $\mathbf{H}$, which is a [[homotopy type theory]]. (For more see at \emph{[[internal category in homotopy type theory]]}.)

However, at the time of this writing little is known for how to speak of \emph{non-finite} [[diagrams]] fully internally. To appreciate the issue, notice that the ``internal'' formulation of categories by [[simplicial objects in an (∞,1)-category]] as \hyperlink{Definition}{above} is in fact not fully internal to the ambient $(\infty,1)$-category $\mathcal{C}$, but assumes that it is known what externally an [[(∞,1)-functor]] $\Delta^{op} \to \mathcal{C}$ is. When we speak in [[homotopy type theory]] this is not an option and we have to genuinely stick to internal reasoning.

Nevertheless, we can speak fully internally of $(n,1)$-categories for ``low $n$'' by making use of the following observations.

\begin{enumerate}%
\item By the discussion at \emph{[[semi-Segal space]]} a category object should equivalently be a [[semi-category]] object $X_\bullet$: a [[semi-simplicial object]] satisfying the [[Segal conditions]], and which is unital in that $Eq(X_1) \hookrightarrow X_1 \stackrel{\partial_1}{\to} X_0$ is an equivalence.

A similar formalization of 1-category objects in homotopy type theory has been presented and studied in some detail in (\hyperlink{AKS}{AKS}).


\item To finite (and ``low'') degree a [[semi-simplicial type]] may be given ``by hand'' as a sequence of [[dependent types]] like this:

\begin{displaymath}
\begin{aligned}
    & \vdash\; X_0 \colon Type
    \\
    x_0,x_1 \colon X_0 \;& \vdash \; X_1(x_0,x_1) \colon Type
    \\
  x_0,x_1,x_2 \colon X_1; f_2 \colon X_1(x_0,x_1); f_1 \colon X_1(x_0,x_2); f_2 \colon X_1(x_0,x_1) \; 
    & \vdash \; X_2(f_0,f_1,f_2) \colon Type
    \\
    \vdots \; &\vdash\; \vdots
 \end{aligned}
\end{displaymath}
etc. (Where in principle we can go on like this to any finite $n$; but it is open how to say this in one go for all $n$ at once.)

Notice that in the [[model category|model]]-[[categorical semantics]] of [[dependent types]] in [[homotopy type theory]], such a structure interprets indeed (up to the given degree) as a [[Reedy model structure|Reedy]] [[fibrant object|fibrant]] [[semi-simplicial object]] as used in the standard model-category theoretic constructions of internal $\infty$-categories discussed \hyperlink{ModelCategoryPresentations}{above}.


\item If $X_0$ is [[n-truncated]] ([[h-level]] $n+2$) so that we are dealing with an internal category that is externally an [[(n,1)-category]], then a complete semi-Segal object $X_\bullet$ should indeed already be determined by its [[simplicial skeleton]] $X_{0 \leq \bullet \leq n+2}$. Note however that requiring $X_0$ to be [[n-truncated]] is not sufficient since we also need that $X_1$, $X_2$, \ldots{} are truncated; see the remark below.



\end{enumerate}
So in conclusion an \emph{$n$-truncated category type} in [[homotopy type theory]] should be an $(n+2)$-skeleton of a [[semi-simplicial type]] $X_{0 \leq \bullet \leq 3}$ as above, such that

\begin{enumerate}%
\item [[Segal condition]]: for each $2 \leq k \leq n$ the canonical function $X_n \to X_1 \times_{X_0} \cdots \times_{X_0} X_1$ into the $n$-fold [[homotopy pullback]] is an [[equivalence]];


\item [[univalence]]/unitality: the canonical function $Eq(X_1) \to X_1 \stackrel{\partial_1}{\to} X_0$ is an [[equivalence]].


\item truncation: for every $i$, $X_i$ is $(n-i)$-truncated (of [[h-level]] $n-i+2$).



\end{enumerate}
This approach to [[(n,1)-categories]] is discussed in (\href{CapriottiKraus17}{CapriottiKraus17}). There, the last condition is replaced by requiring $X_1$ to be $(n-1)$-truncated, which does imply that $X_i$ is $(n-i)$-truncated. One can in fact ask for the truncation property for a \emph{single} positive $i$, and it will imply the truncation property for all $i$. This is discussed in the conclusions of (\href{CapriottiKraus17}{CapriottiKraus17}). However, it would be insufficient to only say that $X_0$ is $n$-truncated since this controls $Eq(X_1)$ but not $X_1$ itself.

We spell the above definition out in more detail below for

\begin{itemize}%
\item $n = 0$ -- \hyperlink{0CategoryTypes}{(0,1)-Category types}, choosing $i = 1$ for the truncation condition


\item $n = 1$ -- \hyperlink{1CategoryTypes}{(1,1)-Category types}, choosing $i = 2$.



\end{itemize}
\begin{remark}
\label{}\hypertarget{}{}
\textbf{(homotopy coherence by dependent types)}

The formulation of [[simplicial objects in an (∞,1)-category]] in the [[internal language]] of [[homotopy type theory]] has to deal with the issue of formulating a simplicial ``[[homotopy coherent diagram]]'' in the internal language. One may think of the above formulation via [[semisimplicial object|semisimplicial]] [[dependent types]] as dealing with this by

\begin{enumerate}%
\item discarding the explicit discussion of the degeneracy maps (which are not homotopy-theoretically necessary anyway);


\item formulating [[simplicial identities]] \emph{not} as [[propositional equalities]] (i.e. as [[terms]] of some [[identity type]] $(\partial_j \circ\partial_i \simeq \partial_j \circ \partial_{i-1})$ which would need to be subjected to their own coherent identities) but in fact as typing [[judgements]]: the face maps are given directly by [[substitution]] of [[variables]] on which the types of cells [[dependent type|depend]].



\end{enumerate}
This is how the above formulation implicitly deals with [[homotopy coherent diagram|homotopy coherence]]. Under [[categorical semantics]] this state of affairs translates into the statement that [[Reedy model structure|Reedy]] [[fibrant object|fibrant]] [[semisimplicial objects]] are already a good (fibrant+cofibrant) model for [[homotopy types]].

\end{remark}
\hypertarget{HCategoryTypes}{}\paragraph*{{H-Category types}}\label{HCategoryTypes}

It may be instructive to begin by discussing a notion of [[internal category]] in [[homotopy theory]] which is \emph{not} an category object in an $(\infty,1)$-category and which does \emph{not} interpret as an [[(∞,1)-category]], but which serves to illustrate a subtlety in the correct definition. In fact, it is an internal formulation of the [[H-category]] that underlies in particular any genuine precategory object, by def. \ref{HomotopyCategoryOfPreCategoryObject} above.

Notice that historically one says that:

\begin{defn}
\label{}\hypertarget{}{}
An \textbf{[[H-monoid]]} is a [[monoid object]] internal to the [[homotopy category]] [[Ho(∞Grpd)]]/[[Ho(Top)]].

\end{defn}
\begin{remark}
\label{}\hypertarget{}{}
This means that an [[H-monoid]] is

\begin{enumerate}%
\item a [[homotopy type]] $X$;


\item equipped with a binary operation $\cdot \colon X \times X \to X$;


\item and equipped with a point $i \colon * \to X$



\end{enumerate}
such that

\begin{enumerate}%
\item there [[existential quantifier|exists]] an [[associativity]] [[homotopy]]

\begin{displaymath}
\left(\left(-\right) \cdot \left(\left(-\right) \cdot \left(-\right)\right)\right)
  \Rightarrow
  \left(\left(\left(-\right) \cdot \left(-\right)\right) \cdot \left(-\right)\right)
  \colon
  X \times X \times X \to X
\end{displaymath}

\item there exists a [[unit law|unitality]] [[homotopy]]

\begin{displaymath}
(i \cdot (-)) \to id \colon  X \to X
  \,.
\end{displaymath}


\end{enumerate}
The point here is that these homotopies are only required to exist, but are not specified and are not part of the data of an [[H-monoid]].

\end{remark}
One also speaks of an \emph{[[H-group]]} for an [[H-monoid]] for which the product operation similarly has [[inverses]] up to unspecified homotopies. Hence it makes sense to consider the following many-object version (``[[oidification]]'') of this classical concept:

\begin{defn}
\label{}\hypertarget{}{}
An \textbf{[[H-category]] type} $X$ is a

\begin{enumerate}%
\item a [[type]] $\vdash \; X_0  \colon$ [[Type]]


\item a [[dependent type]] $x_0,x_1 \colon X_0 \;\vdash\; X_1(x_0,x_1) \colon Type$


\item a [[term]] $\vdash \; i \colon X_0$;


\item a [[function]]

\begin{displaymath}
x_0,x_1,x_2 \colon X_0 \;\vdash\; comp_{x_1,x_2,x_2} \colon X_1(x_0,x_1) \times X_1(x_1,x_2) \to X_1(x_0,x_2)
\end{displaymath}


\end{enumerate}
such that there is a [[term]] of [[identity type]]

\begin{displaymath}
x_0, x_1, x_2, x_3 \colon X_0 \;\vdash\; ( com_{x_0,x_2,x_3} \circ comp_{x_0,x_1,x_2} \simeq  comp_{x_0, x_1, x_2} \circ comp_{x_1,x_2,x_3})
\end{displaymath}
(hence, equivalently, a necessarily unique term of the [[proposition]] [[type]] [[inhabited type|isInhabited]](\ldots{}) of this identity type ).

\end{defn}
The archetypical example of [[H-groups]] already illustrates the deficiency of this notion

\begin{example}
\label{}\hypertarget{}{}
For $\colon * \to Y$ a pointed [[homotopy type]], its [[loop space]][[loop space object|object]] $\Omega_y Y$ is naturally equipped with the structure of an [[H-group]] by

\begin{enumerate}%
\item taking the unit $* \to \Omega_y Y$ to be the constant loop on $Y$;


\item taking the product to be given by any choice of concatenation of loops.



\end{enumerate}
\end{example}
The natural question arising then is: how are those [[H-groups]] characterized that arise as [[loop space objects]], this way?

One observes that those that areise this way carry much more structure than just a composition and unit up to unspecified homotopy: we can instead make an explicit choice of such homotopies by choosing ways to reparameterize the interval and, crucially, any two such choices are themselves related by a choice of higher order homotopy, and so ever on. Such a structure is called a \textbf{strong homotopy monoid} structure with \textbf{strong homotopy associativity} (as opposed to just bare homotopy associativity as in an [[H-monoid]]). Later this was abbreviated to \textbf{[[A-∞ algebra|A-∞]]} structure.

The classical result by [[Jim Stasheff]] answered the question by saying that:

\begin{theorem}
\label{}\hypertarget{}{}
An [[H-group]] $(X, \cdot)$ arises as a [[loop space object]], $X \simeq \Omega Y$ precisely if its homotopy-monoidal structure may be lifted to an [[A-∞ algebra]] structure.

\end{theorem}
The point of the following constructions is to take care of that additional \emph{strong} homotopy information.

\hypertarget{0CategoryTypes}{}\paragraph*{{$(0,1)$-Category types}}\label{0CategoryTypes}

We spell out the \hyperlink{HomotopyTypeTheoryFormulation}{above} strategy for defining [[(n,1)-category]] types in [[homotopy type theory]] for the case of [[(0,1)-categories]].

\begin{quote}%
The following is experimental.


\end{quote}
A \textbf{$(0,1)$-category type} is

\begin{enumerate}%
\item a [[type]] $\vdash\; X_0 \colon Type$


\item a [[dependent type]] $x_0,x_1 \colon X_0 \; \vdash \; X_1(x_0,x_1) \colon Type$;

we write

\begin{displaymath}
X^{\partial \Delta^2} 
   \coloneqq
  \underset{x_0,x_1,x_2 \colon X_0}{\sum}
    X_1(x_1,x_2) \times X_1(x_0,x_2) \times X_1(x_0,x_1)
  \,;
\end{displaymath}

\item a dependent type

\begin{displaymath}
((x_0,x_1,x_2), (f_0, f_1, f_2)) \colon X^{\partial \Delta^2}
  \;\vdash \;
  X_2(f_0,f_1,f_2) \colon Type
  \,;
\end{displaymath}


\end{enumerate}
such that

\begin{enumerate}%
\item \textbf{[[n-truncated|0-truncation]]} -- $X_0$ is [[0-truncated]]/is an [[h-set]] (although this is automatic and does not have to be required explicitly);


\item \textbf{[[coskeleton|1-coskeletalness]]} -- the function

\begin{displaymath}
p_1 
 \colon
  \underset{(x_0,x_1) \colon X_0 \times X_0 }{\sum} X_1(x_0,x_1)
  \to
  X_0 \times X_0
\end{displaymath}
is a [[1-monomorphism]];


\item \textbf{[[Segal condition]]} -- the function

\begin{displaymath}
( (f_{12},f_{02},f_{01}) \mapsto (f_{12},f_{01}) )
  \colon
  \underset{((x_0,x_1,x_2),(f_{12},f_{02},f_{01})) \colon X^{\partial \Delta^2}}{\sum}  
    X_2 
  \to 
  \underset{ (x_0,x_1,x_2) \colon X_0 }{\sum}
  X_1(x_0,x_1) \times X_1(x_1, x_2)
\end{displaymath}
is an [[equivalence in homotopy type theory|equivalence]];


\item \textbf{[[univalence|unitality]]} -- the function

\begin{displaymath}
p_1
  \colon
  \underset{x \colon X_0}{\sum} X_1(x,x)
  \to
  X_0
\end{displaymath}
is an [[equivalence in homotopy type theory|equivalence]].



\end{enumerate}
\hypertarget{1CategoryTypes}{}\paragraph*{{$(1,1)$-Category types}}\label{1CategoryTypes}

We spell out the \hyperlink{HomotopyTypeTheoryFormulation}{above} strategy for defining [[(n,1)-category]] types in [[homotopy type theory]] for the case of [[(1,1)-categories]].

\begin{quote}%
The following is experimental.


\end{quote}
A \textbf{$(1,1)$-category type} is

\begin{enumerate}%
\item a [[type]] $\vdash\; X_0 \colon Type$


\item a [[dependent type]] $x_0,x_1 \colon X_0 \; \vdash \; X_1(x_0,x_1) \colon Type$;

we write

\begin{displaymath}
X^{\partial \Delta^2} 
   \coloneqq
  \underset{x_0,x_1,x_2 \colon X_0}{\sum}
    X_1(x_1,x_2) \times X_1(x_0,x_2) \times X_1(x_0,x_1)
  \,;
\end{displaymath}

\item a dependent type

\begin{displaymath}
((x_0,x_1,x_2), (f_{12}, f_{02}, f_{01})) \colon X^{\partial \Delta^2}
  \;\vdash \;
  X_2(f_{12}, f_{02}, f_{01}) \colon Type
  \,;
\end{displaymath}
we write

\begin{displaymath}
X^{\partial \Delta^3}
  \coloneqq
  \underset{(x_0,x_1,x_2,x_3,x_4 \colon X_1) }{\sum}
  \underset{ f_{i j} \colon X_1(x_i, x_j)}{\sum}
  X_2(f_{12},f_{02},f_{01})
  \times
  X_2(f_{23}, f_{13}, f_{12})
  \times
  \cdots
  \,,
\end{displaymath}

\item a [[dependent type]]

\begin{displaymath}
(\sigma_{123}, \sigma_{023}, \sigma_{013}, \sigma_{012}) \colon X^{\partial \Delta^3}
   \;\vdash\;
   X_3(\sigma_{123}, \sigma_{023}, \sigma_{013}, \sigma_{012})
   \colon 
    Type
\end{displaymath}


\end{enumerate}
such that

\begin{enumerate}%
\item \textbf{[[n-truncated|1-truncation]]} -- $X_0$ is [[1-truncated]]/is an [[h-groupoid]] (which again is automatic and could be omitted)


\item \textbf{[[coskeleton|2-coskeletalness]]} -- the function

\begin{displaymath}
p_1
  \colon
  \underset{(f_{12},f_{02}, f_{01}) \colon X^{\partial \Delta^2}}{\sum}
  X_2(f_{12},f_{02}, f_{01})
  \to 
  X^{\partial \Delta^2}
\end{displaymath}
is a [[1-monomorphism]];


\item \textbf{[[Segal condition]]} -- the functions

\begin{displaymath}
( (f_{12},f_{02},f_{01}) \mapsto (f_{12},f_{01}) )
  \colon
  \underset{((x_0,x_1,x_2),(f_0,f_1,f_2)) \colon X^{\partial \Delta^2}}{\sum}  
    X_2 
  \to 
  \underset{ (x_0,x_1,x_2) \colon X_0 }{\sum}
  X_1(x_1,x_2) \times X_1(x_0, x_1)
\end{displaymath}
and

\begin{displaymath}
( (f_{i j}, \sigma_{i j k})  \mapsto (f_{01}, f_{12}, f_{23}) )
  \colon
  \underset{f_{i j} \colon X_1(x_i,x_j)}{\sum}
  \underset{\sigma_{i_0 i_1 i_2} \colon X_2(f_{i_1 i_2}, f_{i_0 i_2}, f_{i_0 i_1})}{\sum}
   X_3( \sigma_{\cdots}, \cdots )
  \to
  \underset{(x_0,x_1,x_2,x_3) \colon X_0}{\sum}
  X_1(x_0,x_1)
  \times
  X_1(x_1,x_2)
  \times
  X_1(x_2,x_3)
\end{displaymath}
are [[equivalence in homotopy type theory|equivalences]];


\item \textbf{[[univalence|unitality]]} -- the function

\begin{displaymath}
(((x_0,x_1),f) \mapsto x_0)
  \colon
  \underset{x_0,x_1 \colon X_0}{\sum}
  X_1(x_0,x_1)_{\simeq}
  \to
  X_0
\end{displaymath}
is an [[equivalence in homotopy type theory|equivalence]].



\end{enumerate}
\hypertarget{Examples}{}\subsection*{{Examples}}\label{Examples}

We discuss some examples and applications of the above notions. For more on examples internal to $\infty Grpd$ see also at \emph{\href{Segal+space#Examples}{Segal space -- examples}}.

\hypertarget{the_relative_contexts}{}\subsubsection*{{The relative contexts}}\label{the_relative_contexts}

\begin{prop}
\label{}\hypertarget{}{}
The canonical inclusion [[∞Grpd]] $\hookrightarrow$ [[(∞,1)Cat]] is a consistent ``choice of groupoid objects''(``distributor'') in the sense of def. \ref{ChoiceOfGroupoidObjects}.

\end{prop}
This is (\hyperlink{Lurie}{Lurie, theorem 1.4.1}).

\hypertarget{OrdinaryInfinityCategories}{}\subsubsection*{{Ordinary $(\infty,1)$-categories}}\label{OrdinaryInfinityCategories}

\begin{prop}
\label{GrpdInCatIsChoiceOfGroupoidObjects}\hypertarget{GrpdInCatIsChoiceOfGroupoidObjects}{}
An ordinary [[(∞,1)-category]] is equivalently an internal category in the [[(∞,1)-topos]] $\mathcal{C} :=$ [[∞Grpd]]:

\begin{displaymath}
Cat_{(\infty,1)} \simeq Cat(\infty Grpd)
  \,.
\end{displaymath}
\end{prop}
This is (\hyperlink{Lurie}{Lurie, corollary 4.3.16}).

Internal to [[∞Grpd]]

\begin{itemize}%
\item an internal pre-category is known as a \emph{[[Segal space]]};


\item a [[connected]] internal pre-category is known as a \emph{[[reduced Segal space]]};


\item an internal category is known as a \emph{[[complete Segal space]]}.



\end{itemize}
The model category presentations for $Cat(\infty Grpd)$ discussed \hyperlink{ModelCategoryPresentations}{above} are given in this case by the \emph{[[model structure for complete Segal spaces]]}.

\hypertarget{categories}{}\subsubsection*{{$(\infty,n)$-categories}}\label{categories}

By iterating the construction of category objects, one obtains [[n-category]] objects. Externally these are [[(∞,n)-categories]].

An [[∞-groupoid]] may be thought of as an [[(∞,0)-category]]. Write therefore

\begin{displaymath}
Cat_{(\infty,0)} := \infty Grpd
  \,.
\end{displaymath}
Then by the \hyperlink{OrdinaryInfinityCategories}{above} the [[(∞,1)-category of (∞,1)-categories]] is

\begin{displaymath}
Cat_{(\infty,1)} \simeq Cat(Cat_{(\infty,0)})
  \,.
\end{displaymath}
Now by prop. \ref{GrpdInCatIsChoiceOfGroupoidObjects} the inclusion $\infty Grpd \hookrightarrow Cat(\infty Grpd)$ is a consistent choice of groupoid objects, and so we can continue the internalization.

Then the $(\infty,1)$-category $Cat(\mathcal{C})$ of internal categories in $\mathcal{C}$ is, up to [[equivalence of (∞,1)-categories|equivalence]], the $(\infty,1)$-category of [[(∞,2)-categories]]

\begin{displaymath}
Cat(Cat(\infty Grpd))
  \simeq
  Cat(Cat(Cat_{(\infty,0)}))
  \simeq
  Cat(Cat_{(\infty,1)})
  \simeq
  Cat_{(\infty,2)}
  \,.
\end{displaymath}
This yields, with def. \ref{nCategoriesByRecursiveInternalization}, an inductive construction of [[(∞,n)Cat]], the [[(∞,1)-category]] of [[(∞,n)-categories]]

\begin{displaymath}
Cat(Cat(\cdots (Cat_{(\infty,0)})))
  \simeq
  Cat_{(\infty,n)}
  \,.
\end{displaymath}
The corresponding model category presentation is that of \emph{[[n-fold complete Segal spaces]]}.

\hypertarget{InternalBaseTopos}{}\subsubsection*{{The internal self-reflection / internal base $(\infty,1)$-topos}}\label{InternalBaseTopos}

For $\mathbf{H}$ an [[(∞,1)-topos]] it should come canonically equipped (for each choice of [[regular cardinal]] $\kappa$) with an internal category object $\mathcal{Type} \in Cat(\mathbf{H})$, which is the canonical internal [[base (∞,1)-topos]], classifying the (relatively $\kappa$-compact part of) the [[codomain fibration]]-[[(∞,2)-sheaf]] on $\mathbf{H}$.

In the [[syntax]] of [[homotopy type theory]] as discussed \hyperlink{HomotopyTypeTheoryFormulation}{above} the corresponding simplicial object should be

\begin{displaymath}
\itexarray{
    \vdots &&  \vdots & \vdots
    \\
    \downarrow \downarrow \downarrow \downarrow
    \\
    \mathcal{Type}_2 & \coloneqq & [ (f,g,h) : \sum_{(A,B,C) : Type_\kappa \times Type_\kappa \times Type_\kappa} (A \to B)\times (B \to C) \times (A \to C)  & \dashv (g\circ f = h) : Type_\kappa ]
    \\
    \downarrow \downarrow \downarrow
    \\
    \mathcal{Type}_1 & \coloneqq & [ (A,B) : Type_{\kappa} & \vdash A \to B : Type_\kappa ]
    \\
    \downarrow  \downarrow
    \\
    \mathcal{Type}_0 & \coloneqq  & [ & \vdash Type_{\kappa} : Type_\lambda]
  }
  \,,
\end{displaymath}
where $\lambda \gt \kappa$ is another [[regular cardinal]] and where $Type_\kappa$ and $Type_\lambda$ are the corresponding [[object classifier in an (infinity,1)-topos|object classifiers]] of the $(\infty,1)$-topos $\mathbf{H}$;

and equipped with the evident degeneracy maps

\begin{displaymath}
A : Type \vdash s_0 A \to (A \to A)
\end{displaymath}
etc. In the [[categorical semantics]] in a [[type-theoretic model category]] this makes a fibrant and cofibrant [[Reedy model structure|Reedy diagram]], it manifestly satisfies the [[Segal conditions]], and it is precisely [[univalence]] in the type theory that makes this a \emph{[[complete Segal space]]} object.

\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item [[n-category object in an (infinity,1)-category]]


\item [[internal category]], [[internal functor]]


\item [[2-congruence]], [[(n,r)-congruence]]


\item [[Segal space]], [[semi-Segal space]]



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

\hypertarget{general}{}\subsubsection*{{General}}\label{general}

A general abstract formulation is in

\begin{itemize}%
\item [[Jacob Lurie]], \emph{[[(∞,2)-Categories and the Goodwillie Calculus]]} (\href{http://arxiv.org/abs/0905.0462}{arXiv:0905.0462})

\end{itemize}
The model given by complete Segal space objects is due to

\begin{itemize}%
\item [[Charles Rezk]], \emph{A model for the homotopy theory of homotopy theory}. Transactions of the American Mathematical Society 35 (2001), no. 3, 973-1007

\end{itemize}
and has since seen a multitude of further developments.

Influential but unpublished discussion of [[higher Segal spaces]] is due to [[Clark Barwick]].

\hypertarget{ReferencesFormalizationInHomotopyTypeTheory}{}\subsubsection*{{Formalization in homotopy type theory}}\label{ReferencesFormalizationInHomotopyTypeTheory}

Formalizations of [[1-categories]] and [[(n,1)-categories]] internal to [[homotopy type theory]] (see \emph{[[internal categories in homotopy type theory]]}) are discussed in

\begin{itemize}%
\item [[Benedikt Ahrens]], [[Chris Kapulkin]], [[Michael Shulman]], \emph{Univalent categories and the Rezk completion} (\href{http://arxiv.org/abs/1303.0584}{arXiv:1303.0584})


\item [[Paolo Capriotti]], [[Nicolai Kraus]], \emph{Univalent Higher Categories via Complete Semi-Segal Types} (\href{https://arxiv.org/abs/1707.03693}{arXiv:1707.03693})



\end{itemize}
[[!redirects category object in an (∞,1)-category]]

[[!redirects category objects in an (∞,1)-category]] [[!redirects category objects in (∞,1)-categories]] [[!redirects category objects in an (infinity,1)-category]] [[!redirects category objects in (infinity,1)-categories]]

[[!redirects category object in an (∞,1)-topos]] [[!redirects category objects in an (∞,1)-topos]] [[!redirects category object in an (infinity,1)-topos]] [[!redirects category objects in an (infinity,1)-topos]]

[[!redirects internal (∞,1)-category]] [[!redirects (infinity,1)-category object]] [[!redirects (∞,1)-category object]]

[[!redirects internal (infinity,1)-categories]] [[!redirects internal (∞,1)-categories]] [[!redirects (infinity,1)-category objects]] [[!redirects (∞,1)-category objects]]

[[!redirects complete Segal space object]] [[!redirects complete Segal space objects]]

[[!redirects internal category in an (∞,1)-category]] [[!redirects internal category in an (infinity,1)-category]] [[!redirects internal categories in an (∞,1)-category]] [[!redirects internal categories in an (infinity,1)-category]]

[[!redirects internal (infinity,1)-category]]

[[!redirects pre-category object in an (infinity,1)-category]] [[!redirects pre-category object in an (∞,1)-category]] [[!redirects pre-category objects in an (infinity,1)-category]] [[!redirects pre-category objects in an (∞,1)-category]] [[!redirects pre-category objects in (infinity,1)-categories]] [[!redirects pre-category objects in (∞,1)-categories]]

[[!redirects precategory object in an (infinity,1)-category]] [[!redirects precategory object in an (∞,1)-category]] [[!redirects precategory objects in an (infinity,1)-category]] [[!redirects precategory objects in an (∞,1)-category]] [[!redirects precategory objects in (infinity,1)-categories]] [[!redirects precategory objects in (∞,1)-categories]]

[[!redirects categories in an (∞,1)-category]]



\end{document}