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

问题在问什么

Assaf Naor and I have just uploaded to the arXiv our paper “ Random Martingales and localization of maximal inequalities “, to be submitted shortly. This paper investigates the best constant in generalisations of the classical Hardy-Littlewood maximal inequality

for any absolutely integrable , where is the Euclidean ball of radius centred at , and denotes the Lebesgue measure of a subset of . This inequality is fundamental to a large part of real-variable harmonic analysis, and in particular to Calderón-Zygmund theory . A similar inequality in fact holds with the Euclidean norm replaced by any other convex norm on .

已知结果和反例

The exact value of the constant is only known in , with a remarkable result of Melas establishing that . Classical covering lemma arguments give the exponential upper bound when properly optimised (a direct application of the Vitali covering lemma gives , but one can reduce to by being careful). In an important paper of Stein and Strömberg , the improved bound was obtained for any convex norm by a more intricate covering norm argument, and the slight improvement obtained in t

Unfortunately, we do not make direct progress on these problems here. However, we do show that the Stein-Strömberg bound is extremely general, applying to a wide class of metric measure spaces obeying a certain “microdoubling condition at dimension “; and conversely, in such level of generality, it is essentially the best estimate possible, even with additional metric measure hypotheses on the space. Thus, if one wants to improve this bound for a specific maximal inequality,

证明或构造的主线

The method of proof is a little unusual from a harmonic analysis perspective, though it is now quite standard in computer science and metric space geometry. The main idea is to try to convert the underlying metric to an ultrametric , such as those arising from dyadic models of Euclidean space (e.g. from infinite binary trees). The reason for this is that maximal inequalities are easy to prove for ultrametrics, indeed the Hardy-Littlewood inequality is always true in such sett

Now, a direct application of this idea to such metric as the Euclidean metric gives losses that are exponential in the dimension, mainly because one has to triple (resp. double) the size of a ball before it will capture all the balls of lesser radius that intersect it (resp. contain the centre of the original ball). Indeed, this is morally speaking where the Vitali covering lemma bound comes from. The standard way to say this is that the doubling constant of the Euclidean met

阅读时建议盯住的点

But suppose that if instead of trying to capture all balls of lesser radius, one only wanted to capture all balls intersecting a given ball of much smaller radius, and in particular if . Then one only needs to enlarge the original ball by a factor of to achieve this, and this only increases the volume by . Thus we see that the Euclidean metric behaves “like an ultrametric” so long as one can somehow separate scales by a ratio of or more. (This observation has also turned out

How can one formalise this intuition? To avoid some annoying technical issues it is convenient to work on the unit torus (with the induced Euclidean metric) rather than the Euclidean space ; note that a simple scaling argument shows that the maximal inequality constants for the former control those of the latter.

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

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

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

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

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