Integration and Differentiation Limit Interchange Theorems

Similar documents
Integration and Differentiation Limit Interchange Theorems

Uniform Convergence and Series of Functions

Uniform Convergence Examples

Differentiating Series of Functions

The Existence of the Riemann Integral

Uniform Convergence Examples

The Limit Inferior and Limit Superior of a Sequence

General Power Series

Dirchlet s Function and Limit and Continuity Arguments

Upper and Lower Bounds

Bolzano Weierstrass Theorems I

Consequences of Continuity

Consequences of Continuity

Fourier Sin and Cos Series and Least Squares Convergence

Dirchlet s Function and Limit and Continuity Arguments

The Method of Laplace Transforms.

Mathematical Induction Again

Mathematical Induction Again

4130 HOMEWORK 4. , a 2

Convergence of Fourier Series

MATH 140B - HW 5 SOLUTIONS

Math 117: Infinite Sequences

Matrix Solutions to Linear Systems of ODEs

Geometric Series and the Ratio and Root Test

Predator - Prey Model Trajectories and the nonlinear conservation law

Linear Systems of ODE: Nullclines, Eigenvector lines and trajectories

Relationship Between Integration and Differentiation

Cable Convergence. James K. Peterson. May 7, Department of Biological Sciences and Department of Mathematical Sciences Clemson University

Project One: C Bump functions

Lower semicontinuous and Convex Functions

Hölder s and Minkowski s Inequality

5.5 Deeper Properties of Continuous Functions

More On Exponential Functions, Inverse Functions and Derivative Consequences

Predator - Prey Model Trajectories are periodic

Riemann Sums. Outline. James K. Peterson. September 15, Riemann Sums. Riemann Sums In MatLab

Riemann Integration. James K. Peterson. February 2, Department of Biological Sciences and Department of Mathematical Sciences Clemson University

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

Taylor Polynomials. James K. Peterson. Department of Biological Sciences and Department of Mathematical Sciences Clemson University

Riemann Integration. Outline. James K. Peterson. February 2, Riemann Sums. Riemann Sums In MatLab. Graphing Riemann Sums

Riemann Integration Theory

6.2 Deeper Properties of Continuous Functions

MATH 117 LECTURE NOTES

Geometric Series and the Ratio and Root Test

Linear Systems of ODE: Nullclines, Eigenvector lines and trajectories

Predator - Prey Model Trajectories are periodic

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

The First Derivative and Second Derivative Test

The First Derivative and Second Derivative Test

Fourier Sin and Cos Series and Least Squares Convergence

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.

MAT137 - Term 2, Week 2

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

FINAL EXAM Math 25 Temple-F06

Matrices and Vectors

In class midterm Exam - Answer key

Solutions Final Exam May. 14, 2014

The Derivative of a Function

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.

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

Solving systems of ODEs with Matlab

Defining Exponential Functions and Exponential Derivatives and Integrals

1 Definition of the Riemann integral

Math LM (24543) Lectures 02

DR.RUPNATHJI( DR.RUPAK NATH )

Convergence of Sequences

1 Homework. Recommended Reading:

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa

Getting Started With The Predator - Prey Model: Nullclines

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

Solutions Final Exam May. 14, 2014

Proofs Not Based On POMI

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Selected solutions for Homework 9

Constructing Approximations to Functions

More Series Convergence

5.5 Deeper Properties of Continuous Functions

Paul-Eugène Parent. March 12th, Department of Mathematics and Statistics University of Ottawa. MAT 3121: Complex Analysis I

Notes on uniform convergence

Elementary Analysis Math 140D Fall 2007

Functional Analysis F3/F4/NVP (2005) Homework assignment 2

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

Measure Theory and Lebesgue Integration. Joshua H. Lifton

Convergence of Sequences

Problem List MATH 5143 Fall, 2013

Antiderivatives! Outline. James K. Peterson. January 28, Antiderivatives. Simple Fractional Power Antiderivatives

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

Extreme Values and Positive/ Negative Definite Matrix Conditions

The SIR Disease Model Trajectories and MatLab

f (x) dx = F (b) F (a), where F is any function whose derivative is

Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function

Antiderivatives! James K. Peterson. January 28, Department of Biological Sciences and Department of Mathematical Sciences Clemson University

Riemann Integrable Functions

Math 61CM - Solutions to homework 6

2.4 The Extreme Value Theorem and Some of its Consequences

1 Stochastic Dynamic Programming

Sin, Cos and All That

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra

Logarithm and Exponential Derivatives and Integrals

Lebesgue-Radon-Nikodym Theorem

Transcription:

Integration and Differentiation Limit Interchange Theorems James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University March 11, 2018 Outline A More General Integral Interchange Theorem The Differentiation Interchange Theorem

