Pith. sign in

REVIEW 2 major objections 5 minor

A non-sticky Kakeya set of Lebesgue measure zero

T0 review · 2 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Pith's one-line read The paper constructs a compact Kakeya set in R^2 of Lebesgue measure zero that is non-sticky, and extends this to all higher dimensions.

desk verdict Genuinely new construction with a real but repairable gap in Proposition 3.3(3); deserves serious peer review. read the letter →

arxiv 2506.18142 v2 pith:GTUZY7SF submitted 2025-06-22 math.CA math.MG

classification math.CAmath.MG MSC 28A7828A80
keywords KakeyasetBesicovitchLebesguemeasurezerostickysetsnon-stickypackingdimensionHausdorffprojectiontheorem
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

A Kakeya set contains a unit line segment in every direction. The paper's main result is a compact Kakeya set in $\mathbb{R}^2$ of Lebesgue measure zero that is non-sticky, meaning its line-parameter set has packing dimension strictly above $1$. This matters because measure-zero Kakeya sets are the hard case for the Kakeya set conjecture, and the sticky/non-sticky distinction is central to the recent resolution in $\mathbb{R}^3$; if non-stickiness forced positive measure, the restricted sticky conjecture and the full conjecture would be equivalent. The paper shows that route is blocked: non-sticky examples can have zero area. Section 4 then builds sticky and non-sticky measure-zero Kakeya sets in every dimension that are not Cartesian products of a planar example with $\mathbb{R}^{d-2}$ and have full Hausdorff dimension $d$.

What carries the argument

The central object is a Cantor set $C$ built from fractal squares with side lengths $4^{-(n_1+\cdots+n_k)}$ and two alternating selection rules: odd stages keep $2^{3n}$ squares per parent with exactly $2^n$ per column, while even stages keep $2^n$ squares per parent with at least one per subcolumn and a pair overlapping exactly under the $45^\circ$ projections. A uniform-pattern condition (M) makes $C$ a uniform fractal cube and supplies the product estimate for the diagonal projections. Proposition 2.3 is the bridge: any compact parameter set $C$ whose first-coordinate projection contains an interval, whose packing dimension exceeds $1$, which has finite one-dimensional Hausdorff measure, and which has two distinct zero-measure projections, yields a non-sticky measure-zero Kakeya set through the line family $K_0$ and the Besicovitch projection theorem.

What would settle it

Run the induction of Proposition 3.3 with $n_{2k-1}=n_{2k}$ and check at the first even stage whether condition (M) can be met without emptying a column in condition $(**)_1$; if the identical-pattern requirement forces an empty column, the estimate $m_1(\pi_+ C)\le \sqrt2\,\prod_j(1-4^{-(n_{2j-1}+n_{2j})})^{m_j}$ fails and the proof of Proposition 3.3(3) collapses.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.2: there exists a non-sticky Kakeya set of Lebesgue measure zero in $\mathbb{R}^2$, and hence in $\mathbb{R}^d$ for every $d>2$. The proof builds a Cantor set $C\subset[0,1]^2$ that has positive finite one-dimensional Hausdorff measure, packing dimension greater than $1$, and zero Lebesgue measure for both diagonal projections. Using $C$ as the parameter set of affine lines, the union of the corresponding unit segments, after finitely many rotations, is a compact Kakeya set; because the parameter set has packing dimension greater than $1$, the set is non-sticky, and by the Besicovitch projection theorem together with Fubini's theorem, the set has measure zero. The paper also proves Theorem 4.2 and Theorem 4.3: in $\mathbb{R}^d$ there are sticky and non-sticky Kakeya sets of measure zero and Hausdorff dimension $d$ that are not formed by taking a Cartesian product with $\mathbb{R}^{d-2}$.

Load-bearing premise

The proof that the diagonal projections have zero measure rests on the requirement that every parent square at each even construction stage use the same subsquare pattern, and the paper does not verify that the chosen block sizes can meet that requirement together with the other construction conditions.

Editorial extensions

