(18) Let f and g be functions from R to R that have derivatives of al orders. Let h(k) denote the...
Let n be a non-negative integer. Letf() be such that f(x), f'(x).f"(x).,fn+exist, and are continuous, on an interval containing a. In this assignment, you will prove by induction on n that for any r in that interval f'(c) f"(c) fm (c) (t) (x -t)" dt. 7n n! 1. (a) Explain why the claim given above is true for n-0 (b) Use the fact that the claim is true for n-0 to explain why the claim is true for n =...
B2. (a) Let I denote the interval 0,1 and let C denote the space of continuous functions I-R. Define dsup(f,g)-sup |f(t)-g(t) and di(f.g)f (t)- g(t)ldt (f,g E C) tEI (i) Prove that dsup is a metric on C (ii) Prove that di is a metric on C. (You may use any standard properties of continuous functions and integrals, provided you make your reasoning clear.) 6 i) Let 1 denote the constant function on I with value 1. Give an explicit...
Let f(n) = 5n^2. Prove that f(n) = O(n^3). Let f(n) = 7n^2. Prove that f(n) = Ω(n). Let f(n) = 3n. Prove that f(n) =ꙍ (√n). Let f(n) = 3n+2. Prove that f(n) = Θ (n). Let k > 0 and c > 0 be any positive constants. Prove that (n + k)c = O(nc). Prove that lg(n!) = O(n lg n). Let g(n) = log10(n). Prove that g(n) = Θ(lg n). (hint: ???? ? = ???? ?)???? ?...
3. Let f, g : a, bl → R be functions such that f is integrable, g is continuous. and g(x) >0 for al x E [a, b]. Since both f,g are bounded, let K> 0 be such that f(x)| 〈 K and g(x)-K for all x E la,b] (a) Let η 〉 0 be given. Prove that there is a partition P of a,b] such that for all i (b) Let P be a partition as in (a). Prove...
(8) Let E c R" and G C Rm be open. Suppose that f E -G and g:GR', so that h -gof:E R'. Prove that if f is differentiable at a point x E E and if g is differentiable at f(x) є G, then the partial derivatives Dh,(x) exist, for all , SO , . . . , n, and and J-: に1 The subscripts hi, 9i, k denote the coordinates of the functions h, g, f relative to...
(A and C) Exercise 1.14. If n and k are integers, define the binomial coeffi- cient (m), read n choose k, by n! if 0 <k <n, = 0 otherwise. k!(n - k)! (a) Prove that ("#") = (m) + (-2) for all integers n and k. (b) By definition, () = 1 if k = 0 and 0 otherwise. The recursion relation in (a) gives a computational procedure, Pascal's triangle, for calculating binomial coefficients for small n. Start with...
(1) Let fn} be a sequence of C1 functions from the interval 0, 1] to R such that for some M 0 there holds fn(0) |(x)|< M, for al E [0, 1], nEN. Prove that there is a subsequence {fng} converging uniformly to a function f e C((0, 1]) on 0, 1]. (1) Let fn} be a sequence of C1 functions from the interval 0, 1] to R such that for some M 0 there holds fn(0) |(x)|
3. Let f, g : a, b] → R be functions such that f is integrable, g is continuous. and g(x) 〉 0 for all x є a,b]. Since both f, g are bounded, let K 〉 0 be such that |f(x) K and g(x) < K for all x E [a,b (a) Let n > 0 be given. Prove that there is a partition P of [a, b such that for all i 2. (b) Let P be a...
*4, Let U be an open subset of R" and f:U-R" a function whose component functions have continuous partial derivatives. We say that f is an immersion if Dsf is injective for all v in U and a submersion if Dof is surjective for allv in U. (a) Suppose that f:U-R" is an immersion. Prove that, for each v in U, we can find an open set V of U containing v, an open set W of R" containing f...
(a) Let Sk: KCR + R" be an equicontinuous sequence of functions on a compact set K converging pointwise. Prove that the convergence is uniform. (a) Use (a) to obtain that fn(x) x2 x2 +(1-nx)2, 0 < x < 1 is not equicontinuous. =