Pith. sign in

REVIEW 2 major objections 4 minor 28 references

Generalized Arithmetic Kakeya

T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For every finite set of rational directions, the homogeneous arithmetic Kakeya inequality matches the original one.

desk verdict New equivalence and higher-dimensional bounds, but Section 4 has a mis-scaled sumset that needs a fix before the proof works as written. read the letter →

arxiv 2411.13395 v1 pith:RGJGF2U7 submitted 2024-11-20 math.CO

Cosmin Pohoata , Dmitrii Zakharov This is my paper · ORCID
classification math.CO MSC 11B30
keywords arithmeticKakeyahomogeneousinequalityShannonentropyadditivecombinatoricsBesicovitchsetsfinite-fieldsumsetsMinkowskidimensionconjecture
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

The paper proves that the 'homogeneous' version of the arithmetic Kakeya inequality, which includes an extra conditional-entropy term, is equivalent to the original inequality for every finite set of rational directions $R\subset\mathbb{Q}$ (Theorem 1). The homogeneous form is the one that can be iterated, so the equivalence means any bound on the ordinary arithmetic Kakeya constant $\beta(R)$ automatically upgrades to the stronger inequality that higher-dimensional Kakeya problems need. Using this, the paper proves a quantitative bound on the $d$-dimensional arithmetic Kakeya constant $\beta(R^d)$ in terms of $\beta(R)$, and as a corollary obtains a new lower bound on the Minkowski dimension of $(n,d)$-Besicovitch sets, the sets containing a translate of every $d$-dimensional unit disk. A reader should care because these Besicovitch sets are the disk analogue of Kakeya sets, where the central question is how small such sets can be; the new bound improves the power of the relevant iteration.

What carries the argument

The main new mechanism is Lemma 5, a finite-field sumset lemma. It states that if $A\subset\mathbb{F}_p$ has size at least $p/m$ and $I=\{1,\dots,m\}$, then for at least $mp^{-\varepsilon}$ of the indices $j\in[m/2,m]$ the dilated sumset $A+j^{-1}I$ has size at least $p^{1-\varepsilon}$. The proof of Theorem 1 uses this lemma on the fibers $D_y$ of the auxiliary graph: it guarantees that enough random arithmetic progressions meet enough fibers, so that the restricted graph $(X',Y')$ inherits entropy bounds close to those of $(X,Y)$. Applying the ordinary inequality (2) to $(X',Y')$ and rearranging yields the homogeneous inequality (4). Theorem 2 then rests on an iterative telescoping identity that applies the homogeneous inequality one coordinate at a time, with a permutation-averaging step producing the factor $(1-1/(\delta_1\cdots\delta_d))^{-1}$ where $\delta_i=\beta(R_i)/(\beta(R_i)-1)$.

What would settle it

One could count good indices in Lemma 5 numerically: for a moderately large prime $p$, take $m\approx p^{1/2}$, pick $A$ of size about $p/m$, and test how many $j\in[m/2,m]$ satisfy $|A+j^{-1}I|\ge p^{1-\varepsilon}$; fewer than $mp^{-\varepsilon}$ good indices would refute the lemma. Alternatively, an exhaustive search over small sets $R\subset\mathbb{Q}$ and small-support random variables $(X,Y)$ could look for a violation of $\beta_h(R)=\beta(R)$; the theorem asserts none exists.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central claim is that for any finite $R\subset\mathbb{Q}$ with $|R|\geq 2$, $\beta_h(R)=\beta(R)$. Here $\beta(R)$ is the least $\beta$ such that $H(Y)\leq \beta\max_{r\in R}H(X+rY)$ for all finitely supported integer random variables $X,Y$, and $\beta_h(R)$ is the least $\beta$ such that $H(Y)+(\beta-1)H(X|Y)\leq \beta\max_{r\in R}H(X+rY)$. Theorem 1 gives the nontrivial direction $\beta_h(R)\leq\beta(R)$: the homogeneous inequality comes for free once the ordinary one is known. The proof converts the entropy data into a graph in $\mathbb{F}_p^2$, restricts it to a random arithmetic progression, applies the original inequality to the restricted random variables, and then rearranges the resulting entropy identities. With homogeneity in hand, Proposition 6 proves Theorem 2, the bound $\beta(R^d)\leq d\,\frac{(\beta/(\beta-1))^d}{(\beta/(\beta-1))^d-1}$, and Corollary 1 gives $\dim_M K\geq \frac{d}{\beta(R)}n$ for every $(n,d)$-Besicovitch set $K$. Numerically, using the best current bound $\beta(R)\leq\alpha=1.675\ldots$ for suitable $R$, this reads $\dim_M K\geq \frac{(\alpha/(\alpha-1))^d-1}{(\alpha/(\alpha-1))^d}n$.

