Skip to content
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

Merged
merged 2 commits into from
Jan 29, 2024

Conversation

gapry
Copy link
Contributor

@gapry gapry commented Jan 14, 2024

This pull request provides the solution for Exercise 04, Chapter 01, from the third edition of Principles of Mathematical Analysis by Walter Rudin.

Books/BabyRudin/Chapter01/ex04.tex Outdated Show resolved Hide resolved
Books/BabyRudin/Chapter01/ex04.tex Outdated Show resolved Hide resolved
@@ -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$.
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

When you write $\alpha \in S$ in the definition of $L$, you redefined $\alpha$ in that context, but $\alpha$ is already defined by the problem. Try not to redefine symbol, that can get confusing, same goes with $\beta$.

@@ -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$.
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You defined $L$ and $U$, but you never used it.

Copy link
Owner

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 $S$ is an ordered set, and let $E$ be a non-empty subset of $S$, so there exists $x \in E$.

$\alpha$ is a lower bound of $E$, so $\alpha \le x$,

$\beta$ is an upper bound of $E$, so $x \le \beta$,

Combined, we have $\alpha \le x \le \beta$, so $\alpha \le \beta$

@ceciliachan1979 ceciliachan1979 merged commit 87b865c into ceciliachan1979:main Jan 29, 2024
1 check passed
@gapry gapry deleted the rudin-1-4 branch March 13, 2024 04:58
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants