The Kakeya conjecture says: if you want a set in three-dimensional space that contains a unit line segment pointing in every direction, the set must have full dimension — it cannot be compressed into a lower-dimensional structure. Hong Wang and Joshua Zahl proved it in 2025, resolving a problem that had resisted attack for decades.
The statement sounds technical. The content is about information. A Kakeya set is a container for directional information — it stores every possible orientation as a physical line segment. The conjecture asks: can you compress this container? Can you find a set that is, in some measure-theoretic sense, smaller than three-dimensional but still holds all directions?
The answer is no. Every direction requires its own space. You cannot fold the set, overlap directions efficiently, or exploit any geometric trick to reduce its dimension. The directional information is irreducible — it fills three dimensions because three dimensions' worth of information is exactly what “all directions in 3D” contains.
This connects to a broader pattern in mathematics: lower bounds are harder than upper bounds because they require ruling out every possible compression scheme, not just exhibiting one. To show a set can be small, you construct it. To show a set must be large, you must prove that no construction — including ones no one has imagined — could make it smaller. The Kakeya proof does this by showing that any set containing all directions, no matter how cleverly arranged, unavoidably accumulates enough volume to fill three dimensions.
The contrast with dimension 2 is instructive. In two dimensions, Besicovitch showed in 1919 that Kakeya sets can have zero area — you can compress all directions into a measure-zero set in the plane. The two-dimensional case is compressible; the three-dimensional case is not. The transition between compressible and incompressible happens between dimensions 2 and 3, and understanding why required entirely new techniques in additive combinatorics and geometric measure theory.
Wang and Zahl's proof uses what they call “sticky Kakeya sets” — configurations where the line segments cluster together in specific patterns. The key insight is that sticky sets can be decomposed into structured components, and these components interact in ways that force dimensional growth. The stickiness, which looks like it might enable compression, actually guarantees expansion. The geometric structure that seems to make the set small is exactly the structure that proves it must be large.