Problem Set - Orders

## Problem Set - Orders

 Define the following and give an example for each: (a)   partial order, (b)   total order, (c)   order, (d)   ordered set, (e)   maximum, (f)   minimum, (g)   upper bound, (h)   lower bound, (i)   bounded above, (j)   bounded below, (k)   least upper bound, (l)   greatest lower bound, (m)   supremum, (n)   infimum, (o)   intervals. An ordered set $S$ has the least upper bound property if it satisfies: If $E\subseteq S$, $E\ne \varnothing$, and $E$ is bounded above then $\mathrm{sup}\left(E\right)$ exists in $S$. An ordered set $S$ is well ordered if it satisfies: If $E\subseteq S$ then $E$ has a minimal element. An ordered set $S$ is totally ordered if it satisfies: If $x,y\in S$ then $x or $x. An ordered set $S$ is a lattice if it satisfies: If $x,y\in S$ then $\mathrm{sup}\left\{x,y\right\}$ and $\mathrm{inf}\left\{x,y\right\}$ exist. Show that $ℚ$ does not have the least upper bound property. Show that $ℝ$ has the least upper bound property. Which of ${ℤ}_{>0},{ℤ}_{\ge 0},ℤ,ℂ$ have the least upper bound property? Which of ${ℤ}_{>0},{ℤ}_{\ge 0},ℤ,ℚ,ℝ,ℂ$ are well ordered? Which of ${ℤ}_{>0},{ℤ}_{\ge 0},ℤ,ℚ,ℝ,ℂ$ are totally ordered? Which of ${ℤ}_{>0},{ℤ}_{\ge 0},ℤ,ℚ,ℝ,ℂ$ are lattices? Let $S$ be a set. Show that the set of subsets of $S$ is partially ordered by inclusion. Define the following and give examples of each: (a)   ordered monoid, (a)   ordered group, (a)   ordered ring, (a)   ordered field, Let $S$ be an ordered field. Prove the following: (a)   If $a\in S$ and $a>0$ then $-a<0$. (b)   If $a\in S$ and $a>0$ then ${a}^{-1}>0$. (c)   If $a,b\in S$, $a>0$ and $b>0$ then $ab>0$. Let $S$ be an ordered group and let $x\in G$. Define the absolute value of $x$.