If this is right

  • In $\mathbb{R}^2$, there is a compact Kakeya set of Lebesgue measure zero whose line-parameter set has packing dimension strictly above $1$, so non-stickiness does not force positive measure.
  • Taking products with $\mathbb{R}^{d-2}$ gives non-sticky measure-zero Kakeya sets in every dimension $d>2$.
  • Theorem 4.2 provides a sticky Kakeya set in $\mathbb{R}^d$ of measure zero and Hausdorff dimension $d$ that is not a Cartesian product of a planar Kakeya set with $\mathbb{R}^{d-2}$.
  • Theorem 4.3 provides the analogous non-sticky example in $\mathbb{R}^d$, also of measure zero and Hausdorff dimension $d$, so both high-dimensional constructions satisfy the full-dimension conclusion of the Kakeya set conjecture without being trivial products.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next step is to test whether condition (M) can be weakened or dropped; if the diagonal-projection estimate can be obtained without identical patterns in every parent square, the construction would become substantially more flexible.
  • The Proposition 2.3 recipe suggests a general search: any compact family of parameter sets in $[0,1]^2$ with packing dimension above $1$ and two zero-measure projections automatically yields a non-sticky measure-zero Kakeya set, so the problem reduces to producing such Cantor sets.
  • One could investigate whether a single zero-measure projection plus a lower entropy bound suffices in place of the two diagonal projections, which would shorten the route from fractal-square data to a non-sticky measure-zero Kakeya set.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. This paper constructs a compact Cantor-type set C in [0,1]^2 with pi_0(C)=[0,1], H^1(C) finite and positive, packing dimension strictly larger than 1, and two diagonal projections of zero Lebesgue measure. It then invokes a criterion (Proposition 2.3) built on the Besicovitch projection theorem and Fubini to convert C into a non-sticky Kakeya set of Lebesgue measure zero in R^2; a product with [0,1]^{d-2} gives the same in higher dimensions. The paper also gives two genuinely higher-dimensional constructions: a sticky Kakeya set from products of the four-corner Cantor set (Theorem 4.2) and a non-sticky one from products of C (Theorem 4.3), both of Hausdorff dimension d and not formed by a trivial Cartesian product with a line.

Significance. The main result, if fully justified, resolves a natural question: measure-zero Kakeya sets need not be sticky, so the sticky and non-sticky cases are not distinguished by Lebesgue measure. The construction is explicit and the proof strategy is attractive, using standard tools (Besicovitch projection, Marstrand, product inequalities). The paper is careful in many places: Proposition 2.4 gives a self-contained lower bound for packing dimension of fractal cubes, and the higher-dimensional examples in Section 4 address a gap in the literature. The central issue is that the proof of the zero-measure projection claim rests on an unproved combinatorial existence statement for condition (M). This is likely fixable, but until it is supplied the main theorem is conditional.

major comments (2)
  1. [Section 3, condition (M) and Proposition 3.3(3)] The proof that m_1(pi_+(C))=m_1(pi_-(C))=0 requires the Cantor set to satisfy condition (M), because the product bound (1 - 4^{-(n_{2j-1}+n_{2j})})^{m_j} in the covering argument is obtained by assuming that the even-stage pattern inside every parent square is identical, so that the exact-overlap condition (***)_k provides a reduction in every parent. Condition (M) is introduced only as an 'additional condition', and the paper never proves that the sequence n_k chosen in Proposition 3.3 admits a construction satisfying (M) simultaneously with (*)_k, (**)_k, and (***)_k at every stage and every repetition. This is a load-bearing gap: the conclusions m_1(pi_+(C))=m_1(pi_-(C))=0, and hence the Lebesgue measure zero of the Kakeya set via Proposition 2.3, depend on it. Please add a lemma that explicitly constructs the uniform pattern and verifies all required conditions.
  2. [Section 3, Proposition 3.3(3), counting step] The step from (***)_1 to 'pi_+(C) is contained in at most 4^{n1+n2}-1 intervals of length sqrt(2)*4^{-(n1+n2)}' uses the fact that, because n1=n2, each repetition selects exactly one square in each fine column, so that without the duplicate pair the projection would occupy at most 4^{n1+n2} distinct diagonal classes. This one-per-column fact is never stated or proved; if several squares were allowed per column, a single duplicate would not in general reduce the covering number by one. Please make this counting explicit, since it is essential to the product estimate.
minor comments (5)
  1. [Theorem 4.3 statement] The word 'Haudorff' should be 'Hausdorff'.
  2. [Section 3, Proposition 3.3(2), displayed formula] In the displayed computation, the term m_k(n_{2k-1}+n_{2k}) appears to be missing the factor 3; the following line uses m_k(3n_{2k-1}+n_{2k}). Please correct the typo.
  3. [Theorem 4.2, stickiness conclusion] The stickiness conclusion needs dim_P(A_B)=d-1, but the text states only the Hausdorff dimension of A_B. Since A_B is bi-Lipschitz equivalent to C_{d-1} x C_{d-1} and dim_P(C0)=dim_H(C0)=1/2, the product inequality (2.2) gives the required packing dimension; please state this explicitly.
  4. [Abstract and throughout] The spelling 'Bescovitch' should be 'Besicovitch'.
  5. [Section 3, condition (M)] Condition (M) is formulated for C_{2k} with k>=1; when the first pair (n1,n2) is repeated, the same uniformity is needed for the patterns inside each element of C_2. Please make the indexing uniform or add a sentence covering the initial repetition.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the construction is explicit and uses only external classical theorems as inputs.

full rationale

