Abstract
The initial algebra for a set functor can be constructed iteratively via a well-known transfinite chain, which converges after a regular infinite cardinal number of steps or at most three steps. We extend this result to the analogous construction of relatively initial algebras. For the dual construction of the terminal coalgebra Worrell proved that if a set functor is α-accessible, then convergence takes at most α + α steps. But until now an example demonstrating that fewer steps may be insufficient was missing. We prove that the functor of all α-small filters is such an example. We further prove that for β ≤ α the functor of all α-small β-generated filters requires precisely α + β steps and that a certain modified power-set functor requires precisely α steps. We also present an example showing that whether a terminal coalgebra exists at all does not depend solely on the object mapping of the given set functor. (This contrasts with the fact that existence of an initial algebra is equivalent to existence of a mere fixed point.)
Similar content being viewed by others
References
Adámek, J.: Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carol. 15, 589–609 (1974)
Adámek, J., Levy, P.B., Milius, S., Moss, L.S., Sousa, L.: On final coalgebras of power-set functors and saturated trees. Appl. Categ. Struct. 23, 609–641 (2015)
Adámek, J., Porst, H.-E.: On tree coalgebras and coalgebra presentations. Theor. Comput. Sci. 311, 257–283 (2004)
Adámek, J., Trnková, V.: Initial algebras and terminal coalgebras in many-sorted sets. Math. Struct. Comput. Sci. 21, 481–509 (2011)
Adámek, J., Trnková, V.: Relatively terminal coalgebras. J. Pure Appl. Algebra 216, 1887–1895 (2012)
Barr, M.: Coequalizers and free triples. Math. Z. 116, 307–322 (1990)
Barr, M.: Terminal coalgebras in well-founded sets. Theor. Comput. Sci. 114, 299–315 (1993)
Kůrková-Pohlová, V., Koubek, V.: When a generalized algebraic category is monadic. Comment. Math. Univ. Carol. 15, 577–587 (1974)
Koubek, V.: Set functors. Comment. Math. Univ. Carol. 12, 175–195 (1971)
Trnková, V.: Some properties of set functors. Comment. Math. Univ. Carol. 10, 323–352 (1969)
Trnková, V., Adámek, J., Koubek, V., Reiterman, J.: Free algebras, input processes and free monads. Comment. Math. Univ. Carol. 16, 339–351 (1975)
Worrell, J.: On the final sequence of a finitary set functor. Theor. Comput. Sci. 338, 184–199 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Horst Herrlich
Václav Koubek died before publication of this work was completed. The remaining two authors deeply regret this loss.
Rights and permissions
About this article
Cite this article
Adámek, J., Koubek, V. & Palm, T. Fixed Points of Set Functors: How Many Iterations are Needed?. Appl Categor Struct 24, 649–661 (2016). https://doi.org/10.1007/s10485-016-9451-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10485-016-9451-1