Integration and Differentiation Limit Interchange Theorems

Similar documents
Integration and Differentiation Limit Interchange Theorems

Uniform Convergence and Series of Functions

Differentiating Series of Functions

Uniform Convergence Examples

Uniform Convergence Examples

The Existence of the Riemann Integral

Upper and Lower Bounds

Fourier Sin and Cos Series and Least Squares Convergence

The Method of Laplace Transforms.

The Limit Inferior and Limit Superior of a Sequence

Bolzano Weierstrass Theorems I

Consequences of Continuity

Convergence of Fourier Series

General Power Series

Relationship Between Integration and Differentiation

Dirchlet s Function and Limit and Continuity Arguments

Predator - Prey Model Trajectories and the nonlinear conservation law

5.5 Deeper Properties of Continuous Functions

Dirchlet s Function and Limit and Continuity Arguments

6.2 Deeper Properties of Continuous Functions

Consequences of Continuity

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

Geometric Series and the Ratio and Root Test

Linear Systems of ODE: Nullclines, Eigenvector lines and trajectories

The First Derivative and Second Derivative Test

Riemann Integration Theory

The First Derivative and Second Derivative Test

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

MATH 140B - HW 5 SOLUTIONS

FINAL EXAM Math 25 Temple-F06

4130 HOMEWORK 4. , a 2

MAT137 - Term 2, Week 2

Predator - Prey Model Trajectories are periodic

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

Math 117: Infinite Sequences

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

Solutions Final Exam May. 14, 2014

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

Fourier Sin and Cos Series and Least Squares Convergence

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

Linear Systems of ODE: Nullclines, Eigenvector lines and trajectories

Geometric Series and the Ratio and Root Test

Predator - Prey Model Trajectories are periodic

Mathematical Induction Again

Convergence of Sequences

Mathematical Induction Again

Defining Exponential Functions and Exponential Derivatives and Integrals

Matrix Solutions to Linear Systems of ODEs

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

Lower semicontinuous and Convex Functions

Hölder s and Minkowski s Inequality

MATH 117 LECTURE NOTES

Matrices and Vectors

Convergence of Sequences

5.5 Deeper Properties of Continuous Functions

The Derivative of a Function

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

Measure Theory and Lebesgue Integration. Joshua H. Lifton

Solving systems of ODEs with Matlab

1 Definition of the Riemann integral

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

Math 328 Course Notes

Solutions Final Exam May. 14, 2014

Math 104: Homework 7 solutions

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

Project One: C Bump functions

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

Derivatives and the Product Rule

Getting Started With The Predator - Prey Model: Nullclines

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

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

Integration by Parts Logarithms and More Riemann Sums!

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

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.

Sin, Cos and All That

Elementary Analysis Math 140D Fall 2007

1 The Glivenko-Cantelli Theorem

Selected solutions for Homework 9

Constructing Approximations to Functions

More Series Convergence

CAAM 454/554: Stationary Iterative Methods

The Heine-Borel and Arzela-Ascoli Theorems

Notes on uniform convergence

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

Problem List MATH 5143 Fall, 2013

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

Function Composition and Chain Rules

16 1 Basic Facts from Functional Analysis and Banach Lattices

Convergence & Continuity

More Least Squares Convergence and ODEs

Math212a1413 The Lebesgue integral.

Math LM (24543) Lectures 02

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

Extreme Values and Positive/ Negative Definite Matrix Conditions

The SIR Disease Model Trajectories and MatLab

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

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

Math 61CM - Solutions to homework 6

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 1 A More General Integral Interchange Theorem 2

A More General Integral Interchange Theorem Theorem Let (x n ) be a sequence of Riemann Integrable functions on [a, b]. Let x on [a, b]. Then x is Riemann integrable on [a, b] and x n b lim n a x n (t)dt = b a ( lim n x n(t))dt = b a x(t)dt. 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].

A More General Integral Interchange Theorem Let ɛ > 0 be given. since the convergence is orm, there is N so that x n (t) x(t) < ɛ, n > N, t [a, b] (α) 5(b a) 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 x n x, we can easily show x is bounded. So we can define M j = sup t j 1 t t j x(t), m j = inf t j 1 t t j x(t) ˆM j = sup t j 1 t t j xˆn (t), ˆm j = inf t j 1 t t j xˆn (t) where {t 0, t 1,..., t p } are the points in the partition π.

A More General Integral Interchange Theorem Using the infimum and supremum tolerance lemma, we can find points s j [t j 1, t j ] and u j [t j 1, t j ] so that M j ɛ 5(b a) < x(s j ) M j (γ) m j x(u j ) < m j + ɛ 5(b a) (δ) Thus U(x, π) L(x, π) = π = π (M j m j ) t j {M j x(s j ) + x(s j ) xˆn (s j ) + xˆn (s j ) xˆn (u j ) + xˆn (u j ) x(u j ) + x(u j ) m j } t j

A More General Integral Interchange Theorem Now break this into individual pieces: U(x, π) L(x, π) = π (M j x(s j )) t j + π (x(s j ) xˆn (s j )) t j + π (xˆn (s j ) xˆn (u j )) t j + π (xˆn (u j ) x(u j )) t j + π (x(u j ) m j ) t j Using Equation γ and Equation δ we can overestimate the first and fifth term to get U(x, π) L(x, π) < π ɛ 5(b a) t j + π (x(s j ) xˆn (s j )) t j + π + π (xˆn (s j ) xˆn (u j )) t j + π ɛ 5(b a) t j (xˆn (u j ) x(u j )) t j

