Kakeya set


In mathematics, a Kakeya set, or Besicovitch set, is a set of points in Euclidean space which contains a unit line segment in every direction. For instance, a disk of radius 1/2 in the Euclidean plane, or a ball of radius 1/2 in three-dimensional space, forms a Kakeya set. Much of the research in this area has studied the problem of how small such sets can be. Besicovitch showed that there are Besicovitch sets of measure zero.
A Kakeya needle set is a set in the plane with a stronger property, that a unit line segment can be rotated continuously through 180 degrees within it, returning to its original position with reversed orientation. Again, the disk of radius 1/2 is an example of a Kakeya needle set.

Kakeya needle problem

The Kakeya needle problem asks whether there is a minimum area of a region D in the plane, in which a needle of unit length can be turned through 360°. This question was first posed, for convex regions, by. The minimum area for convex sets is achieved by an equilateral triangle of height 1 and area 1/, as Pál showed.
Kakeya seems to have suggested that the Kakeya set D of minimum area, without the convexity restriction, would be a three-pointed deltoid shape. However, this is false; there are smaller non-convex Kakeya sets.

Besicovitch sets

was able to show that there is no lower bound > 0 for the area of such a region D, in which a needle of unit length can be turned round. This built on earlier work of his, on plane sets which contain a unit segment in each orientation. Such a set is now called a Besicovitch set. Besicovitch's work showing such a set could have arbitrarily small measure was from 1919. The problem may have been considered by analysts before that.
One method of constructing a Besicovitch set is known as a "Perron tree" after Oskar Perron who was able to simplify Besicovitch's original construction: take a triangle with height 1, divide it in two, and translate both pieces over each other so that their bases overlap on some small interval. Then this new figure will have a reduced total area.
Now, suppose we divide our triangle into eight subtriangles. For each consecutive pair of triangles, perform the same overlapping operation we described before to get four new shapes, each consisting of two overlapping triangles. Next, overlap consecutive pairs of these new shapes by shifting their bases over each other partially, so we're left with two shapes, and finally overlap these two in the same way. In the end, we get a shape looking somewhat like a tree, but with an area much smaller than our original triangle.
To construct an even smaller set, subdivide your triangle into, say, 2n triangles each of base length 2−n, and perform the same operations as we did before when we divided our triangle twice and eight times. If both the amount of overlap we do on each triangle and the number n of the subdivision of our triangle are large enough, we can form a tree of area as small as we like. A Besicovitch set can be created by combining three rotations of a Perron tree created from an equilateral triangle.
Adapting this method further, we can construct a sequence of sets whose intersection is a Besicovitch set of measure zero. One way of doing this is to observe that if we have any parallelogram two of whose sides are on the lines x = 0 and x = 1 then we can find a union of parallelograms also with sides on these lines, whose total area is arbitrarily small and which contain translates of all lines joining a point on x = 0 to a point on x = 1 that are in the original parallelogram. This follows from a slight variation of Besicovich's construction above. By repeating this we can find a sequence of sets
each a finite union of parallelograms between the lines x = 0 and x = 1, whose areas tend to zero and each of which contains translates of all lines joining x = 0 and x = 1 in a unit square. The intersection of these sets is then a measure 0 set containing translates of all these lines, so a union of two copies of this intersection is a measure 0 Besicovich set.
There are other methods for constructing Besicovitch sets of measure zero aside from the 'sprouting' method. For example, Kahane uses Cantor sets to construct a Besicovitch set of measure zero in the two-dimensional plane.

Kakeya needle sets