Load-bearing premise

The argument stands on Lemma 5, the new claim that for every large subset $A$ of a finite field and every short interval $I$, many dilates $j^{-1}I$ expand $A$ to size at least $p^{1-\varepsilon}$; if that claim fails, the random-progression restriction does not preserve the entropy bounds and Theorem 1 collapses.

Editorial extensions

If this is right

  • Any bound on the one-dimensional arithmetic Kakeya constant $\beta(R)$ immediately gives the same bound on the homogeneous constant $\beta_h(R)$; in particular the known $\alpha=1.675\ldots$ bound now applies to the homogeneous inequality without rewriting its proof.
  • The bound $\beta(R^d)\le d\,(\beta/(\beta-1))^d/((\beta/(\beta-1))^d-1)$ gives explicit numerical constants for product sets; for example $\beta(\{0,1\}^d)\le d\,2^d/(2^d-1)$.
  • For $(n,d)$-Besicovitch sets, the Minkowski dimension lower bound becomes $\dim_M K\ge \bigl((\alpha/(\alpha-1))^d-1\bigr)/(\alpha/(\alpha-1))^d\,n$ with $\alpha=1.675\ldots$.
  • Because the homogeneous inequality iterates cleanly, the proof also supplies a template for turning similar one-dimensional entropy inequalities into higher-dimensional geometric estimates, and the same iterative structure applies to finite-field variants.

Reading between the lines

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

  • The equality $\beta_h(R)=\beta(R)$ suggests a broader principle: for entropy inequalities that sit naturally in a tensor product, the homogeneous strengthening may often be automatic, and the proof of Theorem 1 gives a concrete model for discovering such upgrades.
  • The new upper bound for $\beta(R^d)$ is probably not tight: since any affine-spanning $R\subset\mathbb{Q}^d$ has $d\le\beta(R)\le d+1$, the formula interpolates between the trivial endpoints, and sharper $d$-dimensional bounds would immediately improve the Besicovitch dimension constant.
  • Lemma 5 is asymptotic in the prime $p$; extracting an effective quantitative version would make Corollary 1's constant explicit for fixed $n,d$, and then random constructions of Besicovitch sets could be tested against the predicted dimension.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 4 minor

Summary. The paper studies entropic arithmetic Kakeya constants. It defines β(R) by H(Y) ≤ β(R) max_r H(X+rY) and the homogeneous variant β_h(R) by adding (β_h(R)-1)H(X|Y) to the left-hand side. Theorem 1 claims that β_h(R)=β(R) for every finite R⊂Q with |R|≥2. The proof passes through a discretized graph G'⊂F_p^2 and, using a new sumset lemma (Lemma 5), constructs from a random arithmetic progression a smaller graph G_I whose entropy data inherit the original inequality. Theorem 2 and Proposition 6 iterate the homogeneous inequality to bound β(R^d), yielding Corollary 1 on the Minkowski dimension of (n,d)-Besicovitch sets.

Significance. The equivalence in Theorem 1, if established, is an elegant and useful reduction: it makes existing bounds on β(R) automatically valid for the homogeneous form needed in Oberlin-style iterations, without rewriting the proof of Katz and Tao. The new sumset lemma is a substantive ingredient, and the iterative argument in Section 5 is clean and appears to work. The paper is fully self-contained in its main dependencies and does not fit parameters to force the conclusion. Because the proof of Theorem 1 currently has a local but load-bearing gap, the significance is conditional on the repair.

