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

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

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

[[!include category theory - contents]]

\hypertarget{topos_theory}{}\paragraph*{{Topos Theory}}\label{topos_theory}

[[!include topos theory - contents]]

\hypertarget{the_isbell_envelope_of_a_category}{}\section*{{The Isbell Envelope of a Category}}\label{the_isbell_envelope_of_a_category}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{profunctors}{Profunctors}\dotfill \pageref*{profunctors} \linebreak
\noindent\hyperlink{concrete_envelopes}{Concrete Envelopes}\dotfill \pageref*{concrete_envelopes} \linebreak
\noindent\hyperlink{enrichment}{Enrichment}\dotfill \pageref*{enrichment} \linebreak
\noindent\hyperlink{isbell_duality}{Isbell Duality}\dotfill \pageref*{isbell_duality} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

Given a [[category]] $\mathcal{T}$ of ``test objects'', one can consider ``things'' which $\mathcal{T}$ can detect. If one already has a class of [[object]]s in mind, one can consider $\mathcal{T}$-structures on those objects by looking at [[morphism]]s to and from objects of $\mathcal{T}$. Then one considers questions only in so far as they can be distinguished after mapping into $\mathcal{T}$. A simple example is that of smooth [[manifold]]s where many questions are solved by transporting the problem to Euclidean spaces via charts. Another example is the use of weak topologies on locally convex topological spaces. Without a class of objects in mind, the natural definition of an object probeable by $\mathcal{T}$-objects involves presheaves and copresheaves and is as follows.

\begin{defn}
\label{IsbellEnvelope}\hypertarget{IsbellEnvelope}{}
Let $\mathcal{T}$ be an [[small category|essentially small]] category. Then the \emph{Isbell envelope} of $\mathcal{T}$, written $E(\mathcal{T})$, is defined as follows. An object is a triple $X = (P,F,c)$ where

\begin{enumerate}%
\item $P$ is a [[contravariant functor]] $\mathcal{T} \to Set$ (a [[presheaf]]),
\item $F$ is a [[covariant functor]] $\mathcal{T} \to Set$ (a [[copresheaf]]),
\item $c : P \times F \to \mathcal{T}(-,-)$ is a [[natural transformation]] of bifunctors $\mathcal{T}^{op} \times \mathcal{T} \to$ [[Set]].

\end{enumerate}
(We conventionally write $X = (P_X, F_X, c_X)$.) A morphism $X \to Y$ is a pair of natural transformations $(\alpha,\beta)$ with $\alpha : P_X \to P_Y$ $\beta : F_Y \to F_X$ which satisfy the relation $c_X(-,\beta -) = c_Y(\alpha -,-)$.

\end{defn}
The requirement that $\mathcal{T}$ be essentially small implies that the collections of natural transformations form sets, and thus that this is a [[locally small category]].

Certain elementary properties are easy to prove.

\begin{prop}
\label{ElemProp}\hypertarget{ElemProp}{}
There is a (``double/twosided Yoneda'') embedding of $\mathcal{T}$ as a full subcategory of $E(\mathcal{T})$ via

\begin{displaymath}
T \mapsto (\mathcal{T}(-,T), \mathcal{T}(T,-), \circ)
\end{displaymath}
Identifying $\mathcal{T}$ with its image, there are [[natural isomorphism]]s

\begin{displaymath}
\mathcal{T}^g(T,X) \cong P_X(T), \qquad \mathcal{T}^g(X,T) \cong F_X(T)
\end{displaymath}
\end{prop}
\emph{Other elementary properties to follow}

\hypertarget{profunctors}{}\subsection*{{Profunctors}}\label{profunctors}

The Isbell envelope of a category can be viewed as a category of [[profunctors]]. In short, the Isbell envelope of $\mathcal{T}$ consists of the \emph{lax factorisations of $Hom$ through $1$}.

Let us spell this out. Recall that a profunctor $\mathcal{A} \to \mathcal{B}$ is a functor $\mathcal{A} \times \mathcal{B}^{op} \to Set$. Both covariant and contravariant functors to $Set$ are special examples of profunctors: a covariant functor $\mathfrak{F} : \mathcal{A} \to Set$ is a profunctor $\mathcal{A} \to 1$, where $1$ is the terminal category, and a contravariant functor $\mathfrak{G} : \mathcal{B} \to Set$ is a profunctor $1 \to \mathcal{B}$. The composition of these as profunctors produces the obvious profunctor $\mathfrak{F} \times \mathfrak{G} : \mathcal{A} \times \mathcal{B}^{op} \to Set$. Thus extracting the functor part of the definition of an object in the Isbell envelope of $\mathcal{T}$ produces a profunctor $\mathcal{T} \to \mathcal{T}$ which factors through $1$.

