3.4 KiB
Lecture 2
Ordered sets, least upper bounds and fields.
Warm up
(a) The statements says: \forall a\in A, \exists s\in a such that s\geq 7.
The negation is \exist a\in A,\forall s\in a, such that s<7.
Ordered sets
Let S be a set. An order on S is a relation satisfying:
- "trichotomy". If
x,y\in S, then exactly on eof the these statements are hold:x<y,x=y,x>y. - "transitivity". If
x,y,z\in S, thenx<y,y\implies x<z.
An ordered set is a set with order.
Definition 1.7
Let S be an ordered set and let E\subset S (E is the "universe", all the element you can ever think of...)
\beta\in Sis an upper bound ofEif\forall x\in E,x\leq \betaEis bounded above if\exist \beta \in Ssuch that\betais the upper bound ofE.
Example
S=\mathbb{Q}, E=\{1,2,3\}(Eis bounded above)- 3,4,3.5 are all upper bounds of
E. - 2,2.5 is not upper bounds of
E. \piis not upper bound ofSsince\pi\notin S
- 3,4,3.5 are all upper bounds of
S=\mathbb{Q}, E=\{x\in \mathbb{Q}:0<x<1\}(Eis bounded above)- The upper bound is
1.
- The upper bound is
S=\mathbb{Q}, E=\{x\in \mathbb{Q}:0<x\}(Eis not bounded above)- Sad
S=\mathbb{Q}, E=\phi.\beta\in Sis an upper bound ofEif\forall x\in E,x\leq \beta\equiv\beta\in Sis not an upper bound ofEif\exists x\in E,x> \beta- So this statement is true for any rational numbers since
\cancel{\exist} a\in Esuch thatx>\beta.
Definition 1.8
Least upper bound, LUB, supremum, SUP
Let S be an ordered set and E\subset S. We say \alpha\in S is the LUB of E if
\alphais the UB ofE. (\forall x\in E,x\leq \alpha)- if
\gamma<\alpha, then\gammais not UB ofE. (\forall \gamma <\alpha, \exist x\in Esuch thatx>\gamma)
Lemma
Uniqueness of upper bounds.
If \alpha and \beta are LUBs of E, then \alpha=\beta.
Proof:
Suppose for contradiction \alpha and \beta are both LUB of E, then \alpha\neq\beta
WLOG \alpha>\beta and \beta>\alpha.
EOP
We write SupE to denote the LUB of E.
This also applies to GLB (greatest lower bound) and infinum of E
Example
S=\mathbb{Q}, E=\{1,2,3\}(Eis bounded above)SupE=3,Inf E=1
S=\mathbb{Q}, E=\{x\in \mathbb{Q}:0<x<1\}(Eis bounded above)SupE=3,Inf E=1
SupE and Inf E=1 don't have to \in E
S=\mathbb{Q}, E=\{x\in \mathbb{Q}:0<x\}(Eis not bounded above)SupE=\inftyor not defined,Inf E=0
S=\mathbb{Q}, E=\phi.SupE=-\inftyor not defined,Inf E=\inftyor not defined, we don't put\inftyin\mathbb{Q}
Important example
S=\mathbb{Q}, A=\{p\leq \mathbb{Q}:p>0, p^2<2\}.Ais not empty and bounded above. However,Sup Ades not exists.
If S=\mathbb{R}, A=\{p\leq \mathbb{Q}:p>0, p^2<2\}.
* A is not empty and bounded above. However, Sup A=\sqrt{2}.
Least upper bound property (LUBP)
if \forall E\subset S that tis non-empty and bounded above, \exist Sup E\in S.
Greatest upper bound property (GLBP)
S has greatest lower bound property (GLBP) if \exist E\subset S that is non-empty and bounded below, \exists Inf E\in S
\mathbb{Q} does not have LUBP and GLBP.
Theorem 1.11
Let S be an ordered set. Then S has the LUBP \iff S has the GLBP
Proof:
Let S be a set with LUBP. (we want to show S has GLBP)