Abstract 1 Introduction 2 Preliminaries 3 A Sufficient Condition for 𝝂𝑭=𝑽𝝎+𝝎 4 DCC-Categories 5 Terminal Coalgebras in 𝝎+𝝎 Steps 6 Finitary Endofunctors on Metric Spaces 7 Conclusions and Future Work References

Terminal Coalgebras for Finitary Functors

Jiří Adámek ORCID Czech Technical University in Prague, Czech Republic
Technical University Brauschweig, Germany
Stefan Milius ORCID Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany Lawrence S. Moss ORCID Indiana University, Bloomington, IN, USA
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 condition
Funding:
Jiří Adámek: Supported by the grant No. 22-02964S of the Czech Grant Agency.
Stefan Milius: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number 470467389.
Lawrence S. Moss: Supported by grant #586136 from the Simons Foundation.
Copyright and License:
[Uncaptioned image] © Jiří Adámek, Stefan Milius, and Lawrence S. Moss; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Theory of computation Models of computation
; Theory of computation Logic and verification
Editors:
Corina Cîrstea and Alexander Knapp

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 F on the unique morphism F11 to obtain the following ω𝗈𝗉-chain

1!F1F!FF1FF!FFF1FFF! (1.1)

and then continue transfinitely. For each ordinal i, we write Vi for the ith iterate. So we have

V0=1,Vi+1=FVi,and Vi=limj<iVj when i is a limit ordinal; (1.2)

