The Needle and the Nothing

Here is a simple-sounding question. You have a needle lying on a table. You want to turn it so that, at some moment, it has pointed in every single direction.

How small an area can the needle sweep while it does that? Spin it around its middle and it sweeps a whole disc. But you can be far cleverer.

In 1919 Abram Besicovitch found a shocking answer: you can do it inside an area as close to zero as you like. Almost nothing.

That puzzle turned out to hide one of the deepest questions in modern mathematics — and in 2025 it was finally answered in three dimensions.

Let the needle have length one. The simplest way to point it in every direction is to spin it around its centre.

Doing that, it sweeps out a disc of radius one-half. The area is pi over four, about 0.79.

That is the lazy answer. The real game is to do it in less area. And it turns out you can do much, much less.

Here is the trick: you are allowed to slide the needle, not just pivot it. Think of a three-point turn in a car.

Using clever slides, the needle can make all its turns inside a triangle. An equilateral triangle of height one does the job.

Its area is one over the square root of three, about 0.58 — already smaller than the disc. Among all convex shapes, that triangle is the best you can do.

But who said the shape has to be convex? Drop that, and the floor falls out.

Let the needle slide along a curved track and it traces a graceful three-cornered curve called a deltoid.

The needle stays tangent to it, sweeping only the region inside. That area is pi over eight, about 0.39 — smaller again.

Kakeya himself guessed, in 1917, that this deltoid might be the smallest possible. He was wrong — and gloriously so.

Abram Besicovitch was working on a different problem when he found the construction that would make him famous.

Start with a triangle. Cut it into thin slivers. Now slide the slivers so they overlap as much as possible, letting them poke out in a spray of fine spikes.

Each sliver still carries needles pointing in its own small range of directions, so together they still cover every direction. But the overlapping means the total area shrinks.

Repeat the cutting and sliding, and the area can be driven below any number you choose. You can cover every direction inside an area as close to zero as you like.

That was about covering directions. But can a needle actually turn continuously through all of them inside such a tiny area?

In 1928 Besicovitch showed: yes. You can connect the spikes with thin corridors, and shuffle the needle from one to the next.

A needle can make a full turn inside an area as small as you please. There is no smallest answer at all — only smaller and smaller.

Mathematicians stopped thinking about one moving needle, and pictured every position at once: a set that contains a line segment pointing in every direction.

Such a set is called a Kakeya set, or a Besicovitch set. We have seen it can have zero area.

So if area cannot tell these sets apart from nothing, we need a sharper ruler. How “big” is a set that has zero area but still contains a needle in every direction?

A single line has zero area, but it is clearly “one-dimensional”. A filled square is two-dimensional. Some sets sit in between, with a fractional dimension.

The right ruler is this dimension. Fatten the set into tubes of thickness delta, measure the volume, and watch how fast it shrinks as delta shrinks. That rate is the dimension.

A set that is nearly two-dimensional barely loses volume as the tubes get thinner. A thin, wispy set loses volume fast.

So the sharp question is: a Kakeya set has zero area, but can it be wispy — of dimension less than the space it lives in?

This is the Kakeya conjecture: although a Kakeya set can have zero area, it can never be wispy. It must have the full dimension of the space it lives in.

In the plane, that means dimension exactly two. In three-dimensional space, dimension exactly three.

In 1971 Roy Davies proved it in the plane. The flat case was hard enough. Three dimensions resisted for another fifty years.

It sounds almost obvious — of course something pointing in all directions should be “full”. But the overlaps that make the area vanish are exactly what make it so hard to pin the dimension down.

Nobody cracked three dimensions in one blow. They raised the floor, bit by bit.

In 1995 Tom Wolff showed a 3D Kakeya set must have dimension at least two-and-a-half. For years that was the record.

Nets Katz and Terence Tao laid out a plan of attack. In 2014 Larry Guth proved that any counterexample would have to be “grainy” — built from many tiny regions where lots of needles pile up.

In 2022 Hong Wang and Joshua Zahl handled the worst-behaved, “sticky” Kakeya sets. The final assault was now in reach.

The breakthrough was to stop tracking individual needles and track the grains instead — the tiny blocks where many needles bundle together.

Grains are easier to count, and there is a firm limit on how many can crowd through any one point. That limit is the lever.

Wang and Zahl set up an induction: if no Kakeya set can be wispy up to some dimension, then none can be wispy a little beyond it either. Each turn of the argument pushes the bound higher.

Terence Tao described it as perfecting a perpetual-motion machine — the argument gives back a little more than you put in, again and again, until the bound reaches three.

In February 2025, Hong Wang of New York University and Joshua Zahl of the University of British Columbia posted their proof: every Kakeya set in three dimensions has full dimension three.

Nets Katz called it a once-in-a-century result. It was not just one problem solved — it was the foundation stone of a tower.

Above Kakeya sit the restriction conjecture, the Bochner–Riesz conjecture, the local smoothing conjecture — deep questions about how waves and the Fourier transform behave. Had Kakeya been false, the whole tower would have fallen.

Now, as one mathematician put it, all of those dreamed-about problems suddenly look approachable.

What began as a puzzle about turning a needle became a question about the hidden shape of sets that are invisible to area but full of direction.

In 2026, Hong Wang was awarded the Fields Medal, mathematics’ highest honour, in large part for this work.

And the game is not over. The Kakeya conjecture in four dimensions and above is still open — the same question, one dimension at a time.

From a needle on a table to the frontier of modern analysis: proof that the simplest questions can run the deepest.