Joints formed by lines and a k-plane, and a discrete estimate of Kakeya type
- School of Mathematics, University of Edinburgh
- More about Anthony Carbery
- School of Mathematics, Statistics and Actuarial Science, University of Kent
- ORCID iD: 0000-0001-5537-9693
- More about Marina Iliopoulou
In 2008, Zeev Dvir solved the finite-field Kakeya conjecture using the polynomial method. His remarkably short argument led to a burst of activity, which in turn led to the solution of a number of other problems using the polynomial method, a notable example of which was the solution by Larry Guth and Nets Katz of the Erdős distinct-distances problem in 2010. Another result of Guth and Katz, proved in 2008, was the solution to a problem known as the joints conjecture. If F is a field and L is a set of lines in F3, then a joint in F3 is a point contained in set of three lines from L that have linearly independent directions. Given a set of n lines, one can ask how many joints there can be. If one takes all the axis-aligned lines through a (n/3)1/2×(n/3)1/2×(n/3)1/2 grid, one obtains a bound of cn3/2, and the conjecture proved by Guth and Katz was that O(n3/2) was an upper bound when F=R.
This paper considers the following higher-dimensional generalization of the joints problem. Let k1+⋯+kd=n, where all the numbers concerned are positive integers, let P1,…,Pd be families of affine subspaces of Fn, with each Pi∈Pi of dimension ki, and define a multijoint to be a point x∈Fn such that there is a sequence of affine subspaces P1,…,Pd satisfying the following three conditions.
For each i, Pi∈Pi.
By considering grids as in the case of joints in F3, one arrives naturally at the conjecture that the number of multijoints is at most
Note that if d=3, k1=k2=k3=1, and P1=P2=P3, then we recover the joints conjecture.
One of the main results of this paper is the first proof of a case of the multijoints conjecture where not all the ki are equal to 1: it proves the result when all but one of the ki are equal to 1. This result was proved independently by Yu and Zhao, and a few months later, while this paper was being prepared for publication, the whole conjecture was proved by Tidor, Yu and Zhao.
The second main result of the paper concerns lines in R3. Given a set L of lines, let J be the set of joints determined by L, and for each point x∈R3 let L(x) be the number of lines in L that contain x. The authors prove the inequality
which is related to the Kakeya maximal problem. They provide a simple example to show that the inequality fails for lines in F3p: thus, this is a specifically Euclidean result, and they use (as they must) specifically Euclidean methods to prove it. Since L(x)≥3 for every joint x, this result trivially implies the Guth-Katz bound, but since a point may be contained in many lines from L, it is a considerable strengthening. They also provide a structural description of the set of joints that lie in at most O(|L|1/2) lines from L. The reason that the threshold |L|1/2 is a natural one is connected to a threshold that appears in the Szemerédi-Trotter theorem. A consequence of that theorem is that the number of points x for which k≤L(x)≤2k is O(|L|2/k3) when k≤|L|1/2 and O(|L|/k) when k≥|L|1/2).