Functional Analysis Lecture 11

[[lecture-data]]

← Lecture 10 | Lecture 12 →
Lecture Notes: Rodriguez, page 53

2. Lebesgue Measure and Integration

[[Lebesgue Integral]] of nonnegative functions

Recall from last time

L+ functions

If E⊂R is measurable, the class of nonnegative measurable functions on E is given as
L+(E)={f:E→[0,∞]|f is measurable}

)

Let ϕ∈L+(E) be a simple, nonnegative measurable function such that ϕ=∑i=1naj1Ai where Ai∩Aj=∅ for all i,j and ⋃i=1nAi=E. Then the Lebesgue integral of ϕ is
∫Eϕ=∑i=1naim(Ai)∈[0,∞]

Now, for general [[nonnegative measurable functions]] we have

)

If f∈L+(E), the Lebesgue integral of f is

∫Ef=sup{∫Eφ:φ∈L+(E) simple, φ≤f}
Theorem

If E⊂R is a set with m(E)=0, then for all f∈L+(E) we have ∫Ef=0

ie it is only interesting to take integrals over functions with positive measure

Proof

From the definition, we have f∈L+(E). If φ is a [[simple function]] such that φ=∑i=1naiχAi and φ≤f, then m(Ai)≤m(A)=0. So in the sum, all terms must be 0. Thus we always have ∫Eφ=0 and the supremum over all such φ is also 0.

see [[it is only interesting to take integrals of functions with positive measure]]

Note

  1. if φ∈L+(E) is a [[simple function]], then the two definitions of ∫Eφ agree
  2. If f,g∈L+(E), c∈[0,∞], and f≤g on E then
  • ∫Ecf=c∫Ef
  • ∫Ef≤∫Eg
  1. If f∈L+(E) and F⊂E is measurable, then
  • ∫Ff=∫EfχF≤∫Ef

Theorem

If f,g∈L+(E) and f≤g [[almost everywhere]] on E then

∫Ef≤∫Eg
Proof

Let F={x∈E:f(x)≤g(x)}.

∫Ef=∫Ff+∫Fcf0=∫Ff≤∫Fg+∫Fcg=∫Eg◼

See [[function relations almost everywhere hold in the integral]]

Monotone Convergence Theorem

If {fn}n is a sequence in L+(E) (nonnegative and measurable) such that f1≤f2≤… and fn→f pointwise on E, then

limn→∞∫Efn=∫Ef
Note

Pointwise convergence is much weather than uniform convergence required for Reimann integration

Proof

Since f1≤f2≤…, we have that ∫Ef1≤∫Ef2≤… (since [[function relations almost everywhere hold in the integral]]). Thus {∫Efn}n is an increasing sequence on nonnegative numbers. Thus limn→∞∫Efn∈[0,∞].

And since limn→∞fn(x)=f(x) for all x∈E, we know f1≤f2≤⋯≤f

Thus for all n, we have

∀n,∫Efn≤∫Ef⟹limn→∞∫Efn≤∫Ef

Thus to show equality, we have need to show ∫Ef≤limn→∞∫Efn.

Now, let φ∈L+(E) be simple ie φ=∑i=1maiχAi with φ≤f. Let ϵ∈(0,1). and define

En={x∈E|fn(x)≥(1−ϵ)φ(x)}

Note that for all x, we then have (1−ϵ)φ(x)<f(x). And since limn→∞fn(x)=f, every x must lie in some En. Thus ⋃nEn=E

Then we have

∫Efn≥∫Enfn≥∫En(1−ϵ)φ=(1−ϵ)∫Eφ=(1−ϵ)∑i=1maim(Ai∩En)

And since E1∩Ai⊂E2∩Ai⊂… and ⋃n(En∩Ai)=Ai, this implies that

m(Ai∩En)→m(Ai) as n→∞

Thus

limn→∞∫Efn≥limn→∞(1−ϵ)∑i=1maim(Ai∩En)=(1−ϵ)∑i=1maim(Ai)=(1−ϵ)∫Eφ

Thus for all ϵ∈(0,1) we have

(1−ϵ)∫Eφ≤limn→∞∫Efn⟹ϵ→0∫Eφ≤limn→∞∫Efn=∫Ef◼

(see [[Monotone Convergence Theorem]])

Theorem

Let f∈L+(E) and let {φn}n be a sequence of simple functions such that

0≤φ1≤φ2≤⋯≤f

with φn→f pointwise. Then

∫Ef=limn→∞∫Eφn

ie, we can take any pointwise increasing sequence of simple functions and compute the limit (instead of needed to compute the supremum)

Proof

We can just plug the φn in to the [[Monotone Convergence Theorem]]

Theorem

If f,g∈L+(E) then

∫E(f+g)=∫Ef+∫Eg
Proof

