Skip to content

Commit

Permalink
BabyRudin: Solution: Ex05 in Ch01: Update
Browse files Browse the repository at this point in the history
  • Loading branch information
gapry committed Jan 29, 2024
1 parent 11b8d9c commit 4633638
Showing 1 changed file with 7 additions and 10 deletions.
17 changes: 7 additions & 10 deletions Books/BabyRudin/Chapter01/ex05.gapry.tex
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}

0 comments on commit 4633638

Please sign in to comment.