The paper's derivation is self-contained and non-circular. The main conclusion, Theorem 1.2, is obtained by explicitly constructing a Cantor set C whose properties are verified directly: Proposition 3.2 proves the projection condition (1), Proposition 3.3(1)-(2) prove the Hausdorff and packing dimension estimates, and Proposition 3.3(3) proves the two diagonal projections have zero measure via an inductive covering argument. The integer parameters n_k and repetition counts m_k are chosen to satisfy explicit inequalities such as (3.1)-(3.4); they are construction parameters, not fitted data, and no result is predicted from a quantity that was defined in terms of the conclusion. The Besicovitch projection theorem, Marstrand's theorem, and the standard product inequalities for Hausdorff and packing dimensions are all external classical results, and the paper does not rely on any prior result by the same authors. There is no self-citation chain that forces the outcome. A possible concern is that Proposition 3.3(3) invokes condition (M) to make the covering count for the diagonal projections work, and the paper does not explicitly prove that (M) is compatible with conditions (*)_k, (**)_k, and (***)_k; however, that is a potential missing existence proof for a combinatorial configuration, not a circular reduction of the conclusion to its own assumptions. Therefore the circularity score is 0.

Assumptions & free parameters 1 free parameters · 6 assumptions · 0 invented entities

The central claim rests on standard theorems of geometric measure theory and fractal geometry plus the explicit choice of integer sequences n_k and m_k. No new entities are introduced. The sequences are construction parameters, not data-fitted constants.

free parameters (1)
  • Sequences n_k and repetition counts m_k = Not applicable; chosen recursively to satisfy (3.1)-(3.4)
    The Cantor set construction depends on positive integers n_k (with n_{2k-1}=n_{2k}) and repetition counts m_k. They are not fitted to data; they are construction parameters selected to make the dimension and projection estimates hold. The theorem asserts existence, so any valid choice works.
assumptions (6)
  • standard math Besicovitch projection theorem
    Theorem 2.2, cited from Falconer [5]; used in Proposition 2.3 and Theorem 1.2 to pass from two zero projections to almost all projections.
  • standard math Marstrand's projection theorem
    Used in Lemma 4.1(3) and Theorem 4.3 to bound Hausdorff dimension of projected Cantor sums and products.
  • standard math Marstrand's slicing theorem
    Used in Theorems 4.2 and 4.3 to compute Hausdorff dimension of line-union sets from slices.
  • standard math Packing dimension lower bound via entropy dimension
    Proposition 2.4 relies on Fan-Lau-Rao [6] and Barany-Simon-Solomyak [1] to lower-bound the packing dimension of fractal cubes.
  • standard math Product dimension inequalities (2.1) and (2.2)
    Used in Proposition 3.3, Lemma 4.1, and Theorems 4.2-4.3 to control dimensions of products.
  • standard math Hausdorff measure monotonicity under Lipschitz maps
    Used to get H^1(C) >= 1 from pi_0(C) = [0,1] in Proposition 3.3(1).

how reviews work

0 comments
Cite this review

Pith. "Pith review of A non-sticky Kakeya set of Lebesgue measure zero." pith.science (2026). https://pith.science/paper/GTUZY7SF

@misc{pith2026250618142,
  author       = {Pith},
  title        = {Pith review of: A non-sticky Kakeya set of Lebesgue measure zero},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GTUZY7SF}},
  note         = {Machine review of arXiv:2506.18142}
}
abstract

The Kakeya set conjecture in ${\mathbb R} ^3$ was recently resolved by Wang and Zahl. The distinction between sticky and non-sticky Kakeya sets plays an important role in their proof. Although the proof did not require the Kakeya set to be Lebesgue measure zero, measure zero Kakeya sets are the crucial case whose study is required to resolve the conjecture. In this paper, we explicitly construct a non-sticky Kakeya set of Lebesgue measure zero in ${\mathbb R}^2$ (and hence in any dimension). We also construct non-trivial sticky and non-sticky Kakeya sets in high dimension that are not formed by taking the Cartesian product of a 2-dimensional Kakeya set with ${\mathbb R}^{d-2}$, and we verify that both Kakeya sets have Hausdorff dimension $d$.

Figures

Figures reproduced from arXiv: 2506.18142 by the authors.

Figure 1
Figure 1. Examples of first (left) and second (right) iterations of the construction with n1 = n2 = 1 and with (∗ ∗ ∗) 1 also satisfied. Denote the collection of all of these squares obtained from all Qk by C2k+1. We now further subdivide each square in C2k+1 into 24n2k+2 many subsquares and choose 2n2k+2 many squares satisfying the following conditions: (∗ ∗) k In each column of width 4−(n1+···+n2k+2) in each Qk from C2k, at… view at source ↗
Figure 2
Figure 2. An illustration of K0 for K = C, as in [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. An illustration of B for d = 3 and the slice xd = λ. The copy of Cd−1 at xd = 0 has been scaled up by a factor of 2, and only the lines emanating from one corner of the copy of Cd−1 at xd = 1 are shown. To verify the set is sticky, we compute AB as AB = [ a∈ 1 2 Cd−1 (Cd−1 − a) × {a}. This set is bi-Lipschitz equivalent to Cd−1 × Cd−1 via the bi-Lipschitz map (x, y) 7→ (y−2x, 2x), and it has Hausdorff dimension d−1,… view at source ↗

Discussion (0). Continue with ORCID to comment.

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.