scientific article; zbMATH DE number 1367729

From MaRDI portal
Publication:4702091





Let \(f\) be a mapping of a poset \((P,\leq)\) into itself. Then \(f\) is called upper isotone iff it satisfies (1) \(a\leq f(a)\) for some \(a\in P\), and (2) \(x\leq f(x)\leq y\Rightarrow f(x)\leq f(y) \forall x,y\in P\). If (1) holds and also (3): \(x\leq y\Rightarrow f(x)\leq f(y) \forall x,y\in P\), then \(f\) is said to be isotone. If \(x\leq f(x) \forall x\in P\) holds, \(f\) is called noncontractive. A poset \(P\) is said to be inductive iff every nonempty well-ordered subset of \(P\) has a least upper bound in \(P\). Then the author proves the equivalence of the following three statements: 1) Every upper isotone selfmapping on an inductive poset has a fixed point. 2) Every noncontractive selfmapping on an inductive poset has a fixed point. 3) Every isotone selfmapping on an inductive poset has a fixed point. Here 2) is from \textit{G. Birkhoff}, Lattice theory (AMS Coll. Publ. 25, Am. Math. Soc., New York) (1948; Zbl 0033.10103), p. 48 (Chapter III, Ex. 6), and 3) is from \textit{A. Abian} and \textit{A. Brown}, Can. J. Math. 13, 78-82 (1961; Zbl 0098.25502).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702091)