MATH 409 Lecture 19

From Notes
Jump to navigation Jump to search

« previous | Tuesday, November 5, 2013 | next »

Lecture Slides

Darboux vs. Riemann Sums

Darboux Sums
Riemann Sum

Riemann Sums

Recall upper and lower Darboux sums and upper and lower integrals

A Riemann sum of a function f:[a,b] with respect to a partition P={x0,x1,,xn} of [a,b] generated by samples tj[xj1,xj] is a sum

𝒮(f,P,tj)=j=1nf(tj)(xjxj1)
Note: The function f need not be bounded. If it is bounded, then L(f,P)𝒮(f,P,tj)U(f,P) for any choice of samples tj.


The riemann sums 𝒮(f,P,tj) converge to a limit I(f) as the norm P0 if for every ϵ>0 there exists δ>0 such that P<δ implies |𝒮(f,P,tj)I(f)|<ϵ for any partition P and choice of samples tj.

Theorem. The Riemann sums 𝒮(f,P,tj) converge to a limit I(f) as P0 if and only if the function f is integrable on [a,b] and I(f)=abf(x)dx.

Proof of (⇒). Assume the Riemann sums 𝒮(f,P,tj) converge to a limit I(f) as P0. Given ϵ>0, we choose δ>0 so that for every partition P with P<δ, we have |𝒮(f,P,tj)I(f)|<ϵ for any choice of samples tj. Let t~j be a different set of samples for the same partition P. Then |𝒮(f,P,t~j)I(f)|<ϵ. We can choose the samples tj,t~j so that f(tj) is arbitrarily close to supf([xj1,xj]) while f(t~j) is arbitrarily close to Failed to parse (syntax error): {\displaystyle \inf{f([x_{j-1},x_])}} . That way 𝒮(f,P,tj) gets arbitrarily close to U(f,P), while 𝒮(f,P,t~j) gets arbitarily close to L(f,P).

Hence it follows from the above inequalities that |U(f,P)I(f)|ϵ and |L(f,P)I(f)|ϵ. As a consequence, the distance between U(f,P) and L(f,P) is U(f,P)L(f,P)2ϵ. In particular, the function f is bounded. We conclude that f is integrable.

Let I=abf(x)dx. The number I lies between L(f,P) and U(f,P). The inequalities U(f,P)L(f,P)2ϵ and |U(f,P)I(f)|ϵ imply that |II(f)|3ϵ as ϵ can be arbitrarily small, I=I(f).

quod erat demonstrandum


Properties of Integrals

Integration as a Linear Operation

Theorem. If f,g are integrable on an interval [a,b], then the sum f+g is also integrable on [a,b] and

ab(f(x)+g(x))dx=abf(x)dx+abg(x)dx

Theorem. If f is integrable on an interval [a,b] and α is a real constant, then the scalar product αf is integrable on [a,b] and

abαf(x)dx=αabf(x)dx

Proof of both. Let I(f) denote the integral of f and I(g) denote the integral of g over [a,b]. The key observation is that the Riemann sums depend linearly on a function. Namely, 𝒮(f+g,P,tj)=𝒮(f,P,tj)+𝒮(g,P,tj) and 𝒮(αf,P,tj)=α𝒮(f,P,tj) for any partition P of [a,b] and choice of samples tj. It follows that

|𝒮(f+g,P,tj)I(f)I(g)||𝒮(f,P,tj)I(f)|+|𝒮(g,P,tj)I(g)||𝒮(αf,P,tj)αI(f)|=|α||𝒮(f,P,tj)I(f)|

As P0, the Riemann sums 𝒮(f,P,tj) and 𝒮(g,P,tj) get arbitrarily close to I(f) and I(g), respectively. Then 𝒮(f+g,P,tj) will be getting arbitrarily close to I(f)+I(g) while 𝒮(αf,P,tj) will be getting arbitrarily close to αI(f). Thus I(f)+I(g) is the integral of f+g and αI(f) is the integral of αf over [a,b].

quod erat demonstrandum


Integrability of Subintervals

Theorem. If a function f is integrable on [a,b], then it is integrable on each subinterval [c,d][a,b].

Proof. Since f is integrable on [a,b], for any ϵ>0 there is a partition Pϵ of [a,b] such that U(f,Pϵ)L(f,Pϵ)<ϵ. Given a subinterval [c,d][a,b], let Pϵ'=Pϵ{c,d} and Qϵ=Pϵ[c,d]. Then Pϵ' is a partition of [a,b] that refines Pϵ. Hence

U(f,Pϵ)L(f,Pϵ)U(f,Pϵ)L(f,Pϵ)<ϵ

Since Qϵ is a partition of [c,d] contained in Pϵ', it follows that

U(f,Qϵ)L(f,Qϵ)U(f,Pϵ)L(f,Pϵ)<ϵ

