Exercise 1. Simple Functions are Approximately Step
edit
Let
ψ
=
∑
i
=
1
n
c
i
1
E
i
{\displaystyle \psi =\sum _{i=1}^{n}c_{i}\mathbf {1} _{E_{i}}}
be a simple function on the bounded interval [a ,b ]. Also let
ε
∈
R
+
{\displaystyle \varepsilon \in {\mathbb {R}}^{+}}
.
Prove that there exists a step function s and measurable set F such that
s and
ψ
{\displaystyle \psi }
are equal on F , and F is nearly all of [a ,b ].
More formally, for all
x
∈
F
{\displaystyle x\in F}
, we have
ψ
(
x
)
=
s
(
x
)
{\displaystyle \psi (x)=s(x)}
.
And
λ
(
[
a
,
b
]
∖
F
)
<
ε
{\displaystyle \lambda ([a,b]\smallsetminus F)<\varepsilon }
.
Hint: Approximate each of
E
1
,
…
,
E
n
{\displaystyle E_{1},\dots ,E_{n}}
.
Exercise 2. Step Functions are Approximately Continuous
edit
Let s be any step function on a closed, bounded interval,
s
:
[
a
,
b
]
→
R
{\displaystyle s:[a,b]\to {\mathbb {R}}}
and
s
=
∑
i
=
1
n
c
i
1
I
i
{\displaystyle s=\sum _{i=1}^{n}c_{i}\mathbf {1} _{I_{i}}}
. Also let
ε
∈
R
+
{\displaystyle \varepsilon \in {\mathbb {R}}^{+}}
.
Prove that there is a continuous function
f
:
[
a
,
b
]
→
R
{\displaystyle f:[a,b]\to {\mathbb {R}}}
and measurable set
E
⊆
[
a
,
b
]
{\displaystyle E\subseteq [a,b]}
, such that
for all
x
∈
E
:
f
(
x
)
=
s
(
x
)
,
and
λ
(
[
a
,
b
]
∖
E
)
<
ε
{\displaystyle {\text{ for all }}x\in E:f(x)=s(x),\quad {\text{ and }}\lambda ([a,b]\smallsetminus E)<\varepsilon }
Hint: There is a finite number of discontinuities of s .
Put a small enough neighborhood around each discontinuity. Outside of these neighborhoods, make f and s equal.
Inside of these neighborhoods, interpolate a linear function from one end to the other.
Here we study two kinds of approximation results. One defines a notion in which two functions are "basically the same" (at least for the purposes of integration). This is the idea of functions being equal "almost everywhere". For functions equal almost everywhere, one may replace one function by the other and the value of the integral is unchanged.
The other kind of approximation result is that every measurable function is (1) approximately continuous, and (2) approximately step. This means that measurable functions can be replaced by continuous or step functions, and although this changes the value of the integral, it does so "not too much".
Definition : almost everywhere, a.e.
Let
f
,
g
:
E
→
R
{\displaystyle f,g:E\to {\mathbb {R}}}
be two measurable functions. We say that they are equal almost everywhere if the set of points at which they are not equal is a null set. That is to say,
λ
(
{
x
|
f
(
x
)
≠
g
(
x
)
}
)
=
0
{\displaystyle \lambda (\{x|f(x)\neq g(x)\})=0}
We also abbreviate the statement that f equals g almost everywhere by writing
f
=
g
a.e.
{\displaystyle f=g{\text{ a.e. }}}
Exercise 3. Almost Equal to 0
edit
Show that the constant function 0, and the Dirichlet function
1
Q
{\displaystyle \mathbf {1} _{\mathbb {Q}}}
are equal almost everywhere.
A.e. Preserves Measurability
edit
Suppose
f
,
g
:
E
→
R
{\displaystyle f,g:E\to {\mathbb {R}}}
are two functions, and f is measurable, and suppose
f
=
g
a.e.
{\displaystyle f=g{\text{ a.e. }}}
We will prove that therefore g is measurable.
Let
a
∈
R
{\displaystyle a\in {\mathbb {R}}}
and consider the sets
F
=
f
−
1
(
(
a
,
∞
)
)
=
{
x
∈
E
|
g
(
x
)
>
a
}
{\displaystyle F=f^{-1}((a,\infty ))=\{x\in E|g(x)>a\}}
G
=
g
−
1
(
(
a
,
∞
)
)
=
{
x
∈
E
|
f
(
x
)
>
a
}
{\displaystyle G=g^{-1}((a,\infty ))=\{x\in E|f(x)>a\}}
H
=
{
x
∈
E
|
f
(
x
)
≠
g
(
x
)
}
{\displaystyle H=\{x\in E|f(x)\neq g(x)\}}
Exercise 4. A.e. Preserves Measurability
edit
Justify why the following sets are measurable, in this order:
1. F
2. H
3.
F
∖
H
{\displaystyle F\smallsetminus H}
4.
G
∖
H
{\displaystyle G\smallsetminus H}
5. G
Simple Functions Are Approximately Step
edit
In this section we will show that, if
ψ
:
[
a
,
b
]
→
R
{\displaystyle \psi :[a,b]\to {\mathbb {R}}}
is a simple function then there is a step function
s
:
[
a
,
b
]
→
R
{\displaystyle s:[a,b]\to {\mathbb {R}}}
and a set
E
⊆
[
a
,
b
]
{\displaystyle E\subseteq [a,b]}
such that
ψ
=
s
{\displaystyle \psi =s}
on E and
λ
(
[
a
,
b
]
∖
E
)
<
ε
{\displaystyle \lambda ([a,b]\smallsetminus E)<\varepsilon }
.
So let
ψ
=
∑
i
=
1
n
c
i
1
E
i
{\displaystyle \psi =\sum _{i=1}^{n}c_{i}\mathbf {1} _{E_{i}}}
be a simple function and let
ε
∈
R
+
{\displaystyle \varepsilon \in {\mathbb {R}}^{+}}
.
As we proved in a previous lesson, each
E
i
{\displaystyle E_{i}}
is approximately an open set. That is to say, there is an open set
E
i
⊆
U
i
{\displaystyle E_{i}\subseteq U_{i}}
such that
λ
(
U
i
∖
E
i
)
<
ε
/
n
{\displaystyle \lambda (U_{i}\smallsetminus E_{i})<\varepsilon /n}
.
Measurable Functions Are Approximately Continuous and Step
edit
We will now show that for any measurable function
f
:
[
a
,
b
]
→
R
{\displaystyle f:[a,b]\to {\mathbb {R}}}
and
ε
∈
R
+
{\displaystyle \varepsilon \in {\mathbb {R}}^{+}}
, there exists a continuous function
g
:
[
a
,
b
]
→
R
{\displaystyle g:[a,b]\to {\mathbb {R}}}
such that
|
f
−
g
|
<
ε
{\displaystyle |f-g|<\varepsilon }
on a set
E
⊆
[
a
,
b
]
{\displaystyle E\subseteq [a,b]}
and
λ
(
[
a
,
b
]
∖
E
)
<
ε
{\displaystyle \lambda ([a,b]\smallsetminus E)<\varepsilon }
. When
ε
{\displaystyle \varepsilon }
is "very small" then E is almost the whole interval [a ,b ], and g is very close to f .
We will also prove that there exists a step function
s
:
[
a
,
b
]
→
R
{\displaystyle s:[a,b]\to {\mathbb {R}}}
such that
|
f
−
s
|
<
ε
{\displaystyle |f-s|<\varepsilon }
on a set
E
⊆
[
a
,
b
]
{\displaystyle E\subseteq [a,b]}
and
λ
(
[
a
,
b
]
∖
E
)
<
ε
{\displaystyle \lambda ([a,b]\smallsetminus E)<\varepsilon }
.
First we prove that there is an M such that
|
f
|
≤
M
{\displaystyle |f|\leq M}
except on a set of measure less than
ε
/
3
{\displaystyle \varepsilon /3}
.
To do so, consider the sequence of sets
E
n
=
{
x
∈
[
a
,
b
]
:
|
f
(
x
)
|
≤
n
}
{\displaystyle E_{n}=\{x\in [a,b]:|f(x)|\leq n\}}
Exercise 5. Measurable Approximately Bounded
edit
First show that
E
n
{\displaystyle E_{n}}
is measurable for each
1
≤
n
{\displaystyle 1\leq n}
.
Next show that
[
a
,
b
]
=
⋃
n
=
1
∞
E
n
{\displaystyle [a,b]=\bigcup _{n=1}^{\infty }E_{n}}
.
Then use the continuity of measure to show that there is some M for which
λ
(
⋃
n
=
1
M
E
n
)
>
b
−
a
−
ε
{\displaystyle \lambda \left(\bigcup _{n=1}^{M}E_{n}\right)>b-a-\varepsilon }
. Define
F
=
⋃
n
=
1
M
E
n
{\displaystyle F=\bigcup _{n=1}^{M}E_{n}}
.
Infer that this is the desired M .
Next we will show that there is a simple function
φ
{\displaystyle \varphi }
such that
|
f
−
φ
|
<
ε
{\displaystyle |f-\varphi |<\varepsilon }
except on F .
To do so, set
n
∈
N
{\displaystyle n\in {\mathbb {N}}}
such that
M
n
<
ε
{\displaystyle {\frac {M}{n}}<\varepsilon }
and define the sets
E
n
,
i
=
{
x
∈
[
a
,
b
]
:
M
(
i
−
1
)
n
≤
|
f
(
x
)
|
<
M
i
n
}
=
(
|
f
|
)
−
1
(
[
M
(
i
−
1
)
/
n
,
M
i
/
n
)
)
,
for
1
≤
i
≤
n
{\displaystyle {\begin{aligned}E_{n,i}&=\left\{x\in [a,b]:{\frac {M(i-1)}{n}}\leq |f(x)|<{\frac {Mi}{n}}\right\}\\&=(|f|)^{-1}([M(i-1)/n,Mi/n)),\quad {\text{ for }}1\leq i\leq n\end{aligned}}}
and then define the function
φ
=
∑
i
=
1
n
(
inf
E
n
,
i
f
)
1
E
n
,
i
{\displaystyle \varphi =\sum _{i=1}^{n}\left(\inf _{E_{n,i}}f\right)\mathbf {1} _{E_{n,i}}}
Exercise 6. Simple Approximation Confirmation
edit
Show that
φ
{\displaystyle \varphi }
is simple and, except on F ,
|
f
−
φ
|
<
ε
{\displaystyle |f-\varphi |<\varepsilon }
.
Finally, use all of the above (with the help of results proved in earlier exercises) to prove the desired result.