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

问题在问什么

We now give a basic application of Fourier analysis to the problem of counting additive patterns in sets, namely the following famous theorem of Roth:

Theorem 1 (Roth’s theorem) Let be a subset of the integers whose upper density

已知结果和反例

is positive. Then contains infinitely many arithmetic progressions of length three, with and .

This is the first non-trivial case of Szemerédi’s theorem , which is the same assertion but with length three arithmetic progressions replaced by progressions of length for any . As it turns out, one can prove Roth’s theorem by an application of linear Fourier analysis – by comparing the set (or more precisely, the indicator function of that set, or of pieces of that set) against linear characters for various frequencies . There are two extreme cases to consider (which are mo

证明或构造的主线

for some multi-dimensional frequency and some open set . In this case, arithmetic progressions can be located using the equidistribution theory of the previous set of notes. At the other extreme, one has Fourier-uniform or Fourier-pseudorandom sets , whose correlation with any linear character is negligible. In this case, arithmetic progressions can be produced in abundance via a Fourier-analytic calculation. To handle the general case, one must somehow synthesise together th

We begin with the density increment argument. We first rephrase Roth’s theorem in a finitary form:

阅读时建议盯住的点

Theorem 2 (Roth’s theorem, again) For every , there exists an , such that for every , and every with , contains an arithmetic progression of length three.

Exercise 3 Show that Theorem 1 and Theorem 2 are equivalent.

值得单独记下的条目

• contains an arithmetic progression of length three; or
• there exists a subprogression of of length at least such that , where goes to infinity as , and is bounded away from zero whenever is bounded away from zero.
• Show that if is an unbounded limit natural number, and is a limit subset whose density is strictly greater than , then contains a (limit) arithmetic progression of length three (with ).
• Show that there exists an unbounded limit natural number and a limit subset of density , which does not contain any arithmetic progressions of length three.
• (Nonnegativity) take values in , and have mean zero;
• (Structure) is Fourier-measurable with a growth function that depends only on ;
• (Smallness) has an norm of at most ; and
• (Pseudorandomness) One has for all .

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

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

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

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

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