\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*{hypothèse inspiratrice}

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

\hypertarget{category_theory}{}\paragraph*{{Category theory}}\label{category_theory}

[[!include category theory - contents]]

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

[[!include homotopy - contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{proofs_of_lifts_of_the_assumption}{Proofs of lifts of the assumption}\dotfill \pageref*{proofs_of_lifts_of_the_assumption} \linebreak
\noindent\hyperlink{proof_of_the_analogous_statement_for_the_category_of_sets}{Proof of the analogous statement for the category of sets}\dotfill \pageref*{proof_of_the_analogous_statement_for_the_category_of_sets} \linebreak
\noindent\hyperlink{undirected_version}{Undirected version}\dotfill \pageref*{undirected_version} \linebreak
\noindent\hyperlink{grothendiecks_formulation}{Grothendieck's formulation}\dotfill \pageref*{grothendiecks_formulation} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

The \emph{hypothèse inspiratrice} or \emph{inspiring assumption} is an assumption formulated by [[Grothendieck]] in \emph{[[Pursuing Stacks]]}, that the [[category]] of auto-[[equivalence of categories|equivalences]] of the [[classical homotopy category]] is [[equivalence of categories|equivalent]] to the [[final category]]. See below for Grothendieck's own formulation of it. It has not been proven in its original form.

\hypertarget{proofs_of_lifts_of_the_assumption}{}\subsection*{{Proofs of lifts of the assumption}}\label{proofs_of_lifts_of_the_assumption}

The \emph{hypothèse inspiratrice} can be proven relatively easily if one re-formulates the question for a lift of the homotopy category to [[derivator|derivators]], [[(∞,1)-category|(∞,1)-category theory]], or some other such setting for [[homotopy theory]]. One such [[proof]] is given in \hyperlink{Cisinski08}{Cisinski 08}. A different proof is given in \hyperlink{ToenVezzoi02}{Toën-Vezzosi 02}, as the case $X=1$ of Corollary 5.2.2.

\hypertarget{proof_of_the_analogous_statement_for_the_category_of_sets}{}\subsection*{{Proof of the analogous statement for the category of sets}}\label{proof_of_the_analogous_statement_for_the_category_of_sets}

$\backslash$begin\{prpn\} The category of auto-equivalences of [[Set]] is equivalent to the final category. $\backslash$end\{prpn\}

$\backslash$begin\{proof\} Any equivalence of categories preserves [[colimit|colimits]]. Since [[Set]] is the [[free co-completion]] of the final category $1_{\mathsf{Cat}}$, and since $1_{\mathsf{Cat}}$ is sent to $1_{\mathsf{Set}}$ under the Yoneda embedding, any auto-equivalence $F$ of [[Set]] is determined uniquely, up to isomorphism, by $F(1_{\mathsf{Set}})$.

Now, equivalences of categories also preserve [[final object|final objects]]. Thus we have that $F(1_{\mathsf{Set}}) = 1_{\mathsf{Set}}$ for all $F$.

The proposition follows immediately from these two observations. $\backslash$end\{proof\}

This argument is rather canonical. In principle, it `should' lift to a proof of the hypothèse inspiratrice, simply by replacing set-theoretic notions by homotopy-theoretic ones: colimits by homotopy colimits, and so on. And this does work, but with the caveat that such a proof can only be formulated if one works inside `homotopy category theory' rather than ordinary category theory.

\hypertarget{undirected_version}{}\subsection*{{Undirected version}}\label{undirected_version}

The original hypothèse inspiratrice is about the homotopy \emph{1-category}, and its lifted versions are about the corresponding \emph{$(\infty,1)$-category} of homotopy types ($\infty$-groupoids). One might formulate an analogous conjecture about the \emph{$\infty$-groupoid} of $\infty$-groupoids (or about its 0-truncation, the set of equivalence classes of $\infty$-groupoids). But here the situation is rather different.

If we assume the law of [[excluded middle]], then there definitely exist nontrivial automorphisms of the $\infty$-groupoid of homotopy types. For instance, if $X$ and $Y$ are two homotopy types that themselves have no nontrivial automorphisms (such as the [[empty set]] and the [[terminal set]]), then there is an automorphism of the $\infty$-groupoid of homotopy types that switches $X$ and $Y$ and leaves everything else fixed. See for instance [[Vladimir Voevodsky|Voevodsky]]`s comment in \href{https://groups.google.com/d/msg/homotopytypetheory/Wyxmcvo5K2Y/SUm3nwYECQAJ}{this thread} on the HoTT mailing list. This requires excluded middle because we have to decide, for each homotopy type, whether it is equivalent to $X$ or to $Y$ or to neither.

It is not known whether any nontrivial automorphisms of the $\infty$-groupoid of homotopy types can be constructed without excluded middle. (To talk about homotopy types without assuming excluded middle, it is best to work in constructive [[homotopy type theory]].) But it is known that certain kinds of such automorphisms (e.g. those that move the empty set) do imply excluded middle or some other nonconstructive axiom; see \hyperlink{BELS17}{BELS}.

\hypertarget{grothendiecks_formulation}{}\subsection*{{Grothendieck's formulation}}\label{grothendiecks_formulation}

The original formulation in \emph{[[Pursuing Stacks]]} (page 30 in the pagination of the original document, section 28, 8th of March 1983) is preceded by

\begin{quote}%
Now this maybe isnt sic so silly after all, in view of the following

Assumption: The category of equivalences of $(Hot)$ with itself, and of natural isomorphisms (possibly even any morphisms) between such, is equivalent to the one point category.

This means 1) any equivalence $(Hot) \stackrel{\approx}{\to} (Hot)$ is isomorphic to the identity functor, and 2) any automorphism of the identity functor (possibly even any endomorphism ?) is the identity.

Maybe these are facts well-known to the experts, maybe not - it is not my business here anyhow to prove such kind of things. It looks pretty plausible , because if there was any non trivial autoequivalence of $(Hot)$, or automorphism of its identity functor, I guess I would have heard about it, or something of the sort would flip to my mind. It would not be so if we abelianized $(Hot)$ some way or other, as there would be the loop and suspension functor, and homotheties by $-1$ of $id_{(Hot)}$.


\end{quote}
In most copies of Pursuing Stacks available, the assumption itself is blacked out. Tim Porter suggests that this is likely due to the text having been highlighted, probably in yellow, leading to the blacking out upon photocopying. Because of the blacking out, the assumption is also not available in circulating typed versions of Pursuing Stacks. Happily, Tim Porter has scanned \emph{[[page 30.pdf|here:file]]} the relevant page from his personal copy of Pursuing Stacks. The assumption is about mid-page.

Later on (page 71 in the pagination of the original document, section 41, around the 24th of March 1983), Grothendieck writes the following.

\begin{quote}%
One comment still, upon the role played in the theory I am developing of the assumption (p.30) that the category of autoequivalences of $(Hot)$ is equivalent to the final category. This assumption has been a crucial guide for putting the emphasis where it really belongs, namely upon the set $W \subset Fl(H)$ of weak equivalences within a category $H$ letter is a bit illegible which one would like to take in some sense as a category of models for homotopy types - the functors $H \rightarrow (Hot)$ following along automatically. However, in no statement whatever I proved so far, was this assumption ever used. On the other hand, the notion of a \emph{modelizer} introduced in the wake of the `assumption' (of p.31) this seems like a typo, presumably it should be p.30 was tacitly changed during the reflection, \ldots{}


\end{quote}
Slightly later again (page 73, section 42, 25th of March 1983), the following is written, introducing the phrase ``inspiring assumption'':

\begin{quote}%
This is indeed very much in the spirit of the ``inspiring assumption'' of p.30, that the category of autoequivalences of $(Hot)$ is equivalent to the unit category, which implies indeed that for two categories $H, H'$ equivalent to $(Hot)$, there is a unique isomorphism between them.


\end{quote}
A further reference comes on page 80-81, section 44, 26th of March 1983.

\begin{quote}%
But it is so if we grant the ``inspiring assumption'', implying that any autoequivalence of $(Hot)$ is isomorphic to the identity functor


\end{quote}
And again on page 86, still on the same day.

\begin{quote}%
If we admit the ``inspiring assumption'' that any autoequivalence of $(Hot)$ is uniquely isomorphic to the identity functor, it will follow that the autoequivalence $(Hot) \rightarrow (Hot)$ induced by (11) (where again $i$ is any weak test functor) is canonically isomorphic to the identity.


\end{quote}
Next is a reference on pg.93, section 46, probably the 28th or 29th of March 1983.

\begin{quote}%
(If we admit the ``inspiring assumption'', there is no real choice, as a matter of fact - but we don't want to use this in a technical sense, but only as a guide and motivation.)


\end{quote}
There is also a reference on pg.216-217, section 72, 10th of June 1983.

\begin{quote}%
This is of course very much in keeping with the ``inspiring assumption'' (section 28), which just means that up to unique isomorphism, there is indeed but \emph{one} equivalence from $Hot_B$ to $Hot_A$ (both categories being equivalent to $Hot(\underline{W})$. Here we are thinking of the extension of the ``assumption'' contemplated earlier, when usual weak equivalence is replaced by a basic localizer $\underline{W}$ as above. It seems plausible that the assumption holds true in all cases - anyhow we did'nt sic have at any moment to make explicit use of it (besides at a moment drawing inspiration from it\ldots{}).


\end{quote}
The final reference is on pg.273, section 83, probably the 27th or 28th of June 1983.

\begin{quote}%
Here also arises the question whether a functor $\phi: M \rightarrow Hot_{\underline{W}}$ stemming from a contractibility structure $M_{c}$ on $M$ can have non trivial automorphisms - a question closely connected to the ``inspiring assumption'' of section 28.


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

\begin{itemize}%
\item [[Denis-Charles Cisinski]], \emph{Propriétés universelles et extensions de Kan dérivées}, Theory Appl. Categ. 20, 605-649 (2008). \href{http://www.tac.mta.ca/tac/volumes/20/17/20-17abs.html}{Link to article}


\item [[Bertrand Toën]] and [[Gabriele Vezzosi]], \emph{Segal topoi and Segal stacks over them}, \href{https://arxiv.org/abs/math/0212330}{arXiv:math/0212330}.


\item [[Auke Booij]], [[Martín Escardó]], [[Peter Lumsdaine]], [[Michael Shulman]]. \emph{Parametricity, automorphisms of the universe, and excluded middle}, \href{https://arxiv.org/abs/1701.05617}{arXiv:1701.05617}



\end{itemize}
[[!redirects inspiring assumption]]



\end{document}