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.