A point on fixpoints in posets
Abstract
Let (X,) be a non-empty strictly inductive poset, that is, a non-empty partially ordered set such that every non-empty chain Y has a least upper bound lub(Y)∈ X, a chain being a subset of X totally ordered by . We are interested in sufficient conditions such that, given an element a0∈ X and a function f:X X, there is some ordinal k such that ak+1=ak, where a\k is the transfinite sequence of iterates of f starting from a0 (implying that ak is a fixpoint of f): itemize=0mm ak+1=f(ak) al=\ak k l\ if l is a limit ordinal, i.e. l=lub(l) itemize This note summarizes known results about this problem and provides a slight generalization of some of them.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.