Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- 1 Introduction
- 2 Algebras and Coalgebras
- 3 Finitary Iteration
- 4 Finitary Set Functors
- 5 Finitary Iteration in Enriched Settings
- 6 Transfinite Iteration
- 7 Terminal Coalgebras as Algebras, Initial Algebras as Coalgebras
- 8 Well-Founded Coalgebras
- 9 State Minimality and Well-Pointed Coalgebras
- 10 Fixed Points Determined by Finite Behaviour
- 11 Sufficient Conditions for Initial Algebras and Terminal Coalgebras
- 12 Liftings and Extensions from Set
- 13 Interaction between Initial Algebras and Terminal Coalgebras
- 14 Derived Functors
- 15 Special Topics
- Appendix A Functors with Initial Algebras or Terminal Coalgebras
- Appendix B A Primer on Fixed Points in Ordered and Metric Structures
- Appendix C Set Functors
- References
- List of Categories
- Index
6 - Transfinite Iteration
Published online by Cambridge University Press: 30 January 2025
- Frontmatter
- Dedication
- Contents
- Preface
- 1 Introduction
- 2 Algebras and Coalgebras
- 3 Finitary Iteration
- 4 Finitary Set Functors
- 5 Finitary Iteration in Enriched Settings
- 6 Transfinite Iteration
- 7 Terminal Coalgebras as Algebras, Initial Algebras as Coalgebras
- 8 Well-Founded Coalgebras
- 9 State Minimality and Well-Pointed Coalgebras
- 10 Fixed Points Determined by Finite Behaviour
- 11 Sufficient Conditions for Initial Algebras and Terminal Coalgebras
- 12 Liftings and Extensions from Set
- 13 Interaction between Initial Algebras and Terminal Coalgebras
- 14 Derived Functors
- 15 Special Topics
- Appendix A Functors with Initial Algebras or Terminal Coalgebras
- Appendix B A Primer on Fixed Points in Ordered and Metric Structures
- Appendix C Set Functors
- References
- List of Categories
- Index
Summary
This chapter takes the iterative construction of initial algebras into the transfinite, generalizing work in Chapters 2 and 4. It begins with a brief presentation of ordinals, cardinals, regular cardinals, and Zermelo’s Theorem: Monotone functions on chain-complete posets have least fixed points obtainable by iteration. When a category has colimits of chains, if an endofunctor preserves colimits of chains of some ordinal length, then the initial-algebra chain converges in the same number of steps. We discuss the precise length of that iterative construction. We introduce the concept of smooth monomorphisms, providing a relation between iteration inside a subobject poset and in the ambient category. We prove the Initial Algebra Theorem: Under natural assumptions related to smoothness, the existence of a pre-fixed point of an endofunctor guarantees the existence of an initial algebra.
Keywords
- Type
- Chapter
- Information
- Initial Algebras and Terminal CoalgebrasThe Theory of Fixed Points of Functors, pp. 167 - 214Publisher: Cambridge University PressPrint publication year: 2025