English

A point on fixpoints in posets

Logic 2015-02-24 v1 Logic in Computer Science

Abstract

Let (X,)(X,\le) be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain YY has a least upper bound lub(Y)X(Y)\in X, a chain being a subset of XX totally ordered by \le. We are interested in sufficient conditions such that, given an element a0Xa_0\in X and a function f:X\aXf:X\a X, there is some ordinal kk such that ak+1=aka_{k+1}=a_k, where a_ka\_k is the transfinite sequence of iterates of ff starting from a0a_0 (implying that aka_k is a fixpoint of ff): \begin{itemize}\itemsep=0mm \item ak+1=f(ak)a_{k+1}=f(a_k) \item al=\lub{akk\textlessl}a_l=\lub\{a_k\mid k \textless{} l\} if ll is a limit ordinal, i.e. l=lub(l)l=lub(l) \end{itemize} This note summarizes known results about this problem and provides a slight generalization of some of them.

Keywords

Cite

@article{arxiv.1502.06021,
  title  = {A point on fixpoints in posets},
  author = {Frédéric Blanqui},
  journal= {arXiv preprint arXiv:1502.06021},
  year   = {2015}
}
R2 v1 2026-06-22T08:34:22.740Z