• 沒有找到結果。

Let F : V → R be the function F (u

N/A
N/A
Protected

Academic year: 2022

Share "Let F : V → R be the function F (u"

Copied!
4
0
0

加載中.... (立即查看全文)

全文

(1)

1. Homework 2

(1) Let V = C([0, 1]) be the space of real valued continuous functions on [0, 1] equipped with the sup-norm

kuk= sup

x∈[0,1]

|u(x)|, u ∈ V.

Let F : V → R be the function F (u) =

Z 1

0

u(x)3dx, u ∈ V.

Let u0∈ V be a nonzero element in V.

(a) Let T : V → R be the map T (h) =

Z 1 0

3u0(x)2h(x)dx.

Prove that T is a bounded linear map.

(b) Assume that khk< ku0k. Prove that

|F (u0+ h) − F (u0) − T (h)| ≤ 4ku0kkhk2.

(c) Prove that f is differentiable at u0 and find DF (u0). (In fact, we do not need to assume that u0 = 0.)

(d) Let f : R → R be any smooth function and F : V → R, F (u) =

Z 1 0

f (u(x))dx.

Is F differentiable at u ∈ V ? If it is differentiable at u, prove or disprove that DF (u)(h) =

Z 1 0

f0(u(x))h(x)dx.

(Hint: mean value theorem and the continuity of f0(t),). Do the case when f : R → R is a polynomial (function).

(2) Let U be an open subset of Rn and f : U → Rm be a function. Let u be a nonzero vector in Rn. Recall that the directional derivative1of f at p ∈ U along u is defined to be

Duf (p) = lim

t→0

1

t(f (p + tu) − f (p)).

(a) Let u be any vector in Rn. Show that if f is differentiable at p, then the direc- tional derivative of f at p along u exists and equals Df (p)(u), i.e.

(1.1) Duf (p) = Df (p)(u).

This implies that if f is differentiable at p, then Duf (p) is a linear map from Rn to Rm in u.

(b) Verify that (1.1) holds in the case when f : R2 → R2, f (x, y) = (x2 − y2, 2xy) and p = (2, 1) and u = (1, 1).

(3) Prove that the function

f : R2 → R, f (x, y) =p|xy|

is not differentiable at (0, 0).

1In Advanced Calculus I, we require u to be a unit vector. In fact, we can drop this assumption.

1

(2)

2

(4) Prove that if α > 1/2 the function f (x, y) =

(|xy|αlog(x2+ y2) if (x, y) 6= (0, 0)

0 if (x, y) = (0, 0)

is differentiable on R2. (5) Prove that the function

f (x, y) =

x3− xy2

x2+ y2 if (x, y) 6= (0, 0) 0 if (x, y) = (0, 0)

is continuous on R2, has first order partial derivatives everywhere on R2 but is not differentiable at (0, 0).

(6) (Product Rule) Let U be an open subset of Rn and f, g : U → R be functions.

Suppose that f and g are differentiable at p. Show that (1.2) D(f g)(p) = g(p)Df (p) + f (p)D(g)(p).

Let f (x, y) = x − y, g(x, y) = x2− y2, p = (1, 1). Verify (1.2) holds for the given f, g and p.

(7) (Quotient Rule) Let U be an open subset of Rn and f : U → R be a function.

Suppose that f is differentiable at p with f (p) 6= 0.

(a) Show that there exists δ > 0 such that f (p + h) 6= 0 for any khk < δ.

(b) Prove that Df (p)(h)/khk is bounded for all h 6= 0.

(c) Let T = −(Df )(p)/f2(p). Show that if khk < δ, 1

f (p + h) − 1

f (p)− T (h) = f (p) − f (p + h) + Df (p)(h) f (p)f (p + h)

+(f (p + h) − f (p))Df (p)(h) f2(p)f (p + h) . (d) Prove that 1/f (x) is differentiable at x = p and

D 1 f



(p) = −Df (p) f2(p).

(e) Suppose g : U → R is a function differentiable at a. Prove that D g

f



(p) = f (p)Dg(p) − g(p)Df (p)

f2(p) .

Computational Problems

(8) Let f (x, y, z) = (x − z, x + z), g(x, y, z) = (xyz, x2− y2), for (x, y, z) ∈ R3 and p = (1, 1, 1). Find D(f + g)(p) and D(3f − 2g)(p).

Let V and W be n and m dimensional real vector spaces. Suppose that β = {v1, · · · , vn} and γ = {w1, · · · , wm} are basis for V and for W respectively. For each v ∈ V, we write

x = x1v1+ x2v2+ · · · + xnvn

(3)

3

for x1, · · · , xn∈ R. The n × 1 matrix [v]β =

 x1 x2

... xn

is called the coordinate (matrix)

representation of v with respect to β. If T : V → W is a linear map, we denote [T ]γβ =[T (v1)]γ [T (v2)]γ · · · [T (vn)]γ .

The m × n real matrix [T ]γβ is called the matrix representation of T with respect to β and γ. One can easily verify that

[T (v)]γ = [T ]γβ[v]β.

Let f : U → Rm be a function defined on an open subset U of Rn and p ∈ U be a point. We write f = f (x1, · · · , xn). If f is differentiable at p, then the matrix representation of Df (p) with respect to the standard basis for Rn and Rm is given by

[Df (p)]γ=

 ∂f

∂x1

(p)



γ

 ∂f

∂x2

(p)



γ

· · ·  ∂f

∂xn

(p)



γ

 . For example, if f (x, y, z) = (f (x, y, z), g(x, y, z)), then

∂f

∂x = (fx, gx), ∂f

∂y = (fy, gy), ∂f

∂z = (fz, gz) and hence

 ∂f

∂x



γ

=fx gx



,  ∂f

∂y



γ

=fy gy



,  ∂f

∂z



γ

=fz gz



which gives

[Df (x, y, z)] =fx(x, y, z) fy(x, y, z) fz(x, y, z) gx(x, y, z) gy(x, y, z) gz(x, y, z)

 .

(9) Let f : R3 → R2, f (x, y, z) = (x4y, xez). Compute Df (x, y, z). Find the matrix representation of Df with respect to the standard basis for R3 and R2, i.e. find [Df (x, y, z)]γβ where β and γ are the standard basis for R3 and R2 respectively.

Check the equation

[Df (x, y, z)(h)]γ = [Df (x, y, z)]γβ[h]β to see if your calculation is correct.

(10) Let f : R3 → R, f(x, y, z) = ex2+y2+z2. Compute Df (x, y, z). Find the matrix representation of Df (x, y, z) with respect to the standard basis for R3 and R, i.e.

find [Df (x, y)]γβ where β and γ are the standard basis for R3 and R respectively.

Also Check

[Df (x, y, z)(h)]γ = [Df (x, y, z)]γβ[h]β.

(11) Let U = R2\ {(x, y) ∈ R2 : x = 0} and f : U → R2, f (x, y) = (xy, y/x).

(a) Compute Df (x, y).

(b) Compute the matrix representation of Df (x, y) with respect to the standard basis for R2, i.e. find [Df (x, y)]β where β is the standard basis for R2.

(c) Compute the matrix representation of Df (x, y) with respect to the basis γ = {(1, 0), (1, 1)} i.e. find [Df (x, y)]γ.

(4)

4

(d) Check

[Df (x, y)(h)]γ = [Df (x, y)(h)]γ[h]γ.

參考文獻

相關文件

We complete the proof of

Hence if we know g, the restriction of f to the boundary of S 1 , and express g as an infinite series of the form (1.2), then we can find (solve for) f.. We need the notion of

Let {f n } be a sequence of real-valued continuous functions on [a, b] which converges uniformly to a continuous function f on

Generalization Theorem Let f be integrable on K = [a, b] × [c, d] to R and suppose that for each y ∈ [c, d], the function x 7→ f (x, y) of [a, b] into R is continuous except

Let F be the field of real numbers or the field of

The time complexity of flatten is Θ(n 2 ) (in the worst case), where n is the number of Tip nodes in the tree.... A simple observation shows that there are exactly n − 1 Bin

[r]

In fact, we can define the operator norm of T using other norms on R n not only the Euclidean norm of x... Show that f is