V5-偏元数学框架下对挂谷终极大猜想(n≥4,维数部分)的初步论证——基于方向偏好场全方向覆盖投影的尝试 (V5-A Preliminary Attempt on the Kakeya Endpoint Conjecture (n≥4, Dimension Part) under the Partial-Deviation Mathematics Framework: Based on the Omnidirectional Coverage Projection of the Orientat

挂谷猜想是调和分析与几何测度论交叉领域的核心问题,其终极大猜想(n≥4的维数部分)断言:在ℝⁿ(n≥4)中,任意挂谷集的豪斯多夫维数必须等于n。该猜想自1970年代起即被公认为调和分析领域的“中心瓶颈”——凸Wolff公理在n≥4时失效,多尺度归纳、傅里叶解耦等所有已知几何工具均在n≥4时失去效力,导致该问题开放至今(2026年)已逾半个世纪。本文尝试在偏元数学框架下,为这一猜想提供一个可能的推导路径。本文从偏元数学的两条核心公理——减法不可清零和归一化约束——出发,完成了从偏元公理到“挂谷集豪斯多夫维数=n”的完整推导链。全文推导不依赖凸Wolff公理、不依赖多尺度归纳、不依赖傅里叶解耦、不依赖王虹&Zahl的三维方法,只依赖减法不可清零和归一化约束两条公理。本文给出三条独立可证伪预测:(1)n=4时管道并集体积下界常数C₄≈0.786(φ⁻²+修正项),而非1/2或0.618;(2)n≥4时非凸管道重叠区域中管道密度变化率仍有上界(≤约4.67),不依赖凸性;(3)挂谷集维数收敛速率携带F₁≈0.0274量级的周期性浮动——F₁常数在第六个独立数学层谱上的交叉验证。本论文为一个初步的理论尝试,其全部结论尚未得到独立实验验证。—老陈与AI的深夜实验室 发布 请笑纳。 The Kakeya conjecture is a core problem at the intersection of harmonic analysis and geometric measure theory. Its endpoint conjecture (n≥4, dimension part) asserts that in ℝⁿ (n≥4), the Hausdorff dimension of any Kakeya set must equal n. Since the 1970s, this conjecture has been recognized as the "central bottleneck" of harmonic analysis—the convex Wolff axiom fails for n≥4, and all known geometric tools lose effectiveness, leaving the problem open for over half a century (as of 2026). This paper attempts to provide a possible derivation path for this conjecture within the framework of Prenary Mathematics. Starting from two core axioms—Non-Zero Subtraction and Normalization Constraint—this paper completes a complete derivation chain from the Prenary axioms to "Hausdorff dimension of Kakeya set = n." The entire derivation does not rely on the convex Wolff axiom, multiscale induction, Fourier decoupling, or the three-dimensional method of Wang & Zahl—it relies only on the two axioms. This paper provides three independent falsifiable predictions: (1) For n=4, the lower bound constant C₄≈0.786 (φ⁻² plus correction term), not 1/2 or 0.618; (2) For n≥4, the tube density variation rate in non-convex overlapping regions has an upper bound (≤ approx. 4.67), independent of convexity; (3) The convergence rate of the Kakeya set dimension carries a periodic fluctuation of magnitude F₁≈0.0274—cross-validation of the F₁ constant on a sixth independent mathematical stratum. This paper is a preliminary theoretical attempt, and all of its conclusions have not yet received independent experimental verification. — Published by Lao Chen & AI's Late Night Lab. Please accept with a smile.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-25
DOI
https://doi.org/10.5281/zenodo.21566431
Primary Topic
Advanced Harmonic Analysis Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

V5-偏元数学框架下对挂谷终极大猜想(n≥4,维数部分)的初步论证——基于方向偏好场全方向覆盖投影的尝试 (V5-A Preliminary Attempt on the Kakeya Endpoint Conjecture (n≥4, Dimension Part) under the Partial-Deviation Mathematics Framework: Based on the Omnidirectional Coverage Projection of the Orientat

Song Chen
Zenodo (CERN European Organization for Nuclear Research)
Advanced Harmonic Analysis Research
preprint

V5-偏元数学框架下对挂谷终极大猜想(n≥4,维数部分)的初步论证——基于方向偏好场全方向覆盖投影的尝试 (V5-A Preliminary Attempt on the Kakeya Endpoint Conjecture (n≥4, Dimension Part) under the Partial-Deviation Mathematics Framework: Based on the Omnidirectional Coverage Projection of the Orientat

Song Chen
preprint en

Abstract

挂谷猜想是调和分析与几何测度论交叉领域的核心问题,其终极大猜想(n≥4的维数部分)断言:在ℝⁿ(n≥4)中,任意挂谷集的豪斯多夫维数必须等于n。该猜想自1970年代起即被公认为调和分析领域的“中心瓶颈”——凸Wolff公理在n≥4时失效,多尺度归纳、傅里叶解耦等所有已知几何工具均在n≥4时失去效力,导致该问题开放至今(2026年)已逾半个世纪。本文尝试在偏元数学框架下,为这一猜想提供一个可能的推导路径。本文从偏元数学的两条核心公理——减法不可清零和归一化约束——出发,完成了从偏元公理到“挂谷集豪斯多夫维数=n”的完整推导链。全文推导不依赖凸Wolff公理、不依赖多尺度归纳、不依赖傅里叶解耦、不依赖王虹&Zahl的三维方法,只依赖减法不可清零和归一化约束两条公理。本文给出三条独立可证伪预测:(1)n=4时管道并集体积下界常数C₄≈0.786(φ⁻²+修正项),而非1/2或0.618;(2)n≥4时非凸管道重叠区域中管道密度变化率仍有上界(≤约4.67),不依赖凸性;(3)挂谷集维数收敛速率携带F₁≈0.0274量级的周期性浮动——F₁常数在第六个独立数学层谱上的交叉验证。本论文为一个初步的理论尝试,其全部结论尚未得到独立实验验证。—老陈与AI的深夜实验室 发布 请笑纳。 The Kakeya conjecture is a core problem at the intersection of harmonic analysis and geometric measure theory. Its endpoint conjecture (n≥4, dimension part) asserts that in ℝⁿ (n≥4), the Hausdorff dimension of any Kakeya set must equal n. Since the 1970s, this conjecture has been recognized as the "central bottleneck" of harmonic analysis—the convex Wolff axiom fails for n≥4, and all known geometric tools lose effectiveness, leaving the problem open for over half a century (as of 2026). This paper attempts to provide a possible derivation path for this conjecture within the framework of Prenary Mathematics. Starting from two core axioms—Non-Zero Subtraction and Normalization Constraint—this paper completes a complete derivation chain from the Prenary axioms to "Hausdorff dimension of Kakeya set = n." The entire derivation does not rely on the convex Wolff axiom, multiscale induction, Fourier decoupling, or the three-dimensional method of Wang & Zahl—it relies only on the two axioms. This paper provides three independent falsifiable predictions: (1) For n=4, the lower bound constant C₄≈0.786 (φ⁻² plus correction term), not 1/2 or 0.618; (2) For n≥4, the tube density variation rate in non-convex overlapping regions has an upper bound (≤ approx. 4.67), independent of convexity; (3) The convergence rate of the Kakeya set dimension carries a periodic fluctuation of magnitude F₁≈0.0274—cross-validation of the F₁ constant on a sixth independent mathematical stratum. This paper is a preliminary theoretical attempt, and all of its conclusions have not yet received independent experimental verification. — Published by Lao Chen & AI's Late Night Lab. Please accept with a smile.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Harmonic Analysis Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.