陶哲轩博客写数学问题时,通常先把对象定义清楚,再给直觉、反例和证明轮廓。把「Fourier uniformity of bounded multiplicative functions in short intervals on average」改写成可阅读的中文笔记,重点是:问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。
问题在问什么
Kaisa Matomäki , Maksym Radziwill , and I just uploaded to the arXiv our paper “ Fourier uniformity of bounded multiplicative functions in short intervals on average “. This paper is the outcome of our attempts during the MSRI program in analytic number theory last year to attack the local Fourier uniformity conjecture for the Liouville function . This conjecture generalises a landmark result of Matomäki and Radziwill , who show (among other things) that one has the asymptoti
whenever and goes to infinity as . Informally, this says that the Liouville function has small mean for almost all short intervals . The remarkable thing about this theorem is that there is no lower bound on how goes to infinity with ; one can take for instance . This lack of lower bound was crucial when I applied this result (or more precisely, a generalisation of this result to arbitrary non-pretentious bounded multiplicative functions) a few years ago to solve the Erdös di
已知结果和反例
The local Fourier uniformity conjecture asserts the stronger asymptotic
under the same hypotheses on and . As I worked out in a previous paper , this conjecture would imply a logarithmically averaged three-point Chowla conjecture, implying for instance that
证明或构造的主线
This particular bound also follows from some slightly different arguments of Joni Teräväinen and myself , but the implication would also work for other non-pretentious bounded multiplicative functions, whereas the arguments of Joni and myself rely more heavily on the specific properties of the Liouville function (in particular that for all primes ).
There is also a higher order version of the local Fourier uniformity conjecture in which the linear phase is replaced with a polynomial phase such as , or more generally a nilsequence ; as shown in my previous paper , this conjecture implies (and is in fact equivalent to, after logarithmic averaging) a logarithmically averaged version of the full Chowla conjecture (not just the two-point or three-point versions), as well as a logarithmically averaged version of the Sarnak con
阅读时建议盯住的点
The main result of the current paper is to obtain some cases of the local Fourier uniformity conjecture:
Theorem 1 The asymptotic (2) is true when for a fixed .
阅读和落地时建议先做的 5 件事
- 用自己的语言重写定义和结论,不看原文能不能说清对象是什么。
- 找一个最小反例或边界情形,确认假设少一条会怎样。
- 把证明拆成可独立检验的引理,每步只保留一个新想法。
- 若涉及计算或形式化,先写可复现的小例子,再谈一般情形。
- 记下尚未解决的缺口:缺估计、缺构造,还是缺正确的范畴。
和智能体、形式化工具怎么接
龙虾PRO做 OpenClaw 落地时,数学笔记最有用的部分往往是「可检验的步骤」:定义、反例、引理边界。智能体适合帮忙展开计算和检索,不适合代替你决定哪条假设能扔。
本文侧重全链路风控方法论。落地时请用自身业务单据做回放验证,不要把示例阈值直接当生产策略。 相关:风控体检 · 方案资源
常见问题 FAQ
什么是AI智能系统?
「AI智能系统」可概括为:Kaisa Matomäki, Maksym Radziwill, and I just uploaded to the arXiv our paper “Fourier uniformity of bounded multiplicative functions in short intervals on average“. This paper is t 本文从定义、方法与实践要点展开说明。
为什么要关注AI智能系统?
关注AI智能系统,是因为它直接影响效率、风险与可复制性。文中指出:Kaisa Matomäki , Maksym Radziwill , and I just uploaded to the arXiv our paper “ Fourier uniformity of bounded multiplicative functions in short intervals on average “. This paper is the outcome of our attempts during the MSRI program in analytic…
如何落地AI智能系统?有哪些关键步骤?
建议按以下路径推进AI智能系统:1) 用自己的语言重写定义和结论,不看原文能不能说清对象是什么。;2) 找一个最小反例或边界情形,确认假设少一条会怎样。;3) 把证明拆成可独立检验的引理,每步只保留一个新想法。;4) 若涉及计算或形式化,先写可复现的小例子,再谈一般情形。;5) 记下尚未解决的缺口:缺估计、缺构造,还是缺正确的范畴。。细节见正文对应章节。
AI智能系统适合哪些人或团队?
AI智能系统更适合:产品/技术负责人、运营与增长团队、需要落地智能体或自动化的中小团队、关注「AI智能系统」方向的读者。若你只需要单次聊天式问答,可先读概念;若要上生产,请重点看步骤、权限与风控相关段落。
关于「问题在问什么」,本文给出了什么结论?
在「问题在问什么」部分,要点是:our paper “ Fourier uniformity of bounded multiplicative functions in short intervals on average “. This paper is the outcome of our attempts during the MSRI program in analytic number theory last year to attack the loc
关于「已知结果和反例」,本文给出了什么结论?
在「已知结果和反例」部分,要点是:int Chowla conjecture, implying for instance that 证明或构造的主线 This particular bound also follows from some slightly different arguments of Joni Teräväinen and myself , but the implication would also work for other non-prete