“孤独跑者”问题看似简单却获新突破
内容总结：
"孤独跑者"猜想研究获突破性进展：数学难题从八人推进至十人
一项看似简单、实则困扰数学界数十年的经典难题——"孤独跑者"猜想，近期连续取得关键进展。继去年法国数学家马蒂厄·罗森菲尔德成功证明八名跑者的情况后，牛津大学本科生塔努帕特·特拉库通猜在此基础上，进一步证明了九名和十名跑者的情形，为这一跨领域数学猜想的研究注入了新动力。
该猜想描述了一个场景：多名跑者以各自恒定且不同的速度，在长度为1的环形跑道上同时同向起跑。猜想断言，无论速度如何，每位跑者都将在某一时刻变得"孤独"，即与其他所有跑者的距离至少为1/N（N为跑者总数）。尽管表述直观，该问题却与数论、几何、图论乃至工程学中的视线规避、台球路径规划等复杂问题深度等价，被誉为"触及数学多个领域的多面体"。
此前，数学家已逐步证明了二至七名跑者的情形，但自2007年解决七人问题后，研究停滞了近二十年。突破始于2023年，罗森菲尔德巧妙地将问题转化为对可能反例的搜索，并借助计算机与数论工具，证明了八人情形下反例不可能存在。其方法核心在于：若猜想不成立，则跑者速度需满足一系列苛刻的素数整除条件，而这将导致速度乘积远超理论阈值，从而形成矛盾。
不久后，牛津大学二年级本科生特拉库通猜在导师引荐下接触到这一成果。他改进了罗森菲尔德的算法，以更高计算效率锁定了九人及十人情形下反例必须满足的素数约束，最终成功排除了所有反例的可能性，一举将证明推进至十人。罗森菲尔德也独立完成了九人证明，他对年轻学者的快速突破表示欣喜，同时也笑称"有点失落"。
专家评价这一进展是"量子跃迁"。由于每增加一名跑者，证明难度呈指数级增长，从七人到十人的跨越被视为重大突破。目前，两人的方法在计算上尚难以直接推广至十一人，需要"全新的视角"。但数学界普遍振奋，因为这是首次用同一方法连续解决多个情形，改变了以往每个新案例都需全新证明的局面。
受此鼓舞，德国罗斯托克大学等机构将于今年10月举办专题研讨会，汇聚来自不同领域的学者，试图从多角度交叉攻关，寻找证明或反例的最终答案。尽管距离证明任意数量跑者的通用结论可能仍需数十年，但沉寂多年的领域已重新焕发活力。正如该猜想提出者之一约尔格·威尔斯所言："我坚信问题终将被解决。"
中文翻译：
看似简单的"孤独跑者"问题取得新进展
引言
想象一个奇特的训练场景：一群跑者开始绕圆形跑道慢跑，每位跑者都保持各自独特且恒定的速度。无论他们的速度如何，是否每位跑者最终都会至少一次变得"孤独"，即相对远离其他所有人？
数学家推测答案是肯定的。
"孤独跑者"问题看似简单且无关紧要，但它以多种形式出现在数学的各个领域。它等价于数论、几何、图论等领域中的问题——例如关于何时能在障碍物场中获得清晰的视线、台球在球桌上可能的运动轨迹，或如何组织网络。"它涉及面很广，触及许多不同的数学领域，"旧金山州立大学的马蒂亚斯·贝克说。
对于只有两到三位跑者的情况，该猜想的证明是基础性的。数学家们在20世纪70年代证明了四位跑者的情况，到2007年，他们已推进到七位跑者。但在过去的二十年里，没有人能取得任何进一步进展。
随后在去年，蒙彼利埃计算机科学、机器人与微电子实验室的数学家马蒂厄·罗森菲尔德解决了八位跑者的情况。几周内，牛津大学一名名叫塔努帕特（保罗）·特拉库尔通猜的二年级本科生，基于罗森菲尔德的想法，证明了九位和十位跑者的情况。
这一突然的进展重新点燃了人们对这个问题的兴趣。"这真是一个巨大的飞跃，"未参与此项工作的贝克说。他补充道，每增加一位跑者，证明猜想的任务就变得"指数级地困难"。"从七位跑者推进到现在的十位跑者，真是令人惊叹。"
起跑冲刺
起初，孤独跑者问题与跑步毫无关系。
相反，数学家们对一个看似不相关的问题感兴趣：如何使用分数来近似无理数，例如圆周率π，这项任务有大量应用。20世纪60年代，一位名叫约尔格·M·威尔斯的研究生推测，一个已有百年历史的方法是最优的——无法改进它。
1998年，一组数学家用跑步的语言重述了这个猜想。假设N位跑者从长度为1个单位的圆形跑道上的同一点出发，每位跑者以不同的恒定速度奔跑。威尔斯的猜想等价于说，无论其他跑者的速度如何，每位跑者最终总会在某个时刻变得孤独。更精确地说，每位跑者都会在某个时刻发现自己与任何其他跑者的距离至少为1/N。
当威尔斯看到关于孤独跑者的论文时，他给作者之一、西蒙弗雷泽大学的路易斯·戈丁发邮件，祝贺他起了"这个美妙而富有诗意的名字"。（戈丁的回复是："哦，你还活着啊。"）
数学家们还证明了孤独跑者问题等价于另一个问题。想象一张无限的方格纸。在每个网格的中心放置一个小正方形。然后从某个网格角开始画一条直线。（这条线可以指向除完全垂直或水平方向外的任何方向。）在直线必定会碰到一个小正方形之前，这些小正方形最大能有多大？
随着孤独跑者问题的各种版本在数学中扩散，人们对这个问题的兴趣与日俱增。数学家们使用完全不同的技术证明了该猜想的不同情况。有时他们依赖数论工具；其他时候则转向几何或图论。
但这意味着他们没有解决这个问题的通用策略。相反，他们有一堆巧妙但临时的技术，可能适用于四位跑者，但不适用于五位。每增加一位跑者，他们都必须回到起点。
到21世纪头十年中期，数学家们已经证明，当有七位或更少的跑者在跑道上奔跑时，他们每个人最终都会变得孤独。他们也找到了简化问题的方法。例如，他们意识到不需要证明所有（无限多）速度组合下的猜想。相反，如果他们能证明对于任何整数速度组合该猜想都成立，那么它在更一般的情况下也必然成立；他们可以忽略分数和无理数。
这是一项容易得多的任务，但仍然涉及处理无限多种可能的速度。还需要更多的东西。
速度限制
2015年，加州大学洛杉矶分校的陶哲轩播下了第一颗种子。他证明，如果孤独跑者猜想对相对较低的速度成立，那么它对更高的速度也成立。对于任意给定数量的跑者，数学家们只需要考虑不超过特定阈值的整数速度。
这至少在理论上将问题简化为有限次数的计算。但在实践中，牛津大学的诺亚·克拉维茨说，即使只处理少数几位跑者，需要检查的速度组合数量仍然是"天文数字，完全不切实际"。
陶哲轩的进展最终引起了罗森菲尔德的注意，他对使用计算机检查大量例子的证明方法感兴趣。
他通过考虑该猜想的可能反例来重新构建问题：跑者的速度必须具备哪些特征，才能使得至少一位跑者永远不会变得孤独？
事实证明，他们的速度必须受到高度约束。罗森菲尔德使用了一个计算机程序以及数论的思想，证明如果他将所有速度相乘，其乘积必须能被某些特定的质数整除。现在他需要做的就是证明没有任何速度组合能满足这个条件。
为此，他回到了陶哲轩阈值的一个修改版本。然后他用速度乘积的形式重写了它：如果孤独跑者猜想对于不超过给定大小的乘积成立，那么它在一般情况下也必然成立。这意味着如果猜想是错误的，就有可能找到一个乘积低于该阈值的反例。
但罗森菲尔德已经证明，在任何反例中，乘积都必须能被所有这些质数整除。这样的乘积必须非常巨大。事实上，巨大到会远远超过阈值。
换句话说，孤独跑者猜想的反例不可能存在——至少对于八位跑者来说是这样。该猜想成立。
偏离跑道
罗森菲尔德开始思考如何将他的证明扩展到九位跑者。与此同时，克拉维茨看到了罗森菲尔德的论文，并把它展示给了他在牛津指导的一位有前途的本科生保罗·特拉库尔通猜。他建议特拉库尔通猜研究九位跑者的猜想。
特拉库尔通猜采用了罗森菲尔德的整体方法，但他开发了一种更高效的计算技术，用于精确定位反例必须具备的质因数。这使他能够更快地排除九位和十位跑者的所有反例：在这两种情况下，猜想都成立。（罗森菲尔德在特拉库尔通猜完成几天后，也独立证明了九位跑者的猜想。他很高兴看到另一位数学家的爆发式进展。但"同时，我也有点沮丧，"他笑着说。）
罗森菲尔德和特拉库尔通猜的方法在计算上都过于昂贵，无法应用于更多跑者，使他们卡在了问题的下一个案例上。"为了达到11位，我认为需要一种全新的看待问题的方式，"特拉库尔通猜说。
但数学家们对这些最近的进展感到兴奋——尤其是单一方法一次性解决了三个案例，而之前每个新案例都需要一个全新的证明。"我真的认为通过这个新想法，找到了一种把握整个猜想的新途径，"德国罗斯托克大学的马蒂亚斯·希穆拉说。
尽管整个猜想的证明感觉仍然遥远——而且数学家们尚未就它是否对任意N位跑者都成立达成一致——但"在停滞一段时间后，事情开始动起来了，"克拉维茨说。
受新结果的启发，希穆拉等人正在组织一个关于孤独跑者猜想的研讨会，将于今年十月在罗斯托克举行。它将汇集来自该猜想出现的不同领域的研究人员。希穆拉说，希望他们能从不同角度处理这个问题，"交流并连接不同的领域"，以找到潜在的证明或反例。
"我相信这个问题会被解决，"威尔斯说。"但可能还需要20、30年。"
英文来源：
New Strides Made on Deceptively Simple ‘Lonely Runner’ Problem
Introduction
Picture a bizarre training exercise: A group of runners starts jogging around a circular track, with each runner maintaining a unique, constant pace. Will every runner end up “lonely,” or relatively far from everyone else, at least once, no matter their speeds?
Mathematicians conjecture that the answer is yes.
The “lonely runner” problem might seem simple and inconsequential, but it crops up in many guises throughout math. It’s equivalent to questions in number theory, geometry, graph theory, and more — about when it’s possible to get a clear line of sight in a field of obstacles, or where billiard balls might move on a table, or how to organize a network. “It has so many facets. It touches so many different mathematical fields,” said Matthias Beck of San Francisco State University.
For just two or three runners, the conjecture’s proof is elementary. Mathematicians proved it for four runners in the 1970s, and by 2007, they’d gotten as far as seven. But for the past two decades, no one has been able to advance any further.
Then last year, Matthieu Rosenfeld, a mathematician at the Laboratory of Computer Science, Robotics, and Microelectronics of Montpellier, settled the conjecture for eight runners. And within a few weeks, a second-year undergraduate at the University of Oxford named Tanupat (Paul) Trakulthongchai built on Rosenfeld’s ideas to prove it for nine and 10 runners.
The sudden progress has renewed interest in the problem. “It’s really a quantum leap,” said Beck, who was not involved in the work. Adding just one runner makes the task of proving the conjecture “exponentially harder,” he said. “Going from seven runners to now 10 runners is amazing.”
The Starting Dash
At first, the lonely runner problem had nothing to do with running.
Instead, mathematicians were interested in a seemingly unrelated problem: how to use fractions to approximate irrational numbers such as pi, a task that has a vast number of applications. In the 1960s, a graduate student named Jörg M. Wills conjectured that a century-old method for doing so is optimal — that there’s no way to improve it.
In 1998, a group of mathematicians rewrote that conjecture in the language of running. Say N runners start from the same spot on a circular track that’s 1 unit in length, and each runs at a different constant speed. Wills’ conjecture is equivalent to saying that each runner will always end up lonely at some point, no matter what the other runners’ speeds are. More precisely, each runner will at some point find themselves at a distance of at least 1/N from any other runner.
When Wills saw the lonely runner paper, he emailed one of the authors, Luis Goddyn of Simon Fraser University, to congratulate him on “this wonderful and poetic name.” (Goddyn’s reply: “Oh, you are still alive.”)
Mathematicians also showed that the lonely runner problem is equivalent to yet another question. Imagine an infinite sheet of graph paper. In the center of every grid, place a small square. Then start at one of the grid corners and draw a straight line. (The line can point in any direction other than perfectly vertical or horizontal.) How big can the smaller squares get before the line must hit one?
As versions of the lonely runner problem proliferated throughout mathematics, interest in the question grew. Mathematicians proved different cases of the conjecture using completely different techniques. Sometimes they relied on tools from number theory; at other times they turned to geometry or graph theory.
But this meant that they didn’t have a general strategy for how to tackle the problem. Rather, they had a bunch of clever but ad hoc techniques that might work for four runners, say, but not five. With each additional runner, they had to go back to the starting line.
By the mid-2000s, mathematicians had proved that when there are seven or fewer runners sprinting around a track, each of them will eventually get lonely. They’d also found ways to simplify the problem. For instance, they realized that they didn’t need to prove the conjecture for all (infinitely many) combinations of speeds. Instead, if they could show that it was true for any combination of whole-number speeds, it would have to be true more generally; they could ignore fractions and irrationals.
This was a much easier task, but it still involved dealing with infinitely many possible speeds. Something more was needed.
Speed Limits
In 2015, Terence Tao of the University of California, Los Angeles planted the first seed. He showed that if the lonely runner conjecture held for relatively low speeds, it would also hold for high speeds. For any given number of runners, mathematicians would only have to consider whole-number speeds up to a particular threshold.
This reduced the problem to a finite number of calculations — at least in theory. In practice, even when you’re dealing with only a few runners, the number of combinations of speeds you have to check is still “astronomical and completely impractical,” said Noah Kravitz of the University of Oxford.
Tao’s advance would eventually catch the eye of Rosenfeld, who was interested in proofs that use a computer to check many examples.
He reframed the problem by considering possible counterexamples to the conjecture: What features would the runners’ speeds have to have so that at least one runner would never end up alone?
Virginie Fèche
It turned out that their speeds would need to be highly constrained. Rosenfeld used a computer program, along with ideas from number theory, to show that if he multiplied all the speeds together, their product would have to be divisible by certain prime numbers. Now all he needed to do was prove that no combination of speeds could satisfy this condition.
To do so, he returned to a modified version of Tao’s threshold. He then rewrote it in terms of the product of speeds: If the lonely runner conjecture was true for products up to a given size, it had to be true in general. This implied that if the conjecture was false, it would be possible to find a counterexample with a product below the threshold.
But Rosenfeld had already shown that in any counterexample, the product would have to be divisible by all those primes. Such a product would have to be massive. So massive, in fact, that it would far exceed the threshold.
In other words, a counterexample to the lonely runner conjecture couldn’t exist — at least, not for eight runners. The conjecture was true.
Off Track
Rosenfeld started thinking about how to extend his proof to nine runners. In the meantime, Kravitz saw Rosenfeld’s paper and showed it to a promising undergraduate he’d been mentoring at Oxford, Paul Trakulthongchai. He advised Trakulthongchai to work on the conjecture for nine runners.
Trakulthongchai used Rosenfeld’s overall approach, but he developed a more efficient computational technique for pinpointing the prime divisors that a counterexample would have to have. This allowed him to more quickly rule out all counterexamples for both nine and 10 runners: The conjecture was true in both cases. (Rosenfeld independently proved the conjecture for nine runners as well, just a few days after Trakulthongchai did. He was happy to see the other mathematician’s burst of progress. But “at the same time, I was a bit bummed out,” he said with a laugh.)
Evan Nedyalkov
Both Rosenfeld’s and Trakulthongchai’s methods are too computationally expensive to work for more runners, leaving them stuck on the problem’s next case. “In order to achieve 11, I think you need an entirely new sort of way of looking at things,” Trakulthongchai said.
But mathematicians are excited by these recent advances — and by the fact that a single approach solved three cases at once, when previously each new case had required an entirely new proof. “I really see a new way of getting a hold on the whole conjecture by this new idea,” said Matthias Schymura of the University of Rostock in Germany.
Although a proof of the whole conjecture still feels far off — and mathematicians don’t yet agree on whether it will hold true for any N runners — “things are starting to move after not moving for a while,” Kravitz said.
Inspired by the new results, Schymura and others are organizing a workshop on the lonely runner conjecture, to be held in Rostock this October. It will bring together researchers from the different fields in which the conjecture appears. The hope is that they’ll approach the problem from various angles and “communicate and bridge the different areas,” Schymura said, to find a potential proof or counterexample.
“I’m convinced the problem will be solved,” Wills said. “But it might be some 20, 30 more years.”