Lecture 2
Ordered sets, least upper bounds and fields.
Warm up
(a) The statements says: such that .
The negation is , such that .
Ordered sets
Let be a set. An order on is a relation satisfying:
- "trichotomy". If , then exactly on eof the these statements are hold: .
- "transitivity". If , then .
An ordered set is a set with order.
Definition 1.7
Let be an ordered set and let ( is the "universe", all the element you can ever think of...)
- is an upper bound of if
- is bounded above if such that is the upper bound of .
Example
- ( is bounded above)
- 3,4,3.5 are all upper bounds of .
- 2,2.5 is not upper bounds of .
- is not upper bound of since
- ( is bounded above)
- The upper bound is .
- ( is not bounded above)
- Sad
- .
- is an upper bound of if is not an upper bound of if
- So this statement is true for any rational numbers since such that .
Definition 1.8
Least upper bound, LUB, supremum, SUP
Let be an ordered set and . We say is the LUB of if
- is the UB of . ()
- if , then is not UB of . ( such that )
Lemma
Uniqueness of upper bounds.
If and are LUBs of , then .
Proof:
Suppose for contradiction and are both LUB of , then
WLOG and .
EOP
We write to denote the LUB of .
This also applies to (greatest lower bound) and infinum of
Example
- ( is bounded above)
- ,
- ( is bounded above)
- ,
and don't have to
- ( is not bounded above)
- or not defined,
- .
- or not defined, or not defined, we don't put in
Important example
- .
- is not empty and bounded above. However, des not exists.
If . * is not empty and bounded above. However, .
Least upper bound property (LUBP)
if that tis non-empty and bounded above, .
Greatest upper bound property (GLBP)
S has greatest lower bound property (GLBP) if that is non-empty and bounded below,
does not have LUBP and GLBP.
Theorem 1.11
Let be an ordered set. Then has the LUBP has the GLBP
Proof:
Let be a set with LUBP. (we want to show has GLBP)