major comments (2)
  1. [§4, Eq. (10)] With I0 defined as I0={dj : 0≤j<m}, the summand |D_y-(y/j)I0| is inconsistent with the conditioning d=y/j. Conditioned on d=y/j, the progression is t+(y/j){0,...,m-1}, so the correct summand is |D_y-(y/j){0,...,m-1}|. With the printed definition, (y/j)I0=(y/j)^2{0,...,m-1}, and Lemma 5, which controls sets of the form A+j^{-1}I for a fixed interval I, does not apply to the printed expression. Thus the stated lower bound on Pr[y∈B_I] is not justified, and this is a load-bearing step for Theorem 1. The gap can be repaired by replacing I0 with the fixed interval {0,...,m-1} in the conditioning and in the subsequent application of Lemma 5, but as written the proof is unsupported at this point.
  2. [§4, after Eq. (10)] The inference from E|B_I| ≥ m p^{-2ε} and |B_I| ≤ m to Pr[|B_I| ≥ p^{-2ε}m] ≥ p^{-2ε} is not valid: reverse Markov bounds require the threshold to be strictly below the expectation lower bound, and no such conclusion follows when the threshold equals the mean. This matters because the construction of G_I requires a positive-probability event. The gap is fixable by choosing a smaller threshold such as p^{-3ε}m and then adjusting ε in the entropy estimates, and a union bound with (9) should be stated explicitly; but as printed the step is unjustified.
minor comments (4)
  1. [§4, notation] The symbol I0 is overloaded: it denotes the random progression {dj}, but in the intended application of Lemma 5 it must be the fixed interval {0,...,m-1}. This overloading is the source of the error in Eq. (10) and should be corrected.
  2. [Lemma 5] The proof concludes a bound for at least half of the indices j in the set J of primes in [m/2,m]; the passage from this to the stated ⌊m p^{-ε}⌋ indices in the full interval [m/2,m] should be written out explicitly.
  3. [Corollary 1] The displayed formula for the Minkowski dimension lower bound appears garbled in the typeset text; please check whether it should be d/β(R)^n or d/β(R)^d n and correct the formatting.
  4. [§5, after Eq. (12)] The coefficient computation after the weighted sum is compressed; since positivity of the coefficients is used before averaging over permutations, an explicit expansion of the grouped coefficients would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: βh(R)=β(R) is derived by applying the original β(R) inequality to a constructed random pair, with the work carried by an independent sumset lemma; no fitted constants or load-bearing self-citations.

full rationale

The derivation chain is self-contained. Theorem 1 proves βh(R) ≤ β(R) by assuming the original inequality (2) for a constructed pair (X',Y') and deriving the homogeneous inequality (4); this is the correct logical direction, not an assumption of the target. The constructed pair is chosen using entropy-normalized parameters α and γ that track the given variables, not fitted to the conclusion. The only nontrivial engine is Lemma 5, a Fourier-analytic sumset lemma proved in Section 3 from first principles; it does not quote the target inequality. Theorem 2 iterates the homogeneous inequality to bound β(R^d), and Corollary 1 is an arithmetic consequence of that bound. The paper contains no load-bearing self-citations: the references to Katz–Tao, Green–Ruzsa, Ruzsa, Freiman embedding by Tao–Vu, and Oberlin are external results, and none is used to define away the claim. The reviewer-flagged issue at Section 4, Equation (10) — namely that the printed summand |D_y-(y/j)I_0| may not match the j^{-1}I dilation required by Lemma 5 if I_0 is interpreted literally — is a possible proof gap concerning scaling, not a circular reduction: even if the argument needs repair, Lemma 5 remains an independent auxiliary statement and the proof still does not assume βh(R) ≤ β(R). Consistent with the default expectation, the honest finding is no significant circularity (score 0).

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

The proof rests on standard entropy inequalities, Ruzsa's equivalence, Freiman embedding, and the Prime Number Theorem, plus the new Lemma 5. The numerical corollary additionally imports Katz-Tao's bound and Oberlin's reduction. No free parameters are fitted to data and no new entities are introduced.