A More General Integral Interchange Theorem We know π t j = b a and so simplifying a bit, we have U(x, π) L(x, π) < 2 ɛ 5 + π (x(s j ) xˆn (s j )) t j + π (xˆn (s j ) xˆn (u j )) t j + π (xˆn (u j ) x(u j )) t j Now use Equation α in piece two and four above to get U(x, π) L(x, π) < 2 ɛ 5 + π + π ɛ 5(b a) t j (xˆn (s j ) xˆn (u j )) t j + π ɛ 5(b a) t j < 4 ɛ 5 + π (xˆn (s j ) xˆn (u j )) t j since like before π ɛ 5(b a) t j = ɛ 5.

A More General Integral Interchange Theorem Finally, xˆn (s j ) xˆn (u j ) ˆM j ˆm j and so U(x, π) L(x, π) < 4 ɛ 5 + π ( ˆM j ˆm j ) t j = 4 ɛ 5 + U(xˆn, π) L(xˆn, π) < ɛ 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 (x n ) on [ 1, 1] where x n (t) = t/e nt2. It is easy to ptws see x n 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 x n 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 M n = sup x n (t) x(t) = sup 1 t 1 1 t 1 t e nt2 = 1 2ne Since M n 0, by the Weierstrass Theorem for Uniform Convergence, we have x n x. At t = 0, x n(0) = 1 for all n and so lim n 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 x n(t) n ( ) lim x n(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 (x n ) on the set S satisfies the Uniform Cauchy Criterion if ɛ > 0, N x n (t) x m (t) < ɛ, for n > m > N and t S This can also be stated like this: ɛ > 0, N x n x m < ɛ, 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 (x n ) be a sequence of functions on the set S. Then ( ) x : S R x n x ( (x n ) satisfies the UCC ). ( :) We assume there is an x : S R so that x n x. Then, given ɛ > 0, there is N so that x n (t) x(t) < ɛ/2 for all t S.

Thus, if n > m > N, we have x n (t) x m (t) = x n (t) x(t) + x(t) x m (t) x n (t) x(t) + x(t) x m (t) < ɛ/2 + ɛ/2 = ɛ Thus, (x n ) satisfies the UCC. ( :) If (x n ) satisfies the UCC, then given ɛ > 0, there is N so that x n (t) x m (t) < ɛ for n > m > N. This says the seq (x n (ˆt) is a Cauchy Sequence for each ˆt S. Since R is complete, there is a number aˆt so that x n (ˆt) aˆt. The number aˆt ptws defines a function x : S R by x(t) = aˆt. Clearly, x n x on S. From the UCC, we can therefore say for the given ɛ, lim x n(t) x m (t) ɛ/2, if n > m > N, t S n

But the absolute function is continuous and so lim n x n(t) x m (t) ɛ/2, if n > m > N, t S or x(t) x m (t) < ɛ when m > N. This shows x n 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 x n 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 (x n ) be a sequence of functions defined on the interval [a, b]. Assume 1 x n is differentiable on [a, b]. 2 x n is Riemann Integrable on [a, b]. 3 There is at least one point t 0 [a, b] such that the sequence (x n (t 0 )) 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 x on [a, b] and x = y. Another way of saying this is x n ( ) lim x n(t) = lim x n(t) n n

Since x n is integrable, by the recapture theorem, x n (t) = t t 0 x n(s) ds + x n (t 0 ). Hence, for any n and m, we have x n (t) x m (t) = If t > t 0, then x n (t) x m (t) t t 0 (x n(s) x m(s)) ds + x n (t 0 ) x m (t 0 ). t (x n(s) x m(s)) ds + x n(t 0 ) x m (t 0 ) t 0 t t 0 x n(s) x m(s) + x n (t 0 ) x m (t 0 )

Since x n y on [a, b], (x n) satisfies the UCC. For a given ɛ > 0, we have there is N 1 so that x n(s) x m(s) < ɛ 4(b a), for n > m > N 1, s [a, b] (α) Thus, using Equation α, for n > m > N 1, t > t 0 [a, b] x n (t) x m (t) < ɛ 4(b a) t = ɛ 4 + x n(t 0 ) x m (t 0 ) t 0 ds + x n (t 0 ) x m (t 0 ) A similar argument for t < t 0 gives the same result: for n > m > N 1, t < t 0 [a, b] x n (t) x m (t) < ɛ 4 + x n(t 0 ) x m (t 0 )

Hence, since the statement if clearly true at t = t 0, we can say for n > m > N 1, t > t 0 [a, b] x n (t) x m (t) < ɛ 4 + x n(t 0 ) x m (t 0 ) We also know (x n (t 0 )) converges and hence is a Cauchy Sequence. Thus, there is N 2 so that x n (t 0 ) x m (t 0 ) < ɛ/4 for n > m > N 2. We conclude if N > max(n 1, N 2 ), both conditions apply and we can say x n (t) x m (t) < ɛ 4 + ɛ 4 = ɛ, for n > m > N, t [a, b] 2 This shows (x n ) satisfies the UCC and there is x : S R so that x n x. So far we know t x n (t) = x n (t 0 ) + x n(s) ds. t 0

Since x n y and each x n is Riemann Integrable on [a, b], by the integral interchange theorem t t 0 x n(s) ds = t t 0 y(s) ds on [a, b]. Also, x n We conclude and so x implies lim n x n (t) = x(t). lim x n(t) = lim x n(t 0 ) + lim n n n t x(t) = x(t 0 ) + t 0 t t 0 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 ), P n, S n ) = = 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 lim n 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 lim n n k=1 k/n 3/2. n 23.2 Evaluate lim n k=1 1/(n + k). 23.3 Prove lim n 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 (x n ) x n (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 x n x on [a, b], then g x n g x on [a, b].