There is an obvious profunctor $\mathcal{T} \to \mathcal{T}$ given by the $Hom$-bifunctor. This is the identity for profunctor composition. The natural transformation from the definition of an object in the Isbell envelope of $\mathcal{T}$ defines a morphism of profunctors from the corresponding profunctor to $Hom$. Thus an object in the Isbell envelope of $\mathcal{T}$ corresponds to an object in the subcategory of the slice category of profunctors over $Hom$ of those objects which factor through $1$.

In other words, a lax factorisation of $Hom$ through $1$.

This characterization relates directly to a definition of [[Cauchy completion]]. One definition of a point of the Cauchy completion is an adjoint pair of a presheaf and copresheaf, and these define a subcategory of the Isbell envelope where $c_X$ is the counit of an adjunction. This exhibits the Cauchy completion as a subcategory of the Isbell envelope, that factorizes through both the free completion and free cocompletion:

\begin{displaymath}
\mathcal{T} \hookrightarrow \bar{\mathcal{T}} \hookrightarrow E(\mathcal{T})
\end{displaymath}
\hypertarget{concrete_envelopes}{}\subsection*{{Concrete Envelopes}}\label{concrete_envelopes}

A variant of the above involves a background category, say $\mathcal{U}$. The test objects should be viewable also as objects of $\mathcal{U}$, usually via a faithful functor. Any object of $\mathcal{U}$ defines a profunctor $\mathcal{T} \to \mathcal{T}$ (which factors through $1$) via

\begin{displaymath}
\begin{aligned}
\mathcal{T} \times \mathcal{T}^{op} &\to \mathcal{U} \times \mathcal{U}^{op} &&\to Set \\
(T_1, T_2) &\mapsto (|T_1|, |T_2|) &&\mapsto \mathcal{U}(U,|T_1|) \times \mathcal{U}(|T_2|,U)
\end{aligned}
\end{displaymath}
Then one can consider those objects of the Isbell envelope of $\mathcal{T}$ that are sub-profunctors of one of this type. In addition one should restrict the morphisms to those that are induced by morphism of objects of $\mathcal{U}$. Translating this back to the language of functors yields the following definition.

\begin{defn}
\label{ConcIsbellEnvelope}\hypertarget{ConcIsbellEnvelope}{}
Let $\mathcal{T}$ and $\mathcal{U}$ be categories with a [[faithful functor]] $\mathcal{T} \to \mathcal{U}$ which we shall write as $T \mapsto |T|$. The \emph{$\mathcal{U}$-concrete Isbell envelope} of $\mathcal{T}$, which we shall write $E_{\mathcal{U}}(\mathcal{T})$, is the category whose objects are triples $(U,P,F)$ where

\begin{enumerate}%
\item $U$ is an object of $\mathcal{U}$,
\item $P : \mathcal{T} \to Set$ is a subfunctor of the (contravariant) functor $T \mapsto \mathcal{U}(|T|,U)$,
\item $F : \mathcal{T} \to Set$ is a subfunctor of the (covariant) functor $T \mapsto \mathcal{U}(U,|T|)$,

\end{enumerate}
such that the image of the natural transformation

\begin{displaymath}
P \times F \to \mathcal{U}(|-|,|-|),
\end{displaymath}
which comes from composition in $\mathcal{U}$, lies in the image of the natural transformation $\mathcal{T}(-,-) \to \mathcal{U}(|-|,|-|).$

A morphism in $E_{\mathcal{U}}(\mathcal{T})$ is a $\mathcal{U}$-morphism on the underlying $\mathcal{U}$-objects that defines natural transformations $P_X \to P_Y$ and $F_Y \to F_X$.

\end{defn}
Having a background category ensures that the size issues with natural transformations do not occur and so we can drop the requirement that $\mathcal{T}$ be essentially small.

\hypertarget{enrichment}{}\subsection*{{Enrichment}}\label{enrichment}

