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

问题在问什么

I’ve just uploaded a new paper to the arXiv entitled “ A quantitative form of the Besicovitch projection theorem via multiscale analysis “, submitted to the Journal of the London Mathematical Society . In the spirit of my earlier posts on soft and hard analysis, this paper establishes a quantitative version of a well-known theorem in soft analysis, in this case the Besicovitch projection theorem. This theorem asserts that if a subset E of the plane has finite length (in the H

A concrete special case of this theorem relates to the product Cantor set K, consisting of all points (x,y) in the unit square whose base 4 expansion consists only of 0s and 3s. This is a compact one-dimensional set of finite length, which is purely unrectifiable, and so Besicovitch’s theorem tells us that almost every projection of K has measure zero. (One consequence of this, first observed by Kahane , is that one can construct Kakeya sets in the plane of zero measure by co

已知结果和反例

Now let be the generation of the Cantor set construction of K, thus is the union of squares of sidelength , and consists of those pairs (x,y) in the unit square whose first n digits in the base 4 expansion consist of 0s and 1s. Define the Favard length of this set to be the average measure of a random orthogonal projection of this set to a line; roughly speaking, this quantity measures how likely Buffon’s needle will fall within a distance of the original Cantor set K. Besico

The problem of establishing the correct rate of decay for this Favard length has received some recent attention. It turns out to be non-trivial to get any explicit decay at all; this was first done by Peres and Solomyak , who obtained a bound of the form , where c > 0 is an absolute constant and is the inverse tower exponential function, i.e. it is the number k of logarithms needed in order for the iterated logarithm of n to drop below 2 (say). This is an incredibly slow rate

证明或构造的主线

The focus in my paper is not to improve these results for the Cantor set, but instead to try to do something similar for more general unrectifiable sets by quantifying the projection theorem. To do this, one has to make the concept of “purely unrectifiable” quantitative, but perhaps more surprisingly one also has to make more quantitative the notion of “length”. At first glance, length is already a quantitative notion – it is, after all, a number. But hidden in the Hausdorff

The notation of unrectifiability also needs to be made quantitative, but this turns out to be straightforward: one asks that the original set E does not have a large intersection with a small neighbourhood of a Lipschitz graph of a specified Lipschitz constant.

阅读时建议盯住的点

Anyway, the main result of the paper is to give an explicit non-trivial upper bound for the Favard length in terms of the quantitative version of Hausdorff length control, and the quantitative version of pure unrectifiability. The precise formulation is a bit technical to state here, but when this machinery is applied to the Cantor set K (with the unrectifiability control provided either by quantitative versions of the Rademacher differentiation theorem, or by Peter Jones’ th

The proof basically consisted of taking the qualitative proof of the Besicovitch projection theorem in Mattila’s book and making every step in the argument quantitative. This turned out to be a little tricky in places, for instance any appeal to the Lebesgue differentiation theorem or Rademacher differentiation theorem had to be replaced with a quantitative counterpart. (There was also some appeals to such “obvious” statements as “every finite set is bounded” which also neede

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

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

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

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

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