-
Notifications
You must be signed in to change notification settings - Fork 5
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Solution for Exercise 04 from Chapter 01 in Baby Rudin #18
Conversation
08fb33a
to
24eb4cf
Compare
24eb4cf
to
1dd03dc
Compare
e2695eb
to
3c25718
Compare
f7ee9c4
to
111abeb
Compare
@@ -0,0 +1,3 @@ | |||
\subsection*{Exercise 04 (Gapry)} | |||
Let $S$ is an ordered set, and let $E$ be a non-empty subset of $S$. | |||
We define $L$ to be the set of all lower bounds of $E$, that is, $L = \{\alpha \in S\ |\ x \ge \alpha,\ \forall x \in E\}$, and $U$ to be the set of all upper bounds of $E$, that is, $U = \{\beta \in S\ |\ x \le \beta,\ \forall x \in E\}$. Since $x \ge \alpha$ and $x \le \beta$, $\forall x \in E$, it follows that $\alpha \le x \le \beta$, $\forall x \in E$, hence $\alpha \le \beta$. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
When you write
@@ -0,0 +1,3 @@ | |||
\subsection*{Exercise 04 (Gapry)} | |||
Let $S$ is an ordered set, and let $E$ be a non-empty subset of $S$. | |||
We define $L$ to be the set of all lower bounds of $E$, that is, $L = \{\alpha \in S\ |\ x \ge \alpha,\ \forall x \in E\}$, and $U$ to be the set of all upper bounds of $E$, that is, $U = \{\beta \in S\ |\ x \le \beta,\ \forall x \in E\}$. Since $x \ge \alpha$ and $x \le \beta$, $\forall x \in E$, it follows that $\alpha \le x \le \beta$, $\forall x \in E$, hence $\alpha \le \beta$. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You defined
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The whole thing could be simplify to just this, you don't really need to argue the inequalities for all elements in the set in order to claim the result.
Let
Combined, we have
111abeb
to
6cd078d
Compare
This pull request provides the solution for Exercise 04, Chapter 01, from the third edition of Principles of Mathematical Analysis by Walter Rudin.