Some Fixed Point Theorems for Partially Ordered Sets
- 1 October 1976
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 28 (5) , 992-997
- https://doi.org/10.4153/cjm-1976-097-0
Abstract
A partially ordered set P has the fixed point property if every order-preserving map f : P → P has a fixed point, i.e. there exists x ∊ P such that f(x) = x. A. Tarski's classical result (see [4]), that every complete lattice has the fixed point property, is based on the following two properties of a complete lattice P: (A)For every order-preserving map f : P → P there exists x ∊ P such that x ≦ f(x). (B)Suprema of subsets of P exist; in particular, the supremum of the set {x|x ≦ f(x)} ⊂ P exists.Keywords
This publication has 3 references indexed in Scilit:
- Common Fixed Points of Commuting Monotone MappingsCanadian Journal of Mathematics, 1967
- A Theorem on Partially Ordered Sets, With Applications to Fixed Point TheoremsCanadian Journal of Mathematics, 1961
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955