next up previous contents index
Next: Order vs. Algebraic Topology Up: Reduction Theorems Previous: Fixed Point Theorems/Reflection Conditions

Isotone Relations

 

Isotone relations are a beautiful variation on the order-preserving mapping theme that has a nice solution to its analogue of Problem 1.1 in the finite case. Most results in this section are due to or inspired by Walker (cf. [129]). For more on the relational fixed point property consider [46], [64], [75], [107].

define4348

Clearly the relational fixed point property implies the fixed point property and it is also preserved by retractions. Unfortunately as pointed out in [46], p.28, (2) or [75], bottom of p.161, the set tex2html_wrap_inline9848 with its natural order does not have the relational fixed point property. Thus the restriction to ordered sets with no infinite chains is only natural. In ordered sets with no infinite chains it is then easy to prove (cf. [129], Proposition 5.2) that if tex2html_wrap_inline9850 is an isotone relation and there are tex2html_wrap_inline7830 such that tex2html_wrap_inline9854 and tex2html_wrap_inline7836 , then tex2html_wrap_inline9858 has a fixed point. This allows us to reflect the relational fixed point property:

  theorem4364

Since (cf. [129], Theorem 5.6) an ordered set P with no infinite chains, the relational fixed point property and more than one point must have an irreducible point we arrive at the conclusion that the situation described above might be the only case that occurs. To back this conjecture we present:

  theorem4368

Proof: By the main result in [70], the tex2html_wrap_inline9798 -core of P exists and by Theorem 5.6 in [129] it has the relational fixed point property iff it is a singleton. \

cor4378

We can also use these results to obtain a quick proof of the finite case of Fofanova and Rutkowski's result on ordered sets of width 2 (recall that the width of an ordered set P is the size of the largest antichain in P, where an antichain is a subset of pairwise noncomparable elements):    

  cor4385

Proof: We will show that P has the fixed point property iff P has the relational fixed point property, which by Theorem 3.27 implies the result. It is clear that the relational fixed point property implies the fixed point property. Now suppose P does not have the relational fixed point property. Let tex2html_wrap_inline9850 be an isotone relation with no fixed point. Since P has width 2, tex2html_wrap_inline9904 is a chain for each tex2html_wrap_inline7890 . Now tex2html_wrap_inline9908 is a fixed point free order-preserving map. \

remark4392


next up previous contents index
Next: Order vs. Algebraic Topology Up: Reduction Theorems Previous: Fixed Point Theorems/Reflection Conditions

Bernd.S.W.Schroder