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

问题在问什么

This week I am visiting the University of Washington in Seattle, giving the Milliman Lecture Series for 2007-2008. My chosen theme here is “ Recent developments in arithmetic combinatorics “. In my first lecture, I will speak (once again) on how methods in additive combinatorics have allowed us to detect additive patterns in the prime numbers, in particular discussing my joint work with Ben Green . In the second lecture I will discuss how additive combinatorics has made it po

Additive combinatorics is focused, among other things, on the task of studying additive patterns in general sets of integers (or more generally, sets in an additive group). It is descended in part from the more classical subject of additive number theory : the study of additive patterns, structures, and operations on explicit sets of integers, such as the primes and the squares . Here are some typical results and conjectures in the subject for both the primes and the squares,

已知结果和反例

I have deliberately phrased the above results in a unified format, namely that of counting additive patterns with one or more free parameters in either the squares or the primes. However, this apparent unification is actually an illusion: the results involving square numbers are much older (the Pell equation solutions, for instance, was essentially known to Diophantus , as well as the ancient Indians) and are proven using completely different methods than for the prime number

To give a very simple example of how additive combinatorics can be applied to the primes, let us consider the problem of finding parallelograms inside the primes – patterns of the form with positive integers; for instance, 3, 7, 43, 47 is a parallelogram of primes. It is very hard to produce any parallelograms of primes by algebraic means (such as an explicit formula); however, there is a simple combinatorial argument that shows that such parallelograms exist in abundance. Th

证明或构造的主线

Let N be a large number, then there are primes less than N. This allows us to form roughly differences of primes . But each of these differences takes values between 1 and N. For N large enough, we can thus use the pigeonhole principle to conclude that there are two differences and of primes which have the same value, which implies that the quadruplet forms a parallelogram. In fact, a slight refinement this argument (using the Cauchy-Schwarz inequality , which can provide a m

The above example shows how one can detect additive patterns in the primes using very little information about the primes themselves; in the above case, the only information we actually needed about the primes was about their cardinality. (Indeed, the argument is not really about primes at all, and is best viewed as a general statement about dense sets of integers, known as the Szemerédi cube lemma .) More generally, the strategy of the additive combinatorial approach is to m

阅读时建议盯住的点

A good example of this type of tool is Szemerédi’s theorem , which asserts any set of integers A of positive density contains arbitrarily long arithmetic progressions; as with the case of parallelograms, the only information needed about the set is that it is large. This theorem does not directly apply to the prime numbers , as they have density zero, but it turns out that there is a trick (which Ben Green and I call the transference principle ) which (very roughly speaking)

In this talk, though, I am not going to discuss the above results further, but instead focus on the task of using additive combinatorics to detect more general classes of additive patterns in sets of integers such as the primes, with the philosophy of always trying to use as little structural information about these sets as possible.

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

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

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

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

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