Constructing Approximations to Functions

Similar documents
An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim

Math 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

Solutions Final Exam May. 14, 2014

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

Iowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions

Problem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1

L p Functions. Given a measure space (X, µ) and a real number p [1, ), recall that the L p -norm of a measurable function f : X R is defined by

6x 2 8x + 5 ) = 12x 8

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

Real Analysis Math 125A, Fall 2012 Sample Final Questions. x 1+x y. x y x. 2 (1+x 2 )(1+y 2 ) x y

Vector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.

e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form

Functions. Chapter Continuous Functions

4.4 Uniform Convergence of Sequences of Functions and the Derivative

Math 209B Homework 2

Sobolev spaces. May 18

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N

7: FOURIER SERIES STEVEN HEILMAN

Tips and Tricks in Real Analysis

Fall TMA4145 Linear Methods. Solutions to exercise set 9. 1 Let X be a Hilbert space and T a bounded linear operator on X.

converges as well if x < 1. 1 x n x n 1 1 = 2 a nx n

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6

Solutions Final Exam May. 14, 2014

x y More precisely, this equation means that given any ε > 0, there exists some δ > 0 such that

LEBESGUE INTEGRATION. Introduction

Mathematics 426 Robert Gross Homework 9 Answers

Introductory Analysis 2 Spring 2010 Exam 1 February 11, 2015

Selected solutions for Homework 9

Cauchy Sequences. x n = 1 ( ) 2 1 1, . As you well know, k! n 1. 1 k! = e, = k! k=0. k = k=1

Entrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems

Continuity. Chapter 4

2. If the values for f(x) can be made as close as we like to L by choosing arbitrarily large. lim

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy

COMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM

Math 5051 Measure Theory and Functional Analysis I Homework Assignment 2

Notes on uniform convergence

Summer Jump-Start Program for Analysis, 2012 Song-Ying Li. 1 Lecture 7: Equicontinuity and Series of functions

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

f(f 1 (B)) B f(f 1 (B)) = B B f(s) f 1 (f(a)) A f 1 (f(a)) = A f : S T 若敘述為真則證明之, 反之則必須給反例 (Q, ) y > 1 y 1/n y t > 1 n > (y 1)/(t 1) y 1/n < t

x x 1 x 2 + x 2 1 > 0. HW5. Text defines:

Calculus 2502A - Advanced Calculus I Fall : Local minima and maxima

Main topics for the First Midterm Exam

Math 328 Course Notes

Implicit Functions, Curves and Surfaces

1 Homework. Recommended Reading:

Review all the activities leading to Midterm 3. Review all the problems in the previous online homework sets (8+9+10).

REAL ANALYSIS II: PROBLEM SET 2

Hilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote

Exercises given in lecture on the day in parantheses.

5. Some theorems on continuous functions

Continuity. Chapter 4

