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

问题在问什么

This week I am in San Diego for the annual joint mathematics meeting of the American Mathematical Society and the Mathematical Association of America . I am giving two talks here. One is a lecture (for the AMS “Current Events” Bulletin) on recent developments (by Martel-Merle, Merle-Raphael, and others) on stability of solitons; I will post on that lecture at some point in the near future, once the survey paper associated to that lecture is finalised. The other, which I am pr

p.s. At this meeting, Endre Szemerédi was awarded the 2008 Steele prize for a seminal contribution to research , for his landmark paper establishing what is now known as Szemerédi’s theorem , which underlies the result I discuss in this talk. This prize is richly deserved – congratulations Endre! [The AMS and MAA also awarded prizes to several dozen other mathematicians, including many mentioned previously on this blog; rather than list them all here, let me just point you to

已知结果和反例

My talk concerns the subject of additive prime number theory – which, roughly speaking, is the theory of additive patterns contained inside the prime numbers . This is a very old subject in mathematics; for instance, the twin prime conjecture , which asserts that there are infinitely many patterns of the form in the primes, may have been considered in one form or another by Euclid (although the modern version of the conjecture probably dates to Brun’s 1915 paper, who showed t

In this talk, I will present the following result of myself and Ben Green in this subject:

证明或构造的主线

Green-Tao Theorem . The prime numbers contain arbitrarily long arithmetic progressions.

More specifically, I want to talk about three basic ingredients in the proof, and how they come together to prove the theorem:

阅读时建议盯住的点

which relates the primes to the Riemann zeta function . [Incidentally, this formula, if rewritten using the geometric series formula as

is a restatement (via generating functions ) of the fundamental theorem of arithmetic ; if instead one rewrites it as

值得单独记下的条目

• Random models for the primes;
• Sieve theory and almost primes;
• Szemerédi’s theorem on arithmetic progressions.
• Take a large number N, and let n be a randomly chosen integer from 1 to N. By the prime number theorem, the event that n is prime has probability .
• By another application of the prime number theorem, the event that n+2 is prime also has probability . (The shift by 2 causes some additional correction terms, but these can be easily absorbed into the o(1) term.)
• Assuming these two events are independent, we conclude . In other words, the number of twin primes less than N is .
• Since goes to infinity as N goes to infinity, there are infinitely many twin primes.
• * . * . * . * . * . * . * .

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

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

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

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

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