Any counterexample to the three-dimensional Kakeya conjecture must be a grainy set.
Assessment
Evidence favors the claim, but the chain is incomplete or the sources are secondary.
The statement is the standard summary of a theorem Larry Guth posted in 2014 and published in 2016, proved with the polynomial method: a small-volume union of tubes in three dimensions, whose points lie in tubes pointing in three quantitatively different directions, clusters at an intermediate scale into thin rectangular slabs called grains. Graininess was one of three structural properties (with planiness and stickiness) that Katz, Łaba and Tao had shown near-extremal Kakeya sets must have, and that the Katz–Tao program conjectured any counterexample to the three-dimensional Kakeya conjecture would have to possess. Guth's theorem extended the graininess property to the full range of hypothetical counterexamples, and Wang and Zahl, in both their 2022 sticky Kakeya paper and their 2025 resolution of the conjecture, state flatly that Guth proved every hypothetical counterexample in three dimensions must be grainy; a variant of his grains decomposition is a building block of their proof.
Two qualifications are worth a reader's attention. Guth's theorem, as he states it, carries a non-degeneracy hypothesis and a technical assumption that the slogan omits; the unconditional phrasing is how the specialists summarize the result, and Wang and Zahl's own grains decomposition shows how the property is obtained in the setting that matters, but the slogan is a summary rather than a literal theorem statement. And because the three-dimensional Kakeya conjecture has now been proved, there are no counterexamples at all, so the statement is now vacuously true in three dimensions; its substantive content is historical, describing the structural constraint that made the proof possible. The graininess result does not extend automatically to four or more dimensions, where the conjecture remains open.
Full reasoning: the evidence and decisions behind this verdict
The claim rests on Guth's paper "Degree reduction and graininess for Kakeya-type sets in R^3" (arXiv:1402.0518, February 2014; Rev. Mat. Iberoam. 32 (2016) 447–494). Its abstract, read directly at arxiv.org/abs/1402.0518, states: if a set of tubes of length N and radius 1 in R^3 has union of volume N^{3-σ}, each point of the union lies in tubes pointing in three quantitatively different directions, and a technical assumption holds, then at scale N^σ the tubes cluster into 1 × N^σ × N^σ slabs, generalizing the graininess estimate of Katz, Łaba and Tao. The full text could not be opened on this pass (the PDF fetch failed), so the proof itself was not checked; the peer-reviewed publication and the downstream use of the result stand in for that check, which is why the status is supported rather than verified.
Three sources assert the claim and none denies it. Wang and Zahl, "Volume estimates for unions of convex sets, and the Kakeya set conjecture in three dimensions" (arXiv:2502.17655, Section 1.4), write that Guth "proved that every (hypothetical) counter-example to the Kakeya conjecture in R^3 must be grainy," and their Section 7.3 and Appendix A build a two-scale grains decomposition whose base case they call Guth's grains decomposition. Their earlier "Sticky Kakeya sets and the sticky Kakeya conjecture" (arXiv:2210.09581, J. Amer. Math. Soc. 39 (2026), Section 1.2) says the results of Bennett–Carbery–Tao and of Guth "show that such a counter-example must be plainy and grainy." Quanta Magazine (Howlett, 14 March 2025) reports the same, derived from Guth's paper. The two Wang–Zahl papers are one voice, and all three sources derive from Guth's paper, so the support is concentrated on a single primary result; in this case that is strength rather than weakness, since the result was refereed, has stood for a decade, and was then used successfully in the proof of the conjecture it was designed to attack.
The material subclaim is Guth's theorem as precisely stated; if it failed, the claim would fall back on Katz, Łaba and Tao's 1999 graininess estimate, which applied only to sets of dimension near 5/2 and under a stickiness hypothesis, and the unconditional slogan would be unsupported. The proof of the three-dimensional Kakeya conjecture supports the claim indirectly: it makes the statement about counterexamples vacuously true and confirms that graininess did the structural work the Katz–Tao program expected of it.
The main uncertainty is one of formulation rather than truth: the slogan drops the hypotheses in Guth's theorem, so whether "any counterexample must be grainy" is literally what Guth proved, or a summary that additionally leans on planiness from the multilinear Kakeya theorem and on the broad/narrow reductions Wang and Zahl carry out, could only be settled by reading Guth's Theorem 1.4 and Wang and Zahl's Appendix A in full. That reading would move the status to verified or add a precise caveat; it is unlikely to reverse the verdict. Nothing found suggests any credible dispute of the result.
Decomposition
The claims this one rests on directly. ↗︎ opens a subclaim; the map shows how they fit together.
The claims this one rests on directly, not gathered into a named line of reasoning.
- requiresa load-bearing premise: the parent is false without itsteward instructions →A small-volume union of tubes in R^3 whose points lie in tubes pointing in three quantitatively different directions clusters into rectangular slabs (grains) at an intermediate scale. ↗︎
- supportsthis provides evidence for the parentsteward instructions →The three-dimensional Kakeya conjecture has been proved: every three-dimensional Kakeya set has dimension three. ↗︎
Provenance
Where this claim has been said, linked to its canonical form.
Every assertion of this claim traces to one primary document, Larry Guth's 2014 paper on degree reduction and graininess for Kakeya-type sets in three dimensions, whose theorem is stated with a non-degeneracy hypothesis and a technical assumption that the slogan "any counterexample must be grainy" drops. The two papers by Wang and Zahl that state the slogan are one voice, and the Quanta report rests on the same paper. A reader wanting the precise statement should open Guth's paper, or Section 7 and Appendix A of Wang and Zahl's 2025 paper, which give the version of the grains decomposition actually used in the proof of the conjecture.
The results from [ 1 ] and [ 22 ] show that such a counter-example must be plainy and grainy, but it is unclear whether K K must be sticky.
Section 1.2, comparing the sticky Kakeya conjecture with the full Kakeya conjecture in R^3: the Katz-Tao program requires a hypothetical counterexample to be sticky, plany and grainy; the authors state that Bennett-Carbery-Tao and Guth's paper establish planiness and graininess, leaving stickiness open at that time.
Asserted without evidence of the source's own. The same authors as the 2025 resolution paper, writing earlier, credit graininess to Guth's paper and planiness to Bennett, Carbery and Tao, without argument of their own at this point. The statement is by leading specialists and is consistent with their later paper, but the two papers are one voice on this point.
Larry Guth, a mathematician at the Massachusetts Institute of Technology, had proved that any counterexample to the Kakeya conjecture needed to be "
The source's own evidence bears what it asserts. A magazine report that rests entirely on Guth's 2014 paper for the assertion. It states the result as an unconditional slogan, dropping the non-degeneracy hypothesis and technical assumption in Guth's theorem, but this is the same summary the specialist literature gives. The recorded passage is truncated mid-sentence; the source's full sentence attributes the result to Guth in 2014 and then explains what a grainy set is.
In [ 9 ] , Guth proved that every (hypothetical) counter-example to the Kakeya conjecture in ℝ 3 \mathbb{R}^{3} must be grainy. Stickiness, however, appeared to be more challenging.
Section 1.4 of the paper resolving the three-dimensional Kakeya conjecture, reviewing the Katz-Tao program: multilinear Kakeya gives planiness, Guth's 2014 paper gives graininess, and stickiness was the missing step the authors' trilogy supplied. The paper goes on to use a variant of Guth's grains decomposition as a building block.
The source's own evidence bears what it asserts. The authors who settled the three-dimensional conjecture state the graininess result as established and attribute it to Guth's paper. They do not reprove it in this passage, but their Section 7 and Appendix A develop a grains decomposition for tubes in three dimensions, so the paper's own machinery bears out that graininess is a usable structural property. This is the most authoritative statement of the claim in the literature. Worth reading closely: Section 7.3 and Appendix A state and prove the version of Guth's grains decomposition actually used, which would settle exactly which hypotheses the unconditional slogan quietly relies on.
How these sources relate
- https://www.quantamagazine.org/once-in-a-century-proof-settles-maths-kakeya-conjecture-20250314/ draws its statement from https://arxiv.org/abs/1402.0518, stating it more strongly than that document supports. The article attributes the result to Guth's 2014 work, which is the arXiv paper "Degree reduction and graininess for Kakeya-type sets in R^3". Guth's abstract states the theorem with a hypothesis that each point lies in tubes pointing in three quantitatively different directions and "a technical assumption"; the article states it unconditionally for any counterexample. The qualifications are dropped, so the crossing is a strengthening, though it matches the way Wang and Zahl themselves summarize the theorem, so it is a conventional simplification rather than a misreading.
- https://arxiv.org/html/2502.17655 cites in support https://arxiv.org/abs/1402.0518, stating it more strongly than that document supports. The assertion is credited directly to Guth's paper. Guth's own abstract conditions the graininess conclusion on a non-degeneracy hypothesis and a technical assumption; Wang and Zahl state it unconditionally. The simplification is deliberate expository shorthand by experts who then work with a variant of the decomposition themselves, but qualifications are dropped at the crossing.
- https://arxiv.org/html/2502.17655 and https://arxiv.org/html/2210.09581 share an author. Both papers are by Hong Wang and Joshua Zahl, per their bylines on arXiv (2210.09581 and 2502.17655).
Cite this claim: a formal citation with its evidence attached
Contribute
Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.
The attention this claim received was paid for by a funded mandate. Funding buys only scheduling: it can make an assessment happen sooner, or reach deeper into a subtree. It has no influence on what the assessment concludes, and none on which claims enter the graph; assessments run under the same public standards whoever pays, funders never see or shape a verdict before anyone else, and mandates that attempt to steer conclusions are refused.
Created by extractor · Aug 24, 2026. Every judgment on this page is accompanied by a reasoning trace.