(a) For natural n, bn−1≥n(b−1).
(b) Hence b−1≥n(b1/n−1).
(c) If t>1 and n>(b−1)/(t−1) 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 bw−1/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 bn≥n(b−1)+1. This is clear when n=1, so by inductionbn=bbn−1≥b((n−1)(b−1)+1))=(n−1)b(b−1)+band we must show (n−1)b(b−1)+b≥n(b−1)+1. Collecting terms on the left and manipulating we must thus show (n−1)(b−1)2≥0, which is clear as all these terms are nonnegative.
(b) This is clear from the previous, as b1/n>1 by noting cn≤1 for c≤1 by induction.
(c) Assume b1/n≥t. Then b−1<n(t−1)≤n(b1/n−1), a contradiction by (b).
(d) We have 1<ybw. Observe b1/n≤b−1n+1 by (b) so we may choose n such that b−1n+1<ybw by conditioning b−1n<ybw−1>0 and now n>b−1ybw−1 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 bx−1/n>y and x is not a minimal upper bound. Therefore bx=y.
(g) If x′≠x then bx−bx′=bx′(bx−x′−1)=0 is a contradiction. ◻
No comments:
Post a Comment