One of the main results in the paper mentioned in the title is the following.
Theorem 1.Let be the unit cube in and let be a continuous function with zero mean. Let be the nodal set . Let denote the -dimensional Hausdorff measure of . Then
(1)
Here indicates the Vaserstein distance between the positive and negative parts of .
The proof, which we now recall briefly, was based on a recursive selection, through a stopping time argument, of dyadic squares where either the mass of is irrelevant, called empty, or is much larger than (or the other way around), called unbalanced.
Assume, without loss of generality, that
is finite and that
is normalized so that
. Consider now the standard dyadic partition of the unit cube: first split
into
subcubes of length
and then, recursively, split each of the new subcubes into
“descendants” each with side length half that of the “parent”. A cube
is
balanced if
where
indicates the volume and
On the other hand,
is
empty if
.
Recursively, at each generation we set aside the cubes
such that either:
- (i) the cube itself is empty;
- (ii) one of the direct descendants of is full (non empty) and unbalanced. In this case, denote by the full, unbalanced descendant of for which is maximal.
This gives a decomposition
where
and
indicate respectively the indices of the empty and full selected cubes, and where
is the remaining set (whatever has not been selected in the process above).
We proved (Proposition 2) that
and that the full cubes
carry most of the mass, i.e.
, and next we claimed (Remark 1) that the corresponding descendants
,
, still carry a significant part of that mass:
(2)
Benjamin Jaye has kindly pointed out that this last estimate may in principle not be true in general, in that the mass in the full, unbalanced descendants may not be comparable to the total mass of in – this mass may lie predominantly in the balanced descendants of . He suggested circumventing this difficulty by constructing the cubes by means of a continuous stopping time argument together with the Besicovitch covering theorem, replacing our original dyadic-based decomposition. With these new cubes, Propositions 3 and 4 remain valid, hence also the statement of Theorem 1. The dyadic decomposition used to prove Theorem 2 requires analogous modification. The result itself, as well as all other results, remains correct as stated.
Details of the modifications to the proof of Theorem 1 are as follows. The function
is extended by 0 from
to all of
. The definitions of balanced and unbalanced cubes are modified so that a cube
is
balanced if
(3)
The choice of the factor
is in accordance with the constant appearing in the Besicovitch covering theorem (see below).
A similar adjustment is made to the definition of full and empty cubes, in that a cube
is
empty whenever
For every such that , there exists such that the open cube centred at and of side length is simultaneously balanced and unbalanced in that either or equals . This can be achieved by continuity, since for very small the cube centred at and of side length is infinitely unbalanced, while for side length it is balanced. Then there must be an intermediate side length for which one of the inequalities in (3) is actually an identity.
These cubes
cover
(up to at most a zero-measure set). According to the Besicovitch covering theorem [
1, Theorem 18.1] (see also [
2]), one can find
sequences
,
, such that for each
the cubes
are pairwise disjoint and together still cover
:
Since
, there is at least one family of cubes
such that
From this particular sequence of cubes we select those that are full, and further relabel the cubes themselves as
. These cubes are thus disjoint and carry most of the mass, since
In conclusion, estimate (2) holds for the cubes
, up to a change of constants. Lemma 1 follows as before with only minor modifications due to extending
by 0 to all of
.
With the revised choice of the side length of the cubes , both the estimates for the size of the zero set (Proposition 3) and for the Vaserstein distance (Proposition 4) hold for the new , with the obvious modifications. The proof of Theorem 1 then concludes as before.
The proof of Theorem 2 follows similar arguments. One option is just to take in the existing proof the cells , where the cubes are now obtained as explained above. Another option is to use Nash's embedding theorem and consider the -dimensional compact manifold as isometrically embedded in . Then the standard Besicovitch theorem in yields a similar Besicovitch covering theorem for (with constant instead of ).
标题中提到的论文的主要结果之一如下。
定理 1.让 是单位立方体 然后让 是一个均值为零的连续函数。让 成为节点集 . 让 表示 维豪斯多夫测度 . 然后
(1)
这里 表示正负部分之间的 Vaserstein 距离 .
我们现在简要回顾一下这个证明,它基于通过停止时间参数对二元平方的递归选择 其中任一质量 无关紧要,称为空,或 远大于 (或相反),称为unbalanced。
不失一般性,假设
是有限的并且
被归一化,使得
. 现在考虑单位立方体的标准二元划分:第一次分裂
进入
长度的子立方体
然后,递归地,将每个新的子立方体拆分为
每个“后代”的边长都是“父母”的一半。一个立方体
是
平衡的,如果
在哪里
表示音量和
另一方面,
是
空的如果
.
递归地,在每一代我们都将立方体放在一边
使得:
- (i)立方体 本身是空的;
- (ii)其中之一 直系后代 的 已满(非空)且不平衡。在这种情况下,表示为 完整的,不平衡的后代 为此 是最大的。
这给出了一个分解
在哪里
和
分别表示空的和完整的选定立方体的索引,其中
是剩余的集合(在上面的过程中没有选择的任何东西)。
我们证明了(命题 2)
和完整的立方体
承载大部分质量,即
, 接下来我们声明 (Remark 1) 相应的后代
,
,仍然承载着该质量的很大一部分:
(2)
Benjamin Jaye 善意地指出,最后的估计在原则上一般来说可能不正确,因为完整的、不平衡的后代的质量 可能无法与总质量相比 在 – 这种物质可能主要存在于平衡的后代中 . 他建议通过构建立方体来规避这个困难通过连续停止时间参数和 Besicovitch 覆盖定理,取代了我们原来的基于二元的分解。有了这些新立方体,命题 3 和 4 仍然有效,因此定理 1 的陈述也是有效的。用于证明定理 2 的二进分解需要类似的修改。结果本身,以及所有其他结果,如所述保持正确。
对定理 1 证明的修改细节如下。功能
从 0 扩展
对所有
. 修改了平衡和非平衡立方体的定义,以便立方体
是
平衡的,如果
(3)
因子的选择
符合 Besicovitch 覆盖定理中出现的常数(见下文)。
对满立方体和空立方体的定义进行了类似的调整,因为立方体
什么时候都是
空的
对于每 以至于 , 那里存在 使得开放的立方体 以 和边长 同时平衡和不平衡,因为要么 或者 等于 . 这可以通过连续性来实现,因为对于 以非常小的立方体为中心 和边长 是无限不平衡的,而对于边长 它是平衡的。那么一定有一个中间边长 其中(3)中的一个不等式实际上是一个恒等式。
这些立方体
覆盖
(最多一个零测量集)。根据 Besicovitch 覆盖定理 [
1 , Theorem 18.1](另见 [
2 ]),可以发现
序列
,
,这样对于每个
立方体
成对不相交并且在一起仍然覆盖
:
自从
,至少有一个立方体族
以至于
从这个特定的立方体序列中,我们选择那些已满的立方体,并进一步将立方体本身重新标记为
. 这些立方体因此是不相交的并承载了大部分质量,因为
总之,估计(2)适用于立方体
,直到常数的变化。引理 1 与以前一样,只是由于扩展而进行了微小的修改
由 0 到所有
.
随着立方体边长的修正选择 ,零集大小(命题 3)和 Vaserstein 距离(命题 4)的估计值都适用于新的 ,有明显的修改。定理 1 的证明然后如前结束。
定理 2 的证明遵循类似的论证。一种选择是采用现有的证明细胞,其中立方体 现在获得如上所述。另一种选择是使用纳什嵌入定理并考虑维紧凑流形 作为等距嵌入 . 那么标准的贝西科维奇定理 产生类似的贝西科维奇覆盖定理 (与常数 代替 )。