Loading [MathJax]/jax/output/HTML-CSS/jax.js

Saturday, August 10, 2013

Real Logs (1.7)

Walter Rudin Principles of Mathematical Analysis, chapter 1, exercise 7:

MathJax TeX Test Page Fix b>1,y>0 and prove that there is a unique real x such that bx=y by completing the following outline. Say x=logby.
(a) For natural n, bn1n(b1).
(b) Hence b1n(b1/n1).
(c) If t>1 and n>(b1)/(t1) then b1/n<t.
(d) If w is such that bw<y then bw+1/n<y for sufficiently large n.
(e) If bw>y then bw1/n>y for sufficiently large n.
(f) Let A={w | w<y} and show bsup A=y.
(g) Show x is unique.

Proof: (a) We show bnn(b1)+1. This is clear when n=1, so by inductionbn=bbn1b((n1)(b1)+1))=(n1)b(b1)+band we must show (n1)b(b1)+bn(b1)+1. Collecting terms on the left and manipulating we must thus show (n1)(b1)20, which is clear as all these terms are nonnegative.
(b) This is clear from the previous, as b1/n>1 by noting cn1 for c1 by induction.
(c) Assume b1/nt. Then b1<n(t1)n(b1/n1), a contradiction by (b).
(d) We have 1<ybw. Observe b1/nb1n+1 by (b) so we may choose n such that b1n+1<ybw by conditioning b1n<ybw1>0 and now n>b1ybw1 so that bw+1/n<y.
(e) As before, since we showed b1/n tends toward 1 we can choose n such that b1/n<bwy to fulfill.
(f) By (a) we have bw is divergent so A has x=sup A. Suppose bx<y; then by (d) we have some bx+1/n<y so x is not an upper bound. Suppose bx>y; then by (e) choose n for bx1/n>y and x is not a minimal upper bound. Therefore bx=y.
(g) If xx then bxbx=bx(bxx1)=0 is a contradiction. 

No comments:

Post a Comment