数学分析第三课(上下确界的概念)

Definition Let $S$ be a set. An order on $S$ is a relation, denote
by $<$, with the following two properties:

1. If $x\in S$ and $y\in S$ then one and only one of the statements
   $$x<y,x=y,y<x$$ is true.

2. If $x,y,z\in S$, if $x<y$ and $y<x$, then $x<z$.

Definition An ordered set is a set $S$ in which an order is defined.

Definition Suppose $S$ is an ordered set, $E\subset S$, and $E$ is
bounded above. Supose there exists an $\alpha \in S$ with the following
properties:

• $\alpha$ is an upper bound of $E$

• If $\gamma <\alpha$ then $\gamma$ is not an upper bound of $E$.

Then $\alpha$ is called the least upper bound of $E$ or the
supremum of $E$ $$\alpha =\sup E$$

Definition Suppose $S$ is an ordered set, $E\subset S$, and $E$ is
bounded blow. Suppose there exists an $\alpha \in S$ with the following
properties:

• $\alpha$ is a lower bound of $E$

• If $\gamma >\alpha$ then $\gamma$ is not a lower bound of $E$.

Then $\alpha$ is called the greatest lower bound of $E$, or the
infimum of $E$

$$\alpha =\inf E$$

Definition An ordered set $S$ is said to have the
least-upper-bound property if the following is true:
If $E\subset S$, $E$ is not empty, and $E$ is bounded above, then
$\sup E$ exists in $S$.
Theorem Suppose $S$ is an ordered set with the least-upper-boudn
property, $B\subset S$, $B$ is not empty, and $B$ is bounded below. Let
$L$ be the set of all lower bounds of $B$. Then $$\alpha =\sup L$$
exists in $S$, and $\alpha =\inf B$

Proof.\

• $\forall \alpha (a\in B)$, $a$ is an upper bound of $L$. Since $B$
  is bounded blow, $L$is not empty. From the definition of a set with
  the least-upper-bound property, we get that $L$ has a supremum value
  in $S$. We call it $\alpha$. $$\alpha =\sup L$$

• 1. $\forall \gamma (\gamma <\alpha )$, $\gamma$ is not an upper bound
     of $L$, which means that $\gamma$ is a lower bound of $B$ and
     $\gamma \in L$. In another word,
     $\forall \gamma (\gamma <\alpha )\to \gamma \in L$.

  2. $\forall \beta (\beta >\alpha )$, $\beta \notin L$, because
     $\alpha$ is the least upper bound of $L$. $\beta \notin L$ means
     that $\beta$ is not a lower bound of $B$. Hence,
     $\exists \delta (\delta \in B)\to \delta <\beta$.

  From the definition of the greatest lower bound, we have shown that
  $$\alpha =\inf B$$