I have a quick question on the excerpt of Theorem 2.40 of Baby Rudin. How would I get "If n is so large that $2^{-n}\delta
A quick question on Baby Rudin Theorem 2.40: Every k-cell is compact.
2
$\begingroup$
analysis
2 Answers
3
You want to have $2^n>\dfrac{\delta}r$; taking logs, this is equivalent to $n\ln 2>\ln\delta-\ln r$, or $n>\dfrac{\ln\delta-\ln r}{\ln 2}$. The fact that you can always choose such an $n$ comes from the Archimedean property of $\Bbb R$.
-
0Thanks Brian. I am just not sure if I can actually use natural lo$g$arithm, unless this is found somewhere in Exercise on Chapter 1 which has somethin$g$ to do with logarithm. – 2012-06-11
2
To finish the lemma, note that $\alpha=\sup E$ is the least upper bound for $E$, therefore $\alpha/2<\alpha$ is not an upper bound for $E$. Thus there is some $n$ such that $2^n>\alpha/2$, so $2^{n+1}>\alpha$. This contradicts the fact that $\alpha$ is the least upper bound for $E$.
-
0Yes thanks a lot Alex! I think your answer comes closest to what I want since I have not actually completed the exercise about logarithm of Chapter 1. – 2012-06-11