By (a), B ε (x) is a closed subset (which

Math 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1

Methods of Mathematical Physics X1 Homework 3 Solutions

Math 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.

Advanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.

Immerse Metric Space Homework

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

REVIEW OF ESSENTIAL MATH 346 TOPICS

5.9 Representations of Functions as a Power Series

Assignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous.

THE INVERSE FUNCTION THEOREM

Homework for Section 1.4, Continuity and One sided Limits. Study 1.4, # 1 21, 27, 31, 37 41, 45 53, 61, 69, 87, 91, 93. Class Notes: Prof. G.

Most Continuous Functions are Nowhere Differentiable

Austin Mohr Math 704 Homework 6

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

Definition: If y = f(x), then. f(x + x) f(x) y = f (x) = lim. Rules and formulas: 1. If f(x) = C (a constant function), then f (x) = 0.

MATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS

REAL AND COMPLEX ANALYSIS

2019 Spring MATH2060A Mathematical Analysis II 1

Taylor and Maclaurin Series. Approximating functions using Polynomials.

MATH 408N PRACTICE MIDTERM 1

1 Definition of the Riemann integral

TAYLOR AND MACLAURIN SERIES

A = (a + 1) 2 = a 2 + 2a + 1

dy = f( x) dx = F ( x)+c = f ( x) dy = f( x) dx

MATH 217A HOMEWORK. P (A i A j ). First, the basis case. We make a union disjoint as follows: P (A B) = P (A) + P (A c B)

Lecture 7 - Separable Equations

In class midterm Exam - Answer key

OBJECTIVE Find limits of functions, if they exist, using numerical or graphical methods.

Exercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.

Differentiation. Table of contents Definition Arithmetics Composite and inverse functions... 5

Math 456: Mathematical Modeling. Tuesday, April 9th, 2018

Math 253 Homework due Wednesday, March 9 SOLUTIONS

MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions.

Unit #10 : Graphs of Antiderivatives, Substitution Integrals

MS 2001: Test 1 B Solutions

MA4001 Engineering Mathematics 1 Lecture 15 Mean Value Theorem Increasing and Decreasing Functions Higher Order Derivatives Implicit Differentiation

Derivatives in 2D. Outline. James K. Peterson. November 9, Derivatives in 2D! Chain Rule

Tangent Lines Sec. 2.1, 2.7, & 2.8 (continued)

STA 4321/5325 Solution to Homework 5 March 3, 2017

(x + 3)(x 1) lim(x + 3) = 4. lim. (x 2)( x ) = (x 2)(x + 2) x + 2 x = 4. dt (t2 + 1) = 1 2 (t2 + 1) 1 t. f(x) = lim 3x = 6,

Sections 2.1, 2.2 and 2.4: Limit of a function Motivation:

Georgia Department of Education Common Core Georgia Performance Standards Framework CCGPS Advanced Algebra Unit 2

Homework 27. Homework 28. Homework 29. Homework 30. Prof. Girardi, Math 703, Fall 2012 Homework: Define f : C C and u, v : R 2 R by

Transcription:

Constructing Approximations to Functions Given a function, f, if is often useful to it is often useful to approximate it by nicer functions. For example give a continuous function, f, it can be useful to find a sequence of differentiable functions f 1, f 2, f 3,... that converge to f uniformly. Here we give one of the basic methods for doing this. Definition 1. A sequence of functions K 1, K 2, K 3,... defined on R is a Dirac sequence, or an approximation to the identity iff it satisfies the following conditions. (a) K n for all k, (b) For all n (c) For all δ > K n (x) dx 1. lim K n (x) dx. x δ The condition (c) say that all most all of the mass of K n is in ( δ, δ). δ δ For large n almost all of the area under the graph of y K n (x) is between δ and δ. Here is a standard method of constructing Dirac sequences. Proposition 2. Let ϕ: R R be a Riemann integrable function with ϕ, and Then K n (x) nϕ(nx) is a Dirac sequence. Problem 1. Prove this. ϕ(x) dx 1.

2 Theorem 3. Let f be a bounded continuous function on R and K n n1 be a Dirac sequence. Let then pointwise. f(x y)k n (y) dy lim f n(x) f(x) Problem 2. Prove this. Hint: The basic trick is to note that as K n(y) dy 1 we have f(x) f(x) 1 f(x) Therefore for any δ > we have f(x) (1) y <δ f(x)k n (y) dy K n (y) dy f(x y)k n (y) dy (f(x) f(x y))k n (y) dy (f(x) f(x y))k n (y) dy + I δ,n (x) + J δ,n (x). f(x)k n (y) dy. y δ (f(x) f(x y))k n (y) dy Now let ε >. Then as f is continuous at x there is a δ > such that y x < δ f(x) f(y) < ε 2. Explain why the following holds ( ε ) I δ,n (x) f(x) f(x y) K n (y) dy < K n (y) dy ε y <δ y <δ 2 2. Using this in the displayed sequence of equalities (1) gives f(x) f n (x) I δ,n (x) + J δ,n (x) < ε 2 + J δ,n(x). This holds for all n. The function f is bounded thus there is a constant B such that f(x) B for all x. It follows that for all x, y R that Therefore J δ,n f(x) f(x y) f(x) + f(x y) 2B. y δ f(x) f(x y) K n (y) dy 2B K n (y) dy. y δ If you now look back at the definition of a Dirac sequence you should be able to use the last inequality to show lim J δ,n(x) and thus there is a N such that n > N implies J δ,n (x) < ε/2.

We can do a bit better. Theorem 4. Let f function on R that is both bounded and uniformly continuous and let K n n1 be a Dirac sequence. Define Then uniformly on R. f(x y)k n (y) dy. lim f n(x) f(x) Problem 3. Prove this. Hint: This is just a matter of rewriting the proof of Theorem 3 and making sure that you can make the choices of quantities such as δ and N in a way that is independent of x. The following gives a large number of examples of functions where Theorem 4 applies. Proposition 5. Let f be a continuous function such that for some interval [α, β] we have f(x) for all x / [α, β]. Then f is bounded and uniformly continuous. Problem 4. Prove this. Hint: This is a good problem to review several of the results we have been working with. (Continuous on closed bounded intervals are bounded and uniformly continuous). Proposition 6. Let f be bounded and continuous on R and let K n n1 be a Dirac sequence and Then f n can be rewritten as f(x y)k n (y) dy. f(y)k n (x y) dy Problem 5. Prove this. Hint: As far as y is concerned, x is a constant. So if we do the change of variable z x y we have dz dy. Remark 7. In what follows we will use which ever formula for f n given by Proposition 6 that it convenient without refering Proposition 6. We are now in a position to prove one of the most famous theorems in analysis, the Weierstrass Approximation Theorem, which says that a continuous function on a closed bounded interval can be uniformly approximated by a polynomial. To start we need a Dirac sequence that is constructed from polynomials. Lemma 8. Let K n (x) : { c n (1 x 2 ) n, x 1;, x >. 3

4 where c n : 1 Then K n n1 is a Dirac sequence. 1. (1 x 2 ) n dx Proof. That K n and K n(x) dx 1 are easy, so it remains to show that for δ > the limit lim x δ K n(x) dx. We first give a bound on c n. 1 (1 x 2 ) n dx 2 (1 + x) n (1 x) n dx 2 (1 x) n dx 2 n + 1. Thus c n n + 1. 2 Let < δ < 1. Then K n (x) dx 2c n (1 x 2 ) n dx 2c n (1 δ) n dx (n+1)(1 δ 2 ) n. x δ δ But (1 δ 2 ) < 1 so lim (n + 1)(1 δ 2 ) n which completes the proof. δ The graphs of y K n (x) for n 1, 2,..., 1. Problem 6. While the exact value of 1 (1 x2 ) n dx is not needed in the last proof, it is fun to compute it. So find 1 (1 x2 ) n dx. Hint: This is a case where it pays to generalize. Let I(m, n) : 1 (1 x) m (1 + x) n dx.

Then we are trying to compute I(n, n). Use integration by parts to show I(m, n) m I(m 1, n + 1) n + 1 when m 1 and n and note that I(, k) 1 (1 + x)k dx is easy to compute. Proposition 9. Let f : R R be a continuous function so such that f(x) for all x / [, 1] and let K n be as in Lemma 8. Set p n (x) 1 then p n f uniformly and the restriction of p n to [, 1] is a polynomial. Proof. By Proposition 5 f is bounded and uniformly continuous. Let B be a bound for f, that is f(x) B for all x R. As f is uniformly continuous for ε > here is a δ >, such that x y δ and x, y [, 1] f(x) f(y) ε. As f is bounded and uniformly continuous, Theorem 4 implies p n f uniformly. All that remains is to show that p n restricted to [, 1] is a polynomial. If x, y [, 1], then x y [ 1, 1] and therefore K n (x y) c n (1 (x y) 2 ) n g (y) + g 1 (y)x + g 2 (y)x 2 + + g 2n (y)x 2n 2n k g k (y)x k where we have just expanded c n (1 (x y) 2 ) n and grouped by powers of x. (Each g k (y) is a polynomial in y, but this does not really matter for us.) As f(y) for y / [, 1] if x [, 1] we have f n (x) : which is clearly a polynomial. 2n k 2n k ( g k (y)x k f(y) dy ) g k (y) dy x k Lemma 1. Let f : [α, β] R be a continuous function with f(x) for x / [α, β]. Define F : [, 1] R to be the function F (x) : f (α + (β α)x) 5

6 and let P n : [, 1] R be polynomials such that P n F uniformly and set ( ) x α p n (x) P n. β α Then each p n is a polynomial and p n f uniformly. Problem 7. Prove this. Hint: This is not hard, so don t be long winded. Theorem 11 (Weierstrass Approximation Theorem). Let f : [a, b] R be continuous. Then there is a sequence of polynomial p n : [a, b] R with p n f uniformly. Problem 8. Prove this. Hint: Extend f to R (we still denote the extended function by f) by, x < a 1; (x (a 1))f(a), a 1 x < a; f(x) : f(x), a x b; ((b + 1) x)f(b), b < x b + 1;, b + 1 < x. This is continuous (don t prove this, just draw the picture and say it is clear). Let α : a 1 and β b + 1. Then use Proposition 9 and Proposition 5 to complete the proof. We now give some applications of these results. Problem 9. Let f : [a, b] R be continuous and assume that b a f(x)x n dx for all n, 1, 2, 3,.... Then show f(x) for all x [a, b]. Hint: Show that b a f(x)p(x) dx all polynomials. Then choose a sequence of polynomials p n f uniformly. Use this sequence to conclude b a f(x)2 dx. Problem 1. Let f, g : [a, b] R be continuous functions such that b a f(x)x n dx b a g(x)x n dx for all n, 1, 2, 3,.... Show that f(x) g(x) for x [a, b]. Hint: Reduce this to the last problem. Convention. For the rest of this homework f : R R is a function such that for some b > we have f(x) for all x with x b and f is Riemann integrable on [ b, b] and that there is a constant B such that f(x) B for all x.

Theorem 12. If K k n1 is a Dirac sequence and K n (y)f(x y) dy then at any point x where f is continuous lim f n(x) f(x). Problem 11. Prove this. Hint: This is an easier version of an earlier theorem. Definition 13. A Dirac sequence K n n1 is differentiable iff for each n K n is differentiable and K n (x + h) K n (x) lim K h h n(x) uniformly. Explicitly this means that for each n and ε > there is a δ > such that (2) h δ K n (x + h) K n (x) K h n(x) ε for all x R Proposition 14. Let f be as in the convention and K k n1 a differentiable Dirac sequence. Then for each n is differentiable and f n(x) K n(x y)f(y) dy. (It is not being assumed that f is differentiable.) Problem 12. Prove this. Hint: First show ( ) fn (x + h) f n (x) K h n(x y)f(y) dy ( Kn (x y + h) K n (x y) h b ( Kn (x y + h) K n (x y) h b take absolute values and then use (2). ) K n(x y) f(y) dy ) K n(x y) f(y) dy Lemma 15. Let f be as in the convention and also assume that f is differentiable with f uniformly continuous and let K k n1 be a differentiable Dirac sequence. Then the derivative of 7

8 can be written as f n(x) K n (x y)f (y) dy Problem 13. Prove this. Hint: Starting with Proposition 7 show f n(x) K n(x y)f(y) dy ( ) d dy K n(x y) f(y) dy ( ) d dy K n(x y) f(y) dy b and use integration by parts along with f( b) f(b). b Theorem 16. Let f be as in the convention and also assume that f is differentiable with f uniformly continuous and let K k n1 be a differentiable Dirac sequence. Then if the limit holds uniformly. Problem 14. Prove this. lim f n f