assumptions (6)
  • standard math Standard Shannon entropy identities and Shearer's inequality
    Used throughout Section 2 and in Proposition 6's final averaging.
  • standard math Ruzsa's equivalence between additive energy and entropy (Lemma 3)
    Bridges set inequalities and entropy inequalities; cited from Ruzsa [21].
  • standard math Freiman embedding into cyclic groups (Lemma 4)
    Proved in the paper following [25, Lemma 5.26] and Green-Ruzsa; transfers G subset of Z^2 to F_p^2.
  • standard math Prime Number Theorem
    Used in Lemma 5 to lower-bound the number of primes in [m/2,m].
  • domain assumption Katz-Tao bound beta_0 <= alpha = 1.675...
    Used only in the corollary to turn the abstract bound into a numerical Minkowski dimension bound; cited from [15].
  • domain assumption Oberlin's reduction from homogeneous arithmetic Kakeya to Minkowski dimension of (n,d)-Besicovitch sets
    Used to derive Corollary 1; cited from [20].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Generalized Arithmetic Kakeya." pith.science (2026). https://pith.science/paper/RGJGF2U7

@misc{pith2026241113395,
  author       = {Pith},
  title        = {Pith review of: Generalized Arithmetic Kakeya},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RGJGF2U7}},
  note         = {Machine review of arXiv:2411.13395}
}
abstract