We conclude that f is integrable on [c,d].

quod erat demonstrandum


Integration over Subintervals

Theorem. If a function f is integrable on [a,b], then for any c(a,b),

abf(x)dx=acf(x)dx+cbf(x)dx

Proof. Since f is integrable on [a,b], it is also integrable on the subintervals [a,c] and [c,b]. Let P be a partition of [a,c] and {tj} be some samples for that partition. Further, let Q be a partition of [c,b] and {τi} be some samples for that partition. Then PQ is a partition of [a,b] and {tj}{τi} are samples for it. The key observation is that

𝒮(f,PQ,{tj}{τi})=𝒮(f,P,tj)+𝒮(f,Q,τi)

If P0 and Q0, then PQ=max(P,Q)0 as well. Therefore the Riemann sums in the latter equality will converge to the integrals abf(x)dx, acf(x)dx, and cbf(x)dx, respectively.

quod erat demonstrandum

Theorem. If a function f is integrable on [a,b] and f([a,b])[A,B], then for each continuous function g:[A,B], the composition gf is also integrable on [a,b].

(proof omitted)

Corollary If function f and g are integrable on [a,b], then so is fg.

Proof. We have (f+g)2=f2+g2+2fg. Since f and g are integrable on [a,b], so is f+g. Since h(x)=x2 is a continuous function on , the compositions hf=f2, hg=g2, and h(f+g)=(f+g)2 are integrable on [a,b]. Then fg=12(f+g)212f212g2 is integrable on [a,b].

quod erat demonstrandum


Comparison Theorem for Integrals

Theorem. [Comparison theorem]. If functions f,g are integrable on [a,b] and f(x)g(x) for all x[a,b], then

abf(x)dxabg(x)dx

Proof. Since fg on the interval [a,b] it follows that 𝒮(f,P,tj)𝒮(g,P,tj) for any partition P of [a,b] and choice of samples tj. As P0, the sum 𝒮(g,P,tj) gets arbitrarily close to the integral of g. The theorem follows.

quod erat demonstrandum

Corollary. If f is integrable on [a,b] and f(x)0, for x[a,b], then abf(x)dx0.

Proof. Comparison theorem with g(x)=0.

quod erat demonstrandum

Corollary. If f is integrable on [a,b] and mf(x)M for x[a,b], then

m(ba)abf(x)dxM(ba)

Corollary. If f is integrable on [a,b], then the function |f| is also integrable on [a,b] and

|abf(x)dx|ab|f(x)|dx

Proof. The function |f| is the composition of f with a continuous function g(x)=|x|. Therefore |f| is integrable on [a,b]. Since |f(x)|f(x)|f(x)| for x[a,b], the Comparison Theorem for integrals implies that

ab|f(x)|dxabf(x)dxab|f(x)|dx
quod erat demonstrandum


Integral with Variable Limit

Suppose f:[a,b] is an integrable function. For any x[a,b], let F(x)=axf(t)dt (we assume F(a)=0).

Theorem. The function F is well-defined and continuous on [a,b].

Proof. Since f is integrable on [a,b], it is also integrable on each subinterval of [a,b]. Hence the function F is well-defined on [a,b]. Besides, f is bounded: |f(t)|M for some M>0 and all t[a,b].

For any x,y[a,b], where xy, we have ayf(t)dt=axf(t)dt+xyf(t)dt. Equivalently, F(y)=F(x)+xyf(t)dx. It follows that

|F(y)F(x)|=|xyf(t)dt|xy|f(t)|dtM|yx|

Thus F is a Lipschitz function on [a,b], which implies F is uniformly continuous on [a,b].

quod erat demonstrandum


Sets of Measure Zero

A subset E of the real line is said to have measure zero if for any ϵ>0, the set E can be covered by countably many open intervals J1,J2, such that n=1|Jn|<ϵ.

Examples

Theorem. Any countable set has measure zero.

Proof. Indeed, suppose E is a countable set and let x1,x2, be a list of all elements of E. Given ϵ>0, let

Jn=(xnϵ2n+1,xn+ϵ2n+1) for n=1,2,

Then EJ1J2 and |Jn|=ϵ2n for all n, so that n=1|Jn|=ϵ.

quod erat demonstrandum

Theorem. A nondegenerate interval [a,b] is not a set of measure zero.

Theorem. There exist sets of measure zero that are of the same cardinality as .


Lebesgue's Criterion for Riemann Integrability

Suppose P(x) is a property depending on xS, where S. We say that P(x) holds for almost all xS (or almost everywhere on S) if the set {xSP(x) does not hold} has measure zero.

Theorem. A function f:[a,b] is Riemann integrable on the interval [a,b] if and only if f is bounded on [a,b] and continuous almost everywhere on [a,b].