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

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

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

[[!include category theory - contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{ExamplesInAnalysisAndTopology}{Examples in analysis and topology}\dotfill \pageref*{ExamplesInAnalysisAndTopology} \linebreak
\noindent\hyperlink{ExamplesForOrderedSets}{Examples for ordered sets}\dotfill \pageref*{ExamplesForOrderedSets} \linebreak
\noindent\hyperlink{knastertarski_theorem}{Knaster-Tarski theorem}\dotfill \pageref*{knastertarski_theorem} \linebreak
\noindent\hyperlink{pataraias_theorem}{Pataraia's theorem}\dotfill \pageref*{pataraias_theorem} \linebreak
\noindent\hyperlink{galois_connections}{Galois connections}\dotfill \pageref*{galois_connections} \linebreak
\noindent\hyperlink{ExamplesInSetTheory}{Examples in set theory}\dotfill \pageref*{ExamplesInSetTheory} \linebreak
\noindent\hyperlink{ExamplesInCategoryTheory}{Examples in category theory}\dotfill \pageref*{ExamplesInCategoryTheory} \linebreak
\noindent\hyperlink{initial_algebras_and_final_coalgebras}{Initial algebras and final coalgebras}\dotfill \pageref*{initial_algebras_and_final_coalgebras} \linebreak
\noindent\hyperlink{fixed_points_of_left_exact_idempotent_endofunctors}{Fixed points of left exact idempotent endofunctors}\dotfill \pageref*{fixed_points_of_left_exact_idempotent_endofunctors} \linebreak
\noindent\hyperlink{domain_theory}{Domain theory}\dotfill \pageref*{domain_theory} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

A \emph{fixed point} (or \emph{fixpoint}) of an [[endofunction]] $f \colon X \to X$ is an [[element]] $x \in X$ such that $f(x) = x$.

More generally, if $C$ is a [[category]] with a [[terminal object]] $1$ and an [[endomorphism]] $f \colon X \to X$, then a fixed point of $f$ is an element $x \colon 1 \to X$ such that $f \circ x = x$. More generally still, we can speak of the same notion but replacing global elements $x \colon 1 \to X$ by [[generalized elements]] $x \colon U \to X$, where again $x$ is a fixed point of $f \colon X \to X$ if $f \circ x = x$.

Fixed points are also called \emph{[[invariants]]}, in particular if they are joint fixed points of all the operations in a given [[monoid]] or [[group]].

Such fixed points we discuss below in

\begin{itemize}%
\item \emph{\hyperlink{ExamplesInAnalysisAndTopology}{Examples in analysis and topology}}


\item \emph{\hyperlink{ExamplesForOrderedSets}{Examples for ordered sets}}


\item \emph{\hyperlink{ExamplesInSetTheory}{Examples in Set theory}}



\end{itemize}
The importance of fixed points all throughout mathematics is difficult to overstate. They are particularly important in [[analysis]], [[topology]], [[lattice]] theory, set theory, and category theory. Fixed points of endofunctors frequently arise as solutions to ``recursive equations'', especially in the form of [[initial algebra of an endofunctor|initial algebras and terminal coalgebras]].

In [[category theory]] the concept of fixed points admits [[categorification]]: For example, if $F \colon C \to C$ is an [[endofunctor]], then an object $c$ of $C$ is called a ``fixed point of the endofunctor'' $F$ is there is an [[isomorphism]] $F(c) \cong c$ (although usually, a fixed point of a functor is an object together with a specified such isomorphism). These fixed points for endofunctors we discuss below in

\begin{itemize}%
\item \emph{\hyperlink{ExamplesInCategoryTheory}{Fixed points of an endofunctor}}

\end{itemize}
See also at

\begin{itemize}%
\item \emph{[[fixed point of an adjunction]]} (which in particular restricts to a concept of fixed points of a [[Galois correspondence]])

\end{itemize}
In [[homotopy theory]] the concept of fixed point becomes that of

\begin{itemize}%
\item \emph{[[homotopy fixed point]]}

\end{itemize}
In [[stable homotopy theory]] it becomes the concept of

\begin{itemize}%
\item \emph{[[fixed point spectrum]]}

\end{itemize}
For further occurences in [[logic]] see also

\begin{itemize}%
\item \emph{[[fixed-point combinator]]}


\item \emph{[[Lawvere's fixed point theorem]]}



\end{itemize}
\hypertarget{ExamplesInAnalysisAndTopology}{}\subsection*{{Examples in analysis and topology}}\label{ExamplesInAnalysisAndTopology}

A typical application of fixed points in analysis is through the following general theorem:

\begin{theorem}
\label{}\hypertarget{}{}
Suppose $X$ is an (inhabited) [[complete metric space]] with distance function $d$ and $f \colon X \to X$ is a function with Lipschitz constant $r$ less than $1$, i.e., $d(f(x), f(y)) \leq r \cdot d(x, y)$ for all $x, y \in X$. Then $f$ has a unique fixed point.

\end{theorem}
The proof is very easy: starting with an initial point $x_0$, the [[sequence]] defined by $x_{n+1} = f(x_n)$ is readily seen to be a [[Cauchy sequence]] which converges to some point $x$. The sequence $x_{n+1} = f(x_n)$ converges to both $x$ and $f(x)$, so $x = f(x)$. If $x$ and $y$ are fixed points, then $0 \leq d(x, y) = d(f(x), f(y)) \leq r \cdot d(x, y)$, so

\begin{displaymath}
(1-r)d(x, y) \leq 0
\end{displaymath}
whence $0 \leq d(x, y) \leq 0$ and therefore $x = y$.

By a suitable choice of space $X$ and endomorphism $f$, this theorem can be used to establish existence and uniqueness of solutions of differential equations (this should be expanded upon).

\begin{itemize}%
\item [[Brouwer's fixed point theorem]]


\item Schauder


\item Kakutani


\item Tychonoff


\item Lefschetz


\item Atiyah-Singer; Wood's Hole



\end{itemize}
\hypertarget{ExamplesForOrderedSets}{}\subsection*{{Examples for ordered sets}}\label{ExamplesForOrderedSets}

\hypertarget{knastertarski_theorem}{}\subsubsection*{{Knaster-Tarski theorem}}\label{knastertarski_theorem}

\begin{theorem}
\label{}\hypertarget{}{}
If $L$ is a [[complete lattice]], then every monotone (i.e., order-preserving) map $f \colon L \to L$ has a fixed point (in fact, the fixed points of $f$ form a complete lattice).

\end{theorem}
\begin{proof}
The [[algebra of an endofunctor|algebras]] for the functor $f \colon L \to L$ are elements $x$ such that $f(x) \leq x$. Limits in $Alg(L)$ are preserved and reflected by the forgetful functor or inclusion $Alg(L) \to L$, hence $Alg(L)$ is complete if $L$ is. In particular, $Alg(L)$ has an initial object, and initial algebras are fixed points.

(In more down-to-earth terms, let $t$ be the infimum of $A = \{x: f(x) \leq x\}$. Then for every $x \in A$, we have $f(t) \leq f(x) \leq x$, hence $f(t) \leq t$. We therefore also have $f(f(t)) \leq f(t)$, so that $f(t) \in A$. But then it follows that $t \leq f(t)$, whence $t = f(t)$. Clearly this $t$ is a least fixed point of $f$.)

To show completeness of $fix(f)$, suppose given $S \subseteq fix(f)$, and let $s$ be the supremum of $S$ in $L$. Then the principal upward-closed set $s \uparrow$ generated by $s$ is a complete lattice. Also, $f$ restricts to a map $s \uparrow \to s \uparrow$ (for if $s \leq x$, then $p \leq x$ for all $p \in S$, whence $p = f(p) \leq f(x)$ for all $p \in S$, so that $s \leq f(x)$). The least fixed point of $f: s \uparrow \to s \uparrow$ is the supremum of $S$ in $fix(f)$.

\end{proof}
A virtual corollary of this theorem is the [[Cantor-Schroeder-Bernstein theorem]].

\hypertarget{pataraias_theorem}{}\subsubsection*{{Pataraia's theorem}}\label{pataraias_theorem}

The following significantly strengthens the Knaster-Tarski theorem, and is based on the notion of an \textbf{ipo} (inductive partial order; see Paul Taylor's book), i.e., a poset with a bottom element and admitting joins of [[direction|directed subsets]].

\begin{theorem}
\label{}\hypertarget{}{}
If $L$ is an ipo, then every monotone map $f \colon L \to L$ has a (least) fixed point.

\end{theorem}
\begin{proof}
Consider the smallest $S$ among subsets of $L$ which contain $\bot$, are closed under $f$, and closed under directed joins in $L$. Then the restriction $f \colon S \to S$ satisfies $1_S \leq f$, i.e., $f$ is \emph{inflationary}. (For the set of all elements $x \in L$ such that $x \leq f(x)$ is another such subset, so $S$ is contained in it.) Thus it suffices to show that every inflationary map on a poset $S$ with a bottom element and directed joins has a fixed point.

The collection $I$ of inflationary monotone maps on $S$ is an ipo: its bottom element is $1_S$, and directed joins are computed pointwise. Moreover, $I$ is itself directed: if $g, h \in I$, then $g \circ h \in I$ dominates them both. Thus the directed join $t$ of the collection exists; it is the maximal element $t$ of $I$. It follows that $f \circ t \leq t$, but also $t \leq f \circ t$ since $f$ is inflationary. So $f \circ t = t$, and in particular $t(\bot) \in S$ is a fixed point of $f$.

This $t(\bot)$ is a least fixed point of $f: L \to L$. For if $x$ is any fixed point, the downward-closed set $L \downarrow x$ contains $\bot$, is closed under $f$, and is closed under [[direction|directed unions]], and therefore $S \subseteq L \downarrow x$. Hence $t(\bot) \in S$ satisfies $t(\bot) \leq x$.

\end{proof}
One may mimic the last part of the proof of the Knaster-Tarski theorem to show that if $L$ is an ipo and $f$ is monotone, then $fix(f)$ (with the order inherited from $L$) is also an ipo. Indeed, we have just seen $fix(f)$ has a bottom element, and if $A \subseteq fix(f)$ is any directed subset, and $s = sup(A)$ is its sup in $L$, then we may argue as we did for the Knaster-Tarski theorem that $f$ restricts to a monotone map on the ipo $s \uparrow L$, whence by Pataraia's theorem it has a least fixed point, and this will be the sup of $A$ in $fix(f)$.

\hypertarget{galois_connections}{}\subsubsection*{{Galois connections}}\label{galois_connections}

\hypertarget{ExamplesInSetTheory}{}\subsection*{{Examples in set theory}}\label{ExamplesInSetTheory}

\begin{itemize}%
\item In at least some of the ``lower'' levels of the hierarchy of countable ordinals, leading up to the Feferman-Sch\"u{}tte ordinal, fixed points of continuous operators on the first uncountable ordinal play a central role. More information may be found at [[countable ordinal]].


\item Critical points of elementary embeddings (non-fixed points)



\end{itemize}
\hypertarget{ExamplesInCategoryTheory}{}\subsection*{{Examples in category theory}}\label{ExamplesInCategoryTheory}

\hypertarget{initial_algebras_and_final_coalgebras}{}\subsubsection*{{Initial algebras and final coalgebras}}\label{initial_algebras_and_final_coalgebras}

Various classical fixed-point theorems for monotone functions on posets can be ``categorified'' to give appropriate fixed-point theorems for endofunctors on categories. An example is that Kleene's fixed-point theorem generalizes to Adamek's fixed-point theorem:

\begin{theorem}
\label{}\hypertarget{}{}
Let $C$ be a category with an initial object $0$ and colimits of $\kappa$-directed diagrams for some regular cardinal $\kappa$, and suppose $F \colon C \to C$ preserves $\kappa$-directed colimits. Then $F$ has an initial algebra (which by Lambek's theorem is a fixed point of $F$).

\end{theorem}
\begin{proof}
Regarding $\kappa$ as an ordinal $\{\alpha \lt \kappa\}$ (hence a poset, hence a category), define a functor $G \colon \kappa \to C$ recursively: on objects, put $G(\emptyset) = 0$, $G(\alpha + 1) = F(G(\alpha))$, and $G(\beta) = colim_{\alpha \lt \beta} G(\alpha)$ for $\beta$ a limit ordinal. On morphisms $\alpha \lt \beta$,

\begin{itemize}%
\item $G(\emptyset \lt \beta)$ is the unique map $0 \to G(\beta)$;


\item For $\beta$ a limit ordinal, $G(\alpha \lt \beta)$ is a component of the cocone diagram that defines $G(\beta)$ as a colimit;


\item $G(\alpha + 1 \lt \beta + 1) = F(G(\alpha \lt \beta))$;


\item For $\alpha$ a limit ordinal, $G(\alpha \lt \beta + 1)$ is the unique map $colim_{\gamma \lt \alpha} G(\gamma) \to G(\beta +1$ corresponding to the cocone from the diagram $G| \colon \alpha \to C$ to $G(\beta+1)$.



\end{itemize}
By assumption, $colim G$ exists in $C$, and this colimit is preserved by $F$. (To be continued.)

\end{proof}
A typical application is where $C$ is a $\kappa$-accessible category and $F \colon C \to C$ is a $\kappa$-accessible functor. A concise statement is that accessible endofunctors on accessible categories with an initial object possess categorical fixed points (in fact, the fixed points form another accessible category with an initial object).

An arguably more elegant viewpoint on this is given in the following theorem and proof.

\begin{theorem}
\label{}\hypertarget{}{}
Suppose $C$ is [[locally presentable category|locally presentable]], i.e., [[accessible category|accessible]] and [[complete category|complete]]/[[cocomplete category|cocomplete]], and suppose $F \colon C \to C$ is an [[accessible functor]]. Then the category of $F$-[[algebra of an endofunctor|algebras]] is also locally presentable. In particular, there exists an initial $F$-algebra. Moreover, the category of fixed points, i.e., the category of $F$-algebras $X$ for which the structure $F X \to X$ is an isomorphism is also locally presentable (in particular, cocomplete and complete).

\end{theorem}
\begin{proof}
$Alg_F$ is an [[inserter]] construction, i.e., the data consisting of the evident 1-cell $U \colon Alg_F \to C$ and 2-cell $F \circ U \to U$ is universal among all such data in the 2-category $Cat$. Since $Acc$ is closed under 2-limits in $Cat$ such as inserters (see \hyperlink{MakkaiPare}{Makkai-Par\'e{}}, theorem 5.1.6), the category $Alg_F$ is accessible. It is also complete since $C$ is complete (being locally presentable) and the underlying functor $U \colon Alg_F \to F$ reflects limits. Since $Alg_F$ is accessible and complete, it is also cocomplete, hence contains an initial object.

Similarly, the category of fixed points $i \colon Fix(F) \to C$ is formed as an iso-inserter construction and is therefore accessible. If $D \colon J \to Fix(F)$ is a diagram of fixed points and $c \in Ob(C)$ is the colimit of $i \circ D$, then $F$ induces a functor (which we give the same name) $F\colon c \downarrow C \to c \downarrow C$, because for any object $c \to d$ in $c \downarrow C$, we have a [[cocone]] $i \circ D \cong F \circ i \circ D \to F(d)$, factoring uniquely through an arrow $c \to F(d)$. Since $c \downarrow C$ is a locally presentable category, the accessible functor $F$ acting on it has an initial algebra $(c \to c', (c \to F(c')) \to (c \to c'))$, as we argued before. This is the colimit of $D$ in $Fix(F)$, as is easily checked. Therefore $Fix(F)$ is cocomplete and accessible.

\end{proof}
Boundedness conditions, such as those given as hypotheses in the previous two theorems, are generally required to establish existence of categorical fixed points. The example of the covariant power-set functor on $Set$ shows that a naive generalization of the Knaster-Tarski theorem from complete lattices to complete/cocomplete categories is hopelessly false.

Paul Taylor has built an elegant theory of locating certain initial algebras inside final coalgebras, via his notion of well-founded coalgebras. This too can be ``categorified'' (to be continued).

\hypertarget{fixed_points_of_left_exact_idempotent_endofunctors}{}\subsubsection*{{Fixed points of left exact idempotent endofunctors}}\label{fixed_points_of_left_exact_idempotent_endofunctors}

\begin{theorem}
\label{}\hypertarget{}{}
Let $E$ be a topos, and let $F \colon E \to E$ be a left-exact idempotent \emph{functor}. Then the category of $F$-coalgebras $X$ whose structure maps $\theta \colon X \to F(X)$ are isomorphisms is a topos.

\end{theorem}
Todd: Here ``idempotent'' involves a coassociativity condition. To be related to structures over a modal operator, as at my web, or to diads a la Toby Kenney.

\hypertarget{domain_theory}{}\subsubsection*{{Domain theory}}\label{domain_theory}

\begin{itemize}%
\item Adjunctions and adjoint equivalences

\end{itemize}
\ldots{}

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

\begin{itemize}%
\item [[Lawvere's fixed point theorem]]


\item [[fixed point of an adjunction]] (which in particular restricts to a concept of fixed points of a [[Galois correspondence]])



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

\begin{itemize}%
\item [[Claudio Hermida]], [[Bart Jacobs]], \emph{Structural induction and coinduction in a fibrational setting}, Information and Computation 145 (1997), 107-152. (\href{http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.7400}{citeseer})


\item [[Michael Makkai]], [[Robert Paré]], \emph{Accessible Categories: The Foundations of Categorical Model Theory}, Contemporary Mathematics 104, AMS (1989).


\item Wikipedia, \emph{\href{https://en.wikipedia.org/wiki/Fixed_point_(mathematics%29}{Fixed point (mathematics)}}



\end{itemize}
A version of the Knaster-Tarski fixed-point theorem is proved in constructive (and even predicative) set theory in

\begin{itemize}%
\item Giovanni Curi, \emph{On Tarski's fixed point theorem}, Proc. Amer. Math. Soc. \textbf{143} (2015), 4439-4455 doi:\href{http://dx.doi.org/10.1090/proc/12569}{10.1090/proc/12569}

\end{itemize}
A relation to [[framed manifold|framed]] [[cobordism classes]] and fixed points:

\begin{itemize}%
\item Carlos Prieto, \emph{Fixed point theory and framed cobordism}, Topol. Methods Nonlinear Anal. Volume 21, Number 1 (2003), 155-169. (\href{https://projecteuclid.org/euclid.tmna/1475266278}{Euclid})

\end{itemize}
[[!redirects fixed points]]

[[!redirects fixed point of the endofunctor]] [[!redirects fixed points of the endofunctor]]

[[!redirects Knaster-Tarski theorem]]



\end{document}