四色定理与四元数：数学中的两个“四”

English

Mathematics does not choose four because of cultural preference or symbolic resonance. When four appears in mathematics, it is because the structure of the problem requires it — because four is exactly the right number, and no other will do. The Four Color Theorem and the quaternions are two very different mathematical results, from different branches of the discipline and different centuries, that share this quality: in each case, four is not an approximation or a convention but a precise answer to a specific structural question.

中文

数学不因文化偏好或象征共鸣而选择四。当四在数学中出现时，是因为问题的结构需要它——因为四恰好是正确的数字，其他数字都不行。四色定理和四元数是两个非常不同的数学结果，来自学科的不同分支和不同世纪，它们共享这一品质：在每种情况下，四都不是近似值或惯例，而是对特定结构问题的精确答案。

The Four Color Theorem: A Century-Long Journey

四色定理：跨越世纪的证明之旅

English
The Four Color Theorem states that any map drawn on a flat surface — any division of the plane into contiguous regions — can be colored using at most four colors, such that no two adjacent regions share the same color. The statement seems almost absurdly simple; the proof took more than a century to find and remains a landmark in mathematical history.

The problem was first proposed in 1852 by Francis Guthrie, a mathematics student who noticed while coloring a map of England that four colors seemed to suffice. The observation was easy to make; the proof was not. For 124 years, mathematicians struggled with the problem, generating many incorrect proofs and developing significant amounts of new mathematics along the way. The eventual proof, by Kenneth Appel and Wolfgang Haken in 1976, was the first major mathematical theorem to rely substantially on computer-assisted verification: they reduced the problem to approximately 1,936 specific cases and used a computer to verify each one.

The proof has been controversial ever since. Some mathematicians argue that a proof that cannot be verified by human inspection alone is not fully satisfying — that we have not understood why the theorem is true, only confirmed that it is. In 1996, Robertson, Sanders, Seymour, and Thomas reduced the set of unavoidable configurations to 633, making the computer verification more manageable. In 2005, Georges Gonthier achieved a milestone by producing a fully computer-checked proof using the Coq proof assistant — a formal verification that left no step to human doubt. To this day, however, there is still no purely classical, non-computer-assisted proof of the Four Color Theorem that can be verified entirely by human inspection. The question of whether such a “traditional” proof exists remains an open philosophical challenge in the foundations of mathematics.

In a major development in 2026, Mikkel Thorup, Ken-ichi Kawarabayashi, Bojan Mohar, and Carsten Thomassen presented an O(n log n) near-linear time algorithm for 4-coloring planar graphs, breaking the 30-year quadratic barrier established by Robertson et al. in 1996. This algorithmic breakthrough, while not a new proof of the theorem, demonstrates that planar graphs can be colored efficiently in practice, further cementing the theorem’s central role in computational geometry and discrete mathematics.

中文
四色定理指出，任何画在平面上的地图——平面分成连续区域的任何划分——都可以用最多四种颜色着色，使得没有两个相邻区域共享同一颜色。这个陈述看起来几乎简单得可笑；证明花了一个多世纪才找到，至今仍是数学史上的里程碑。

这个问题最初由数学学生弗朗西斯·格思里于1852年提出，他在给英格兰地图着色时注意到四种颜色似乎就够了。观察很容易做出；证明则不然。124年来，数学家们为此殚精竭虑，产生了许多错误的证明，并在此过程中发展了大量新数学。最终的证明由肯尼思·阿佩尔和沃尔夫冈·哈肯于1976年完成，是第一个主要依赖计算机辅助验证的重大数学定理：他们将问题简化为约1936个特定情形，并用计算机逐一验证。

这个证明自此以后一直有争议。一些数学家认为，一个无法单独通过人工检验验证的证明并不完全令人满意——我们没有理解定理为什么成立，只是确认了它成立。1996年，罗伯逊、桑德斯、西摩和托马斯将不可避免构型集缩减至633个，使计算机验证更为可行。2005年，乔治·贡蒂埃使用Coq证明辅助器完成了完全由计算机检验的证明，实现了形式化验证的里程碑。然而，至今仍没有纯经典的、不依赖计算机辅助的四色定理证明——一个可以完全由人工检验的“传统”证明是否存在，仍是数学基础中的一个开放性哲学挑战。

2026年，米克尔·索鲁普、川原林健一、博扬·莫哈和卡斯滕·汤姆森提出了一个O(n log n)近线性时间的平面图4着色算法，打破了1996年罗伯逊等人建立的30年二次方时间屏障。这一算法突破虽然并非对定理的新证明，但表明平面图可以在实践中高效着色，进一步巩固了该定理在计算几何与离散数学中的核心地位。

Quaternions: The Fourth Dimension of Numbers

四元数：数字的第四维度

English
Quaternions are a number system that extends complex numbers from two dimensions to four. Complex numbers have the form a + bi, where i² = -1; they can represent rotations in two-dimensional space. Quaternions have the form a + bi + cj + dk, where i, j, and k are three distinct imaginary units with specific multiplication rules. They can represent rotations in three-dimensional space.

