-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
BabyRudin: Solution: Ex05 in Ch01: Update
- Loading branch information
Showing
1 changed file
with
7 additions
and
10 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,14 +1,11 @@ | ||
\subsection*{Exercise 05 (Gapry)} | ||
\begin{flushleft} | ||
$\text{(1) } \exists\ \alpha \in R \ni x \geq \alpha \ \forall x \in A$ \\ | ||
$\text{(2) } \exists\ \alpha \in R \ni -x \leq -\alpha \ \forall -x \in -A$ \\ | ||
\end{flushleft} | ||
|
||
\begin{flushleft} | ||
(1) $\implies \alpha = \inf( A)$ \\ | ||
(2) $\implies -\alpha = \sup(-A)$ | ||
\end{flushleft} | ||
Since $A \subset R$, and $A$ is bounded below, we know that $\inf A$ exists. | ||
Let's claim $\alpha = \inf A$, so that $A = \{x \in R\ |\ x \ge \alpha \}$. | ||
It follows that $-A = \{-x \in R\ | -x \le -\alpha,\ x \in A\}$. | ||
Since we know that $\alpha$ is the greatest lower bound, | ||
the negation of inequality $x \ge \alpha$, which is $-x \le -\alpha$, shows $-\alpha$ the least upper bound, that is , $-\alpha = \sup(-A)$. \\ | ||
|
||
\begin{flushleft} | ||
Obviously, $a = -(-a) \implies \inf(A) = -\sup(-A)$ | ||
\end{flushleft} | ||
According to 1.14 Proposition (d), $\alpha = -(-\alpha)$, we can conclude that $\inf A = -\sup(-A)$. | ||
\end{flushleft} |