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

问题在问什么

This post may be seen as complementary to the post “ The parity problem in sieve theory “. In addition to a survey of another important sieve technique, it might be interesting as a discussion of some of the foundational issues which were discussed in the comments to that post.

Many readers will certainly have heard already of one form or another of the “large sieve inequality”. The name itself is misleading however, and what is meant by this may be something having very little, if anything, to do with sieves. What I will discuss are genuine sieve situations.

已知结果和反例

The framework I will describe is explained in the preprint arXiv:math.NT/0610021 , and in a forthcoming Cambridge Tract. I started looking at this first to have a common setting for the usual large sieve and a “sieve for Frobenius” I had devised earlier to study some arithmetic properties of families of zeta functions over finite fields. Another version of such a sieve was described by Zywina (“The large sieve and Galois representations”, preprint), and his approach was quite

Unfortunately (maybe), there will be quite a bit of notation involved; hopefully, the illustrations related to the classical case of sieving integers to obtain the primes (or other subsets of integers with special multiplicative features) will clarify the general case, and the “new” examples will motivate readers to find yet more interesting applications of sieves.

证明或构造的主线

The objects to sieve will be in a fixed set , typically infinite. The “sieve” is related to the assumed existence of a set of surjective maps , where runs through another (arbitrary) set , and is a finite set. Combinatorialists can think of these maps as a family of colorings of , and number-theorists can think of “reduction” maps modulo , in the case where is a subset of prime numbers. Indeed, the classical case occurs with , the set of primes, and being the reduction map.

We now want to define sifted sets and try to “count” them. This is where classically one would look at a discrete interval of integers, and one could think of taking a finite subset of as a generalization. However, 下面会 generalize this by looking at an arbitrary measure space , such that is finite, and assume there is a map (measurable in an obvious sense) from to , and instead of “counting”, 下面会 try to understand the measure (under ) of sifted sets, of the following type:

阅读时建议盯住的点

whenever subsets have been chosen, say for a finite subset of .

Classically, we have for some integer , is the counting measure, and one might consider , for prime, to be e.g., modulo : if is the set of primes , we see that is (essentially) the set of twin primes between and . It is clear from this that in most applications 下面会 really have a sequence of sets (with attending and ), depending on some parameter (here ), and it will be when this parameter gets large that the results will be interesting. In particular, we need to be careful ab

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

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

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

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

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