Theorem Let (xn) be a sequence of Riemann Integrable functions on [a, b]. Let xn x on [a, b]. Then x is Riemann integrable on [a, b] and lim n b xn(t)dt = a b b ( lim xn(t))dt = x(t)dt. a n a If x is Riemann Integrable on [a, b], the argument we presented in the proof of first integral interchange theorem works nicely. So to prove this theorem it is enough to show x is Riemman Integrable on [a, b]. Let > 0 be given. since the convergence is orm, there is N so that xn(t) x(t) <, 5(b a) n > N, t [a, b] (α) Pick any ˆn > N. Since xˆn is integrable, there is a partition 0 so that U(xˆn, ) L(xˆn, ) < 5 (β) when is a refinement of 0. Since xn x, we can easily show x is bounded. So we can define Mj = sup x(t), mj = inf x(t) tj 1 t tj tj 1 t tj ˆMj = sup xˆn(t), ˆmj = inf xˆn(t) tj 1 t tj tj 1 t tj where {, t1,..., tp} are the points in the partition.

Using the infimum and supremum tolerance lemma, we can find points sj [tj 1, tj] and uj [tj 1, tj] so that Mj 5(b a) < x(sj) Mj (γ) Thus mj x(uj) < mj + 5(b a) (δ) U(x, ) L(x, ) = (Mj mj) tj = {Mj x(sj) + x(sj) xˆn(sj) + xˆn(sj) xˆn(uj) + xˆn(uj) x(uj) + x(uj) mj} tj Now break this into individual pieces: U(x, ) L(x, ) = (Mj x(sj)) tj + (x(sj) xˆn(sj)) tj + (xˆn(sj) xˆn(uj)) tj + (xˆn(uj) x(uj)) tj + (x(uj) mj) tj Using Equation γ and Equation δ we can overestimate the first and fifth term to get U(x, ) L(x, ) < 5(b a) tj + + (xˆn(sj) xˆn(uj)) tj + + 5(b a) tj (x(sj) xˆn(sj)) tj (xˆn(uj) x(uj)) tj

We know tj = b a and so simplifying a bit, we have U(x, ) L(x, ) < 2 5 + (x(sj) xˆn(sj)) tj + (xˆn(sj) xˆn(uj)) tj + (xˆn(uj) x(uj)) tj Now use Equation α in piece two and four above to get U(x, ) L(x, ) < 2 5 + 5(b a) tj + (xˆn(sj) xˆn(uj)) tj + < 4 5 + (xˆn(sj) xˆn(uj)) tj 5(b a) tj since like before 5(b a) tj = 5. Finally, xˆn(sj) xˆn(uj) ˆMj ˆmj and so U(x, ) L(x, ) < 4 5 + ( ˆMj ˆmj) tj = 4 + U(xˆn, ) L(xˆn, ) < 5 using Equation β. We conclude U(x, ) U(x, ) < for all refinements of 0 which shows x is Riemann Integrable on [a, b]. It remains to show the limit interchange portion of the theorem. As mentioned at the start of this proof, this argumen is the same as the one given in the first integral interchange theorem and so it does not have to be repeated.

We now consider another important theorem about the interchange of integration and limits of functions. We start with an illuminating example. Consider the sequence (xn) on [ 1, 1] where xn(t) = t/e nt2. It is easy to ptws see xn x where x(t) = 0 on [ 1, 1]. Taking the derivative, we see x n(t) = 1 2nt2 e nt2 and the critical points of xn are when 1 2nt 2 = 0 or at t = ±1/ 2n. We have studied this kind of sequence before but the other sequences had high peaks proportional to n which meant we could not get orm convergence on any interval [c, d] containing 0. In this sequence, the extreme values occur at ±1/ 2ne. Hence, the peaks hear decrease. We could illustrate this behavior with some carefully chosen Octave plots, but this time we will simply sketch the graph labeling important points.

Let Mn = sup 1 t 1 xn(t) x(t) = sup t 1 t 1 e = 1 nt2 2ne Since Mn 0, by the Weierstrass Theorem for Uniform Convergence, we have xn x. At t = 0, x n(0) = 1 for all n and so limn x n(t) = 1. But x (0) = 0 t=0 as x(t) = 0 on [ 1, 1]. Hence we conclude for this example that at t = 0 the differentiation interchange does not work: lim n x n(t) ( ) lim xn(t), n that is the interchange of convegence and differentiation fails here even though we have orm convergence of the sequence. Finally, since x n(t) = 1 2nt2, we see the pointwise limit of the derivative e nt2 sequence is y(0) = 1 but y(t) = 0 on [ 1, 0) (0, 1] which is not continuous. Since y is not continuous, x n y. What conditions are required to guarantee the derivative interchange result? Definition The sequence of functions (xn) on the set S satisfies the Uniform Cauchy Criterion if > 0, N xn(t) xm(t) <, for n > m > N and t S This can also be stated like this: > 0, N xn xm <, for n > m > N. We will abbreviate this with UCC.

