For a nonempty bounded set, let be the least number of radius- balls covering . The lower and upper Minkowski dimensions are respectively
Using comparable cubes or ball diameters gives the same limits. For an unbounded set one must specify a local or bounded-piece convention; these are the usual bounded-set definitions used in the Kakeya set problem.
For the digit set, fixing the first digits gives exactly cylinders in intervals of length . They cover the set with at most balls of comparable radius. Their base-nine prefix integers are separated by at least two, so these containing intervals have gaps at least . Choosing one point in each cylinder shows that a radius- ball meets at most a bounded number of chosen points. Hence . For , monotonicity sandwiches the covering number between constant multiples of and . This proves the box-counting dimension of separated digit sets formula here:
A planar Besicovitch set is a bounded set of zero Lebesgue measure containing a unit line segment in every unoriented direction. The following proof in fact applies to every bounded planar Kakeya set, whether its area is zero or positive.
Choose directions equally spaced in an angular interval of length, say, , and one segment of the set in each direction. Let be its rectangle of length one and width comparable to , lying in the neighborhood . Put . Then . Two such Kakeya tubes at angle have overlap at most , since the intersection of their supporting strips is a parallelogram of that area. The trivial bound applies for nearly parallel tubes. Thus, uniformly over their translations,
Sum these intersections. Each row contributes at most , so . The Cauchy-Schwarz inequality on the union now gives the planar Kakeya neighborhood lower bound
A cover of by radius- balls covers by their fixed-factor enlargements. Hence . Boundedness gives the matching upper exponent . Taking the lower and upper limits proves
The logarithmic neighborhood loss is compatible with zero area; it still forces full dimension.
Use , with arclength measure. We first bound the transform for constant density. By rotational symmetry, , . For , remove neighborhoods of width about the stationary points . Their contribution is . On each remaining interval integrate by parts using the phase derivative . The boundary terms are , and the integral of the derivative of its reciprocal is bounded by
Splitting at the stationary points gives the same bound on the other half of the circle. Together with the trivial estimate for bounded , this proves .
For merely measurable there is no reason that its amplitude permits this integration by parts. Instead use Gaussian positivity for even extension moments. Set
Expand the fourth power and integrate first in . The Fourier transform of a Gaussian gives
All exchanges of integrals are justified by bounded amplitudes, finite surface measure and the integrable Gaussian. The kernel is nonnegative and almost everywhere. Taking the absolute value of the integral therefore gives . The preceding scalar decay estimate and polar coordinates yield
For the last bound split at and ; the tail becomes an integrable integral after . Since the Gaussian is at least on the radius- ball, the local fourth-moment restriction estimate for the circle follows:
Every constant here is independent of and .
For the requested connection to Besicovitch sets, let be small and dilate the unit segments of a bounded planar Kakeya set by . Their -neighborhoods become direction-separated rectangles of length and width . A smooth circle cap of angular width has a Fourier extension operator of magnitude at least on such a rectangle: after removing the constant phase, the tangential phase variation is and the normal variation is . A frequency modulation translates the rectangle to any desired location. Choose separated caps for the rectangle directions, and multiply their modulated densities by independent Rademacher random variables. Because the caps are disjoint, the input remains bounded by one.
Apply the local fourth-moment estimate in a ball of radius containing the rectangles, then take expectation over the Rademacher random variables. The fourth moment dominates the square of the sum of squared packet magnitudes, giving
There are rectangles, each of area , so the integral of their sum is . Cauchy-Schwarz forces their union area to be at least . Scaling back gives , the planar Kakeya neighborhood lower bound. The covering-number argument in Question 1 then gives both Minkowski dimensions equal to two.
We first construct a genuinely compact Besicovitch set; a sequence of unrelated small-area sets would not suffice. The compact Kakeya construction from small projections below gives the limiting compact set together with its segments.
Let consist of nonempty compact sets whose horizontal projection is exactly . With the Hausdorff metric this is a complete metric space. Indeed a Hausdorff-Cauchy sequence is eventually contained in one bounded closed rectangle and converges there to a nonempty compact set; horizontal projection is Lipschitz for Hausdorff distance, so its value is preserved in the limit.
For put and . The function is upper semicontinuous. To verify this, cover the compact set by finitely many open intervals with total length less than . Joint continuity of the compact images in the Hausdorff metric puts every sufficiently nearby image inside the same cover. This proves the required upper bound, uniformly over a compact parameter interval when a strict bound holds throughout it.
Fix and . The set
is open. It is also dense, by the following explicit finite approximation. Given and tolerance , partition into equal subintervals and choose at each left endpoint. Above that subinterval put the segment
Each segment lies within of its chosen point in . Add a finite -net of points of to their union, ensuring the reverse Hausdorff inclusion. For large the resulting compact set belongs to and has Hausdorff distance less than from . The image of each segment under has length , and the added points contribute zero length. Hence
so .
Take a finite grid of 's whose -neighborhoods cover . The finite intersection of the open dense sets is dense and implies . Thus
is open and dense. The Baire category theorem gives a compact , and therefore for every .
Define
This is the continuous image of the compact set , hence compact. Its section at horizontal coordinate is , of measure zero. The Fubini theorem gives . For every slope , horizontal surjectivity supplies , and contains the segment , , of length . Four rotated copies, through angles , cover all unoriented directions. Their finite union is compact, has area zero, and contains a unit subsegment in every direction:
The point-line dual construction is the mechanism in Körner's construction; the density calculation above supplies the needed proof, rather than assuming that small-area sets automatically admit a suitable nested limit.
For the multiplier discussion, define by . The Plancherel theorem gives boundedness on . We explain why a putative bound, , would contradict Kakeya packing; duality of Lp spaces then treats .
First, such a bound would force the vector-valued inequality
for arbitrary directions , where is the half-plane Fourier projection onto the half-plane . To see the important curvature step, let project onto the radius- disk and modulate by . Its conjugated symbol is , tending almost everywhere to . Dilations give the same putative norm bound for every . Apply this common operator to , average over independent random signs, and use the Khintchine inequality. Letting gives the displayed estimate by convergence and Fatou lemma, first for finitely many smooth function functions and then by approximation. The disk has a boundary normal in every direction; a fixed polygon does not.
The geometric input for this overview is the standard finite Perron tree packing used in Fefferman's original proof: for arbitrarily small one obtains long thin rectangles with and , while fixed longitudinal translates are pairwise disjoint. This is a quantitative finite arrangement, stronger than merely having a compact null set. The splitting/sliding procedure subdivides an angular triangle into narrow triangles and overlaps their bases; the extensions along their axes separate in reverse order. Its area estimate has the form relative to the original total triangle area: the merged central part shrinks by at each generation, and the accumulated caps contribute at most . Taking close to one and then large makes the ratio arbitrarily small. Inscribed rectangular portions retain a fixed proportion of the total area. The reflected extensions explain why the translates can be disjoint even though the original rectangles overlap strongly.
Here is the analytic contradiction, with the relevant powers explicit. Take . In coordinates parallel and perpendicular to the long axis , the directional Hilbert transform integrates only along that axis. If the longitudinal interval is , then outside it
On a fixed translate such as , this has magnitude at least . Since up to the harmless choice of half-plane sign, on . Their disjointness gives a lower bound for the vector-valued output norm.
Writing , Hölder's inequality for gives
The putative vector-valued inequality would imply
which is impossible as . The disk multiplier is self-adjoint, so a bound for would give one for its conjugate exponent below two. Thus the disk multiplier is bounded only at among . This explains both the random-sign step and the precise geometric amplification; it is not an assertion that frequency rectangles by themselves produce a logarithmic norm blow-up.
Perron tree 2026-10-14
A Perron tree is a finite triangular splitting-and-sliding arrangement retaining a prescribed angular range while overlapping its pieces strongly. The compression parameter and the number of generations can make union area an arbitrarily small fraction of total piece area. Suitable longitudinal extensions separate the pieces into disjoint rectangles. This stronger finite geometry is used by the ball-multiplier counterexample; a compact measure-zero Besicovitch set alone does not assert that arbitrary segment translates are disjoint.