陶哲轩博客写数学问题时，通常先把对象定义清楚，再给直觉、反例和证明轮廓。把「254A, Lecture 9: Ergodicity」改写成可阅读的中文笔记，重点是：问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。

问题在问什么

We continue our study of basic ergodic theorems, establishing the maximal and pointwise ergodic theorems of Birkhoff. Using these theorems, we can then give several equivalent notions of the fundamental concept of ergodicity , which (roughly speaking) plays the role in measure-preserving dynamics that minimality plays in topological dynamics. A general measure-preserving system is not necessarily ergodic, but we shall introduce the ergodic decomposition , which allows one to

Just as we derived the mean ergodic theorem from the more abstract von Neumann ergodic theorem in the previous lecture , we shall derive the maximal ergodic theorem from the following abstract maximal inequality.

已知结果和反例

Theorem 1 . (Dunford-Schwartz maximal inequality) Let be a probability space, and let be a linear operator with P1=1 and (i.e. for all . Assume also that P maps non-negative functions to non-negative functions. Then the maximal function obeys the inequality

Since , we thus see (by replacing f with ) that we can reduce to proving (2) in the case .

证明或构造的主线

For every , consider the modified maximal function . Observe that if and only if for all sufficiently large m. By the dominated convergence theorem, it thus suffices to show that

for all m. But observe from definition of (and the positivity preserving nature of P) that we have the pointwise recursive inequality

阅读时建议盯住的点

Integrating this on the region and using the non-negativity of , we obtain

Applying this in the case when P is a shift operator, and replacing f by |f|, we obtain

值得单独记下的条目

• Any set which is invariant (thus TE=E) has either full measure or zero measure .
• Any set which is almost invariant (thus TE differs from E by a null set) has either full measure or zero measure.
• Any measurable function f with a.e. is constant a.e.
• For any and , the averages converge in norm to .
• For any two measurable sets E and F, we have .
• For any , the averages converge pointwise almost everywhere to .

阅读和落地时建议先做的 5 件事

1. 用自己的语言重写定义和结论，不看原文能不能说清对象是什么。
2. 找一个最小反例或边界情形，确认假设少一条会怎样。
3. 把证明拆成可独立检验的引理，每步只保留一个新想法。
4. 若涉及计算或形式化，先写可复现的小例子，再谈一般情形。
5. 记下尚未解决的缺口：缺估计、缺构造，还是缺正确的范畴。

和智能体、形式化工具怎么接

龙虾PRO做 OpenClaw 落地时，数学笔记最有用的部分往往是「可检验的步骤」：定义、反例、引理边界。智能体适合帮忙展开计算和检索，不适合代替你决定哪条假设能扔。

本文侧重全链路风控方法论。落地时请用自身业务单据做回放验证，不要把示例阈值直接当生产策略。 相关：风控体检 · 方案资源