arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.15424math.COmath.MG
收藏

平面上的任意n个点都包含(m1 + o(1))n个无单位距离的点

Every n points in the plane contain (m1 + o(1)) n points with no unit distance

Shisheng Li, Yong Su

AI总结:

该研究证明平面上任意n个点中两两距离不为1的点的最大数量f(n)满足f(n)=(m1 + o(1))n,结合已有界给出f(n)的上界,相关论证已在Lean 4中形式化。

摘要:

设f(n)为平面上任意n个点构成的集合中,两两之间距离不为1的点的最大数量,m1为平面上勒贝格可测且无两点距离为1的集合的上密度的上确界。Larman和Rogers指出f(n) ≥ m1 n。我们证明f(n)/n → m1,即f(n) = (m1 + o(1))n。这是Dúcz和Varga猜想的前半部分,结合Ambrus、Csiszárik、Matolcsi、Varga和Zsámboki给出的界m1 ≤ 0.247,可得f(n) ≤ (0.247 + o(1))n。该证明构造了代数平面上的随机独立子集,其在代数平移和旋转下不变,包含原点的概率至少为有限独立比的最坏情况,并将其转化为至少具有该上密度的平面可测集合。其唯一非经典输入来自OpenAI预印本《The Euclidean plane is not five-colorable》中关于野生特征律的哈尔刚性定理,该预印本具有机器验证的Lean证明,整个论证已在Lean 4中基于该定理形式化。

英文摘要:

Let $f(n)$ be the largest integer such that every set of $n$ points in the plane contains $f(n)$ points no two at distance $1$, and let $m_1$ be the supremum of the upper densities of Lebesgue measurable planar sets with no two points at distance $1$. Larman and Rogers observed that $f(n) \ge m_1 n$. We prove that $f(n)/n \to m_1$; that is, $f(n) = (m_1 + o(1))n$. This is the first half of a conjecture of Dúcz and Varga, and with the bound $m_1 \le 0.247$ of Ambrus, Csiszárik, Matolcsi, Varga and Zsámboki it gives $f(n) \le (0.247 + o(1))n$. The proof builds a random independent subset of the algebraic plane, invariant under algebraic translations and rotations, whose probability of containing the origin is at least the worst finite independence ratio, and turns it into a measurable planar set of at least that upper density. Its only non-classical input is the Haar rigidity theorem for wild character laws from the OpenAI preprint The Euclidean plane is not five-colorable, which has a machine-checked Lean proof. The whole argument has been formalized in Lean 4 on top of it.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