Using the UCC, we can prove another test for orm convergence which is often easier to use. Theorem Let (xn) be a sequence of functions on the set S. Then ( ) x : S R xn x ( (xn) satisfies the UCC ). ( :) We assume there is an x : S R so that xn x. Then, given > 0, there is N so that xn(t) x(t) < /2 for all t S. Thus, if n > m > N, we have xn(t) xm(t) = xn(t) x(t) + x(t) xm(t) xn(t) x(t) + x(t) xm(t) < /2 + /2 = Thus, (xn) satisfies the UCC. ( :) If (xn) satisfies the UCC, then given > 0, there is N so that xn(t) xm(t) < for n > m > N. This says the seq (xn(ˆt) is a Cauchy Sequence for each ˆt S. Since R is complete, there is a number aˆt so that xn(ˆt) aˆt. The number aˆt ptws defines a function x : S R by x(t) = aˆt. Clearly, xn x on S. From the UCC, we can therefore say for the given, lim xn(t) xm(t) /2, if n > m > N, t S n

But the absolute function is continuous and so lim xn(t) xm(t) /2, if n > m > N, t S n or x(t) xm(t) < when m > N. This shows xn x as the choice of index m is not important. Note this argument is essentially the same as the one we used in the proof that orm convergence of continuous functions gives a continuous limit. The difference here is that we do not know each xn is continuous. We are simply proving the existence of a limit function which is possible as R is complete. But the use of the completeness of R is common in both proofs. We are ready to prove our next interchange theorem. Theorem Let (xn) be a sequence of functions defined on the interval [a, b]. Assume 1. xn is differentiable on [a, b]. 2. x n is Riemann Integrable on [a, b]. 3. There is at least one point [a, b] such that the sequence (xn()) converges. 4. x n y on [a, b] and the limit function y is continuous. Then there is x : [a, b] R which is differentiable on [a, b] and xn x on [a, b] and x = y. Another way of saying this is ( ) lim xn(t) = lim x n(t) n n

Since x n is integrable, by the recapture theorem, xn(t) = x n(s) ds + xn(). Hence, for any n and m, we have xn(t) xm(t) = (x n(s) x m(s)) ds + xn() xm(). If t >, then xn(t) xm(t) (x n(s) x m(s)) ds + xn() xm() x n(s) x m(s) + xn() xm() Since x n y on [a, b], (x n) satisfies the UCC. For a given > 0, we have there is N1 so that x n(s) x m(s) <, 4(b a) for n > m > N1, s [a, b] (α) Thus, using Equation α, for n > m > N1, t > [a, b] xn(t) xm(t) < t ds + xn() xm() 4(b a) = + xn() xm() 4 A similar argument for t < gives the same result: for n > m > N1, t < [a, b] xn(t) xm(t) < + xn() xm() 4

Hence, since the statement if clearly true at t =, we can say for n > m > N1, t > [a, b] xn(t) xm(t) < + xn() xm() 4 We also know (xn()) converges and hence is a Cauchy Sequence. Thus, there is N2 so that xn() xm() < /4 for n > m > N2. We conclude if N > max(n1, N2), both conditions apply and we can say xn(t) xm(t) < 4 + 4 =, for n > m > N, t [a, b] 2 This shows (xn) satisfies the UCC and there is x : S R so that xn x. So far we know xn(t) = xn() + x n(s) ds. Since x n y and each xn is Riemann Integrable on [a, b], by the integral interchange theorem x n(s) ds = y(s) ds on [a, b]. Also, xn x implies limn xn(t) = x(t). We conclude lim xn(t) = lim xn() + lim n n n and so x(t) = x() + y(s) ds x n(s) ds. Since we assume y is continuous on [a, b], by the FTOC, x (t) = y(t) on [a, b].

Homework 23 The first three problems are based on this kind of thing: We know 1 0 1/(1 + x 2 )dx = arctan(1) = /4. We can write this an a orm sum limit. Take ormly spaced partitions of width 1/n of [0, 1]. Then points in the partition have the form k/n and we take as evaluation points the RH endpoint. The Riemann sum is then S(f (x) = 1/(1 + x 2 ), Pn, Sn) = = n 1/(1 + k 2 /n 2 )(1/n) k=1 n 1/(1 + k 2 /n 2 )(1/n) = /4. k=1 So a cool question might be Prove limn 4 n k=1 n/(n2 + k 2 ) =. Note we know f (x) = 1/(1 + x 2 ) is RI on [0, 1] since it is continuous and our theorem says the limit of these Riemann sums converges to 1 0 1/(1 + x 2 )dx. Homework 23 23.1 Evaluate limn n k=1 k/n 3/2. n 23.2 Evaluate limn k=1 1/(n + k). 23.3 Prove limn n k=1 1/ n 2 k 2 = /2. Hint The function here is not Riemann integrable on [0, 1] but it is on [L, 1] for any 0 < L < 1. Start with orm partitions of the interval [L, 1] and go from there. 23.4 Discuss the convergence of the sequence of functions (xn) xn(t) = { 0, 0 t 1/n 1, 1/n < t 2/n 0, 2/n < t 1 23.5 Prove if g is a bounded function on [a, b] and xn x on [a, b], then g xn g x on [a, b].