There has been some spectacular progress in geometric measure theory: Hong Wang and Joshua Zahl have just released a preprint that resolves the three-dimensional case of the infamous Kakeya set conjecture! This conjecture asserts that a Kakeya set – a subset of that contains a unit line segment in every direction, must have Minkowski and Hausdorff dimension equal to three. (There is also a stronger “maximal function” version of this conjecture that remains open at present, although the methods of this paper will give some non-trivial bounds on this maximal function.) It is common to discretize this conjecture in terms of small scale
. Roughly speaking, the conjecture then asserts that if one has a family
of
tubes of cardinality
, and pointing in a
-separated set of directions, then the union
of these tubes should have volume
. Here we shall be a little vague as to what
means here, but roughly one should think of this as “up to factors of the form
for any
“; in particular this notation can absorb any logarithmic losses that might arise for instance from a dyadic pigeonholing argument. For technical reasons (including the need to invoke the aforementioned dyadic pigeonholing), one actually works with slightly smaller sets
, where
is a “shading” of the tubes in
that assigns a large subset
of
to each tube
in the collection; but for this discussion we shall ignore this subtlety and pretend that we can always work with the full tubes.
Previous results in this area tended to center around lower bounds of the form , that one would like to make as large as possible. For instance, just from considering a single tube in this collection, one can easily establish (1) with
. By just using the fact that two lines in
intersect in a point (or more precisely, a more quantitative estimate on the volume between the intersection of two
tubes, based on the angle of intersection), combined with a now classical
-based argument of Córdoba, one can obtain (1) with
(and this type of argument also resolves the Kakeya conjecture in two dimensions). In 1995, building on earlier work by Bourgain, Wolff famously obtained (1) with
using what is now known as the “Wolff hairbrush argument”, based on considering the size of a “hairbrush” – the union of all the tubes that pass through a single tube (the hairbrush “stem”) in the collection.
In their new paper, Wang and Zahl established (1) for . The proof is lengthy (127 pages!), and relies crucially on their previous paper establishing a key “sticky” case of the conjecture. Here, I thought I would try to summarize the high level strategy of proof, omitting many details and also oversimplifying the argument at various places for sake of exposition. The argument does use many ideas from previous literature, including some from my own papers with co-authors; but the case analysis and iterative schemes required are remarkably sophisticated and delicate, with multiple new ideas needed to close the full argument.
A natural strategy to prove (1) would be to try to induct on : if we let
represent the assertion that (1) holds for all configurations of
tubes of dimensions
, with
-separated directions, we could try to prove some implication of the form
for all
, where
is some small positive quantity depending on
. Iterating this, one could hope to get
arbitrarily close to
.
A general principle with these sorts of continuous induction arguments is to first obtain the trivial implication in a non-trivial fashion, with the hope that this non-trivial argument can somehow be perturbed or optimized to get the crucial improvement
. The standard strategy for doing this, since the work of Bourgain and then Wolff in the 1990s (with precursors in older work of Córdoba), is to perform some sort of “induction on scales”. Here is the basic idea. Let us call the
tubes
in
“thin tubes”. We can try to group these thin tubes into “fat tubes” of dimension
for some intermediate scale
; it is not terribly important for this sketch precisely what intermediate value is chosen here, but one could for instance set
if desired. Because of the
-separated nature of the directions in
, there can only be at most
thin tubes in a given fat tube, and so we need at least
fat tubes to cover the
thin tubes. Let us suppose for now that we are in the “sticky” case where the thin tubes stick together inside fat tubes as much as possible, so that there are in fact a collection
of
fat tubes
, with each fat tube containing about
of the thin tubes. Let us also assume that the fat tubes
are
-separated in direction, which is an assumption which is highly consistent with the other assumptions made here.
If we already have the hypothesis , then by applying it at scale
instead of
we conclude a lower bound on the volume occupied by fat tubes:
Now, inside each fat tube , we are assuming that we have about
thin tubes that are
-separated in direction. If we perform a linear rescaling around the axis of the fat tube by a factor of
to turn it into a
tube, this would inflate the thin tubes to be rescaled tubes of dimensions
, which would now be
-separated in direction. This rescaling does not affect the multiplicity of the tubes. Applying
again, we see morally that the multiplicity
of the rescaled tubes, and hence the thin tubes inside
, should be
.
We now observe that the multiplicity of the full collection
of thin tubes should morally obey the inequality
fat tubes, and within each fat tube a given point lies in at most
thin tubes in that fat tube, then it should only be able to lie in at most
tubes overall. This heuristically gives
, which then recovers (1) in the sticky case.
In their previous paper, Wang and Zahl were roughly able to squeeze a little bit more out of this argument to get something resembling in the sticky case, loosely following a strategy of Nets Katz and myself that I discussed in this previous blog post from over a decade ago. I will not discuss this portion of the argument further here, referring the reader to the introduction to that paper; instead, I will focus on the arguments in the current paper, which handle the non-sticky case.
Let’s try to repeat the above analysis in a non-sticky situation. We assume (or some suitable variant thereof), and consider some thickened Kakeya set
A typical non-sticky setup is when there are now fat tubes for some multiplicity
(e.g.,
for some small constant
), with each fat tube containing only
thin tubes. Now we have an unfortunate imbalance: the fat tubes form a “super-Kakeya configuration”, with too many tubes at the coarse scale
for them to be all
-separated in direction, while the thin tubes inside a fat tube form a “sub-Kakeya configuration” in which there are not enough tubes to cover all relevant directions. So one cannot apply the hypothesis
efficiently at either scale.
This looks like a serious obstacle, so let’s change tack for a bit and think of a different way to try to close the argument. Let’s look at how intersects a given
-ball
. The hypothesis
suggests that
might behave like a
-dimensional fractal (thickened at scale
), in which case one might be led to a predicted size of
of the form
. Suppose for sake of argument that the set
was denser than this at this scale, for instance we have
and some
. Observe that the
-neighborhood
is basically
, and thus has volume
by the hypothesis
(indeed we would even expect some gain in
, but we do not attempt to capture such a gain for now). Since
-balls have volume
, this should imply that
needs about
balls to cover it. Applying (3), we then heuristically have
The set , being the union of tubes of thickness
, is essentially the union of
cubes. But it has been observed in several previous works (starting with a paper of Nets Katz, Izabella Laba, and myself) that these Kakeya type sets tend to organize themselves into larger “grains” than these cubes – in particular, they can organize into
disjoint prisms (or “grains”) in various orientations for some intermediate scales
. The original “graininess” argument of Nets, Izabella and myself required a stickiness hypothesis which we are explicitly not assuming (and also an “x-ray estimate”, though Wang and Zahl were able to find a suitable substitute for this), so is not directly available for this argument; however, there is an alternate approach to graininess developed by Guth, based on the polynomial method, that can be adapted to this setting. (I am told that Guth has a way to obtain this graininess reduction for this paper without invoking the polynomial method, but I have not studied the details.) With rescaling, we can ensure that the thin tubes inside a single fat tube
will organize into grains of a rescaled dimension
. The grains associated to a single fat tube will be essentially disjoint; but there can be overlap between grains from different fat tubes.
The exact dimensions of the grains are not specified in advance; the argument of Guth will show that
is significantly larger than
, but other than that there are no bounds. But in principle we should be able to assume without loss of generality that the grains are as “large” as possible. This means that there are no longer grains of dimensions
with
much larger than
; and for fixed
, there are no wider grains of dimensions
with
much larger than
.
One somewhat degenerate possibility is that there are enormous grains of dimensions approximately (i.e.,
), so that the Kakeya set
becomes more like a union of planar slabs. Here, it turns out that the classical
arguments of Córdoba give good estimates, so this turns out to be a relatively easy case. So we can assume that least one of
or
is small (or both).
We now revisit the multiplicity inequality (2). There is something slightly wasteful about this inequality, because the fat tubes used to define occupy a lot of space that is not in
. An improved inequality here is
is the multiplicity, not of the fat tubes
, but rather of the smaller set
. The point here is that by the graininess hypotheses, each
is the union of essentially disjoint grains of some intermediate dimensions
. So the quantity
is basically measuring the multiplicity of the grains.
It turns out that after a suitable rescaling, the arrangement of grains looks locally like an arrangement of tubes. If one is lucky, these tubes will look like a Kakeya (or sub-Kakeya) configuration, for instance with not too many tubes in a given direction. (More precisely, one should assume here some form of the Wolff axioms, which the authors refer to as the “Katz-Tao Convex Wolff axioms”). A suitable version if the hypothesis
will then give the bound
So the remaining case is when the grains do not behave like a rescaled Kakeya or sub-Kakeya configuration. Wang and Zahl introduce a “structure theorem” to analyze this case, concluding that the grains will organize into some larger convex prisms , with the grains in each prism
behaving like a “super-Kakeya configuration” (with significantly more grains than one would have for a Kakeya configuration). However, the precise dimensions of these prisms
is not specified in advance, and one has to split into further cases.
One case is when the prisms are “thick”, in that all dimensions are significantly greater than
. Informally, this means that at small scales,
looks like a super-Kakeya configuration after rescaling. With a somewhat lengthy induction on scales argument, Wang and Zahl are able to show that (a suitable version of)
implies an “x-ray” version of itself, in which the lower bound of super-Kakeya configurations is noticeably better than the lower bound for Kakeya configurations. The upshot of this is that one is able to obtain a Frostman violation bound of the form (3) in this case, which as discussed previously is already enough to win in this case.
It remains to handle the case when the prisms are “thin”, in that they have thickness
. In this case, it turns out that the
arguments of Córdoba, combined with the super-Kakeya nature of the grains inside each of these thin prisms, implies that each prism is almost completely occupied by the set
. In effect, this means that these prisms
themselves can be taken to be grains of the Kakeya set. But this turns out to contradict the maximality of the dimensions of the grains (if everything is set up properly). This treats the last remaining case needed to close the induction on scales, and obtain the Kakeya conjecture!

