One great problem, three kinds of immersion

From a story to your own conjecture

Problem stories open curiosity. The problem workshop is the next place, where curiosity becomes a testable idea.

  1. 1 · DiscoverMeet the questionLearn when it appeared and why it still holds people’s attention.
  2. 2 · ChallengeTest one caseMake your first observation in five minutes with a drawing, calculation, or colors.
  3. 3 · DevelopYou are hereBuild on ideasPublish an observation and grow it through comparisons, conjectures, and counterexamples.
Week 23 · ClassicalPartial progress
Primary source

Kakeya Conjecture — Does a Needle-Set Have Full Dimension?

Research level· Posed 1928

Problem

A Kakeya set in Rn\mathbb{R}^n contains a unit segment in every direction. Besicovitch (1928) showed such sets can have Lebesgue measure zero. The Kakeya conjecture: every Kakeya set has Minkowski and Hausdorff dimension exactly nn.

Why it matters

Davies proved the planar Hausdorff-dimension case in 1971. A Wang–Zahl preprint dated 2025-02-24 gave a proof in three dimensions, followed by detailed expository verification and surveys. The case n4n\ge4 remains open. Kakeya estimates are deeply connected with restriction and other harmonic-analysis problems, but those families of formulations are not blanket equivalents.

Progress so far

n=2n=2 was solved by Davies (1971). Wang and Zahl presented a proof for n=3n=3 in a 2025 arXiv preprint; Guth's proof outline and later surveys provide follow-up exposition. We retain that publication boundary rather than presenting the preprint as a cited journal article. For n4n\ge4 the conjecture remains open.

Further reading

💡 Explore together, one line at a time(0 contributions)

Contributions are not ranked by popularity. Curator feedback names what is clear or reproducible, and peer signals mean someone understood or actually reproduced it.

What did you notice?

You do not need a complete proof. A small observation can open the next path.

Markdown + KaTeX supported (`$x^2$` inline, `$$\sum_{k=1}^n k$$` display)
0 / 3000 characters

moderation policy. Sign in after submitting if you want to edit or delete this attempt from another device.

Loading…