These notions can be considered in the setting of [[enriched category theory]] by replacing [[Set]] wherever it occurs (explicitly or implicitly) by the enriching category.

\hypertarget{isbell_duality}{}\subsection*{{Isbell Duality}}\label{isbell_duality}

Within the Isbell envelope of $\mathcal{T}$ one can consider various [[subcategories]] where the objects satisfy extra conditions. An obvious condition is that the presheaf is actually a sheaf. Another useful condition is that of [[Isbell duality]].

\begin{defn}
\label{IsbelDuality}\hypertarget{IsbelDuality}{}
An object $X$ of $E(\mathcal{T})$ is said to be \emph{$P$-saturated} if the obvious natural transformations

\begin{displaymath}
P_X(T) \to NatTrans(F_X,\mathcal{T}(T,-))
\end{displaymath}
are isomorphisms. It is said to be \emph{$F$-saturated} if the obvious natural transformations

\begin{displaymath}
F_X(T) \to NatTrans(P_X,\mathcal{T}(-,T))
\end{displaymath}
are isomorphisms. It is said to satisfy \emph{[[Isbell duality]]} if it is both $P$- and $F$-saturated.

\end{defn}
Within $E(\mathcal{T})$ one can consider the [[full subcategories]] of $P$-saturated objects, of $F$-saturated objects, and those satisfying Isbell duality. Clearly, the last is the intersection of the first two. There are idempotent functors onto the first two categories given by replacing one of $P_X$ or $F_X$ by the natural transformations of the other. An interesting question is to ask whether or not the obvious iteration stabilises after a finite number of steps (which would result in an object satisfying Isbell duality).

If the test category has, or ``morally has'', a [[representable functor]] to $Set$ then there is a strong relationship between saturation and concreteness.

\begin{defn}
\label{ConstSep}\hypertarget{ConstSep}{}
A \emph{constant separator} in a category is an object, say $S$, with the property that if $f \ne g : A \to B$ then there is a [[constant morphism]] $c : S \to A$ such that $f c \ne g c$.

\end{defn}
As the constant morphisms form a two-sided ideal, any object $C_0$ in a category $\mathcal{C}$ defines a covariant functor $|-|_{C_0} : \mathcal{C} \to Set$ which on objects sends $C$ to the set of constant morphisms from $C_0$ to $C$. A morphism $C_0 \to C_0'$ defines a natural transformation (in the opposite direction) between the corresponding functors. From the properties of constant morphisms one can easily deduce that two different morphisms between the same objects induce the same natural transformations between the functors. Thus if there are morphisms between two objects in both directions the two functors are naturally isomorphic.

The property of being a constant separator is clearly equivalent to the condition that this constant functor be faithful. Moreover, it is easy to show that in a non-trivial category, any two constant separators have morphisms between them in both directions and so induce naturally isomorphic functors. Indeed, not just naturally isomorphic but naturally naturally isomorphic in that there is a canonical choice of natural isomorphism.

Now we transfer this to the Isbell envelope of $\mathcal{T}$.

