06.09.2021 Views

Measure, Integration & Real Analysis, 2021a

Measure, Integration & Real Analysis, 2021a

Measure, Integration & Real Analysis, 2021a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

98 Chapter 3 <strong>Integration</strong><br />

in other words,<br />

|E k \ A k | + |A k \ E k |≤|G k \ A k | + |G k \ E k |<br />

< ε<br />

2|a k |n ;<br />

∥ χAk − χ<br />

Ek<br />

∥ ∥1 <<br />

ε<br />

2|a k |n .<br />

Now ∥∥∥ n ∥ ∥∥1 f − ∑ a k χ<br />

Ek<br />

≤<br />

k=1<br />

∥ f −<br />

n ∥ ∥∥1<br />

∑ a k χ<br />

Ak<br />

+<br />

k=1<br />

∥<br />

n<br />

∑<br />

k=1<br />

< ε 2 + n<br />

∑<br />

k=1|a k | ∥ ∥ χAk − χ<br />

Ek<br />

∥ ∥1<br />

< ε.<br />

a k χ<br />

Ak<br />

−<br />

n<br />

∑<br />

k=1<br />

a k χ<br />

Ek<br />

∥ ∥∥1<br />

Each E k is a finite union of bounded intervals. Thus the inequality above completes<br />

the proof because ∑ n k=1 a kχ<br />

Ek<br />

is a step function.<br />

Luzin’s Theorem (2.91 and 2.93) gives a spectacular way to approximate a Borel<br />

measurable function by a continuous function. However, the following approximation<br />

theorem is usually more useful than Luzin’s Theorem. For example, the next result<br />

plays a major role in the proof of the Lebesgue Differentiation Theorem (4.10).<br />

3.48 approximation by continuous functions<br />

Suppose f ∈L 1 (R). Then for every ε > 0, there exists a continuous function<br />

g : R → R such that<br />

‖ f − g‖ 1 < ε<br />

and {x ∈ R : g(x) ̸= 0} is a bounded set.<br />

For every a 1 ,...,a n , b 1 ,...,b n , c 1 ,...,c n ∈ R and g 1 ,...,g n ∈L 1 (R),<br />

Proof<br />

we have ∥∥∥ n ∥ ∥∥1 f − ∑ a k g k ≤<br />

k=1<br />

≤<br />

∥ f −<br />

∥ f −<br />

n<br />

∑<br />

k=1<br />

n<br />

∑<br />

k=1<br />

a k χ<br />

[bk , c k ]<br />

∥ + ∥<br />

1<br />

a k χ<br />

[bk , c k ]<br />

∥ +<br />

1<br />

n<br />

∑<br />

k=1<br />

n<br />

∑<br />

k=1<br />

a k (χ<br />

[bk , c k ] − g ∥<br />

k)<br />

∥<br />

1<br />

|a k |‖χ<br />

[bk , c k ] − g k‖ 1 ,<br />

where the inequalities above follow<br />

from 3.43. By 3.47, we can choose<br />

a 1 ,...,a n , b 1 ,...,b n , c 1 ,...,c n ∈ R to<br />

make ‖ f − ∑ n k=1 a kχ<br />

[bk , c k ] ‖ 1 as small<br />

as we wish. The figure here then<br />

shows that there exist continuous functions<br />

g 1 ,...,g n ∈ L 1 (R) that make<br />

∑ n k=1 |a k|‖χ<br />

[bk , c k ] − g k‖ 1 as small as we<br />

wish. Now take g = ∑ n k=1 a kg k .<br />

The graph of a continuous function g k<br />

such that ‖χ<br />

[bk , c k ] − g k‖ 1 is small.<br />

<strong>Measure</strong>, <strong>Integration</strong> & <strong>Real</strong> <strong>Analysis</strong>, by Sheldon Axler

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!