Analysis
Analysis
Szabó Tamás
Z b XZ b
fn (x) dx = 0 and fn (x) dx = 0 .
a n a
But X
d(x) = fn (x)
n
1, if x ∈ {r1 , r2 , . . . , rn },
gn (x) =
0, otherwise.
again we have
Z b Z b
lim g (x) dx ̸= lim gn (x) dx .
n a n a n
Note, that
n
X
gn = fk ,
k=1
fn = gn − gn−1 , (g0 ≡ 0) .
yi+1
yi
xi xi+1 xn
Instead of taking a partition of the x-axis, we can take a partition of the y -axis.
yi+1
yi+1
yi yi
yi−1
yi−1
Ei Ei
Let f ≥ 0 and
Ei = {x ∈ [a, b] yi−1 < f (x) ≤ yi } .
φ1 φ2
Clearly
φ1 ≤ φ2 ≤ ... ↗ f
Definition
A simple function over X is a function defined on the whole X whose range is a finite set.
Definition
Definition
then
n
X
φ = c k χE
k
k=1
The Lebesgue measure of a subset E of R, denoted by m(E ), is a generalization of the length of intervals.
Monotone. If A ⊂ B, then
m(A) ≤ m(B) .
˙
[ X
m En = m(En ) .
n n
Let A be the set consisting of exactly one element from each equivalence class.
For any r ∈ S := [−1, 1] ∩ Q, define
Ar = {x + r : x ∈ A} .
Then {Ar } are pairwise disjoint, because only one element of an equivalence class is in A.
Moreover,
˙
[
[0, 1] ⊂ {Ar } ⊂ [−1, 2] .
r ∈S
˙
[ X X
1 = m([0, 1]) ≤ m Ar = m(Ar ) = m(A) ≤ m([−1, 2]) = 3
r ∈S r ∈S r ∈S
which is impossible.
Therefore, A is not Lebesgue measurable.
Definition
Example
Remark
From the definition we can see that any intersection of σ-algebras over X is a σ-algebra.
Definition
Let H ⊂ P(X ). The σ-algebra generated by H, denoted by M(H), is the intersection of all σ-algebras containing H.
Remark
Example
Example
{{x} : x ∈ X }
Definition
Let X be a metric space. The σ-algebra generated by open sets of X is called the Borel σ-algebra on X , and in general is denoted by BX , in the case of
X = R simply by B. The sets in BX are called Borel sets.
Remark
Definition
!
˙
[ X
µ An = µ(An ) .
n n
Definition
Example
|A|, if A is finite,
µ(A) =
∞, otherwise.
Theorem
!
[
µ An = lim µ(An ) .
n
n
(Continuity from above) If {An } ⊂ M with A1 ⊃ A2 ⊃ . . . and at least one µ(Ak ) < ∞, then
!
\
µ An = lim µ(An ) .
n
n
Definition
Theorem
Any measure space (X , M, µ) can be expanded to a complete measure space (X , M̃, µ̃), where
and
µ̃(A ∪ N) = µ(A) .
Example
Let X = {1, 2, 3}, M = {∅, {1}, {2, 3}, X } and µ(∅) = 0, µ({1}) = 4, µ({2, 3}) = 0, µ(X ) = 4.
Then M̃ = P(X ) and
µ̃({2}) = 0, µ̃({3}) = 0, µ̃({1, 2}) = 4, µ̃({1, 3}) = 4 ,
Definition
∅ ∈ H,
[
X = Hn for some {Hn } ⊂ H.
n
Let ρ : H → [0, ∞] be a function on H such that ρ(∅) = 0.
For any A ∈ P(X ) let ( )
X [
ν(A) := inf ρ(Hn ) : Hn ∈ H and A ⊂ Hn .
n n
(Countable sub-additivity) !
[ X
ν An ≤ ν(An ) .
n n
Definition
Because
ν({1}) = 1, ν({2}) = 1, ν({1, 2}) = 1 ,
we have that
ν({1} ∪ {2}) = ν({1, 2}) = 1 ̸= 2 = ν({1}) + ν({2}) ,
although {1} and {2} are disjoint. Therefore, ν is not additive, can not be measure on H.
Let
M = {M ⊂ R : either N ⊂ M or M ∩ N = ∅} .
M is a σ-algebra,
ν is a complete measure on M,
for all M ∈ M
ρ(M) = ν(M) ,
for any M ∈ M
C
ν(H) = ν(H ∩ M) + ν(H ∩ M )
for all H ⊂ R.
Definition
C
ν(A) ≥ ν(A ∩ M) + ν(A ∩ M )
Theorem
(Carathéodory Theorem) The collection M of all ν-measurable sets is a σ-algebra, and ν is a complete measure on M.
Example
Let
H = {R and all finite subsets of R}
and on H define
#(H) − 1, if H ̸= ∅ is finite,
ρ(H) = 0, if H = ∅,
1, if H = R.
Then
0, if A is countable,
ν(A) =
1, if A is uncountable.
Definition
[
(monotonicity/countable sub-additivity) if A ∈ H and A ⊂ An for some {An } ⊂ H, then
n
X
ρ(A) ≤ ρ(An ) .
n
Remark
Theorem
Remark
µ = ν
M(H)
Proposition
Let
H = {(a, b], (a, ∞) : −∞ ≤ a ≤ b < ∞} .
Then H is a semi-algebra.
Proposition
where
F (−∞) = lim F (x), F (∞) = lim F (x) .
x→−∞ x→∞
Then ρ is a premeasure on H.
Proof
{Ik }
n
X Xn
ρ(Ik ) = (F (bk ) − F (ak )) = F (b) − F (a) = ρ(I ) .
k=1 k=1
Main steps:
Let In = (an , bn ] be a finite interval. Since F is increasing and right continuous, for any ϵ > 0 there exists a δn such that
ϵ
F (bn ) ≤ F (bn + δn ) < F (bn ) + .
2n
Since a closed, bounded set in R is a compact set, therefore, every open cover of it has a finite subcover.
Definition
The unique measure induced by the premeasure defined above for an increasing and right continuous function F is called the Lebesgue-Stieltjes measure
generated by F , and is denoted by µF and the σ-algebra of all µF -measurable sets is denoted by MF .
Remark
Theorem
Every measure µ on B which is finite on bounded intervals is a Lebesgue-Stieltjes measure generated by the increasing and right continuous function
µ((0, x]), if x ≥ 0,
F (x) =
−µ((x, 0]), if x < 0.
Proposition
for any B ∈ MF
µF (B) = sup{µF (K ) : K is compact and K ⊂ B} ;
Remark
Clearly both the countable intersection of open sets (Gδ ) and the countable union of closed sets (Fσ ) are in B ⊂ MF .
Proposition
Definition
The Lebesgue measure is the Lebesgue-Stieltjes measure generated by F (x) = x. The σ-algebra of all Lebesgue measurable sets is denoted by L, and the
Lebesgue measure is denoted by m.
Proposition
Proposition
Any Lebesgue measurable set with m(E ) > 0 must contain a Lebesgue nonmeasurable set.
Let (X , M) and (Y , N ) be measurable spaces. A function f : X → Y is called (M, N ) measurable if f −1 (E ) ∈ M for every E ∈ N .
Let (X , M) be a measurable space. A function f : X → R is called M measurable if f −1 (E ) ∈ M for every E ∈ B.
A function f : R → R is called Borel measurable if f −1 (E ) ∈ B for every E ∈ B.
A function f : R → R is called Lebesgue measurable if f −1 (E ) ∈ L for every E ∈ B.
Proposition
Definition
This definition does not depend on the representation of the simple function.
Proposition
Z Z Z
φ + ψ dµ = φ dµ + ψ dµ .
E E E
If φ ≤ ψ, then Z Z
φ dµ ≤ ψ dµ .
E E
The map Z
A → φ dµ
A
is a measure on M.
Proposition
0 ≤ φ1 ≤ φ2 ≤ · · · ≤ f
0 ≤ |φ1 | ≤ |φ2 | ≤ · · · ≤ |f |
Definition
Z Z
f dµ = sup φ dµ : 0 ≤ φ ≤ f , φ is simple measurable function .
E E
Theorem
Proof
R
Let f dµ = 0. Define
1
En := x : f (x) > , E := {x : f (x) > 0} .
n
[
Then E1 ⊂ E2 ⊂ . . . and En = E . Since
n 1 Z Z
0 ≤ µ(En ) ≤ f dµ ≤ f dµ = 0
n En
we have µ(En ) = 0 for all n. Therefore,
µ(E ) = lim µ(En ) = 0.
n
R
Let f = 0 a.e., that is µ(E ) = 0. Thus E φ dµ = 0 for any simple measurable function φ, 0 ≤ φ ≤ f . Therefore,
Z Z Z
f dµ = f dµ + f dµ
E EC
Z Z
= sup φ dµ : 0 ≤ φ ≤ f + 0 dµ
E EC
=0 .
Proposition
Then Z Z
f dµ = lim fn dµ ≤ ∞.
n
Proof
R R
Since fn ≤ f for all n, therefore fn dµ ≤ f dµ, hence
Z Z
lim fn dµ ≤ f dµ .
n
For all α with 0 < α < 1, and for any simple functions φ with 0 ≤ φ ≤ f , define
En := {x : fn (x) ≥ αφ(x)} .
Then [
E1 ⊂ E2 ⊂ . . . and En = X .
n
Thus Z Z Z Z
lim fn (x) dµ ≥ lim f (x) dµ ≥ α lim φ dµ = α φ dµ
n n E n n E
n n
holds for every 0 < α < 1. So Z Z
lim fn (x) dµ ≥ φ dµ ,
n
therefore, Z Z Z
lim fn (x) dµ ≥ sup φ dµ : 0 ≤ φ ≤ f = f dµ .
n
Corollary
Example
Theorem
Z Z
lim inf fn dµ ≤ lim inf fn dµ .
n n
Proof
For any i ≥ k,
inf fn ≤ fi .
n≥k
Therefore, Z Z
inf fn dµ ≤ inf fi dµ .
n≥k n≥k
Example
Let
n, if x ∈ (0, 1/n),
fn (x) =
0, otherwise.
Z Z Z Z
lim inf fn dm = 0 dµ = 0 < 1 = lim inf 1 = lim inf n dm = lim inf fn dm .
n n n (0,1/n) n
Let
1,
if x ∈ (0, n),
n
fn (x) =
0, otherwise.
Z Z Z 1 Z
lim inf fn dm = 0 dm = 0 < 1 = lim inf 1 = lim inf dm = lim inf fn dm .
n n n (0,n) n n
Definition
Remark
That is, if
+ −
f := max{f , 0}, f := − min{f , 0} ,
then
f is integrable iff Z Z
+ −
f dµ < ∞ , f dµ < ∞ .
if f is integrable, then Z Z Z
+ −
|f | dµ = f dµ + f dµ .
Definition
Theorem
Corollary
Suppose
{fn } ⊂ L1
XZ
and |fn | < ∞.
n
Theorem
If f is Riemann integrable on [a, b], then it is Lebesgue integrable on [a, b], and
Z b Z
f (x) dx = f dm .
a [a,b]
Remark
Example
Let
X (−1)n−1
f (x) = χ[n−1;n) .
n=1 n
Then Z ∞
f (x) dx = ln 2 ,
0
Z
|f | dm = ∞ .
[0;∞)
Definition
The Lp space over (X , M, µ) is defined as the set of all equivalence classes of measurable functions f such that ∥f ∥p < ∞, where f and g are
equivalent if f = g a.e.
If X = N, M = P(N), and µN is the counting measure, then Lp (N, P(N), µN ) is denoted by ℓp , i.e., ℓp is the space of all sequences
{a = (an ); an ∈ R} such that X p
|an | < ∞
n