\begin{defn}
\label{GenSpaceConst}\hypertarget{GenSpaceConst}{}
Let $X=(P,F,c)$ be an object of $E(\mathcal{T})$. An element $\alpha \in P(T)$, for $T$ an object of $\mathcal{T}$, is said to be \emph{constant} if $\phi \circ \alpha \in \mathcal{T}(T,T')$ is constant for all $T'$ objects of $\mathcal{T}$ and $\phi \in F(T')$.

Let us write $|X|_T$ for the set of constant elements in $P(T)$.

\end{defn}
\begin{lemma}
\label{GenSpConsFun}\hypertarget{GenSpConsFun}{}
Let $T_0$ be an object in $\mathcal{T}$. The assignment $X \to |X|_{T_0}$ is functorial and extends the assignment $T \to |T|_{T_0}$. A $\mathcal{T}$--morphism $T_0 \to T_1$ defines a natural transformation of functors.

\end{lemma}
\begin{proof}
Let $X_i = (P_i,F_i,c_i)$, $i = 1,2$, be two objects in $E(\mathcal{T})$. Let $(\alpha,\beta)$ be a morphism from the first to the second. Then $\alpha$ is a natural transformation $P_1 \to P_2$ so in particular defines a morphism of sets $P_1(T_0) \to P_2(T_0)$. Let $\gamma \in P_1(U_0)$ be a constant element. Let $T$ be an object in $\mathcal{T}$ and $\phi \in F_2(T)$. We need to show that $\phi \circ (\alpha \circ \gamma)$ is a constant morphism. By the definition of a morphism in $E(\mathcal{T})$, $\phi \circ (\alpha \circ \gamma) = (\phi \circ \beta) \circ \gamma$ and this latter is a constant morphism since $\gamma \in P_1(T_0)$ is a constant element.

For the extension, we observe that for $\gamma \in P_T(T_0)$ then if $\gamma$ is a constant morphism, $c_T(\phi,\gamma) = \phi \circ \gamma$ is constant for all $\phi$; whilst if $c_T(\phi,\gamma)$ is constant for all $\phi$ then in particular $\gamma = c_T(1_T,\gamma)$ is constant. That the morphisms correspond is obvious.

A $\mathcal{T}$--morphism $\psi : T_0 \to T_1$ defines a map $P(T_1) \to P(T_0)$ as $P$ is a contravariant functor. Let $\gamma \in P(T_1)$ be a constant element. Then for $T'$ an object in $\mathcal{T}$ and $\phi \in F(U')$, $\phi \circ (\gamma \circ \psi) = (\phi \circ \gamma) \circ \psi$ and $\phi \circ \gamma$ is a constant morphism in $\mathcal{T}(T_1,T')$ so $\phi \circ (\gamma \circ \psi)$ is a constant morphism in $\mathcal{T}(T_0,T')$. Hence $\gamma \circ \psi$ is a constant element in $P(T_0)$.

\end{proof}
The result that the natural transformations depend only on the existence of a morphism does not carry over to this extended setting.

[[Andrew Stacey|Andrew]]: Useful to have an example here, of course.

Let us fix a $\mathcal{T}$--object $T_0$. We have two bifunctors $\mathcal{T} \times E(\mathcal{T}) \to Set$ given by

\begin{displaymath}
(T,X) \mapsto P_X(T)
\end{displaymath}
and

\begin{displaymath}
(T,X) \mapsto Set(|T|_{T_0},|X|_{T_0})
\end{displaymath}
Let us, to simplify notation, identify $T$ with its image in $E(\mathcal{T})$. Then $P_X(T)$ is naturally isomorphic to $E(\mathcal{T})(T,X)$ so the fact that $X \mapsto |X|_{T_0}$ is a functor defines a natural transformation from the first to the second via

\begin{displaymath}
P_X(T) \cong E(\mathcal{T})(T,X) \to Set(|T|_{T_0}, |X|_{T_0})
\end{displaymath}
In a similar fashion, we obtain a natural transformation

\begin{displaymath}
F_X(T) \cong E(\mathcal{T})(X,T) \to Set(|X|_{T_0},|T|_{T_0}).
\end{displaymath}
We therefore obtain a functorial choice of underlying concrete object (with the underlying category being $Set$). We can refine the notion of concreteness slightly.

\begin{defn}
\label{ConcGenSp}\hypertarget{ConcGenSp}{}
Let $\mathcal{T}$ be an essentially small category with a concrete separator, say $T_0$. Let $X = (P_X,F_X,c_X)$ be an object of $E(\mathcal{T})$. We say that $X$ is \emph{$P$--concrete} if the map of sets

\begin{displaymath}
P_X(T) \to Set(|T|_{T_0},|X|_{T_0})
\end{displaymath}
is injective for all $\mathcal{T}$--objects, $T$.

Similarly, we say that $X$ is \emph{$F$--concrete} if the map of sets

\begin{displaymath}
F_X(T) \to Set(|X|_{T_0}, |T|_{T_0})
\end{displaymath}
is injective for all $\mathcal{T}$--objects, $T$.

\end{defn}
Clearly, if it is both $P$-concrete and $F$-concrete then it is concrete. Changing the concrete separator does not alter concreteness.

\begin{theorem}
\label{ConcreteIsbell}\hypertarget{ConcreteIsbell}{}
Let $\mathcal{T}$ be an essentially small category admitting a constant separator. Then for an object $X$ of $E(\mathcal{T})$, the following hold:

\begin{enumerate}%
\item If $X$ is $P$-saturated then it is $P$-concrete,
\item If $X$ is $F$-saturated then it is $F$-concrete,
\item If $X$ satisfies Isbell duality then it is concrete.

\end{enumerate}
\end{theorem}
\begin{proof}
Clearly the first and second statements imply the third.

Let us consider the first.

Let $X$ be an object of $E(\mathcal{T})$ such that $P_X(T) = NatTrans(F_X,F_T)$ for all $\mathcal{T}$--objects $T$. Let $S$ be a concrete separator in $\mathcal{T}$. We shall write $|-|$ for $|-|_S$. Let $T$ be an object of $\mathcal{T}$. Let $\alpha \ne \beta \in P_X(T)$. As $P_X(T) = NatTrans(F_X,F_T)$, their inequality means that they differ as natural transformations. Thus there is some $T'$ for which $\alpha$ and $\beta$ induce different morphisms $F_X(T') \to F_T(T')$. Thus there is some $\phi \in F_X(T')$ such that $\alpha_{T'}(\phi) \ne \beta_{T'}(\phi) \in \mathcal{T}(T,T')$.

As $S$ is a constant separator, there is thus a constant morphism $\delta : S \to T$ such that $\alpha_{T'}(\phi) \circ \delta \ne \beta_{T'}(\phi) \circ \delta$. Using composition notation, we rewrite this as $\phi \circ \alpha \circ \delta \ne \phi \circ \beta \circ \delta$. As $\delta$ is a constant morphism, $\alpha \circ \delta$ and $\beta \circ \delta$ are constant elements of $P_X(S)$. Since $\phi \circ \alpha \circ \delta \ne \phi \circ \beta \circ \delta$, they must be different constant elements. Thus the maps $\alpha,\beta : |T| \to |X|$ are different and so $X$ is $P$--concrete.

The second statement is very similar.

Let $X$ be an object of $E(\mathcal{T})$ such that $F_X(U) = NatTrans(P_X,P_T)$ for all $\mathcal{T}$--objects $T$. Let $S$ be a concrete separator in $\mathcal{T}$. Let $T$ be an object of $\mathcal{T}$. Let $\phi \ne \psi \in F_X(T)$. As $F_X(T) = NatTrans(P_X,P_T)$, their inequality means that they differ as natural transformations. Thus there is some $T'$ for which $\phi$ and $\psi$ induce different morphisms $P_X(T') \to P_T(T')$. Thus there is some $\alpha \in P_X(T')$ such that $\phi_{T'}(\alpha) \ne \psi_{T'}(\alpha) \in \mathcal{T}(T',T)$.

As $S$ is a constant separator, there is thus a constant morphism $\delta : S \to T'$ such that $\phi_{T'}(\alpha) \circ \delta \ne \psi_{T'}(\alpha) \circ \delta$. Using the composition notation, we rewrite this as $\phi \circ \alpha \circ \delta \ne \psi \circ \alpha \circ \delta$. As $\delta$ is a constant morphism, $\alpha \circ \delta \in P_X(S)$ is a constant element. We therefore have an element of $|X|$ which distinguishes between the induced maps from $\phi$ and $\psi$. Hence $X$ is $F$--concrete.

\end{proof}
\hypertarget{examples}{}\subsubsection*{{Examples}}\label{examples}

When $\mathcal{T}$ is a [[poset]], the category of saturated objects in its Isbell envelope coincides with its [[MacNeille completion]].

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

\begin{itemize}%
\item [[John Isbell]], \emph{Structure of categories}, Bulletin of the American Mathematical Society 72 (1966), 619-- 655.


\item [[John Isbell]], \emph{Normal completions of categories}, Reports of the Midwest Category Seminar, vol. 47, Springer, 1967, 110--155.


\item [[Richard Garner]], \emph{The Isbell monad} , Advances in Mathematics \textbf{274} (2015) pp.516-537. (\href{http://comp.mq.edu.au/~rgarner/Papers/Isbell.pdf}{draft})


\item [[Vaughan Pratt]], \emph{Communes via Yoneda, from an elementary perspective}, Fundamenta Informaticae 103 (2010), 203--218.



\end{itemize}
For more see the \href{Isbell+duality#references}{references} at \emph{[[Isbell duality]]}.

[[!redirects Isbell envelope]] [[!redirects Isbell envelopes]] [[!redirects generalized object]] [[!redirects generalized objects]]



\end{document}