We first recall some coalgebraic aspects of recursion theory, as set out by Paul Taylor in his book.
We assume throughout that is a category with pullbacks, and that is an endofunctor with the property that preserves pullback squares of the form
where is monic. This implies that preserves monos in particular and also intersections of subobjects.
We define -algebras and -coalgebras and morphisms of such in the usual way.
Let be a -coalgebra structure on . A subobject in is (-)inductive if in the pullback
the map factors through (note that is monic since preserves monos). Equivalently, that for every commutative square as above (not necessarily a pullback square), factors through . A coalgebra is well-founded if the only inductive subobject of is itself.
(Taylor) If is a well-founded -coalgebra and is an isomorphism, then is an initial algebra.
The proof may be found in section 6.3 of Taylor’s book Practical Foundations of Mathematics.
The pullback of an inductive subobject along a coalgebra map is an inductive subobject .
Let and be the coalgebra structures. Given a commutative square
we must show that the top arrow factors through . Since is formed by pulling back along , it suffices to produce a map that fits into a commutative square
Gluing together the commutative squares
and using the fact that is a coalgebra map, we may form a map from to the pullback of and :
and now using the fact that is an inductive subobject, the map factors as a map followed by . The map followed by gives us the desired .
If a coalgebra is well-founded, then so is the coalgebra .
We must prove that any inductive subobject is the entirety of . The map is a coalgebra map, so by lemma , the map formed by the pullback
is an inductive subobject. Since is well-founded, is an isomorphism. Applying to this pullback, we have a commutative square
but because is inductive, the map factors through . Since is an iso, is forced to be a monic retraction, and thus an iso itself, as was to be proved.
For the next lemma, assume the category is locally cartesian closed.
A small colimit of well-founded coalgebras (in the category of coalgebras) is again well-founded.
Notice that the underlying functor preserves and reflects colimits. Let be such a colimit, and let be an inductive subobject. The pullbacks along the coalgebra maps are again inductive subobjects, and thus isomorphisms since the are well-founded. We have since colimits are stable under pullback (by local cartesian closure), and the induced comparison map between colimits in is an isomorphism since the are. Thus is well-founded.
Suppose is well-powered, locally cartesian closed, and admits small coproducts and coequalizers of congruences. Suppose there exists a -fixpoint (e.g., a terminal -coalgebra). Then there exists an initial -algebra, and this is embedded in .
Under the colimit conditions on , we may form unions of subobjects, and so subobject lattices are small and small-cocomplete. By lemma , the union of all well-founded subcoalgebras of is again a well-founded coalgebra; it is thus the maximal well-founded subcoalgebra. We claim this is the initial -algebra.
Indeed, by theorem , it suffices to show that the coalgebra structure is an isomorphism. From the diagram
we see is monic. The map is also monic since preserves monos. From lemma , the subcoalgebra is well-founded. It therefore contains and is contained in the maximal , so that is an isomorphism, as desired.
For a locally cartesian closed category, and a morphism of , recall that the polynomial endofunctor is defined to be the composite
A -type is an initial algebra of a polynomial endofunctor .
Let be a well-powered infinitary -pretopos. Then has all -types.
In the first place, is complete. For that, it suffices to show it has all small products (since it is already finitely complete and thus has equalizers).
Let be a collection of objects of indexed over a set . Since has small coproducts by asumption, we have a map in ,
where , and where sends the summand to (the copy of ). Then
is the product, where is the unique map . Indeed, maps are in natural bijection with maps in (this equivalence holds by infinite extensivity), i.e., with an -indexed family of maps , as required.
Now let be a morphism of , and the associated polynomial endofunctor. Since is complete, we may form the limit of the countable chain
Moreover, preserves this limit because (a) this is a connected limit, and (b) the functors , , and all preserve connected limits. It follows from Adámek’s theorem that the limit , with coalgebra structure the isomorphism that obtains by the limit preservation by , is a terminal coalgebra.
It now follows from theorem that there is an initial algebra for . This completes the proof.