Étoiles et toi

Convergence of measurable functions

The discussion of this article falls entirely into the category of standard Lebesgue measure on ℝ𝑛, and all measurable functions and measurable spaces are Lebesgue measurable. For the difference and connection between Lebesgue measure theory and Borel measure theory, I refer you to Borel measure and Lebesgue measure.

2 Convergence a.e.

Definition 2.1 (Convergence a.e.).

We say that a sequence of L-measurable functions {𝑓𝑛} defined on a measurable set 𝐸⊆ℝ𝑛 converges almost everywhere if it converges pointwise to a measurable function 𝑓 other than on a null set. That is

𝜆({𝑥∈𝐸|lim𝑛→∞𝑓𝑛(𝑥)≠𝑓(𝑥)})=0

where 𝜆 is the standard Lebesgue measure on ℝ𝑛.

3 Almost uniform convergence

Definition 3.1 (Convergence a.u.). Given a sequence {𝑓𝑛} of L-measurable functions defined on an L-measurable set 𝐸⊆ℝ𝑛, if for all 𝛿>0, there exists a L-measurable set 𝐸𝛿⊆𝐸 s.t. 𝜆(𝐸𝛿)<𝛿, {𝑓𝑛} converges uniformly on 𝐸∖𝐸𝛿. We say that {𝑓𝑛} almost converges uniformly on 𝐸.

Notice that the definition of almost uniform convergence is different from uniform convergence a.e. because we require that it converges uniformly on non-measure-zero sets, despite that the set can be arbitrarily small. 1

3.1 Egorov theorem

In mathematical analysis, the condition of uniform convergence is unusually strong, that in general you don’t have uniform convergence if you can only prove pointwise convergence.

Theorem 3.1.1 (Egorov). Suppose that 𝐸 is a finite L-measurable set, and {𝑓𝑛} a sequence of L-measurable functions that converges a.e. to a function 𝑓 that is finite a.e. . Then {𝑓𝑛} converges a.u. to 𝑓.

2

4 Convergence in measure

Definition 4.1 (Convergence in measure).

Let 𝜆 be a standard Lebesgue measure on measurable set 𝐸⊆ℝ𝑛, then we say that a sequence of a.e. finite functions {𝑓𝑛}:𝐸→ℝ𝑛, convergeces in measure to 𝑓, if for all 𝜀>0, we have

lim𝑛→∞𝜆({𝑥∈𝐸||𝑓𝑛(𝑥)−𝑓(𝑥)|≥𝜀})=0

This kind of convergence coincide with that of probability, in probability we say that a sequence of random variables 𝑋𝑛 converges in probability to 𝑋 if for all 𝜀>0

lim𝑛→∞ℙ(|𝑋𝑛−𝑋|≥𝜀)=0

here the probability function ℙ(𝑋) stands as a measure.

4.1 Properties of convergence in measure

We discuss briefly the convergence in measure compared to other kinds of convergence, first we have the following observation:

Let 𝐸=(0,∞), define

𝑓𝑛(𝑥)={0if𝑥∈(0,𝑛]1if𝑥∈(𝑛,∞)

we can verify that 𝑓𝑛⟶a.e.0: Consider

lim𝑛→∞𝜆({𝑥∈𝐸||𝑓𝑛(𝑥)−0|})

Let 𝑥∈𝐸, we can find an 𝑁∈ℕ s.t. 𝑁>𝑥, by definition of 𝑓𝑛(𝑥), we have 𝑓𝑛(𝑥)=0 for all 𝑛≥𝑁 (since now 𝑥∈(0,𝑛]). Therefore 𝑓𝑛 converges pointwise to 0.

But this function does not converges in standard Lebesgue measure, which requires

∀𝜀>0.lim𝑛→∞𝜆({𝑥∈𝐸||𝑓𝑛(𝑥)−0|≥𝜀})=0

However, notice that for each 𝑓𝑛, no matter how big 𝑛 is, there are always uncountably many point in (𝑛,+∞) on which 𝑓𝑛(𝑥)=1, this shows that

lim𝑛→∞𝜆({𝑥∈𝐸||𝑓𝑛(𝑥)−0|≥1})=∞

which shows that 𝑓𝑛 does not converges in measure to 𝑓.

4.1.1 Lebesgue theorem

Let us pause and consider briefly why would this happen. An obvious reason is that 𝐸 is infinitely big, so that the increment of 𝑛 can never “fill” the rest of the space, so if we can somehow control the “rest” of the uncontrolled space as we advance, so that the unconstrolled space finally becomes zero, we may establish a stronger result, this is shown by Lebesgue theorem, Henri Lebesgue proved that under certain conditions, convergence a.e. implies convergence in measure.

Theorem 4.1.1.1 (Lebesgue).

Suppose

  1. 𝐸⊆ℝ𝑛 is a finite L-measurable set
  2. {𝑓𝑛} a sequence of a.e. finite functions on 𝐸
  3. 𝑓𝑛⟶a.e.𝑓 where 𝑓 is a function a.e. finite.

Then we have

𝑓𝑛⟶m.𝑓

4.1.2 Riesz theorem

With one direction we have another direction, Riesz theorem provides the method to turn convergence in measure into convergence a.e.

Theorem 4.1.2.1 (Riesz). Let 𝑓𝑛⟶m.𝑓 on 𝐸⊆ℝ𝑛 measurable. Then there exists subsequence 𝑓𝑛𝑘⟶a.e.𝑓.

5 Relation diagram of three different kinds of convergence

Therefore, summarizing the above three different kinds, we can have the following diagram

Typst visual content
  1. 1This is in particular a weaker version of convergence uniformly almost everywhere.
  2. 2Notice that the inverse of Egorov theorem is automatically true (since uniform convergence is stronger), this makes Egorov theorem a necessary and sufficient condition for convergence a.u.

Nearby in the garden

数学 / Analysis

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注