旧博客原文
原题:Kakeya conjecture in R^3
Kakeya conjecture in is very subtle.in fact wolff stay the best(but not very difficult to get,just use the structure so-called hairbrush)result
until the result of Katz and Tao
.Where
is a constant independent with kakeya set.and in the article of Tao,they proved
.
Two-dimensional case
first we overview the case of dimension 2,these is the only case that is proved.and the key point is the estimate:
.
where satisfied
is a
-neibeihood of kakeya set
.to remember one thing:this is equivalent to the maximal function version of kakeya conjecture,but for the minkoski version,there is a extra structure for the group
in different scales(this can be view as a multi-scale apporoach).
this inequality is easy to proof.just observed that .and to remember one thing:the inequality can be view as a uniformly estimate of overlap of the kakeya set,that is just mean the overlap would not concentrate to much at a lonely stick.this is enough to get a proof of the 2 dimension case just by a density decrement trick:we just not consider about the whole set
,but a low density subset
,where
,and make
.
Kakeya estimates
Let ,and let
be a collection of
-tubes.whose set of directions all lie in a cap of radius
. Let
be fixed.
• If we have a Kakeya estimate at some dimension d, and if the collection is direction-separated, then
(1)
• If we have an X-ray estimate at some dimension d, and if consists ofessentially distinct tubes, then
for some β > 0, where m is the directional multiplicity of .(2)
So obviously the X-ray estimate is stronger than the kakeya estimate.it is just give the information of the overlap of the sticks with the same direction.
in fact wolff have establish the X-ray estimate at dimension ,so (2) just come from a rescaling argument.
The sticky reduction
renormalization process,just consider the process to make the thin sticks to be fat.and to proof this structure nearly has Markov property.but with a very small error term when change the scale.this is proved by the X-ray estimate.
Triple intersection estimate
Use Hardy-Litterwood-Soblev inequality,we can get a so called triple intersection estimate in general,said the triple intersection is smaller than the situation the 3 lines move together.and we just accosiate this to the cap-cup principle to get some information of the volume of .

Reduce to additive combination problem
The right problem is just you have a cubes,and there is some sticks according them,if the distance of sticks is

补充说明
以下是新整理的中文说明;上方旧博客原文保持不变。
Kakeya 猜想问:包含每个方向单位线段的集合是否必须有 full Hausdorff 或 Minkowski dimension?二维情形已经解决,三维情形则出现了 hairbrush、multiscale 和 sum-product 等深层结构。

1. Tube formulation
令 $E_\delta$ 是 Kakeya set 的 $\delta$-neighborhood。Minkowski 维数问题等价于估计
$$|E_\delta|\gtrsim_\varepsilon \delta^{\varepsilon}$$
在合适维数归一化下的下界。更常用的语言是研究方向分离的 $\delta$-tubes 的重叠。
2. 二维情形
二维中,任意两个不同方向 tubes 的交叠容易控制。核心估计可以理解为:重叠不能集中在一根孤立 tube 附近。由此配合 density decrement,可推出二维 Kakeya 集合有 full dimension。
3. Hairbrush 结构
三维中,许多 tubes 可以围绕一根 tube 形成 hairbrush。Wolff 的观察是:如果很多 tubes 都与一根 tube 相交,那么它们的方向和位置仍然受到几何限制。这给出非平凡维数下界。
4. Multiscale 难点
Minkowski 版本比单尺度 maximal function 更微妙,因为不同尺度之间的结构会相互传递。一个尺度上的高重叠可能在下一尺度分裂,反过来又影响全局维数。
5. Katz-Tao 方向
Katz-Tao 的改进把 Kakeya 问题与 sum-product 现象联系起来。大致图像是:若 tubes 太集中,会诱导出同时具有加法和乘法结构的集合;sum-product 阻止这种集合太小。这是三维 Kakeya 后续发展的关键思想。
发表回复