陶哲轩博客写数学问题时，通常先把对象定义清楚，再给直觉、反例和证明轮廓。把「Distinguished Lecture Series II: Charles Fefferman, “Interpolation of functions on R^n”」改写成可阅读的中文笔记，重点是：问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。

问题在问什么

On Thursday, Charlie Fefferman continued his lecture series on interpolation of functions. Here, he stated the main technical theorem about bundles that underlies all the results, answering the “cliffhanger” question from the last lecture , and broadly outlined the proof, except for a major technical wrinkle about “Whitney convexity” which he will discuss on Friday. Last time, Charlie introduced the notion of a bundle on a compact set , as a collection of subsets of the ring

As mentioned earlier, this problem generalises the problem of how to extend a function f on E (possibly with some derivatives prescribed) to a function F on ; the bundle is describing all the constraints that F has to satisfy. Later on, 下面会 also discuss a more general version of these results, in which is supposed to lie in a convex set, rather than a coset. As stated, this question is too general (it includes as a special case the existence problem for arbitrary linear parti

已知结果和反例

As mentioned in the first lecture, if E was a finite set, then the first two questions here are trivial, and the last one is given by the finiteness theorem. However, there is a compactness problem when moving from the finite world to the infinite world, basically because the uniform limit of uniformly functions need not be (consider for instance how the one-dimensional uniformly functions converge to the merely function |x| as . However, as mentioned before, no such difficul

Anyway, let us return to questions 1-3 above. There is an obvious obstruction to solvability of Q1: if the bundle has any empty fibre, thus for at least x, then clearly the bundle admits no sections. Is this the only obstruction – or in other words, does solvability at each point imply global solvability? The answer is rather clearly no, even in the easy case m=0 and n=1. For instance, take , let be the set of all constant functions, and let consist of a single constant funct

证明或构造的主线

What has gone on here is that while the original bundle looked prima facie like it could support sections, the qualitative nature of the solution space showed that the constraints in that bundle actually forced sections to lie in a smaller bundle (which, in the above simple example, is the same as the original bundle but in which the fiber at 0 was replaced with the empty set). The smaller bundle did not admit sections, and so the original bundle did not.

It turns out that there is a natural way to generalise the idea of “using continuity to deduce new constraints from old” to the problem and not just the problem, known as Glaeser reduction . To explain it, let us give a more sophisticated example, now in the category of rather than . Let be a function with for , and with oscillating infinitely often between -1 and 1. (A simple example of such a function is .) Let be the graph of , with the origin adjoined. Consider the proble

阅读时建议盯住的点

But what is happening at the origin (0,0)? The value of F(0,0) is of course prescribed to equal f(0,0), but what about the first derivatives ? The curve E is not differentiable at (0,0), so one cannot directly differentiate f to recover any of these first derivatives. However, we are requiring F to be not just differentiable, but continuously differentiable. Because of this, we can infer constraints on from the constraints on the tangential derivatives as x approaches 0. Inde

One can even concoct iterated examples in which the continuity is used once to deduce new constraints from old, and then used again to deduce even more constraints from the ones just established. Consider for instance the compact set , where each is the curve

值得单独记下的条目

• What can we say about the jets of sections F of ? We know they lie in , but can they take on every value in that space?
• What is the best value of , as F ranges over sections of ?
• admits sections if and only if every fibre of is non-empty.
• If admits sections, and , then every element of can arise as the jet of a section of .
• If admits sections, then there exists a finite subset S of E of cardinality O(1) such that .

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

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

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

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

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