三维Kakeya简化的细胞极大密度分解及修正
Cellular Maximal-Density Factoring: Joint Shadings, Stable Refinements, and a Conditional Kakeya Application
- Changkong College, Nanjing University of Aeronautics and Astronautics（南京航空航天大学长空学院）
- School of Science, Nanjing University of Posts and Telecommunications（南京邮电大学理学院）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
针对Guth–Wang–Zahl三维Kakeya简化证明的两处缺陷，提出细胞联合极大密度分解方法修正，完成关键估计与链推导，证明对应幂为尖锐值。
AI中文摘要：
Guth–Wang–Zahl提出的三维Kakeya简化使用极大密度分解步骤在子管与更长的凸父管之间过渡，后续应用要求一个输出保留阴影质量、正则化两个重数并与进一步的父管细化兼容。已发表证明中的两处过渡未确保这三点：邻近子管支撑无法确定被截断父管邻域的重数，且最终子管细化不一定保留针对早期父管阴影证明的结论。我们将其替换为细胞联合极大密度分解：正子管质量记录在带标签父管与半开单元的加权图上，正则化边权与右度产生一个边集，同时定义两种阴影，使兼容性与重数恒等式成立；可比权重还可将全 incidence 父管细化提升回子管质量。我们开发了分辨率受限的角度选择，同步粗小管与细管质量，证明所需的带标签 slab 估计，并追踪第6节与第9节应用中的损失；缓冲度拆分则给出方程(94)--(103)与主引理2的修正链。对于此处考虑的均匀类，基于DOV的矩形幂2−σ是尖锐的，我们不主张更强的终端Kakeya指数，其尖锐凸父管类似问题仍未解决。
英文摘要：
Maximal-density factoring must often make one parent object carry several forms of information at once: child mass, two multiplicity levels, a density estimate, and the ability to survive later geometric refinements. These properties are not stable under arbitrary deletion. We introduce a cellular factoring method that places positive child mass on a weighted bipartite graph of labelled parents and half-open spatial cells. After regularizing edge weights and cell degrees, one edge set defines both the child shading and the parent shading. Compatibility and pointwise multiplicity bounds are then exact, while any later selection of whole parent-cell incidences lifts quantitatively back to the children. The combinatorial core does not require Euclidean geometry: it extends to finite measurable atomic partitions with comparable atom measures and admits an explicit finite-iteration loss. We combine this joint construction with a weighted planar incidence estimate, a resolution-limited cellwise angular selection, a labelled slab estimate, and a global synchronization of tubelet and fine-tube mass. The resulting rectangular parent estimate has shading exponent $2-σ$, which is sharp uniformly over the class considered here. With the stated GWZ factoring data and corresponding $K_F(β)$ or $K_{KT}(β)$, we obtain the two small-middle interfaces used in the reduction. For the very-non-sticky branch, assuming both $K_{KT}(β)$ and $K_F(β)$, the stated GWZ Lemma 9.1 hypotheses together with the source-uniformity and refinement interface (I1)--(I4) yield the terminal gain for the represented fine-tube input; this conditional application supplies the corresponding input to the surrounding reduction, while the sharp-convex-parent problem lies outside its scope.