the connecting morphisms are as expected. In particular, for every ordinal i, we have a morphism Vi+1Vi. If the transfinite chain converges in the sense that this morphism is an isomorphism for some i, then its inverse is the structure of a terminal coalgebra for F [2, dual of second prop.]. This happens for a limit ordinal i iff F preserves the limit Vi. 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. 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. 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 d¯ (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.

A slightly stronger condition than our DCC was introduced in previous work [9]. The relationship of the two condition is dicussed in Section 4.

Another related result concerns the category of complete metric spaces: locally contracting endofunctors F on this category satisfying F have a terminal coalgebra obtained in ω steps [6] (see also [5, Cor. 5.2.18]). Moreover, this is then also an initial algebra.

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 SX for monomorphisms and XE for strong epimorphisms. Given an endofunctor F, we write νF for its terminal coalgebra, if it exists.

Regarding the ω𝗈𝗉-chain in (1.1), let n:VωFn1 (n<ω) be the limit cone. We obtain a unique morphism m:FVωVω such that for all nω𝗈𝗉, we have

(2.1)

This is the connecting morphism from Vω+1=FVω to Vω in the transfinite chain (1.2).

If F preserves the limit Vω, then m is an isomorphism (and conversely). Therefore, its inverse yields the terminal coalgebra m1:VωFVω [2, dual of second prop.]; shortly νF=Vω. 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 FVω≇Vω [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 F on the morphism m:FVωVω rather than on !:F11, obtaining the ω𝗈𝗉-chain

Vω𝑚Vω+1FmVω+2FFm. (2.2)

Its limit is denoted by

Vω+ω=limn<ωVω+n. (2.3)

Worrell proved that when F is a finitary set functor, it preserves this limit. Therefore, we obtain that Vω+ω carries a terminal coalgebra; shortly νF=Vω+ω, 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

X0f0X1f1X2f2. (2.4)

In 𝖲𝖾𝗍, 𝖳𝗈𝗉, 𝖬𝖾𝗍, and K-𝖵𝖾𝖼, the limit L is carried by the set of all sequences (xn)n<ω, xnXn that are compatible: fn(xn+1)=xn for every n. The limit projections are the functions n:LXn defined by n((xi))=xn.

  1. 1.

    In 𝖳𝗈𝗉, the topology on L has as a base the sets n1(U), for U open in Xn.

  2. 2.

    In 𝖬𝖾𝗍, the metric on L is defined by d((xn),(yn))=supn<ωd(xn,yn).

  3. 3.

    In K-𝖵𝖾𝖼, the limit L is a subspace of ΠiXi.

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 A of a category 𝒜 is finitely presentable if its hom-functor 𝒜(A,):𝒜𝖲𝖾𝗍 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. 1.

    The category 𝖲𝖾𝗍 of all sets and 𝖲𝖾𝗍𝗉 of pointed sets; the finitely presentable objects are precisely the finite sets.

  2. 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. 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. 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. 5.

    The category M-𝖲𝖾𝗍 of sets with an action of a monoid M, and equivariant maps; the finitely presentable objects are precisely the orbit-finite M-sets (i.e. those having finitely many orbits).

  6. 6.

    The category K-𝖵𝖾𝖼 of vector spaces over a field K 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. 7.

    The category 𝖭𝗈𝗆 of nominal sets and equivariant maps; the finitely presentable objects are precisely the orbit-finite nominal sets.

  8. 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 x is compact if for every subset S, xS implies that xS for some finite SS.)

Remark 2.3.

We next recall definitions concerning subobjects.

  1. 1.

    For a fixed object A, the monomorphisms with codomain A have a natural preorder: given c:CA and c:CA, we say that cc iff c=cm for some monomorphism m:CC. A subobject of A is an equivalence class of monomorphisms under the induced equivalence relation. We write representatives to denote subobjects.

  2. 2.

    A subobject (represented by) c:CA is finitely presentable if its domain C is a finitely presentable object.

Remark 2.4.

We recall properties of an lfp category 𝒜 used in the proof of Theorem 5.1:

  1. 1.

    𝒜 is complete [7, Rem 1.56] (and cocomplete by definition).

  2. 2.

    𝒜 has a (strong-epi,mono)-factorization system [7, Rem. 1.62].

  3. 3.

    Every morphism from a finitely presentable object to a directed colimit factorizes through one of the colimit maps.

  4. 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 c:CA, it is easy to see that the object A is the colimit of the diagram of all its finitely presentable subobjects s:SA such that cs.

  5. 5.

    The collection of all finitely presentable objects, up to isomorphism, is a set. It is a generator of 𝒜; it follows that a morphism m:XY is monic iff for every pair u,v:UX of morphisms with a finitely presentable domain U, we have that mu=mv implies u=v.

Definition 2.5 ([14]).

An initial object 0 is strict if every morphism with codomain 0 is an isomorphism. A monomorphism AB 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 F:𝒜𝒜 preserves nonempty intersections if F 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. 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. 2.

    The initial object {0} in K-𝖵𝖾𝖼 is not strict. Thus all subobjects are nonempty. Every endofunctor on K-𝖵𝖾𝖼 preserves finite intersections [9, Ex. 4.3].

  3. 3.

    In 𝖦𝗋𝖺 and 𝖯𝗈𝗌 nonempty intersections are, as in 𝖲𝖾𝗍, intersections of subobjects having a common element.

Remark 2.8.
  1. 1.

    Unlike on 𝖲𝖾𝗍 and K-𝖵𝖾𝖼, 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 1 the terminal graph, a single loop, and by S a single node which has no loop. Let F be the extension of the identity functor with FX=X if X has no loop, else FX=X+1. The graph 1+1 has subobjects S+1 and 1+S with the nonempty intersection S+S, but F does not preserve it.

  2. 2.

    The colection of all finitary endofunctors on lfp categories preserving non-empty intersections is, nevertheless, large. It contains constant functors, finite power-functors ()n (n), 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. 3.

    On the category 𝖭𝗈𝗆, the abstraction functor (cf. [16, Thm. 4.12]) and the finite power-set functor preserve intersections.

Remark 2.9.

Let A be an object of a locally finitely presentable category.

  1. 1.

    If A is not strictly initial, then it has a nonempty finitely presentable subobject. To see this, let ci:CiA (iI) be the colimit cocone of the diagram in ˜2.4.4. If each Ci is strictly initial, then so is the colimit A. Indeed, the colimit of any diagram of strict initial objects is itself strict initial.

  2. 2.

    Moreover, if A is not strictly initial, then it is the directed colimit of the canonical diagram of all its nonempty finitely presentable subobjects. To see this, combine ˜2.4.4 with the previous item.

  3. 3.

    If for some ordinal iω+ω the object Vi is strictly initial, then νF is obtained in ω+ω steps by default. Indeed, recall the transfinite chain Vj from (1.2). The connecting morphism from Vi+1=FVi to Vi is an isomorphism, whence νF=Vi.

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 Vω+ω 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 F:𝒜𝒜 be an endofunctor such that the following hold:

  1. 1.

    The limit Vω of the ω𝗈𝗉-chain (2.3) exists, and the morphism m:FVωVω is monic.

  2. 2.

    F preserves monomorphisms.

  3. 3.

    𝒜 has and F preserves nonempty intersections of ω𝗈𝗉-chains of monomorphisms.

Then the limit Vω+ω is preserved by F; therefore νF=Vω+ω.

Proof.

Let Vi be defined for all ordinals i by V0=1, Vi+1=FVi, and Vi=limj<iVj for limit ordinals i. The ω𝗈𝗉-chain (1.1) is its beginning, (2.1) defines the connecting morphism m:Vω+1Vω, and the ω𝗈𝗉-chain (2.2), repeated below, is the continuation of the chain in (1.1) up to Vω+ω=limi<ω+ωVi:

Vω𝑚Vω+1FmVω+2FFm.

From Items 1 and 2, the morphisms Fim are monic. By ˜2.9.3, we may assume without loss of generality that Vω+ω is not strictly initial. So by Item 3, F preserves this limit. It follows that νF=Vω+ω, as explained at the beginning of Section 2.

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 νF=Vω+ω for all finitary endofunctors on DCC-categories preserving nonempty binary intersections.

We have already seen the order of subobjects of a fixed object A (cf. ˜2.3). (This corresponds to the preordered collection in the slice category 𝒜A.) Dually, we use the order on strong quotients, represented by strong epimorphisms e:AE: given e:AE, we have ee iff e=ue for some u:EE. This corresponds to the preordered collection in the slice category A𝒜. 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 A satisfies the following descending chain condition: Every strictly descending chain of subobjects or strong quotients of A 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 a natural number n is assigned, called the grade of A, such that every (proper) subobject and every (proper) strong quotient of A is finitely presentable, and with a grade at most (smaller than, respectively) the grade of A.

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 A with top element , bottom element , and elements anm (nm<ω) ordered as follows:

aijanm iff i=n and jm.

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 2, due to <a0<, and at least 3 due to <a10<a11<, and so on.

Example 4.3 ([9]).

The following categories are graduated (cf. Example 2.2): 𝖲𝖾𝗍, 𝖲𝖾𝗍𝗉, 𝖡𝗈𝗈𝗅, 𝕊-𝖬𝗈𝖽 for a finite semiring 𝕊, M-𝖲𝖾𝗍 for a finite monoid M, 𝖦𝗋𝖺, K-𝖵𝖾𝖼, and 𝖯𝗈𝗌. In the first four categories, the grade is the cardinality of the underlying set. The grade of a graph having n vertices and k edges is n+k, 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 (n,k) with kn2. There is an order-isomorphism φ:. The grade of a poset with n elements which contains k comparable pairs is φ(n,k).

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. 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 X is given by a number of orbits. So the DCC on subobjects of an orbit-finite nominal set clearly holds.

  2. 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 X whose elements have supports of cardinality n (this is the degree of X) is a quotient of the nominal set 𝔸#n={(a1,,an):|{a1,,an}|=n}, where 𝔸 denotes the set of names (or atoms). Now observe that a quotient of 𝔸#n having degree n is determined by a subgroup G of the symmetric group Sn. More specifically, the quotient determined by G identifies (a1,,an) and (aπ(1),,aπ(n)) for every (a1,,an)𝔸#n and every πG. Conversely, given a quotient e:𝔸#nX we obtain G as consisting of all those π for which e identifies the above two n-tuples for every a1,,an in 𝔸. We conclude that every strictly descending chain of quotients of 𝔸#n all having degree n corresponds to a strictly descending chain of subgroups of Sn; the same holds of course for every single-orbit nominal set of degree n. Such a chain must be finite, since so is Sn. In fact, more can be said: For n2, such a chain of subgroups of Sn has length at most 2n3 [10] (and for n=1, Sn is trivial, of course, so chains of subgroups have length 0).

  3. 3.

    For general orbit-finite sets we now conclude that for every proper strong quotient of a nominal set X 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 X, or the maximum length of the above chain of subgroups of Sn for some orbit. Thus, 𝖭𝗈𝗆 is DCC.

  4. 4.

    To see that 𝖭𝗈𝗆 is even graduated, observe that we can assign to each orbit-finite nominal set X 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 X 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

24.
Definition 4.6.

A category has finitary ω𝗈𝗉-limits if for every limit n:LAn (n<ω) of an ω𝗈𝗉-chain and every finitely presentable subobject m:ML, some morphism km:MAk is monic.

Proposition 4.7.

Every DCC-category has finitary ω𝗈𝗉-limits.

Proof.

Let 𝒜 be a DCC-category. Let n:LAn be a limit cone of an ω𝗈𝗉-chain D=(An) with connecting morphisms an+1:An+1An. Given a finitely presentable object M and a monomorphism m:ML, factorize nm as a strong epimorphism en:MBn followed by a monomorphism un:BnAn (˜2.4.2). We obtain a subchain (Bn) of (An) with connecting maps bn given by the diagonal fill-ins, as shown below:

(4.1)

Notice that bn is a strong epimorphism, since so is en. We thus have a descending chain (Bn) of strong quotients of the finitely presentable object M: e0e1e2. By the DCC condition, there is some k such that for nk, bn is an isomorphism. For nk, let bn,k:BnBk be the composites recursively defined by bn+1,k=bn,kbn. Thus, for every nk, the triangle below commutes, where the lower part commutes by (4.1):

(4.2)

Let D be the ω𝗈𝗉 chain (An)nk. This is a shortening of our original ω𝗈𝗉-chain D, and so its limit is n:LAn (nk). The commutativity of all diagrams (4.2) shows that we have a cone (unbn,k1)nk of D. Thus, there exists b:BkL such that

nb=unbn,k1(nk).

Consider the following diagram for nk:

(4.3)

The square commutes, and we now prove that so does the outside. We show that for all nk and all 0ink,

unbn,ni1eni=nm. (4.4)

We argue by induction on i. For i=0, this holds using bn,n=𝗂𝖽 and the factorization unen=nm. Assume (4.4) for i. Fix nk such that nki+1. Then

unbn,n(i+1)1en(i+1)=unbn,ni1bni11eni1since bn,ni1=bni1bn,ni=unbn,ni1enisince eni1=bni1eni=nmby induction hypothesis

The induction completed, we take i=nk in (4.4) to see the commutativity of the outside of (4.3) for all n. Since the limit cone (n)nk is collectively monic, the triangle in (4.3) commutes: m=bek. As m is monic, so is ek. Thus, km=ukek 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 F:𝒜𝒜 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 Vi is not strictly initial for any iω+ω.

  1. 1.

    We first show that the canonical morphism m:Vω+1Vω is monic. Consider a parallel pair q,q:QFVω such that mq=mq. We prove that q=q. By ˜2.4.5, we may assume that Q is a finitely presentable object. Using that Vω can be assumed not to be strictly initial and ˜2.9.2, we may express Vω as a directed colimit of nonempty finitely presentable subobjects, say mt:MtVω (tT). Since F is finitary, Fmt:FMtFVω is also a directed colimit. Hence, q and q factorize through Fmt for some t. We denote the factorizing morphisms by r and r, respectively. It is sufficient to show that they are equal. To this end consider the following diagram:

    (5.1)

    The limit vω,i:VωVi is finitary (Proposition 4.7). Thus, there is some i so that vω,imt:MtVi is monic, and this monomorphism is nonempty. Since F preserves nonempty binary intersections, it preserves nonempty monomorphisms (˜2.6). Hence, the following morphism is monic:

    =(FMtFmtFVωFvω,iFVi).

    It is enough to show that merges r and r. The triangle on the right in (5.1) commutes. Thus we obtain

    =Fvω,iFmt=vω,i+1mFmt.

    Using that m merges q and q, we see that merges r and r:

    r =vω,i+1mFmtr
    =vω,i+1mq
    =vω,i+1mq
    =vω,i+1mFmtr
    =r.

    Since is monic, we have r=r whence q=q, as desired.

  2. 2.

    Next, we prove that F preserves nonempty intersections of ω𝗈𝗉-chains of subobjects. Consider such a chain ai:Ai+1Ai, and let its limit cone be i:LAi, where L is not strictly initial. It follows that neither is any of the Ai. Take a cone

    qi:QFAi(i<ω).

    Our task is to find a morphism q:QFL such that qi=Fiq for all i. (This is unique: all maps i are nonempty monic, whence all Fi are monic.)

    Using ˜2.4.4, we can assume, without loss of generality, that Q is finitely presentable: for a general object Q, express it as a colimit of finitely presentable subobjects Qt, and use the result which we prove for each Qt.

    Choose a nonempty, finitely presentable subobject c:CL (˜2.9.1). Note that this gives nonempty, finitely presentable subobjects

    ci=()for every i<ω,

    which, moreover, form a cone: ci=aici+1 for every i<ω.

    By recursion on i we define a subchain (Bi) of (Ai) given by intersections

    together with a cone pi:QFBi such that Fuipi=qi and a cone mi:CBi such that ci=uimi; this shows that all the intersections are nonempty.

    To define B0 and u0, express A0 as a directed colimit of all its finitely presentable subobjects u:BA0 that contain c0 (˜2.4.4). Then use that F preserves this colimit: for the morphism q0:QFA0 we may find a subobject u0:B0A0 containing c0 such that q0 factorizes through Fu0 via some p0:QFB0, say:

    Since u0 contains the subobject c0, we have a monomorphism m0:C0B0 such that c0=u0m0.

    In the induction step we are given Bi, ui, pi, and mi. Form the intersection of ui and ai to obtain Bi+1, bi, and ui+1 as shown in the left-hand square below:

    The outside commutes by induction hypothesis: uimi=ci=aici+1. Hence, we obtain the monomorphism mi+1 as indicated such that the upper part and right-hand triangle commute, as desired. Since C is not strictly initial, neither is Bi+1, whence the intersection of ai and ui is nonempty.

    So by hypothesis, F preserves the above pullback. Since the square below commutes

    there is a unique morphism pi+1:QFBi+1 such that

    pi=Fbipi+1andqi+1=Fui+1pi+1.

    For all ij<ω, we form the composite morphism

    bj,i=().

    We obtain a descending chain of subobjects bj,0:BjB0 (j<ω) of the finitely presentable object B0. Since 𝒜 is DCC, there is some k<ω such that bk,0 represents the same subobject as bj,0 for every jk. Hence, the morphism bj,k is an isomorphism.

    The shortened ω𝗈𝗉-chain (Ai)ik has the limit cone (i)ik. The morphisms

    hi=(Bkbi,k1BiuiAi)(ik)

    form a cone: we see that hi=aihi+1 from the commutativity of the diagram below:

    So there is a unique morphism h:BkL such that ih=uibi,k1 for ik.

    The desired morphism is

    q=(QpkFBkFhFL).

    In order to verify that qi=Fiq, it is sufficient to show this for ik; it then follows also for all i<k, since the qi and i form cocones:

    qi=Fak,iqk=Fak,iFkq=Fiqfor i<k.

    Now observe first that since (pi) form a cone of (FBi), we have

    Fbi,kpi=pk.

    By definition of h, we also have ui=ihbi,k. Therefore for all ik, we obtain

    qi=Fuipi=FiFhFbi,kpi=FiFhpk=Fiq.

    This extends to all i<k, 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 K-𝖵𝖾𝖼 has a terminal coalgebra obtained in ω+ω steps.

Indeed, every set functor preserves nonempty binary intersections [18, Prop. 2.1], and every endofunctors on K-𝖵𝖾𝖼 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 n, we present a locally finitely presentable category and a finitary endofunctor which needs n steps for its terminal-coalgebra chain to converge. The category is the complete lattice of all subsets of n (considered as the set of all ordinals i<n). The functor is the monotone map F preserving the empty set, and on all other sets Xn,

FX=X{minX}.

This is monotone, since given XY, if X contains minY, then minX=minY. The only coalgebra for F is empty; thus νF=.

The functor F is finitary because for every directed union X=Xt of nonempty subsets, minX lies in some Xt. Since the union is directed, X is also a union of all Xs where st. Then minX is contained in all Xs. It follows that minXs=minX, thus FXs=Xs{minX} for all st. Consequently,

𝖼𝗈𝗅𝗂𝗆FXs=𝖼𝗈𝗅𝗂𝗆Xs{minX}=X{minX}=FX.

The terminal-coalgebra chain Vi is given by V0=n and Vi=ni for all 0<i<n, which is easy to prove by transfinite induction. Thus, that chain takes precisely n steps to converge to the empty set, the terminal coalgebra for F.

6 Finitary Endofunctors on Metric Spaces

We denote by 𝖬𝖾𝗍 the category of (extended) metric spaces, where “extended” means that we might have d(x,y)=. The morphisms are non-expanding maps: the functions f:XY where d(f(x),f(x))d(x,x) holds for every pair x,xX. (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 S of a metric space M is a subset SM equipped with the metric inherited from M. Moreover, note that there is a bijective correspondence between subobjects of M represented by isometric embeddings and subspaces of M: indeed, for every subspace SM, the inclusion SM is an isometric embedding, and conversely, if f:MM is any isometric embedding, then it is monic and represents the same subobject of M as the inclusion map f[M]M of the subspace on the image of f. 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 M. Let fS:SA be a cocone of the diagram of all finite subspaces mS:SM of M. Then there is a unique map f:MA which restricts to fS for each finite subspace: fmS=fS. This map is non-expanding: given elements x,yM, let S be the subspace of M given by {x,y}. Since fS:SA is non-expanding, the distance of f(x) and f(y) in A is at most equal to the distance of x and y in M, that is, in S.

Remark 6.2.

One easily derives that, given a metric space M and a finite subspace SM, the space M is the directed colimit of the diagram of all its finite subspaces containing S (cf. ˜2.4.4).

Proposition 6.3.

The category 𝖬𝖾𝗍 has finitary ω𝗈𝗉-limits in the following sense: for every limit ln:LAn (n<ω) of an ω𝗈𝗉-chain and every finite subobject m:ML, some morphism lkm:MAk 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 F be a finitary endofunctor on 𝖬𝖾𝗍 preserving isometric embeddings. For every non-expanding map q:QFM where Q is finite, there exists a factorization through Fm for some finite subspace m:SM:

Proof.

  1. 1.

    Given a directed diagram D in 𝖬𝖾𝗍 of metric spaces Ai (iI) and subspace embeddings ai,j:AiAj (ij), the colimit C is the union iIAi with the metric inherited from the subspaces: for x,yiIAi, the distance d(x,y) in C is their distance in Ai for any iI such that x,yAi.

    An analogous statement holds for a directed diagram whose connecting morphisms are isometric embeddings.

  2. 2.

    Given q:QFM, let DM be the directed diagram of all finite subspaces of M and all inclusion maps. Its colimit is M, using Item 1. Since F is finitary, FM is the colimit of FDM, which is a directed diagram of isometric embeddings. The image q[Q] is a finite subspace of FM. By Item 1, there exists a finite subspace m:SM such that the colimit injection Fm of FC=𝖼𝗈𝗅𝗂𝗆FDM satisfies q[Q]Fm[FS]. Let q:QFS be the unique map such that q=Fmq. Then q is non-expanding because so is q and because Fm 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 F 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 Vi, iω+ω are nonempty.

  1. 1.

    The morphism m:Vω+1Vω is monic: given a non-empty space Q and q,q:QFVω such that mq=mq, we prove that q=q. By Lemma 6.1, we may assume that Q is finite. Thus, there exists a nonempty finite subspace mt:MtQ such that both q and q factorize through Fmt: we have morphisms r,r:QFMt such that q=Fmtr and q=Fmtr. As in Item 1 of the proof of Theorem 5.1, we derive r=r. Since Fmt is monic (because F preserves nonempty binary intersections), this proves q=q.

  2. 2.

    We prove that F preserves nonempty limits of ω𝗈𝗉-chains of monomorphisms

    ai:Ai+1Ai(i<ω).

    Let i:LAi be the limit cone. Given a cone qi:QFAi (i<ω), we only need to find a morphism q:QFL such that qi=Fiq (i<ω).

    Using Lemma 6.1, we may assume that Q is finite. We define a subchain (Bi) of (Ai) carried by nonempty binary subspaces ui:BiAi, together with cones pi:QFBi and mi:CBi such that Fuipi=qi and ci=uimi. We use recursion analogous to that in Item 2 of the proof of Theorem 5.1. In order to define B0, u0, and p0 use Lemma 6.4: there is a nonempty binary subspace u0:B0A0 and a morphism p0:QFB0 such that q0=Fu0p0. 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 X to the space 𝒫𝖿X of all finite subsets of X equipped with the Hausdorff distance222The definition goes back to Pompeiu [17] and was popularized by Hausdorff [12, p. 293].

d¯(S,T)=max(supxSd(x,T),supyTd(y,S)),for S,TX finite,

where d(x,S)=infySd(x,y). In particular d¯(,T)= for nonempty finite sets T. For a non-expanding map f:XY we have 𝒫𝖿f:Sf[S].

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 m:XY is the inclusion of a subspace, then 𝒫𝖿m preserves distances: given finite subsets S and T of the metric space X, then for every xS, we have that the distance d(x,T) is the same in X and Y. By symmetry, the Hausdorff distance of S and T is also the same in 𝒫𝖿X and in 𝒫𝖿Y.

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 ν𝒫𝖿=Vω+ω.

7 Conclusions and Future Work

This paper gives a sufficient condition for the terminal coalgebra νF 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 K-𝖵𝖾𝖼 no extra assumption is needed: νF 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.