测度论:Measure Theory (2) —— Monotone Class Theorem(单调类定理)

这是我的笔记以及一些个人理解,其中大多证明系本人完成。

单调类定理是我初次接触测度论时遇见的第一个难以理解其证明的定理,其中对三个集类的构造颇有“左脚踩右脚上天”的感觉。但在测度论中此类构造证明比比皆是,例如后面我会讲到Vitali对不可测集的构造。




Definition. (Monotone Class)

A monotone class G is a family of sets, which is closed under countable unions of increasing sets, and closed under countable intersections of decreasing sets, i.e.,

if A1A2,AiG, then i=1AiG;

if A1A2,AiG, then i=1AiG.





Lemma 2.1

Apparently, all σfields are monontone classes. However, there exists some monotone classes that are not closed under complement or finite unions (even if they are closed under countable unions), which means that:
Monotone class can neither be a field nor a σfield.




Proof. (Lemma 2.1)

Firstly, let's prove that all σfields are monotone classes. Suppose we have a σfield F, and sets E1,E2,F. By definition, we have E1c,E2c,F.

  1. Suppose E1E2E3, where EiF for iN+. Since σfield is closed under countable unions, we have i=1EiF.
  2. Suppose E1E2E3, where EiF for iN+. Similarly, we have i=1Ei=i=1EicF.

Hence, we complete the proof that all σfields are monotone classes.

For the latter part of the statement, suppose that:

A:={all intervals in R}

Suppose an arbitrary sequence of intervals E1,E2,, where EiF for iN+. We prove that A is a monotone class firstly.

W.l.o.g., assume all intervals are open, i.e., Ei:=(ai,bi).

  1. When E1E2, we have (a1,b1)(a2,b2), where a1a2, and b1b2, that is, {an}n=1 is deceasing, and {bn}n=1 is increasing. Then limnan=aR or , and limnbn=bR or . However, any of (a,b),(a,),(,b),(,) is interval. Therefore, n=1En=limn(an,bn)A.

  2. When E1E2, similarly, we have n=1EnA.

Therefore, we complete the proof that A is a monotone class.

However, suppose E1=(2,1),E2=(1,2) and E1,E2A.

  1. E1E2=(2,1)(1,2) is not interval, hence E1E2A, which means such monotone class is not closed under finite unions.

  2. E3=(1,3), then E3c=(,1][3,) is not an interval, E3cA, which means such monotone class is not closed under complement either.





Theorem 2.1 (Monotone Class Theorem)

The smallest monotone class GA containing a field A coincides with the σ-field FA generated by A.




Proof. (Monotone Class Theorem)

Firstly, be Lemma 2.1 above, FA is a monotone class such that AFA, while GA is the smallest monotone class which contains A. Thus we have:

GAFA

Thus, it remains for us to prove that FAGA as following. We now proving GA is a field:

  1. Let G:={A:AcGA}.
  • Proof: AG.
    For BA, since A is a field, we must have BcA, and because AGA, we further have BcGA. By the way that G was constructed, we have BG. Thus,

BA:BGAAGA

  • Proof: G is a monotone class.

    Suppose E1E2,EiG. By the way that G was constructed, we have: E1cE2c,EicGA. Since GA is a monotone class, then i=1Eic=(i=1Ei)cGA. By the way that G was constructed, we further have i=1EiG

    Suppose E1E2,EiG, we must have E1cE2c,EicGA. Thus i=1Eic=(i=1Ei)cGAi=1EiG.

    GA is the smallest monotone class that contains A, then GAG, and thus for BGA:BG. By the way that G was constructed, we have BcGA. Hence, for BGA:BcGA. Therefore, GA is closed under complement.

    Besides, since A is a field and AGA, we have ΩAΩGA.
  1. Let E:={E:(AE)GA} for AA.
  • Proof: AE.
    For BA, since A is a field, then ABA, and also AGA, then (AB)GA. By the way that E was constructed, we have: BE. Thus, BA:BEAE.

  • Proof: E is a monotone class.
    Suppose E1E2,EiE. By the way that E was constructed, we have (AE1)(AE2), and (AEi)GA. Moreover, since GA is a monotone class, we have i=1(AEi)=A(i=1Ei)GA. By the way that E was constructed, we further have i=1EiE.

    Suppose E1E2,EiE, we must have (AE1)(AE2), then i=1(AEi)=A(i=1Ei)GA. By the way that E was constructed, we have: i=1EiE.

    Thus, E is a monotone class, with AE. Similar as the construction as in 1., since GA is the smallest monotone class that contains A, then: GAE.

    This means that, for BGA:BE. By the way that E was constructed, (AB)GA.

    Notice that, the first we have is AA, and then construct E accordingly based on the fixed A.

    Therefore, for AA:(E):BGA:ABGA. If we have omit the construction of E, then:

AA:BGA:ABGA

  1. Let W:={E:(AE)GA} for AGA.
  • Proof: AW.
    For B1A, from the final conclusion of 2., we have: B2GA:(B1B2)GA. Besides, by the way that W was constructed, we have: B1W, hence B1A:B1WAW.

  • Proof: W is a monotone class.
    Suppose E1E2,EiW, by the way that W was constructed, we have: (AE1)(AE2), where (AEi)GA. Since GA is a monotone class, then i=1(AEi)=A(i=1Ei)GA. Furthermore, by the way that W was constructed, we have: i=1EiW.

    Suppose E1E2, where EiW, we must have (AE1)(AE2), where (AEi)GA. Thus, i=1(AEi)=A(i=1Ei)GA. By the way that W was constructed, we have: i=1EiW.

    Therefore, W is a monotone class, with AW.

    Since GA is the smallest monotone class that contains A, then GAW. Thus for BGA:BW, and by the way that W was constructed, we have (AB)GA.

    Notice that, similar as 2., here we firstly fix AGA, and then construct W based on the fixed A accordingly.

    Therefore, AGA:BGA:(AB)GA.

    According to what have proved above, GA is closed under complement, therefore, we complete the proof that GA is a field.

Lastly, we further prove that GA is a σfield, i.e., prove GA is closed under countable unions.

Suppose E1,E2,,EiGA. Since GA is a monotone class, we have:

i=1Ei=E1E2=E1(E1E2)(E1E2E3)=i=1((k=1i1Ek)Ei)GA

Therefore, for E1,E2,,EiGA:i=1EiGA. This shows that GA is closed under countable unions, therefore, GA is a σfield.

FA is the σfield generated by A (i.e., the minimal σfield containing A). Hence FAGA.

Recall that, GAFA is already proved at the beginning. Therefore, we complete the proof that GA=FA.

posted @   车天健  阅读(563)  评论(0编辑  收藏  举报
编辑推荐:
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
阅读排行:
· TypeScript + Deepseek 打造卜卦网站:技术与玄学的结合
· 阿里巴巴 QwQ-32B真的超越了 DeepSeek R-1吗?
· 【译】Visual Studio 中新的强大生产力特性
· 10年+ .NET Coder 心语 ── 封装的思维:从隐藏、稳定开始理解其本质意义
· 【设计模式】告别冗长if-else语句:使用策略模式优化代码结构
点击右上角即可分享
微信分享提示