For each k ≥ 1, we partition the interval [0,∞] into disjoint interval as follows:
[0,∞] = [0, 1) ⋃ [1, 2)⋃ · · · [n − 1, n) ⋃ [n,∞]
= ⋃i=1n2n [2ni−1,2ni)⋃[n,∞)
Define, for each 1 ≤ i ≤ n2n,
Eni = f −1([2ni−1,2ni))
and En = f −1 ([n, ∞]). Define the function πn (x) as follows:
i=1∑n2n2ni−1χEn,i+nχEn
If f(x) < ∞, then there exists a positive integer n such that f(x) < n. Since x ∈ En,i for some
1 ≤ i ≤n2n , we have
0 ≤ f(x) −πn(x) ≤ 2ni−2ni−1=2n1
If f(x) = ∞, then πn(x) = n for every n. Thus, for each x ∈ E,
n→∞limπn(x)=f(x)
This gives us a sequence πn(x) of simple functions on E converging to f(x).
We now show that πn(x) ≤ πn+1(x) for every integer x ∈ E. To do so, notice that for each
1 ≤ i ≤ n2n ,
En+1,2i−1⋃En+1,2i=f−1([2n+12i−2,2n+12i−1))⋃f−1([2n+12i−1,2n+12i))=f−1([2ni−1,2ni))=Eni
If x ∈ En,i for some 1 ≤ i ≤ n2n , then
πn(x)=2ni−1
On the other hand,
πn+1(x)=2n2i−2 or 2n2i−1
both of which are
≥2ni−1
If x ∈ En then πn(x) = n. But,
f−1([n,∞])=f−1(n,n+1)⋃f−1([n+1,∞])
If x∈=f−1(n,n+1), then
πn+1(x)=i=n2n+1+1∑(n+1)2n+12n+1i−1χEn,i≥2n+1n2n+1=πn(x)
If x ∈ f−1([k + 1,∞]), then πn+1(x) = k + 1 > k = πn . thus, we have shown that for every x ∈ E,
πn+1(x)≥πn(x)
Comments