By using a trick of Pál, known as Pál joins, a set in which a unit line segment can be rotated continuously through 180 degrees can be created from a Besicovitch set consisting of Perron trees.
In 1941, H. J. Van Alphen showed that there are arbitrary small Kakeya needle sets inside a circle with radius 2 + ε. Simply connected Kakeya needle sets with smaller area than the deltoid were found in 1965. Melvin Bloom and I. J. Schoenberg independently presented Kakeya needle sets with areas approaching to, the Bloom-Schoenberg number. Schoenberg conjectured that this number is the lower bound for the area of simply connected Kakeya needle sets. However, in 1971, F. Cunningham showed that, given ε > 0, there is a simply connected Kakeya needle set of area less than ε contained in a circle of radius 1.
Although there are Kakeya needle sets of arbitrarily small positive measure and Besicovich sets of measure 0, there are no Kakeya needle sets of measure 0.

Kakeya conjecture

Statement

The same question of how small these Besicovitch sets could be was then posed in higher dimensions, giving rise to a number of conjectures known collectively as the Kakeya conjectures, and have helped initiate the field of mathematics known as geometric measure theory. In particular, if there exist Besicovitch sets of measure zero, could they also have s-dimensional Hausdorff measure zero for some dimension s less than the dimension of the space in which they lie? This question gives rise to the following conjecture:
This is known to be true for n = 1, 2 but only partial results are known in higher dimensions.

Kakeya maximal function

A modern way of approaching this problem is to consider a particular type of maximal function, which we construct as follows: Denote Sn−1 ⊂ Rn to be the unit sphere in n-dimensional space. Define to be the cylinder of length 1, radius δ > 0, centered at the point a ∈ Rn, and whose long side is parallel to the direction of the unit vector e ∈ Sn−1. Then for a locally integrable function f, we define the Kakeya maximal function of f to be
where m denotes the n-dimensional Lebesgue measure. Notice that is defined for vectors e in the sphere Sn−1.
Then there is a conjecture for these functions that, if true, will imply the Kakeya set conjecture for higher dimensions:

Results

Some results toward proving the Kakeya conjecture are the following:
Somewhat surprisingly, these conjectures have been shown to be connected to a number of questions in other fields, notably in harmonic analysis. For instance, in 1971, Charles Fefferman was able to use the Besicovitch set construction to show that in dimensions greater than 1, truncated Fourier integrals taken over balls centered at the origin with radii tending to infinity need not converge in Lp norm when p ≠ 2.

Analogues and generalizations of the Kakeya problem

Sets containing circles and spheres

Analogues of the Kakeya problem include considering sets containing more general shapes than lines, such as circles.
A generalization of the Kakeya conjecture is to consider sets that contain, instead of segments of lines in every direction, but, say, portions of k-dimensional subspaces. Define an -Besicovitch set K to be a compact set in Rn containing a translate of every k-dimensional unit disk which has Lebesgue measure zero. That is, if B denotes the unit ball centered at zero, for every k-dimensional subspace P, there exists x ∈ Rn such that + x ⊆ K. Hence, a -Besicovitch set is the standard Besicovitch set described earlier.
In 1979, Marstrand proved that there were no -Besicovitch sets. At around the same time, however, Falconer proved that there were no -Besicovitch sets for 2k > n. The best bound to date is by Bourgain, who proved in that no such sets exist when 2k−1 + k > n.

Kakeya sets in vector spaces over finite fields

In 1999, Wolff posed the finite field analogue to the Kakeya problem, in hopes that the techniques for solving this conjecture could be carried over to the Euclidean case.
Zeev Dvir proved this conjecture in 2008, showing that the statement holds for cn = 1/n!. In his proof, he observed that any polynomial in n variables of degree less than |F| vanishing on a Kakeya set must be identically zero. On the other hand, the polynomials in n variables of degree less than |F| form a vector space of dimension
Therefore, there is at least one non-trivial polynomial of degree less than |F| that vanishes on any given set with less than this number of points. Combining these two observations shows that Kakeya sets must have at least |F|n/n! points.
It's not clear whether the techniques will extend to proving the original Kakeya conjecture but this proof does lend credence to the original conjecture by making essentially algebraic counterexamples unlikely. Dvir has written a survey article on progress on the finite field Kakeya problem and its relationship to randomness extractors.