William Rowan Hamilton, the Irish mathematician, had been searching for a three-dimensional analog of complex numbers — a system with three components that would work for three-dimensional geometry the way complex numbers work for two-dimensional geometry. On October 16, 1843, walking across the Brougham Bridge in Dublin, the solution came to him: not three components but four, with three imaginary units rather than one. He carved the defining equations into the stone of the bridge on the spot: i² = j² = k² = ijk = -1.

Quaternions are a four-dimensional non-commutative algebra — a generalization of complex numbers where multiplication does not commute. The set of unit quaternions (those with a² + b² + c² + d² = 1) forms the 3‑sphere and is isomorphic to the Lie group SU(2), a fundamental object in physics and geometry.

Regarded as a mathematical curiosity for most of the nineteenth century, quaternions were later eclipsed by vector analysis, then rediscovered in the late twentieth century for their computational utility. Every three-dimensional rotation in computer graphics, aerospace navigation, and robotics is now represented and computed using quaternions. They are more numerically stable than rotation matrices, more compact, and more easily interpolated — which is why every smooth rotation in a video game, every satellite attitude control system, and every robotic arm uses them. The abstract algebra of a nineteenth-century mathematician, discovered on a bridge in Dublin, now runs silently inside every three-dimensional digital environment in the world.

中文
四元数是一种将复数从二维扩展到四维的数字系统。复数的形式为a+bi，其中i²=-1；它们可以表示二维空间中的旋转。四元数的形式为a+bi+cj+dk，其中i、j和k是具有特定乘法规则的三个不同虚数单位。它们可以表示三维空间中的旋转。

爱尔兰数学家威廉·罗万·哈密顿一直在寻找复数的三维类似物——一个具有三个分量的系统，能像复数适用于二维几何一样适用于三维几何。1843年10月16日，在都柏林布鲁厄姆桥上散步时，解答突然降临：不是三个分量，而是四个，用三个虚数单位而非一个。他当场将基本方程刻在了桥的石头上：i² = j² = k² = ijk = -1。

四元数是一种四维非交换代数——复数的高维推广，其乘法不满足交换律。全体单位四元数（a² + b² + c² + d² = 1）构成三维球面，同构于李群SU(2)，是物理学与几何学中的基本对象。

四元数在十九世纪大部分时间被视为数学奇物，之后被向量分析所取代，又在二十世纪末因其计算实用性而被重新发现。计算机图形学、航空航天导航和机器人技术中的每一个三维旋转，现在都使用四元数来表示和计算。它们比旋转矩阵更数值稳定，更紧凑，更容易插值——这就是为什么视频游戏中的每一次平滑旋转、每一个卫星姿态控制系统和每一只机械臂都离不开它们。一位十九世纪数学家在都柏林一座桥上发现的抽象代数，如今悄无声息地运行在世界上每一个三维数字环境的内部。

The Deep Connection: Four Colors and Four Imaginary Units

深层的对话：四色与四个基底

English
The Four Color Theorem and quaternions have long intrigued mathematicians by their coincidental use of the number four. But beneath the surface lies a more substantive algebraic correspondence. The finite field with four elements, F₄ = {0, 1, ω, ω²}, provides a natural algebraic structure for encoding the four colors — effectively translating map coloring into equations over this field.

More profoundly, the four-color theorem is equivalent to the 3‑edge-coloring of cubic planar maps (the dual of the four-color problem), and those three edge colors can be assigned to the three imaginary units i, j, k of the quaternions. The constraints of proper coloring can be expressed through group operations in SU(2) — the group of unit quaternions — establishing a mathematical bridge between the four colors of the theorem and the four dimensions of quaternion algebra.

This correspondence, while elegant, stops short of a full proof. Despite these structural and algebraic parallels, no proof of the Four Color Theorem has yet been accomplished using quaternion theory alone. The connection remains one of the most beautiful coincidences in mathematics — a reminder that the number four recurs not only in the practical and symbolic frameworks of human culture but also in the very grammar of algebra and topology. Whether this is pure coincidence or a reflection of some deeper combinatorial property of four is a question that continues to invite reflection, across civilizations and across disciplines.

中文
四色定理与四元数因其巧合地使用了数字四而长久以来令数学家着迷。但在表面之下，存在更实质的代数对应。具有四个元素的有限域F₄ = {0, 1, ω, ω²}为四种颜色提供了一种自然的代数编码结构——将地图着色问题转化为这个域上的方程求解。

更深刻的是，四色定理等价于三次平面图的三边着色（四色问题的对偶形式），而三种边颜色可以对应四元数的三个虚数单位i、j、k。着色的约束规则可以通过SU(2)——单位四元数群——的群运算来表达，从而在定理的四种颜色与四元数代数的四个维度之间架起一座数学的桥梁。

这一对应虽优雅，却尚不足以构成完整的证明。尽管存在这些结构与代数层面的平行，至今尚未有人用四元数理论单独完成被公认的四色定理证明。这种关联仍然是数学中最迷人的巧合之一，它提醒我们：数字四不仅反复出现在人类文化的实用与象征框架中，也深植于代数与拓扑的语法本身。这是纯粹的巧合，还是反映了四的某种更深层的组合性质？这个问题，跨越文明与学科，依然邀请着不断的思考。

Four Color Theorem and Quaternions – Four in Mathematics 四色定理与四元数：数学中的两个“四”