没有合适的资源?快使用搜索试试~ 我知道了~
rudin数学分析原理答案
5星 · 超过95%的资源 需积分: 50 197 下载量 178 浏览量
2009-01-04
22:48:44
上传
评论 7
收藏 865KB PDF 举报
温馨提示
试读
107页
rudin数学分析原理答案 rudin数学分析原理答案 rudin数学分析原理答案
资源推荐
资源详情
资源评论
MATH 413 [513] (PHILLIPS) SOLUTIONS TO HOMEWORK 1
Generally, a “solution” is something that would be acceptable if turned in in the
form presented here, although the solutions given are often close to minimal in this
respect. A “solution (sketch)” is too sketchy to be considered a complete solution
if turned in; varying amounts of detail would need to be filled in.
Problem 1.1: If r ∈ Q \{0} and x ∈ R \ Q, prove that r + x, rx 6∈ Q.
Solution: We prove this by contradiction. Let r ∈ Q\{0}, and suppose that r +x ∈
Q. Then, using the field properties of both R and Q,wehavex =(r + x) −r ∈ Q.
Thus x 6∈ Q implies r + x 6∈ Q.
Similarly, if rx ∈ Q, then x =(rx)/r ∈ Q. (Here, in addition to the field
properties of R and Q,weuser 6= 0.) Thus x 6∈ Q implies rx 6∈ Q.
Problem 1.2: Prove that there is no x ∈ Q such that x
2
= 12.
Solution: We prove this by contradiction. Suppose there is x ∈ Q such that
x
2
= 12. Write x =
m
n
in lowest terms. Then x
2
= 12 implies that m
2
=12n
2
.
Since 3 divides 12n
2
, it follows that 3 divides m
2
. Since 3 is prime (and by unique
factorization in Z), it follows that 3 divides m. Therefore 3
2
divides m
2
=12n
2
.
Since 3
2
does not divide 12, using again unique factorization in Z and the fact that
3 is prime, it follows that 3 divides n. We have proved that 3 divides both m and
n, contradicting the assumption that the fraction
m
n
is in lowest terms.
Alternate solution (Sketch): If x ∈ Q satisfies x
2
= 12, then
x
2
is in Q and satisfies
¡
x
2
¢
2
= 3. Now prove that there is no y ∈ Q such that y
2
= 3 by repeating the
proof that
√
2 6∈ Q.
Problem 1.5: Let A ⊂ R be nonempty and bounded below. Set −A = {−a: a ∈
A}. Prove that inf(A)=−sup(−A).
Solution: First note that −A is nonempty and bounded ab ove. Indeed, A contains
some element x, and then −x ∈ A; moreover, A has a lower bound m,and−m is
an upper bound for −A.
We now know that b = sup(−A) e xists. We show that −b = inf(A). That −b is
a lower bound for A is immediate from the fact that b is an upper bound for −A.
To show that −b is the greatest lower bound, we let c>−b and prove that c is not
a lower bound for A.Now−c<b,so−c is not an upper bound for −A. So there
exists x ∈−A such that x>−c. Then −x ∈ A and −x<c.Soc isnotalower
bound for A.
Problem 1.6: Let b ∈ R with b>1, fixed throughout the problem.
Comment: We will assume known that the function n 7→ b
n
,fromZ to R,is
strictly increasing, that is, that for m, n ∈ Z,wehaveb
m
<b
n
if and only if
m<n. Similarly, we take as known that x 7→ x
n
is strictly increasing when n is
Date: 1 October 2001.
1
2 MATH 413 [513] (PHILLIPS) SOLUTIONS TO HOMEWORK 1
an integer with n>0. We will also assume that the usual laws of exponents are
known to hold when the exponents are integers. We can’t assume anything about
fractional exponents, except for Theorem 1.21 of the book and its corollary, because
the context makes it clear that we are to assume fractional powers have not yet
been defined.
(a) Let m, n, p, q ∈ Z, with n>0andq>0. Prove that if
m
n
=
p
q
, then
(b
m
)
1/n
=(b
p
)
1/q
.
Solution: By the uniqueness part of Theorem 1.21 of the book, applied to the
positive integer nq, it suffices to show that
h
(b
m
)
1/n
i
nq
=
h
(b
p
)
1/q
i
nq
.
Now the definition in Theorem 1.21 implies that
h
(b
m
)
1/n
i
n
= b
m
and
h
(b
p
)
1/q
i
q
= b
p
.
Therefore, using the laws of integer exponents and the equation mq = np ,weget
h
(b
m
)
1/n
i
nq
=
hh
(b
m
)
1/n
i
n
i
q
=(b
m
)
q
= b
mq
= b
np
=(b
p
)
n
=
hh
(b
p
)
1/q
i
q
i
n
=
h
(b
p
)
1/q
i
nq
,
as desired.
By Part (a), it makes sense to define b
m/n
=(b
m
)
1/n
for m, n ∈ Z with n>0.
This defines b
r
for all r ∈ Q.
(b) Prove that b
r+s
= b
r
b
s
for r, s ∈ Q.
Solution: Choose m, n, p, q ∈ Z, with n>0andq>0, such that r =
m
n
and
s =
p
q
. Then r + s =
mq+np
nq
. By the uniqueness part of Theorem 1.21 of the book,
applied to the positive integer nq, it suffices to show that
h
b
(mq+ np) / (nq)
i
nq
=
h
(b
m
)
1/n
(b
p
)
1/q
i
nq
.
Directly from the definitions, we can write
h
b
(mq+ np) / (nq)
i
nq
=
·
h
b
(mq+ np)
i
1/(nq)
¸
nq
= b
(mq+ np)
.
Using the laws of integer exponents and the definitions for rational exponents, we
can rewrite the right hand side as
h
(b
m
)
1/n
(b
p
)
1/q
i
nq
=
hh
(b
m
)
1/n
i
n
i
q
hh
(b
p
)
1/q
i
q
i
n
=(b
m
)
q
(b
p
)
n
= b
(mq+ np)
.
This proves the required equation, and hence the result.
(c) For x ∈ R, define
B(x)={b
r
: r ∈ Q ∩ (−∞,x]}.
Prove that if r ∈ Q, then b
r
= sup(B(r)).
Solution: The main point is to show that if r, s ∈ Q with r<s, then b
r
<b
s
.
Choose m, n, p, q ∈ Z, with n>0andq>0, such that r =
m
n
and s =
p
q
. Then
MATH 413 [513] (PHILLIPS) SOLUTIONS TO HOMEWORK 1 3
also r =
mq
nq
and s =
np
nq
, with nq > 0, so
b
r
=(b
mq
)
1/(nq)
and b
s
=(b
np
)
1/(nq)
.
Now mq < np because r<s. Therefore, using the definition of c
1/(nq)
,
(b
r
)
nq
= b
mq
<b
np
=(b
s
)
nq
.
Since x 7→ x
nq
is strictly increasing, this implies that b
r
<b
s
.
Now we can prove that if r ∈ Q then b
r
= sup(B(r)). By the above, if s ∈ Q
and s ≤ r, then b
s
≤ b
r
. This implies that b
r
is an upper bound for B(r). Since
b
r
∈ B(r), obviously no number smaller than b
r
can be an upp er bound for B(r).
So b
r
= sup(B(r)).
We now define b
x
= sup(B(x)) for every x ∈ R. We need to show that B(x)
is nonempty and bounded above. To show it is nonempty, choose (using the
Archimedean property) some k ∈ Z with k<x; then b
k
∈ B(x). To show it
is bounded above, similarly choose some k ∈ Z with k>x.Ifr ∈ Q ∩ (−∞,x],
then b
r
∈ B(k) so that b
r
≤ b
k
by Part (c). Thus b
k
is an upper bound for B(x).
This shows that the definition makes sense, and Part (c) shows it is consistent with
our earlier definition when r ∈ Q.
(d) Prove that b
x+y
= b
x
b
y
for all x, y ∈ R.
Solution:
In order to do this, we are going to need to replace the set B(x)abovebythe
set
B
0
(x)={b
r
: r ∈ Q ∩ (−∞,x)}
(that is, we require r<xrather than r ≤ x) in the definition of b
x
.(Ifyouare
skeptical, read the main part of the solution first to see how this is used.)
We show that the replacement is possible via some lemmas.
Lemma 1. If x ∈ [0, ∞)andn ∈ Z satisfies n ≥ 0, then (1 + x)
n
≥ 1+nx.
Proof: The proof is by induction on n. The statement is obvious for n =0. So
assume it holds for some n. Then, since x ≥ 0,
(1 + x)
n+1
=(1+x)
n
(1 + x) ≥ (1 + nx)(1 + x)
=1+(n +1)x + nx
2
≥ 1+(n +1)x.
This proves the result for n +1.
Lemma 2. inf{b
1/n
: n ∈ N} = 1. (Recall that b>1andN = {1, 2, 3,...}.)
Proof: Clearly 1 is a lower bound. (Indeed, (b
1/n
)
n
= b>1=1
n
,sob
1/n
> 1.) We
show that 1 +x is not a lower bound when x>0. If 1 + x were a lower bound, then
1+x ≤ b
1/n
would imply (1 + x)
n
≤ (b
1/n
)
n
= b for all n ∈ N. By Lemma 1, we
would get 1 + nx ≤ b for all n ∈ N, which contradicts the Archimedean property
when x>0.
Lemma 3. sup{b
−1/n
: n ∈ N} =1.
Proof: Part (b) shows that b
−1/n
b
1/n
= b
0
= 1, whence b
−1/n
=(b
1/n
)
−1
. Since
all numbers b
−1/n
are strictly positive, it now follows from Lemma 2 that 1 is an
upper bound. Suppose x<1 is an upper bound. Then x
−1
is a lower bound for
4 MATH 413 [513] (PHILLIPS) SOLUTIONS TO HOMEWORK 1
{b
1/n
: n ∈ N}. Since x
−1
> 1, this contradicts Lemma 2. Thus sup{b
−1/n
: n ∈
N} = 1, as claimed.
Lemma 4. b
x
= sup(B
0
(x)) for x ∈ R.
Proof: If x 6∈ Q, then B
0
(x)=B(x), so there is nothing to prove. If x ∈ Q,
then at least B
0
(x) ⊂ B(x), so b
x
≥ sup(B
0
(x)). Moreover, Part (b) shows that
b
x−1/n
= b
x
b
−1/n
for n ∈ N. The numbers b
x−1/n
are all in B
0
(x), and
sup{b
x
b
−1/n
: n ∈ N} = b
x
sup{b
−1/n
: n ∈ N}
because b
x
> 0, so using Lemma 3 in the last step gives
sup(B
0
(x)) ≥ sup{b
x−1/n
: n ∈ N} = b
x
sup{b
−1/n
: n ∈ N} = b
x
.
Now we can prove the formula b
x+y
= b
x
b
y
. We start by showing that b
x+y
≤
b
x
b
y
, which we do by showing that b
x
b
y
is an upper bound for B
0
(x + y). Thus let
r ∈ Q satisfy r<x+y. Then there are s
0
,t
0
∈ R such that r = s
0
+t
0
and s
0
<x,
t
0
<y. Choose s, t ∈ Q such that s
0
<s<xand t
0
<t<y. Then r<s+ t,so
b
r
<b
s+t
= b
s
b
t
≤ b
x
b
y
. This shows that b
x
b
y
is an upper bound for B
0
(x + y).
(Note that this does not work using B(x + y). If x + y ∈ Q but x, y 6∈ Q, then
b
x+y
∈ B(x + y), but it is not possible to find s and t with b
s
∈ B(x), b
t
∈ B(y),
and b
s
b
t
= b
x+y
.)
We now prove the reverse inequality. Suppose it fails, that is, b
x+y
<b
x
b
y
. Then
b
x+y
b
y
<b
x
.
The left hand side is thus not an upper bound for B
0
(x), so there exists s ∈ Q with
s<xand
b
x+y
b
y
<b
s
.
It follows that
b
x+y
b
s
<b
y
.
Repeating the argument, there is t ∈ Q with t<ysuch that
b
x+y
b
s
<b
t
.
Therefore
b
x+y
<b
s
b
t
= b
s+t
(using Part (b)). But b
s+t
∈ B
0
(x + y) because s + t ∈ Q and s + t<x+ y, so this
is a contradiction. Therefore b
x+y
≤ b
x
b
y
.
Problem 1.9: Define a relation on C by w<zif and only if either Re(w) < Re(z)
or both Re(w)=Re(z) and Im(w ) < Im(z). (For z ∈ C, the expressions Re(z)
and Im(z) denote the real and imaginary parts of z.) Prove that this makes C an
ordered set. Does this order have the least upper bound property?
Solution: We verify the two conditions in the definition of an order. For the first,
let w, z ∈ C. There are three cases.
Case 1: Re(w) < Re(z). Then w<z, but w = z and w>zare both false.
Case 2: Re(w) > Re(z). Then w>z, but w = z and w<zare both false.
MATH 413 [513] (PHILLIPS) SOLUTIONS TO HOMEWORK 1 5
Case 3: Re(w)=Re(z). This case has three subcases.
Case 3.1: Im(w) < Im(z). Then w<z, but w = z and w>zare both false.
Case 3.2: Im(w) > Im(z). Then w>z, but w = z and w<zare both false.
Case 3.3: Im(w)=Im(z). Then w = z, but w>zand w<zare both false.
These cases exhaust all possibilities, and in each of them exactly one of w<z,
w = z,andw>zis true, as desired.
Now we prove transitivity. Let s<wand w<z. If either Re(s) < Re(w)
or Re(w) < Re(z), then clearly Re(s) < Re(z), so s<z.IfRe(s)=Re(w)
and Re(w)=Re(z), then the definition of the order requires Im(s) < Im(w)and
Im(w) < Im(z). We thus have Re(s)=Re(z) and Im(s) < Im(z), so s<zby
definition.
It remains to answer the last question. We show that this order does not have
the least upper bound property. Let S = {z ∈ C :Re(z) < 0}. Then S 6= ∅ because
−1 ∈ S,andS is bounded above because 1 is an upper bound for S.
We show that S does not have a least upper bound by showing that if w is an
upper bound for S, then there is a smaller upper bound. First, by the definition of
the order it is clear that Re(w) is an upper bound for
{Re(z): z ∈ S} =(−∞, 0).
Therefore Re(w) ≥ 0. Moreover, every u ∈ C with Re(u) ≥ 0 is in fact an upper
bound for S. In particular, if w is an upper bound for S, then w − i<wand has
the same real part, so is a smaller upper bound.
Note: A related argument shows that the set T = {z ∈ C:Re(z) ≤ 0} also has
no least upper bound. One shows that w is an upper bound for T if and only if
Re(w) > 0.
Problem 1.13: Prove that if x, y ∈ C, then ||x|−|y|| ≤ |x −y|.
Solution: The desired inequality is equivalent to
|x|−|y|≤|x −y| and |y|−|x|≤|x − y |.
We prove the first; the second follows by exchanging x and y.
Set z = x − y. Then x = y + z. The triangle inequality gives |x|≤|y| + |z|.
Substituting the definition of z and subtracting |y| from both sides gives the result.
Problem 1.17: Prove that if x, y ∈ R
n
, then
kx + yk
2
+ kx − yk
2
=2kxk
2
+2kyk
2
.
Interpret this result geometrically in terms of parallelograms.
Solution: Using the definition of the norm in terms of scalar products, we have:
kx + yk
2
+ kx − yk
2
= hx + y, x + yi + hx − y, x − yi
= hx, xi + hx, yi + hy, xi + hy, yi
+ hx, xi−hx, yi−hy, xi+ hy, yi
=2hx, xi+2hy, yi =2kxk
2
+2kyk
2
.
The interpretation is that 0,x,y,x+ y are the vertices of a parallelogram, and
that kx + yk and kx −yk are the lengths of its diagonals while kxk and kyk are each
剩余106页未读,继续阅读
youwubing
- 粉丝: 1
- 资源: 12
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
- 1
- 2
前往页