41 comments
Comments feed for this article
25 February, 2025 at 9:08 pm
Anonymous
Thanks for this!!
25 February, 2025 at 9:09 pm
Anonymous
” crucial improvement
.”
I think this is a typo.
[Corrected, thanks – T.]
25 February, 2025 at 9:21 pm
Anonymous
For the upper bounds on mu_{fat} and mu_{fine} above and below (2), should the exponent 3-d instead be d-3?
[Corrected, thanks – T.]
25 February, 2025 at 9:40 pm
Anonymous
yay for Kakeya
25 February, 2025 at 10:50 pm
Anonymous
Which other conjectures are also closed by this conjecture?
26 February, 2025 at 8:45 am
Terence Tao
In the paper, Wang and Zahl show that their methods also establish the tube doubling conjecture of Keleti: if an arbitrary collection of
tubes is doubled in all spatial dimensions, then the volume of the union only increases by a factor of
.
In principle, this breakthrough could lead to progress on the other conjectures in the Kakeya cluster, such as the Bochner-Riesz and restriction conjectures, but this would probably require improving the Kakeya set results here to a Kakeya maximal function estimate, as well as more technical “Furstenberg set” variants of the conjecture (roughly speaking, in which one has a fractal subset of a line segment in every direction, rather than a full line segment or some fixed measure subset of that line segment).
26 February, 2025 at 12:06 am
Anonymous
Thank you for the accessible explanation. I learned a lot.
26 February, 2025 at 12:14 am
Anonymous
How similar is the d = 3 case to higher d, and do arguments in this case improve bounds in the higher case?
26 February, 2025 at 8:17 am
Terence Tao
Some of the basic framework (e.g., induction on scales) would carry over, but much of the case analysis would become more complicated. In the three-dimensional situation, whenever one of the dimensions degenerated in some fashion, the problem was then similar to a two-dimensional one, and one could turn to the L^2 methods of Cordoba to good effect. If one was say in four dimensions, then to treat such degenerate cases one would need three-dimensional analysis – that is to say, one would need to adapt the methods of the current paper. In principle if one had exactly the right induction hypothesis in the ambient dimension, one could then get Kakeya estimates in all dimensions, but finding precisely the right hypothesis for which the induction will close might take some time to work out. But I think this will get done eventually; the obstructions I see to extending to higher dimensions are primarily technical in nature, rather than fundamental obstacles (though there could be some nasty unfavorable surprises in the exponent numerology when one tries to execute the strategy carefully).
26 February, 2025 at 5:24 am
J
How difficult would it be to formalize the proof in Lean compared to your earlier project, where you formalized the proof of PFR in Lean4?
26 February, 2025 at 8:13 am
Terence Tao
I would imagine this to be several times larger in magnitude than the Carleson formalization project, which is currently ongoing and expected to take months (with dozens of people involved). When combined with previous papers, we are looking at something like 200 to 300 pages of literature, which needs to be expanded further into a detailed blueprint. I think it is theoretically possible to do at the current state of formalization technology if we divert significant mathematical resources to this goal, but it may be better to wait on this one until the technology improves and/or the proof simplifies.
26 February, 2025 at 5:27 am
Anonymous
Really excited to see this cracked! It is the culmination of dozens of papers and years of research that at least. I suppose now trying to extend this to Restriction will be attempted? Not getting the maximal function estimate shows the difficulty of the problem.
It is impressive, to me at least, how non-intuitive the argument is. A remarkable amount of effort and perseverance must have gone into the proof. Typing 127 pages of Tex is a feat in and of itself
26 February, 2025 at 7:04 am
Will Sawin
The equation immediately after the phrase “the crucial improvement” does not actually include the crucial improvement and instead is identical to the previous equation.
[Corrected, thanks – T.]
26 February, 2025 at 8:27 am
basementcolorful451c5cd9f3
Hong Wang should be awarded by the Fields Medal in next year for what she achieved in past several years. She is a truly amazing mathematician!
26 February, 2025 at 9:02 am
Anonymous
There are several instances of (rho/delta)^(-2) that should say (rho/delta)^2 when talking about the number of thin tubes in a fat tube.
[Corrected, thanks – T.]
26 February, 2025 at 7:38 pm
Anonymous
I vaguely recall there is some connection between the Kakeya conjecture and large value estimates for Dirichlet polynomials. How much of the Kakeya conjecture needs to be proved in order to get new large values estimates? Does one need the Kakeya conjecture in every dimension? Does one need “hard” versions of the conjecture as opposed to “soft” versions?
26 February, 2025 at 8:33 pm
Terence Tao
See for instance this MathOverflow question and answer. The Montgomery conjecture implies the Kakeya conjecture for arithmetic progressions, which implies the Kakeya conjecture in all dimensions, which of course implies the Kakeya conjecture in three dimensions. So the new breakthrough will not immediately make any progress on the Montgomery conjecture, but it does raise one’s hopes that some advance will be made on these stronger conjectures also in coming years.
28 February, 2025 at 2:40 am
Anonymous
Following up on the 2014 paper “Degree reduction and graininess for Kakeya-type sets in
” and specifically Theorem 0.1, which seems to play a crucial role in degree reduction for the 3D Kakeya conjecture, I’ve been searching on Google Scholar for subsequent citations or extensions, but haven’t found explicit high-dimensional generalizations directly related to this 2014 work. I’m unsure if this type of structural theorem has been extended to higher dimensions.
I was wondering if the absence of such a generalization is considered a major obstacle in tackling the Kakeya conjecture in higher dimensions?
Thank you.
28 February, 2025 at 9:18 am
Terence Tao
My guess is that the lack of an optimal 3D Kakeya theory was an obstacle to extending graininess type results to higher dimensions, but now that we have at least one 3D Kakeya result with an optimal exponent, it should now be possible *in principle* to start getting higher dimensional results. Of course, this 3D theory is vastly more complicated than the optimal 2D theory of Cordoba that is largely based on L^2 estimates (second moment method), so it will take some time to work out even the 4D case I think. But I don’t see any fundamental obstacles, only (significant) technical challenges.
28 February, 2025 at 9:02 pm
Josh
Proposition 3.2 from [1] is a higher dimensional grains decomposition similar in spirit to Guth’s previous work in R^3. In higher dimensions, the grains need not be pieces of (hyper)planes. Proposition 3.2 only asserts that the grains are thin neighbourhoods of low-degree algebraic hypersurfaces. In R^4 a bit more is known, compared to R^n — heuristically, the grains must be either hyperplanes, quadratic hypersurfaces, or algebraic hypersurfaces that are ruled by 2-planes.
[1] https://arxiv.org/abs/1701.07045
1 March, 2025 at 12:32 pm
Anonymous
Congratulations to Josh and Hong Wang for this spectacular work. Seeing their gradual progress on the problem over the last five years I expected they could do this. But still seeing the completion of it was a beautiful surprise.
3 March, 2025 at 9:42 pm
Anonymous
Hi Professor Tao. It seems there is a similar-flavor question called Nikodym (set) problem whose dim 2 case is also solved for a long time.
Is there any higher dimensional results for this problem?
4 March, 2025 at 8:31 am
Terence Tao
The Kakeya set conjecture implies the Nikodym set conjecture as a corollary (this is a simple argument coming from applying a projective transformation to convert a Nikodym set into a Kakeya set). The converse isn’t quite a known implication (though the “maximal function” version of the two conjectures are known to be equivalent), but nevertheless the two conjectures are believed to be of essentially the same level of difficulty. I discussed this issue in Section 4 of this old paper of mine.
7 March, 2025 at 10:32 am
Anonymous
Wrong paper link?
[I don’t believe so -T.]
8 March, 2025 at 1:37 pm
Anonymous
Thank you for answering the question!
4 March, 2025 at 12:10 am
Anonymous
When was the Kakeya set conjecture posed? 1930s?
4 March, 2025 at 8:36 am
Terence Tao
The Kakeya needle problem was proposed in 1917, and Kakeya sets (initially referred to as Besicovitch sets, as Besicovitch was the first to construct them) were introduced as a concept in 1919, but the question of the dimension of such sets was not explicitly addressed until the work of Davies in 1971, who referred to it as the “Kakeya problem”. The precise terminology of the “Kakeya set conjecture” was likely introduced by Bourgain in the early 1990s.
4 March, 2025 at 5:43 pm
Anonymous
A noob passing by with a stupid question….
I’ve only been introduced to the ‘squeegee’ approach by Mathologer (https://www.youtube.com/watch?v=IM-n9c-ARHU&t=804s). Can yall help me understand, how using ‘tubes’ can even go lower? Did Wang and Zahl just prove that it is infinitesimal?
5 March, 2025 at 9:22 am
Terence Tao
The Kakeya set problem is related to the Kakeya needle problem, but technically the two problems are distinct. The needle problem concerns the problem of trying to rotate a needle of zero thickness in as small a set as possible to cover all orientations. The Kakeya set problem (in its Minkowski dimension formulation) can be phrased as a problem of understanding how to pack tubes of small but non-zero thickness
in different orientations in as small a set as possible. Besicovitch showed for the set problem that the minimum area (in two dimensions) or volume (in three dimensions) required for the latter problem goes to zero in the limit
, which by some additional arguments shows that the area required for the Kakeya needle problem also can be made as small as possible. The question then remained of how fast this convergence to zero was as a function of
– in particular, whether it was basically a power law in
, or whether the convergence was more logarithmic in nature. It was shown by Davies in 1971 that the latter scenario was the truth in two dimensions; and now we basically know it to be true in three dimensions also (although the convergence rate is not known to be precisely logarithmic; currently we just know that it is slower than a power law convergence rate).
This does not directly impact the original Kakeya needle problem, which was set in two dimensions, but from a modern perspective the needle problem was more of a historical motivation for the Kakeya family of conjectures than the primary focus of current research.
7 March, 2025 at 1:31 am
Anonymous
Can you expand on the historical motivation part?
7 March, 2025 at 8:12 am
Terence Tao
I have some old surveys on this topic, e.g., https://www.ams.org/notices/200103/fea-tao.pdf http://www.math.ucla.edu/~tao/preprints/Expository/edinburgh.dvi https://arxiv.org/abs/math/0010069
14 March, 2025 at 8:53 am
Anonymous
Is there a conjectural analogue of a more generalized “Furstenberg-type arithmetic Kakeya” and would such a result imply the Montgomery conjecture? It would be mildly amusing if this recent progress in Kakeya eventually leads to the resolution of RH, but one can only dream…
14 March, 2025 at 1:23 pm
Terence Tao
At this stage I do not think there is any such proposal, though it is tempting to contemplate such a conjecture as a possible route to resolving the Montgomery conjecture. The recent advances on restriction and Kakeya have relied quite heavily on the geometry of Euclidean space, and specifically three dimensional space. It is possible that the geometric structure is actually a red herring, and that one may be able to run the induction on scales etc. in a much more arithmetic setting (replacing convex bodies by approximate groups, etc.). Perhaps after the recent progress is extended to arbitrary dimension, it will become clearer what is going on. (As a point against this approach, though, there are signs that in higher dimensions that higher degree geometric objects, such as quadric hypersurfaces, will inevitably show up, and at present additive combinatorics is not well equipped to even talk about these sorts of objects in a purely arithmetic fashion. As a wild speculation, one *might* be able to somehow reconstruct that sort of algebraic geometry structure from the incidence structure in the spirit of the group configuration theorem from model theory, but this is a rather large ask, especially given how other such proposals – e.g., an inverse Szemeredi-Trotter theorem that has some sort of algebraic structure in its conclusion – have no viable path to completion at present.)
14 March, 2025 at 9:34 pm
Mark Lewko
This is a truly spectacular result by Hong and Josh!
I’m curious if you (or any of your readers) are aware of anything non-trivial known about Besicovitch constructions in higher dimensions? I’m unaware of any literature on this topic, or any construction that beats taking products of the Schoenberg-Keich two dimensional example which has logarithmic compression. There seems to be a bit of a paradox in that lower bounds get considerably harder to prove as the dimension increases yet (as far as I know) that extra freedom doesn’t seem to actually be very helpful in finding compression (for affine objects).
17 March, 2025 at 6:24 am
"Once In A Century" Math Proof Threads The Needle On A Decades-Old Conjecture - 3ACES
[…] preprint server, a wave of excitement rippled through the international mathematical community. Tao wrote about it on his blog; Katz lauded it as a “once-in-a-century kind of […]
27 March, 2025 at 7:36 am
Hoe een naald kan draaien en kantelen in een onzichtbaar gebied
[…] dan zou die onmogelijke eigenschappen moeten bezitten. Direct nadat het bewijs online kwam, reageerde Terence Tao op zijn blog enthousiast: „Hong Wang en Joshua Zahl hebben een preprint gepubliceerd die het driedimensionale […]
2 April, 2025 at 3:15 am
Aperiodical News Roundup – March 2025 | The Aperiodical
[…] three-dimensional Kakeya set conjecture has been proved. The result is described by Terry Tao as “spectacular progress in geometric measure […]
3 April, 2025 at 11:11 pm
Hong Wang and Joshua Zahl’s Solution for Kakeya’s Problem in Three Dimensions – Reflections and Links | Combinatorics and more
[…] and Zahl’s spectacular work was described in Terry Tao’s blog, in an article by Joseph Howlett in Quanta Magazine, and in many other places. Congratulations to […]
2 August, 2025 at 6:31 am
Anonymous
Just read a Quanta article on Hannah Cairo’s resolution of the Mizohata-Takeuchi conjecture. Does Cairo’s result tell us anything about the Kakeya problem? I haven’t looked at her paper, maybe she answers that question. (I’m a curious bystander, not a mathematician.)
11 August, 2025 at 6:51 am
Terence Tao
Cairo’s work deals with another aspect of the Kakeya/restriction cluster of conjectures, roughly speaking it has to do with measuring how strong the effect of constructive interference between oscillations of different frequencies can be, and where these effects can be localized. Kakeya compression can give examples of such interference, but they are not the only source of such; and Cairo’s construction does not go through this route and so does not directly impact the Kakeya conjecture (which is already well understood in two dimensions anyways).
3 November, 2025 at 10:25 am
How to Make the Kakeya Conjecture Quantitative: A Guided Walk Through the Wang–Zahl Proof | Continuous Learning & Development
[…] The three-dimensional Kakeya conjecture, after Wang and Zahl […]