Solutions of Homework Set #1 For Math 301
Solutions of Homework Set #1 For Math 301
x=0
= 0,
F
y
(0, 0) =
_
d
dy
F(0, y)
_
y=0
= 0 imply T = 0.
F(x, y) F(0, 0) T(x 0, y 0)
(x, y) (0, 0)
=
x
2
|y| y
2
|x|
_
x
2
+ y
2
= r
2
cos
2
| sin | sin
2
| cos |
2r
2
0
as (x, y) (0, 0). Therefore, F is dierentiable at (0, 0).
(c) F(x, 1) = x
2
|x| is not dierentiable when x = 0. So
F
x
(0, 1) does not exist. By the dierentiation
theorem, F cannot be dierentiable at (0, 1).
2. Let v
i
= (x
i1
, . . . , x
in
). If v
1
, v
2
, v
3
, . . . is a Cauchy sequence in R
n
, then by the useful inequality and
the denition of Cauchy sequence, for every > 0, there exists K N such that i, j K implies
|x
im
x
jm
| v
i
v
j
< for m = 1, . . . , n. So the sequences x
1m
, x
2m
, x
3m
, . . . are Cauchy sequences
in R. By Cauchys theorem, x
1m
, x
2m
, x
3m
, . . . converges to some number l
m
R. By practice exercise
#2, v
1
, v
2
, v
3
, . . . converges to L = (l
1
, . . . , l
n
).
3. Dene F : R
2
R
2
by F(x, y) = (s, t), where s = (cos x) e
y
, t = e
x
+ sin y. Now
s
x
= sin x,
s
y
= e
y
,
t
x
= e
x
,
t
y
= cos y
are continuous near (x, y) = (0, 0). So F is C
1
near (x, y) = (0, 0). Also,
det F
(0, 0) =
(s, t)
(x, y)
(0, 0) =
0 1
1 1
= 1 = 0.
By the inverse function theorem, near (x, y) = (0, 0), (x, y) can be expressed as a dierentiable function
of (s, t). At (s, t) = (0, 1),
_
x
s
x
t
y
s
y
t
_
=
_
0 1
1 1
_
1
=
_
1 1
1 0
_
.
Therefore,
x
s
= 1,
x
t
= 1,
y
s
= 1,
y
t
= 0.
4. Dene F : R
5
R
2
by F(u, v, x, y, z) = (f
1
, f
2
), where f
1
(u, v, x, y, z) = 2u
2
+ x + yv z 2 and
f
2
(u, v, x, y, z) = u + v + xu + xy
2
2. Since
f
1
u
= 4u,
f
1
v
= y,
f
1
x
= 1,
f
1
y
= v,
f
1
z
= 1,
f
2
u
= 1 + x,
f
2
v
= 1,
f
2
x
= u + y
2
,
f
2
y
= 2xy,
f
2
z
= 0
are continuous near p, F is C
1
near p. Now F(p) = (0, 0) and
(f
1
, f
2
)
(x, y)
(p) =
1 1
5 0
= 5 = 0. By the
implicit function theorem, (x, y) = 0 can be expressed as a dierentiable function of (z, u, v) near p.
Taking partial derivatives of both sides of the equations with respect to z, we have
x
z
+
y
z
v = 1 and
x
z
u +
x
z
y
2
+ 2xy
y
z
= 0.
When (z, u, v) = (2, 1, 1), we have
x
z
+
y
z
= 1 and
x
z
+ 4
x
z
= 0. Solving these, we get
x
z
= 0 and
y
z
= 1. (Alternatively, by practice exercise #22, there we have
x
z
=
1 1
0 0
_
(5) = 0 and
y
z
=
1 1
5 0
_
(5) = 1.)
5. (a) Let A, B have entries a
ij
, b
ji
(i = 1, 2, . . . , m; j = 1, 2, . . ., n), respectively.
tr(AB) =
m
i=1
_
n
j=1
a
ij
b
ji
. .
ith row sum
_
=
a
11
b
11
+ a
12
b
21
+ + a
1n
b
n1
+a
21
b
12
+ a
22
b
22
+ + a
2n
b
n2
+
+a
m1
b
1m
+ a
m2
b
2m
+ + a
mn
b
nm
=
n
j=1
_
m
i=1
b
ji
a
ij
. .
jth column sum
_
= tr(BA).
(b) Note both sides of F
1
_
F(x)
_
= x are functions fromR
n
to R
n
. The right side is the identity function,
which is a linear transformation. Dierentiating both sides at a R
n
, we get
_
F
1
_
_
F(a)
. .
=b
_
F
(a) = I
n
,
where I
n
is the n n identity matrix. Similarly, both sides of F
_
F
1
(y)
_
= y are functions from R
m
to R
m
. Dierentiating both sides at b R
m
, we get F
_
F
1
(b)
. .
=a
__
F
1
_
(b) = I
m
, where I
m
is the mm
identity matrix. Since F
(a), (F
1
)
(a)
_
F
1
_
(b)
_
= tr
_
_
F
1
_
(b)F
(a)
_
= tr(I
n
) = n.