11. Ordered Sets

Review and Refinement:

On this Page we assume all Sets are ordered.

11.1 Segments and "Ideal Cuts":

For MATH, we will use the notation, MATH $\QTR{Large}{\ }$for the segment of $\QTR{Large}{a}$ in $\QTR{Large}{A}$. (rather than $\QTR{Large}{S(a)}$ )

The text book defines a closely related notion of an Ideal, a subset MATH, having the property that MATH and MATH. I will refer to an Ideal as an Ideal Cut (Think of Dedekind Cut ) because

  1. For any subset MATH, is an Ideal Cut if and only if $\QTR{Large}{x<y}$ for every MATH and MATH

    Hence if MATH and MATH are Ideal Cuts then MATH or MATH .

    Also, if MATH is a Set of Ideal Cuts, then so is MATH

  2. For any MATH, $\QTR{Large}{A[a]}$ is an Ideal Cut. More generally, any subset MATH, is an Ideal Cut if for some subset MATH, MATH

    We also have

  3. Let MATH. Show MATH MATH MATH

  4. Let MATH , show that MATH where the right side reads "The segment of $\QTR{Large}{t}$ in $\QTR{Large}{A[a]}$.

Proofs:

  1. Verify for yourself:

  2. Exercise due March 16;

  3. If MATH then MATH or MATH. If MATH then MATH but by definition MATH MATH . If MATH ....

  4. In general, for MATH we have MATH . What we need to show is that if $\QTR{Large}{t<a}$ then

    MATH .

    But

    MATH

    and

    MATH and MATH MATH

-----------------------------------------------------------------------------------------

11.2 Order morphisms :

A map MATH is said to be an order morphism if for all MATH , MATH. Unless there is a possibility of confusion we will use the symbol $\QTR{Large}{\leq }$ ambiguously.

  1. Let MATH be a one to one order morphism then for all MATH

    MATH

  2. Let MATH is said to an onto order morphism then for all MATH

    MATH or MATH

  3. The Segment Mapping Formula - Let MATH be an order isomorphism (one to one, onto, and order preserving) then for all MATH , MATH

Proofs:

  1. This amounts to observing that MATH since $\QTR{Large}{f}$ is one to one.

  2. First note that MATH since MATH

    (It may the the case that MATH)

    Next, let MATH , in particular let MATH since $\QTR{Large}{f}$ is onto let MATH such that MATH

    If $\QTR{Large}{s<a}$ then MATHBut we cannot have $\QTR{Large}{s>a}$ since then MATH contradicting the choice of MATH.

    Hence MATH

  3. Follows from 1. and 2.