Terminal Coalgebras for Finitary Functors
Abstract
We present a result that implies that an endofunctor on a category has a terminal coalgebra obtainable as a countable limit of its terminal-coalgebra sequence. It holds for finitary endofunctors preserving nonempty binary intersections on locally finitely presentable categories, assuming that the posets of strong quotients and subobjects of every finitely presentable object satisfy the descending chain condition. This allows one to adapt finiteness arguments that were originally advanced by Worrell concerning terminal coalgebras for finitary set functors. Examples include the categories of sets, posets, vector spaces, graphs, and nominal sets. A similar argument is presented for the category of metric spaces (although it is not locally finitely presentable).
Keywords and phrases:
terminal coalgebra, countable iteration, descending chain conditionFunding:
Jiří Adámek: Supported by the grant No. 22-02964S of the Czech Grant Agency.Copyright and License:
2012 ACM Subject Classification:
Theory of computation Models of computation ; Theory of computation Logic and verificationEditors:
Corina Cîrstea and Alexander KnappSeries and Publisher:
Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 Introduction
Coalgebras capture various types of state-based systems in a uniform way by encapsulating the type of transitions as an endofunctor on a suitable base category. Coalgebras also come with a canonical behaviour domain given by the notion of a terminal coalgebra. So results on the existence and construction of terminal coalgebras for endofunctors are at the heart of the theory of universal coalgebra. The topic is treated in our monograph [5]. A well-known construction of the terminal coalgebra for an endofunctor was first presented by Adámek [2] (in dual form) and independently by Barr [11]. The idea is to iterate a given endofunctor on the unique morphism to obtain the following -chain
| (1.1) |
and then continue transfinitely. For each ordinal , we write for the th iterate. So we have
| (1.2) |
the connecting morphisms are as expected. In particular, for every ordinal , we have a morphism . If the transfinite chain converges in the sense that this morphism is an isomorphism for some , then its inverse is the structure of a terminal coalgebra for [2, dual of second prop.]. This happens for a limit ordinal iff preserves the limit . However, in general, this transfinite chain does not converge at all (e.g. for the power-set functor), and moreover, if it does converge, then the number of iterations needed to obtain the terminal coalgebra can be arbitrarily large. For example, the set functor , which assigns to a set the set of all subsets of cardinality smaller than , requires iterations [4].
A famous result by Worrell [20] states that a finitary set functor needs at most iterations to converge. We generalize this result to other base categories by isolating properties of the category of sets and endofunctors on it that entail it:
-
1.
The descending chain condition (DCC), which states that for every finitely presentable object (a category-theoretic generalization of the notion of a finite set) every strictly decreasing chain of subobjects or strong quotient objects is finite.
-
2.
The preservation of nonempty binary intersections, that is, pullbacks of two monomorphisms such that the domain is not a strict initial object (cf. ˜2.5).
The first condition is inspired by the descending chain condition in algebra and more specifically by the Noetherian condition introduced by Urbat and Schröder [19]. Regarding the second one, it was shown by Trnková that every set functor preserves nonempty binary intersections [18]. In addition, every finitary set functor preserves all nonempty intersections [5, Thm. 4.4.3].
Our main result (Theorem 5.1) holds for locally finitely presentable categories satisfying the DCC: every finitary endofunctor preserving nonempty binary intersections has a terminal coalgebra obtained in steps. We also show that the DCC is satisfied by a large number of categories of interest, such as sets, posets, graphs, vector spaces, boolean algebras, and nominal sets.
The category of metric spaces and non-expanding maps is not locally finitely presentable, and so our main result is not applicable to it. Nevertheless, we provide in Theorem 6.5 a sufficient condition for an endofunctor to have a terminal coalgebra obtained in steps: the endofunctor should be finitary and preserve nonempty binary intersections (as in our Theorem 5.1), and it also should preserve isometric embeddings.
Related work.
As we have mentioned above, our DCC condition was inspired by Urbat and Schröder [19]. However, the results here are disjoint from the ones in op. cit.
The most closely related paper to this one is our previous work [1]. That paper also contains results on endofunctors having terminal coalgebras in steps. But those results pertain to endofunctors belonging to one of several inductively defined classes. For example, for sets it studies the Kripke polynomial functors. This is the smallest class of endofunctors containing the constant functors and the finite power-set functor, and closed under products, coproducts, and composition. We have shown [1, Thm. 3.5] that every Kripke polynomial set functor has a terminal coalgebra in steps. Similarly, we have shown [1, Thm. 5.9] a result for the category of metric spaces and non-expanding maps, replacing the finite power-set functor with the Hausdorff functor: this assigns to a space the set of its compact subsets, using a well-known metric (cf. Example 6.6). Again, every Hausdorff polynomial functor has a terminal coalgebra in steps. However, since the Hausdorff functor is not finitary on the category of all metric spaces, these results cannot be inferred from Theorem 5.1. In contrast, the results in this paper apply to categories not mentioned in op. cit: see Example 4.3 and Proposition 4.4. Both the theory and the specific results that follow are new.
2 Preliminaries
We review a few preliminary points. We assume that readers are familiar with algebras and coalgebras for an endofunctor, as well as with locally finitely presentable categories and (strong-epi, mono)-factorizations.
First we set up some notation. We write for monomorphisms and for strong epimorphisms. Given an endofunctor , we write for its terminal coalgebra, if it exists.
Regarding the -chain in (1.1), let () be the limit cone. We obtain a unique morphism such that for all , we have
| (2.1) |
This is the connecting morphism from to in the transfinite chain (1.2).
If preserves the limit , then is an isomorphism (and conversely). Therefore, its inverse yields the terminal coalgebra [2, dual of second prop.]; shortly . Then we say that the terminal coalgebra is obtained in steps.
This technique of finitary iteration is the most basic and prominent construction of terminal coalgebras. However, it does not apply to the finite power-set functor . For that functor [3, Ex. 3(b)]. However, a modification of finitary iteration does apply, as shown by Worrell [20, Th. 11]. One needs a second infinite iteration, iterating on the morphism rather than on , obtaining the -chain
| (2.2) |
Its limit is denoted by
| (2.3) |
Worrell proved that when is a finitary set functor, it preserves this limit. Therefore, we obtain that carries a terminal coalgebra; shortly , and we say that the terminal coalgebra is obtained in steps.
Limits of -chains.
We recall the following characterization of limits of -chains.
Remark 2.1.
Consider an -chain
| (2.4) |
In , , , and , the limit is carried by the set of all sequences , that are compatible: for every . The limit projections are the functions defined by .
-
1.
In , the topology on has as a base the sets , for open in .
-
2.
In , the metric on is defined by .
-
3.
In , the limit is a subspace of .
Locally finitely presentable categories.
We continue with a terse review of locally finitely presentable categories; see [7] for background. A diagram is directed if its domain is a directed poset (i.e. nonempty and such that every pair of elements has an upper bound). A functor is finitary if it preserves directed colimits. An object of a category is finitely presentable if its hom-functor preserves directed colimits. A category is locally finitely presentable (lfp, for short) if it is cocomplete and has a set of finitely presentable objects such that every object is a directed colimit of objects from that set.
Example 2.2.
We list a number of examples of lfp categories.
-
1.
The category of all sets and of pointed sets; the finitely presentable objects are precisely the finite sets.
-
2.
The category of graph and their homomorphisms as well as of posets and monotone maps; finitely presentable objects are precisely the finite graphs or posets, respectively.
-
3.
Every finitary variety, that is, any category of algebras specified by operations of finite arity and equations; the finitely presentable objects are precisely those algebras which have a presentation by finitely many generators and relations (in the usual sense of universal algebra). The following three items are instances of this one.
-
4.
The category of Boolean algebras and their homomorphisms; the finitely presentable objects are precisely the finite Boolean algebras. The same holds for every locally finite variety, e.g. join-semilattices or distributive lattices.
-
5.
The category - of sets with an action of a monoid , and equivariant maps; the finitely presentable objects are precisely the orbit-finite -sets (i.e. those having finitely many orbits).
-
6.
The category of vector spaces over a field and linear maps; the finitely presentable objects are precisely the finite-dimensional vector spaces.
More generally, given a semiring , the category of all -semimodules is lfp.
-
7.
The category of nominal sets and equivariant maps; the finitely presentable objects are precisely the orbit-finite nominal sets.
-
8.
A poset, considered as a category, is lfp iff it is an algebraic lattice: a complete lattice in which every element is a join of compact ones. (An element is compact if for every subset , implies that for some finite .)
Remark 2.3.
We next recall definitions concerning subobjects.
-
1.
For a fixed object , the monomorphisms with codomain have a natural preorder: given and , we say that iff for some monomorphism . A subobject of is an equivalence class of monomorphisms under the induced equivalence relation. We write representatives to denote subobjects.
-
2.
A subobject (represented by) is finitely presentable if its domain is a finitely presentable object.
Remark 2.4.
We recall properties of an lfp category used in the proof of Theorem 5.1:
-
1.
is complete [7, Rem 1.56] (and cocomplete by definition).
-
2.
has a -factorization system [7, Rem. 1.62].
-
3.
Every morphism from a finitely presentable object to a directed colimit factorizes through one of the colimit maps.
-
4.
Every object is the colimit of the canonical directed diagram of all of its finitely presentable subobjects [9, Lemma 3.1]. Moreover, given any finitely presentable subobject , it is easy to see that the object is the colimit of the diagram of all its finitely presentable subobjects such that .
-
5.
The collection of all finitely presentable objects, up to isomorphism, is a set. It is a generator of ; it follows that a morphism is monic iff for every pair of morphisms with a finitely presentable domain , we have that implies .
Definition 2.5 ([14]).
An initial object is strict if every morphism with codomain is an isomorphism. A monomorphism is empty if its domain is a strict initial object; it is nonempty if it is not empty.
An intersection (a wide pullback of monomorphisms) is empty if its domain is a strict initial object, that is, the limit cone is formed by empty monomorphisms; the intersection is nonempty if it is not empty.111There is no condition on the (non-)emptiness of the family of monomorphisms which is intersected here.
An endofunctor preserves nonempty intersections if takes a nonempty intersection to a (not necessarily nonempty) wide pullback.
Remark 2.6.
Every endofunctor preserving nonempty binary intersections preserves nonempty monomorphisms. This holds since a morphism is monic iff the pullback along itself is formed by a pair of identity morphisms.
Example 2.7.
-
1.
In , the initial object is strict. A nonempty intersection is an intersection of subsets having a common element. Trnková [18] proved that every set functor preserves nonempty binary intersections.
It follows that every finitary set functor preserves nonempty intersections [5, Thm. 4.4.3].
-
2.
The initial object in is not strict. Thus all subobjects are nonempty. Every endofunctor on preserves finite intersections [9, Ex. 4.3].
-
3.
In and nonempty intersections are, as in , intersections of subobjects having a common element.
Remark 2.8.
-
1.
Unlike on and , on most everyday categories finitary endofunctors may fail to preserve nonempty intersections. For example, consider the category of graphs. We exhibit a finitary endofunctor not preserving nonempty binary intersections. We denote by the terminal graph, a single loop, and by a single node which has no loop. Let be the extension of the identity functor with if has no loop, else . The graph has subobjects and with the nonempty intersection , but does not preserve it.
-
2.
The colection of all finitary endofunctors on lfp categories preserving non-empty intersections is, nevertheless, large. It contains constant functors, finite power-functors (), and it is closed under finite products and composites. It is also closed under coproducts provided that they commute with pullbacks (which holds in categories such as , , and ).
-
3.
On the category , the abstraction functor (cf. [16, Thm. 4.12]) and the finite power-set functor preserve intersections.
Remark 2.9.
Let be an object of a locally finitely presentable category.
- 1.
- 2.
-
3.
If for some ordinal the object is strictly initial, then is obtained in steps by default. Indeed, recall the transfinite chain from (1.2). The connecting morphism from to is an isomorphism, whence .
3 A Sufficient Condition for
We first present a simple result that holds for all endofunctors of all categories. It will then be used twice in the sequel. In it, we recall the notation from (2.2). Following this, we introduce DCC-categories and prove a generalization of Worrell’s result for them (Theorem 5.1).
Proposition 3.1.
Let be an endofunctor such that the following hold:
-
1.
The limit of the -chain (2.3) exists, and the morphism is monic.
-
2.
preserves monomorphisms.
-
3.
has and preserves nonempty intersections of -chains of monomorphisms.
Then the limit is preserved by ; therefore .
Proof.
4 DCC-Categories
We introduce lfp categories satisfying a descending chain condition, shortly DCC-categories. Examples are presented and the related condition of graduatedness is discussed. We prove that -limits in DCC-categories are finitary. In Section 5, we prove that for all finitary endofunctors on DCC-categories preserving nonempty binary intersections.
We have already seen the order of subobjects of a fixed object (cf. ˜2.3). (This corresponds to the preordered collection in the slice category .) Dually, we use the order on strong quotients, represented by strong epimorphisms : given , we have iff for some . This corresponds to the preordered collection in the slice category . In the literature, the opposite order on quotients is also used. For example, Urbat and Schröder [19], whose work has inspired our next definition, use that opposite order. So readers of papers in this area should be careful.
Definition 4.1.
A locally finitely presentable category is a DCC-category if every finitely presentable object satisfies the following descending chain condition: Every strictly descending chain of subobjects or strong quotients of is finite.
Our notion is also related to the stronger notion of graduatedness [9]: an lfp category is graduated if to every every finitely presentable object a natural number is assigned, called the grade of , such that every (proper) subobject and every (proper) strong quotient of is finitely presentable, and with a grade at most (smaller than, respectively) the grade of .
Clearly, every graduated lfp category is DCC. But not conversely:
Example 4.2.
Here is a DCC-category which is not graduated. Consider the poset with top element , bottom element , and elements () ordered as follows:
iff and .
This is a complete lattice with all elements compact (i.e. finitely presentable). Thus, it is an lfp category. The DCC condition is obvious. But cannot have a (finite) grade: its grade would have to be at least , due to , and at least due to , and so on.
Example 4.3 ([9]).
The following categories are graduated (cf. Example 2.2): , , , for a finite semiring , - for a finite monoid , , , and . In the first four categories, the grade is the cardinality of the underlying set. The grade of a graph having vertices and edges is , and the grade of a vector space is its dimension. Finally, the grade of a poset is desribed as follows. Let be the poset of pairs of natural numbers ordered lexicographically, and let be the subposet of pairs with . There is an order-isomorphism . The grade of a poset with elements which contains comparable pairs is .
An important example of a graduated category not included in op. cit. is , the category of nominal sets and equivariant maps. We present a proof based on ideas by Urbat and Schröder [19]. We assume that readers are familiar with basic notions (like orbit and support) from the theory of nominal sets, see Pitts [16].
Proposition 4.4.
The category is a graduated lfp category.
Proof.
Our proof proceeds in several steps.
-
1.
The finitely presentable objects of are precisely the orbit-finite nominal sets [15, Prop. 2.3.7]. By equivariance, a subobject of a nominal set is given by a number of orbits. So the DCC on subobjects of an orbit-finite nominal set clearly holds.
-
2.
For the descending chain condition for strong quotients, first recall that in all quotients are strong, and they are represented by the surjective equivariant maps. We first consider single-orbit nominal sets and recall that the supports of elements of an orbit all have the same cardinality. We also recall the standard fact [16, Exercise 5.1] that every single-orbit nominal set whose elements have supports of cardinality (this is the degree of ) is a quotient of the nominal set , where denotes the set of names (or atoms). Now observe that a quotient of having degree is determined by a subgroup of the symmetric group . More specifically, the quotient determined by identifies and for every and every . Conversely, given a quotient we obtain as consisting of all those for which identifies the above two -tuples for every in . We conclude that every strictly descending chain of quotients of all having degree corresponds to a strictly descending chain of subgroups of ; the same holds of course for every single-orbit nominal set of degree . Such a chain must be finite, since so is . In fact, more can be said: For , such a chain of subgroups of has length at most [10] (and for , is trivial, of course, so chains of subgroups have length 0).
-
3.
For general orbit-finite sets we now conclude that for every proper strong quotient of a nominal set one of the following three numbers strictly decreases while the other two do not increase: the number of orbits, the degree of some orbit of , or the maximum length of the above chain of subgroups of for some orbit. Thus, is DCC.
-
4.
To see that is even graduated, observe that we can assign to each orbit-finite nominal set the sum of the three numbers mentioned in point 3 above. It is then clear that for every proper nominal subset or proper quotient of the grade is strictly smaller.
Example 4.5.
The category of abelian groups is not DCC. The group of integers is finitely presentable, but it has the following descending sequence of proper subgroups
Definition 4.6.
A category has finitary -limits if for every limit () of an -chain and every finitely presentable subobject , some morphism is monic.
Proposition 4.7.
Every DCC-category has finitary -limits.
Proof.
Let be a DCC-category. Let be a limit cone of an -chain with connecting morphisms . Given a finitely presentable object and a monomorphism , factorize as a strong epimorphism followed by a monomorphism (˜2.4.2). We obtain a subchain of with connecting maps given by the diagonal fill-ins, as shown below:
| (4.1) |
Notice that is a strong epimorphism, since so is . We thus have a descending chain of strong quotients of the finitely presentable object : . By the DCC condition, there is some such that for , is an isomorphism. For , let be the composites recursively defined by . Thus, for every , the triangle below commutes, where the lower part commutes by (4.1):
| (4.2) |
Let be the chain . This is a shortening of our original -chain , and so its limit is (. The commutativity of all diagrams (4.2) shows that we have a cone of . Thus, there exists such that
Consider the following diagram for :
| (4.3) |
The square commutes, and we now prove that so does the outside. We show that for all and all ,
| (4.4) |
We argue by induction on . For , this holds using and the factorization . Assume (4.4) for . Fix such that . Then
The induction completed, we take in (4.4) to see the commutativity of the outside of (4.3) for all . Since the limit cone is collectively monic, the triangle in (4.3) commutes: . As is monic, so is . Thus, is also monic.
5 Terminal Coalgebras in Steps
We are ready to state and prove the main theorem of this paper.
Theorem 5.1.
Let be a DCC-category. Every finitary endofunctor which preserves nonempty binary intersections has a terminal coalgebra obtained in steps.
Proof.
We will apply Proposition 3.1. Due to ˜2.9.3 we can assume without loss of generality that is not strictly initial for any .
-
1.
We first show that the canonical morphism is monic. Consider a parallel pair such that . We prove that . By ˜2.4.5, we may assume that is a finitely presentable object. Using that can be assumed not to be strictly initial and ˜2.9.2, we may express as a directed colimit of nonempty finitely presentable subobjects, say (). Since is finitary, is also a directed colimit. Hence, and factorize through for some . We denote the factorizing morphisms by and , respectively. It is sufficient to show that they are equal. To this end consider the following diagram:
(5.1) The limit is finitary (Proposition 4.7). Thus, there is some so that is monic, and this monomorphism is nonempty. Since preserves nonempty binary intersections, it preserves nonempty monomorphisms (˜2.6). Hence, the following morphism is monic:
It is enough to show that merges and . The triangle on the right in (5.1) commutes. Thus we obtain
Using that merges and , we see that merges and :
Since is monic, we have whence , as desired.
-
2.
Next, we prove that preserves nonempty intersections of -chains of subobjects. Consider such a chain , and let its limit cone be , where is not strictly initial. It follows that neither is any of the . Take a cone
Our task is to find a morphism such that for all . (This is unique: all maps are nonempty monic, whence all are monic.)
Using ˜2.4.4, we can assume, without loss of generality, that is finitely presentable: for a general object , express it as a colimit of finitely presentable subobjects , and use the result which we prove for each .
Choose a nonempty, finitely presentable subobject (˜2.9.1). Note that this gives nonempty, finitely presentable subobjects
which, moreover, form a cone: for every .
By recursion on we define a subchain of given by intersections
together with a cone such that and a cone such that ; this shows that all the intersections are nonempty.
To define and , express as a directed colimit of all its finitely presentable subobjects that contain (˜2.4.4). Then use that preserves this colimit: for the morphism we may find a subobject containing such that factorizes through via some , say:
Since contains the subobject , we have a monomorphism such that .
In the induction step we are given , , , and . Form the intersection of and to obtain , , and as shown in the left-hand square below:
The outside commutes by induction hypothesis: . Hence, we obtain the monomorphism as indicated such that the upper part and right-hand triangle commute, as desired. Since is not strictly initial, neither is , whence the intersection of and is nonempty.
So by hypothesis, preserves the above pullback. Since the square below commutes
there is a unique morphism such that
For all , we form the composite morphism
We obtain a descending chain of subobjects of the finitely presentable object . Since is DCC, there is some such that represents the same subobject as for every . Hence, the morphism is an isomorphism.
The shortened -chain has the limit cone . The morphisms
form a cone: we see that from the commutativity of the diagram below:
So there is a unique morphism such that for .
The desired morphism is
In order to verify that , it is sufficient to show this for ; it then follows also for all , since the and form cocones:
Now observe first that since form a cone of , we have
By definition of , we also have . Therefore for all , we obtain
This extends to all , the argument is as above.
Having checked all the conditions in Proposition 3.1, we are done.
Corollary 5.2.
Every finitary endofunctor on or has a terminal coalgebra obtained in steps.
Indeed, every set functor preserves nonempty binary intersections [18, Prop. 2.1], and every endofunctors on preserves finite intersections [9, Ex. 4.3].
The following example demonstrates that without extra conditions there is no uniform bound on the convergence of the terminal-coalgebra chain for finitary functors on locally finitely presentable categories.
Example 5.3.
For every ordinal , we present a locally finitely presentable category and a finitary endofunctor which needs steps for its terminal-coalgebra chain to converge. The category is the complete lattice of all subsets of (considered as the set of all ordinals ). The functor is the monotone map preserving the empty set, and on all other sets ,
This is monotone, since given , if contains , then . The only coalgebra for is empty; thus .
The functor is finitary because for every directed union of nonempty subsets, lies in some . Since the union is directed, is also a union of all where . Then is contained in all . It follows that , thus for all . Consequently,
The terminal-coalgebra chain is given by and for all , which is easy to prove by transfinite induction. Thus, that chain takes precisely steps to converge to the empty set, the terminal coalgebra for .
6 Finitary Endofunctors on Metric Spaces
We denote by the category of (extended) metric spaces, where “extended” means that we might have . The morphisms are non-expanding maps: the functions where holds for every pair . (Note that this class of morphisms is smaller than the class of continuous functions between metric spaces.)
We have seen in Theorem 5.1 a sufficient condition for an endofunctor to have a terminal coalgebra in steps. This result does not apply to , since that category is not locally finitely presentable; in fact, the empty space is the only finitely presentable object [8, Rem. 2.7]. However, for finitary endofunctors on , we are able to prove an analogous result. To do this, we work with finite spaces in lieu of finitely presentable objects. Recall that a subspace of a metric space is a subset equipped with the metric inherited from . Moreover, note that there is a bijective correspondence between subobjects of represented by isometric embeddings and subspaces of : indeed, for every subspace , the inclusion is an isometric embedding, and conversely, if is any isometric embedding, then it is monic and represents the same subobject of as the inclusion map of the subspace on the image of . We need the following fact.
Lemma 6.1.
Every metric space is a directed colimit of the diagram of all its finite subspaces.
Proof.
Fix a metric space . Let be a cocone of the diagram of all finite subspaces of . Then there is a unique map which restricts to for each finite subspace: . This map is non-expanding: given elements , let be the subspace of given by . Since is non-expanding, the distance of and in is at most equal to the distance of and in , that is, in .
Remark 6.2.
Proposition 6.3.
The category has finitary -limits in the following sense: for every limit () of an -chain and every finite subobject , some morphism is monic.
Proof.
This follows since has finitary -limits (Proposition 4.7) because the forgetful functor into (1) preserves limits and (2) preserves and reflects monomorphisms.
Lemma 6.4.
Let be a finitary endofunctor on preserving isometric embeddings. For every non-expanding map where is finite, there exists a factorization through for some finite subspace :
Proof.
-
1.
Given a directed diagram in of metric spaces () and subspace embeddings (), the colimit is the union with the metric inherited from the subspaces: for , the distance in is their distance in for any such that .
An analogous statement holds for a directed diagram whose connecting morphisms are isometric embeddings.
-
2.
Given , let be the directed diagram of all finite subspaces of and all inclusion maps. Its colimit is , using Item 1. Since is finitary, is the colimit of , which is a directed diagram of isometric embeddings. The image is a finite subspace of . By Item 1, there exists a finite subspace such that the colimit injection of satisfies . Let be the unique map such that . Then is non-expanding because so is and because is an isometric embedding.
The following theorem has a proof analogous to that of Theorem 5.1. Recall that a functor preserving nonempty binary intersections also preserves nonempty monomorphisms (˜2.6). This time, we need an extra condition that isometric embeddings are preserved:
Theorem 6.5.
Let be a finitary endofunctor on preserving nonempty binary intersections and isometric embeddings. Then it has a terminal coalgebra obtained in steps.
Proof.
We again use Proposition 3.1. By ˜2.9.3, we may assume without loss of generality that all , are nonempty.
-
1.
The morphism is monic: given a non-empty space and such that , we prove that . By Lemma 6.1, we may assume that is finite. Thus, there exists a nonempty finite subspace such that both and factorize through : we have morphisms such that and . As in Item 1 of the proof of Theorem 5.1, we derive . Since is monic (because preserves nonempty binary intersections), this proves .
-
2.
We prove that preserves nonempty limits of -chains of monomorphisms
Let be the limit cone. Given a cone (), we only need to find a morphism such that ().
Using Lemma 6.1, we may assume that is finite. We define a subchain of carried by nonempty binary subspaces , together with cones and such that and . We use recursion analogous to that in Item 2 of the proof of Theorem 5.1. In order to define , , and use Lemma 6.4: there is a nonempty binary subspace and a morphism such that . The induction step and the rest of the proof is as in Theorem 5.1.
Example 6.6.
The finite power-set functor has a lifting that maps a metric space to the space of all finite subsets of equipped with the Hausdorff distance222The definition goes back to Pompeiu [17] and was popularized by Hausdorff [12, p. 293].
where . In particular for nonempty finite sets . For a non-expanding map we have .
This functor is clearly finitary; in fact, it is the free algebra monad for the variety of quantitative semilattices [13, Sec. 9].
We now show that it preserves isometric embeddings. Indeed, if is the inclusion of a subspace, then preserves distances: given finite subsets and of the metric space , then for every , we have that the distance is the same in and . By symmetry, the Hausdorff distance of and is also the same in and in .
Finally, preserves nonempty binary intersections because it is a lifting of a set functor and since intersections of metric spaces are formed on the level of sets.
Corollary 6.7.
The lifted functor has a terminal coalgebra .
7 Conclusions and Future Work
This paper gives a sufficient condition for the terminal coalgebra for an endofunctor to be obtained in steps of the well-known iterative construction. This generalizes Worrell’s theorem that states that finitary endofunctors on have that property. Our generalization concerns DCC-categories; examples include sets, vector spaces, posets, nominal sets, and many others. Finitary endofunctors preserving nonempty binary intersections are proved to have terminal coalgebras in steps.
The category of abelian groups is an example of an lfp category which is not DCC. We leave as an open problem the question whether every finitary endofunctor on preserving nonempty binary intersections has a terminal coalgebra obtained in steps.
We have also seen that finitary endofunctors on the category of (extended) metric spaces have terminal coalgebras obtained in steps, provided that they preserve nonempty binary intersections and isometric embeddings. We also leave as an open problem the question whether every finitary endofunctor on preserving nonempty intersections (but not necessarily isometric embeddings) has a terminal coalgebra obtained in steps.
We have seen that that for finitary endofunctors on or no extra assumption is needed: is always obtained in steps. It is interesting to ask about other DCC categories with this property; we currently have no example of a finitary endofunctor on a DCC category that does not have a terminal coalgebra obtained in steps.
Worrell’s result holds, more generally, for -accessible set functors (i.e. those preserving -directed colimits): they have a terminal coalgebra obtained in steps. An appropriate generalization of DCC categories in which this result holds is also an item for future work.
References
- [1] Jirí Adámek, Stefan Milius, and Lawrence S. Moss. On Kripke, Vietoris and Hausdorff polynomial functors. In Paolo Baldan and Valeria de Paiva, editors, 10th Conference on Algebra and Coalgebra in Computer Science, CALCO 2023, June 19-21, 2023, Indiana University Bloomington, IN, USA, volume 270 of LIPIcs, pages 21:1–21:20. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
- [2] Jiří Adámek. Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolin., 15:589–602, 1974.
- [3] Jiří Adámek and Vaclav Koubek. On the greatest fixed point of a set functor. Theoret. Comput. Sci, 150:57–75, 1995. doi:10.1016/0304-3975(95)00011-K.
- [4] Jiří Adámek, Paul B. Levy, Stefan Milius, Lawrence S. Moss, and Lurdes Sousa. On final coalgebras of power-set functors and saturated trees. Appl. Categ. Structures, 23(4):609–641, August 2015. Available online; http://dx.doi.org/10.1007/s10485-014-9372-9.
- [5] Jiří Adámek, Stefan Milius, and Lawrence S. Moss. Initial Algebras and Terminal Coalgebras: the Theory of Fixed Points of Functors. Cambridge University Press, 2025.
- [6] Jiří Adámek and Jan Reitermann. Banach’s fixed-point theorem as a base for data-type equations. Appl. Categ. Structures, 2:77–90, 1994. doi:10.1007/BF00878504.
- [7] Jiří Adámek and Jiří Rosický. Locally Presentable and Accessible Categories. Cambridge University Press, 1994.
- [8] Jiří Adámek and Jiří Rosický. Approximate injectivity and smallness in metric-enriched categories. J. Pure Appl. Algebra, 226(6), 2022. Article 106974.
- [9] Jiří Adámek and Lurdes Sousa. A finitary adjoint functor theorem. Theory Appl. Categories, 41:1919–1936, 2024.
- [10] László Babai. On the length of subgroup chains in the symmetric group. Comm. Alg., 14(9):1729–1736, 1986. doi:10.1080/00927878608823393.
-
[11]
Michael Barr.
Terminal coalgebras in well-founded set theory.
Theoret. Comput. Sci., 114(2):
299–315, 1993. doi:10.1016/0304-3975(93)90076-6. - [12] Felix Hausdorff. Grundzüge der Mengenlehre. Veit & Comp., Leipzig, 1914.
- [13] Radu Mardare, Prakash Panangaden, and Gordon D. Plotkin. Quantitative algebraic reasoning. In Martin Grohe, Eric Koskinen, and Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’16, New York, NY, USA, July 5-8, 2016, pages 700–709. ACM, 2016. doi:10.1145/2933575.2934518.
- [14] Stefan Milius, Dirk Pattinson, and Thorsten Wißmann. A new foundation for finitary corecursion and iterative algebras. Inform. and Comput., 271, 2020. Article 104456. doi:10.1016/J.IC.2019.104456.
- [15] Daniela Petrişan. Investigations into Algebra and Topology over Nominal Sets. PhD thesis, University of Leicester, 2011.
- [16] Andrew M. Pitts. Nominal Sets: Names and Symmetry in Computer Science, volume 57 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2013.
- [17] Dimitrie Pompeiu. Sur la continuité des fonctions de variables complexes. Annales de la Faculté des Sciences de la Université de Toulouse pour les Sciences Mathématiques et les Sciences Physiques, 2ième Série, 7(3):265–315, 1905.
- [18] Věra Trnková. Some properties of set functors. Comment. Math. Univ. Carolin., 10:323–352, 1969.
- [19] Henning Urbat and Lutz Schröder. Automata learning: An algebraic approach. In Proc. Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 900–914. IEEE Computer Society, 2020. doi:10.1145/3373718.3394775.
- [20] James Worrell. On the final sequence of a finitary set functor. Theoret. Comput. Sci., 338:184–199, 2005. doi:10.1016/J.TCS.2004.12.009.