Around the early 2000-s, Bourgain, Katz and Tao introduced an arithmetic approach to study Kakeya-type problems. They showed that the Euclidean Kakeya conjecture follows from a natural problem in additive combinatorics, now referred to as the `Arithmetic Kakeya Conjecture'. We consider a higher dimensional variant of this problem and prove an upper bound using a certain iterative argument. The main new ingredient in our proof is a general way to strengthen the sum-difference inequalities of Katz and Tao which might be of independent interest. As a corollary, we obtain a new lower bound for the Minkowski dimension of $(n, d)$-Besicovitch sets.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 24 canonical work pages

  1. [1]

    On Kakeya’s problem and a similar one

    A.S. Besicovitch. “On Kakeya’s problem and a similar one .” Mathematische Zeitschrift 27.1 (1928): 312-320

    work page 1928

  2. [2]

    The kakeya problem

    A. S. Besicovitch. “The kakeya problem.” The American Ma thematical Monthly 70.7 (1963): 697-706

    work page 1963

  3. [3]

    Besicovitch type maximal operators an d applications to Fourier analysis

    Bourgain, Jean. “Besicovitch type maximal operators an d applications to Fourier analysis.” Geom. Funct. Anal. 1 (1991): 147-187

    work page 1991

  4. [4]

    Bourgain, λ p-sets in analysis: results, problems and related aspects, i n: Handbook of the geometry of Banach spaces, Vol

    J. Bourgain, λ p-sets in analysis: results, problems and related aspects, i n: Handbook of the geometry of Banach spaces, Vol. I , North-Holland, Amsterdam, 2001, 195–23

    work page 2001

  5. [5]

    Some remarks on the Kakeya problem

    R.O. Davies. “Some remarks on the Kakeya problem.” Mathe matical Proceedings of the Cambridge Philosophical Society. Vol. 69. No. 3. Cambridge University Press, 1971

    work page 1971

  6. [6]

    M. Dhar, Z. Dvir, B. Lund, Simple proofs for Furstenberg s ets over finite fields, Discrete Analysis, (22), 2021

    work page 2021

  7. [7]

    Ellenberg, D

    J. Ellenberg, D. Erman, Furstenberg sets and Furstenber g schemes over finite fields, Algebra & Number Theory, 10(7):1415–1436, 2016

    work page 2016

  8. [8]

    Improv ed bounds for the Kakeya maximal conjecture in higher dimensions

    J. Hickman, Keith M. Rogers, and Ruixiang Zhang. “Improv ed bounds for the Kakeya maximal conjecture in higher dimensions.” American Journal of Mathematics 144.6 (2022) : 1511-1560

    work page 2022

Show all 28 references
  1. [9]

    On a conjec ture of Marton

    W.T. Gowers, B. Green, F. Manners, and T. Tao. “On a conjec ture of Marton.” arXiv preprint arXiv:2311.05762 (2023)

    2023 arXiv

  2. [10]

    Marton’s Conjecture in abelian groups with bounded torsion

    W. T. Gowers, B. Green, F. Manners, and T. Tao. “Marton’s Conjecture in abelian groups with bounded torsion.” arXiv preprint arXiv:2404.02244 (2024)

    2024 arXiv

  3. [11]

    Green, F

    B. Green, F. Manners, and T. Tao. ”Sumsets and entropy re visited.” Random Structures & Algorithms (2024)

    2024

  4. [12]

    Green, I

    B. Green, I. Z. Ruzsa, On the arithmetic Kakeya conjectu re of Katz and Tao, Periodica Mathematica Hungarica 78 (2019), 135–151

    2019

  5. [13]

    Katz and T

    N. Katz and T. Tao, Bounds on arithmetic projections, an d applications to the Kakeya conjecture, Math. Res. Lett. 6 (1999), no. 5-6, 625–630

    1999

  6. [14]

    Recent progress on the Kakeya conje cture

    N. Katz, and T. Tao. “Recent progress on the Kakeya conje cture.” Publicacions matem` atiques (2002): 0161-179

    2002

  7. [15]

    Katz and T

    N. Katz and T. Tao, New bounds for Kakeya problems, J. Anal. Math. 87 (2002), 231–263

    2002

  8. [16]

    An improved bound on the Hausdorff d imension of Besicovitch sets in R3

    N. Katz, and J. Zahl. “An improved bound on the Hausdorff d imension of Besicovitch sets in R3.” Journal of the American Mathematical Society 32.1 (2019): 195-259

    2019

  9. [17]

    New counterexamples for sums-differences

    M. Lemm. “New counterexamples for sums-differences.” P roceedings of the American Mathematical Society 143.9 (2015): 3863-3868

    2015

  10. [18]

    Bounds for Kakeya-type maximal operators associated with k-planes

    R. Oberlin. “Bounds for Kakeya-type maximal operators associated with k-planes.” Mathematical research letters 14.1 (2007): 87-97

    2007

  11. [19]

    The ( d, k ) Kakeya problem, and estimates for the X-ray transform

    R. Oberlin. “The ( d, k ) Kakeya problem, and estimates for the X-ray transform.” Ph .D. thesis, University of Wisconsin-Madison (2007)

    2007

  12. [20]

    Two bounds for the X-ray transform

    R. Oberlin. “Two bounds for the X-ray transform.” Mathe matische Zeitschrift 266.3 (2010)

    2010

  13. [21]

    I. Z. Ruzsa, Sumsets and entropy, Random Structures Algorithms 34 (2009), no. 1, 1–10

    2009

  14. [22]

    Tao, From rotating needles to stability of waves: eme rging connections between combinatorics, analysis, and PD E, Notices Amer

    T. Tao, From rotating needles to stability of waves: eme rging connections between combinatorics, analysis, and PD E, Notices Amer. Math. Soc. 48 (2001), no. 3, 294–303

    2001

  15. [23]

    Edinburgh lecture notes on the Kakeya problem

    T. Tao. “Edinburgh lecture notes on the Kakeya problem. ” Preprint, available at http://www.math.ucla.edu/tao/preprints/kakeya.html (2002)

    2002

  16. [24]

    Tao, Sumset and inverse sumset theory for Shannon ent ropy

    T. Tao, Sumset and inverse sumset theory for Shannon ent ropy. Combinatorics, Probability and Computing 19.4 (2010): 603-639

    2010

  17. [25]

    Tao, and Van H

    T. Tao, and Van H. Vu. Additive combinatorics. Vol. 105. Cambridge University Press, 2006

    2006

  18. [26]

    Sticky Kakeya sets and the sticky K akeya conjecture

    H. Wang, and J. Zahl. “Sticky Kakeya sets and the sticky K akeya conjecture.” arXiv preprint arXiv:2210.09581 (2022)

    2022

  19. [27]

    The Assouad dimension of Kakeya se ts in R3

    H. Wang, and J. Zahl. “The Assouad dimension of Kakeya se ts in R3.” arXiv preprint arXiv:2401.12337 (2024)

    2024 arXiv

  20. [28]

    New Kakeya estimates using Gromov’s algebrai c lemma

    J. Zahl. “New Kakeya estimates using Gromov’s algebrai c lemma.” Advances in Mathematics 380 (2021): 107596. Department of Mathematics, Emory University, Atlanta, GA. Email address : cosmin.pohoata@emory.edu Department of Mathematics, Massachusetts Institute of Tec hnology, Ca...

    2021

Pith tools

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