Let {φn}n and {ψn}n be two sequences of simple functions such that
0≤φ1≤φ2≤⋯≤f with φn→f and
o≤ψ1≤ψ2≤⋯≤g with ψn→g pointwise then

0≤φ1+ψ1≤φ2+ψ2≤⋯≤f+g

Where φn+ψn→f+g pointwise and each φi+ψi are simple (since they are the sum of simple functions). So by the [[Monotone Convergence Theorem]] and linearity for simple functions we have

∫E(f+g)=limn→∞∫E(φn+ψn)(linearity)=limn→∞∫Eφn+∫Eψn(MTC)=∫Ef+∫Eg

See [[lebesgue integral of sum is sum of the integral]]

Theorem

Let {fn}n be a sequence in L+(E). Then

∫E∑nfn=∑n∫Efn
Proof

via induction. Since the [[lebesgue integral of sum is sum of the integral]], we know for each N∈N that

∫E∑n=1Nfn=∑n=1N∫Efn

And since

∑n=11fn≤∑n=12fn≤…

and ∑n=1Nfn→∑n=1∞fn as N→∞, by the [[Monotone Convergence Theorem]] we have

∫E∑n=1∞=limN→∞∫E∑n=1Nfn=limN→∞∑n=1N∫Efn=∑n=1∞∫Efn◼

see [[integral of sum of a sequence is sum of the integrals]]

Note

this does not hold for Riemann integration. Enumerate the rationals and let fn be the function that is 1 for the first n rational numbers and 0 everywhere else

Theorem

Let f∈L+(E). Then ∫Ef=0⟺f=0 [[almost everywhere]] on E

Proof

(⟸)

If f=0 [[almost everywhere]]

0≤∫Ef≤∫E0=0
(⟹)

Let

Fn={x∈E:f(x)>1n},F={x∈E:f(x)>0}

Then F=⋃nFn and F1⊂F2⊂… and for all n

0≤1nm(Fn)=∫Fn1n≤∫Fnf≤∫Ef=0

Then 1nm(Fn)=0⟹m(Fn)=0 for all n. But then by continuity of measure, we have

m(F)=m(⋃n=1∞Fn)=limn→∞m(Fn)=0
◼

see [[integral is 0 if and only if the function is 0 almost everywhere]]

Theorem

If {fn}n is a sequence in L+(E) such that f1(x)≤f2(x)≤… for almost all x∈E and

(∗){f1(x)≤f2(x)≤f3(x)…limn→∞fn(x)=f(x)

Then

∫Ef=limn→∞∫Efn
Proof

Let

F={x∈E|(∗) holds}

Then m(E∖F)=0 by assumption. Thus f−χFf=0 a.e. and fn−χFfn=0 a.e. also. Then the [[Monotone Convergence Theorem]] says

∫Ef=∫EfχF=∫Ff=limn→∞∫Ffn

Where the first equality holds since [[function relations almost everywhere hold in the integral]] and the last holds by the [[Monotone Convergence Theorem]]. This then becomes

limn→∞∫Ffn=limn→∞∫Efn

Because m(E∖F)=0 and so any integral over the region is 0.

ie, sets of measure zero do not affect the [[Lebesgue Integral]].

see [[sets of measure zero do not affect the integral]]

Theorem (Fatou's Lemma)

Let {fn}n be a sequence in L+(E). Then

∫Elimn→∞inffn(x)dx≤limn→∞inf∫fn(x)dx
Recall

limn→∞infan=supn≥1[infk≥nak]

And the limn→∞inf function is defined pointwise

Proof

We have

limn→∞inffn(x)=supn≥1[infk≥nfk(x)]=limn→∞[infk≥nfk(x)]

And since infk≥1fk(x)≤infk≥2fk≤… by the MCT we have

∫Elimn→∞inffn=limn→∞∫Einfk≥nfk

For all j≥n and all x∈E, we have

infk≥nfk(x)≤fj(x)⟹∫Einfk≥nfk≤∫Efj⟹∫Elimn→∞inffn=limn→∞∫E(infk≥nfk)≤limn→∞[infj≥n∫Efj]=limn→∞inf∫Efn

So we have "swapped the integral and inf" and we can plug this into the MCT to get the desired result.

◼

see [[Fatou's Lemma]]

Theorem

Let f∈L+(E) and let ∫Ef<∞. Then the set

F={x∈E:f(x)=∞}

must have measure 0.

Proof

We know for all n∈N we have

nχF≤fχF

So integrating both sides gives us

nm(F)≤∫EfχF≤∫Ef≤∞

Thus for all n, we have m(F)≤1n∫Ef. Taking n→∞, we have m(F)=0.

see [[functions with finite integrals map a measure zero set to infinity]]

Next things:

const { dateTime } = await cJS()

return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}