[Paper Review] Polynomials with dense zero sets and discrete models of the Kakeya conjecture and the Furstenberg set problem

Ruixiang Zhang|arXiv (Cornell University)|Mar 6, 2014

Advanced Harmonic Analysis Research22 references4 citations

TL;DR

This paper establishes the discrete analogue of the Kakeya conjecture in $\mathbb{R}^n$ and fully solves the discrete Furstenberg set problem using polynomial methods and Wongkew's theorem on low-degree polynomials. It shows that low-dimensional Kakeya sets cannot arise from discrete configurations, highlighting the critical role of continuity and transversality in the true Kakeya problem, with key results derived from incidence bounds via polynomial zero sets and lattice point counting.

ABSTRACT

We prove the discrete analogue of Kakeya conjecture over $\mathbb{R}^n$. This result suggests that a (hypothetically) low dimensional Kakeya set cannot be constructed directly from discrete configurations. We also prove a generalization which completely solves the discrete analogue of the Furstenberg set problem in all dimensions. The difference between our theorems and the (true) problems is only the (still difficult) issue of continuity since no transversality-at-incidences assumptions are imposed. The main tool of the proof is a theorem of Wongkew \cite{wongkew2003volumes} which states that a low degree polynomial cannot have its zero set being too dense inside the unit cube, coupled with Dvir-type polynomial arguments \cite{dvir2009size}. From the viewpoint of the proofs, we also state a conjecture that is stronger than and almost equivalent to the (lower) Minkowski version of the Kakeya conjecture and prove some results towards it. We also present our own version of the proof of the theorem in \cite{wongkew2003volumes}. Our proof shows that this theorem follows from a combination of properties of zero sets of polynomials and a general proposition about hypersurfaces which might be of independent interest. Finally, we discuss how to generalize Bourgain's conjecture to high dimensions, which is closely related to the theme here.

Motivation & Objective

• To establish the discrete analogue of the Kakeya conjecture in $\mathbb{R}^n$, showing that low-dimensional Kakeya sets cannot be constructed from discrete configurations.
• To fully solve the discrete analogue of the Furstenberg set problem in all dimensions, generalizing previous partial results.
• To clarify the gap between discrete models and the true Kakeya problem by isolating the role of continuity and transversality.
• To strengthen the connection between polynomial method techniques and geometric incidence problems, particularly through zero set density theorems.
• To present a new proof of Wongkew's theorem on polynomial zero sets, highlighting its implications for hypersurfaces and incidence geometry.

Proposed method

• Utilizes Wongkew's theorem, which bounds the density of zero sets of low-degree polynomials in the unit cube, to control incidence structures in discrete models.
• Applies Dvir-type polynomial arguments to analyze configurations of lines and points in discrete settings, leveraging the fact that low-degree polynomials cannot vanish on too many points.
• Employs lattice point counting techniques in subspaces of varying dimension, using results from Birch and Heath-Brown on quadratic forms and their solutions.
• Applies the circle method to estimate the number of solutions to quadratic equations over integers, with careful control of major and minor arcs.
• Uses affine transformations to reduce problems on sublattices to standard integer lattices, preserving geometric and arithmetic structure.
• Combines singular integral estimates with scaling arguments to show convergence of main terms in exponential sums, linking to known results in analytic number theory.

Experimental results

Research questions

• RQ1 Can a (hypothetically) low-dimensional Kakeya set in $\mathbb{R}^n$ be constructed from discrete configurations of lines and points?
• RQ2 What is the maximal size of a discrete Furstenberg set in $\mathbb{R}^n$ under general incidence conditions?
• RQ3 How do the discrete models of the Kakeya and Furstenberg problems differ from their continuous counterparts in terms of geometric constraints?
• RQ4 To what extent can the polynomial method, as used in finite fields, be extended to continuous settings without transversality assumptions?
• RQ5 What is the precise role of continuity and transversality in preventing low-dimensional Kakeya sets, and how is this reflected in discrete models?

Key findings

• The discrete analogue of the Kakeya conjecture holds in $\mathbb{R}^n$: no discrete configuration can yield a set of dimension less than $n$.
• The discrete Furstenberg set problem is completely solved in all dimensions, with bounds matching the expected full dimensionality.
• The number of lines in a discrete configuration lying in any $r$-dimensional affine subspace is bounded by $\lesssim N^{r-1}$, independent of the subspace, when $r \geq 2$.
• For $r=3$, the number of solutions is bounded by $\lesssim N^{1+4\alpha+\varepsilon}$ with $\alpha = \frac{3}{2n-6}$, which is $\lesssim N^3$ for large $n$, confirming the bound.
• The proof of Wongkew's theorem is rederived using properties of polynomial zero sets and a general proposition on hypersurfaces, which may be of independent interest in incidence geometry.
• The paper establishes that the Minkowski version of the Kakeya conjecture is implied by a stronger conjecture on polynomial zero sets, suggesting a new pathway to the full conjecture.