The three dimensional Kakeya conjecture is true

The just-published issue of the Journal of the American Mathematical Society (JAMS) contains a paper by Wang and Zahl (Wang and Zahl 2026) in which they resolve the so-called sticky case of the Kakeya conjecture in . This result became a major milestone on the path toward the full resolution of the conjecture in a subsequent work.

A Kakeya set in is a compact subset of that contains a unit line segment in every direction. It has long been known that such sets may have Lebesgue measure zero. The Kakeya conjecture in asserts that every Kakeya set must nevertheless have full Hausdorff dimension,

The two-dimensional version of the conjecture was proved by Davies, and in particular implies that any Kakeya set satisfies . In 1991, Bourgain improved this lower bound to and in 1995 Wolff further raised it to Wolff’s bound remained the best known result for more than two decades. In 2019, Katz and Zahl (Katz and Zahl 2019) established the first improvement beyond this threshold, proving that for some . Although quantitatively small, this advance was conceptually significant: Katz and Zahl showed how to rule out certain sets of Hausdorff dimension that closely mimic Kakeya sets, overcoming a key obstruction that had long hindered progress. Their work renewed optimism that a complete solution might be within reach.

In a 2014 lecture, Tao outlined a strategy for resolving the Kakeya conjecture in , now known as the Katz–Tao program. A central notion in this program is that of a sticky Kakeya set, defined as follows. For each (affine) line , let denote the unique point on such that the vector from the origin to is orthogonal to . The collection of all lines in can be equipped with the metric where denotes the angle between the two lines.

A compact set is called a sticky Kakeya set if there exists a set of lines with packing dimension that contains at least one line in every direction, and such that for each the intersection contains a unit line segment. This is precisely the definition of an ordinary Kakeya set, augmented by the requirement that the associated family of lines has packing dimension .

The Katz–Tao program proposed a two-step approach:

  1. Show that any hypothetical counterexample to the Kakeya conjecture in , that is, any Kakeya set of Hausdorff dimension , must be sticky, and also must have two other structural properties called planiness and graininess.

  2. Use these properties to derive a contradiction, thereby ruling out the existence of such counterexamples.

The property of planiness had already been established prior to this program. In 2016, Guth (Guth 2016) proved graininess, leaving stickiness as the final missing ingredient in step (i). In their just-published JAMS paper (Wang and Zahl 2026), Wang and Zahl completed step (ii) of the program by showing that no sticky Kakeya counterexample can exist.

While paper (Wang and Zahl 2026) was under review, Wang and Zahl posted a subsequent preprint (Wang and Zahl 2025) in which they proved that any Kakeya set in with Hausdorff dimension must necessarily be sticky. Combined with Theorem  , this yields a complete resolution of the Kakeya conjecture in .

References

Guth, Larry. 2016. “Degree Reduction and Graininess for Kakeya-Type Sets in R3.” Rev. Mat. Iberoam. 32 (2): 447–94. https://doi.org/10.4171/RMI/891.
Katz, Nets, and Joshua Zahl. 2019. “An Improved Bound on the Hausdorff Dimension of Besicovitch Sets in R3.” J. Amer. Math. Soc. 32 (1): 195–259.
Wang, Hong, and Joshua Zahl. 2025. “Volume Estimates for Unions of Convex Sets, and the Kakeya Set Conjecture in Three Dimensions.” arXiv Preprint arXiv:2502.17655.
———. 2026. “Sticky Kakeya Sets and the Sticky Kakeya Conjecture.” Journal of the American Mathematical Society 39 (2): 515–85.

No comment found.

Add a comment

You must log in to post a comment.