Kakeya Set
A set is called a Kakeya set if it contains a line in every direction. In other words, for every vector , there is a vector so that the line is contained in .
The Finite Field Kakeya problem
A Kakeya set has at least elements, for .
Proof Suppose that is a Kakeya set with . By the parameter counting argument, there is a non-zero polynomial that vanishes on with . We write as a sum of two pieces — the terms of highest degree plus the terms of lower degree. If is the degree of , then we have , where is homogeneous of degree and , and where is non-zero. Let be any non-zero vector in . Choose so that the line is contained in . Consider the polynomial in one variable . The polynomial vanishes for each . It has degree . By the vanishing lemma, is the zero polynomial. In other words, every coefficient of is zero. But the coefficient of in is exactly . So we see that vanishes for all ! Since is homogeneous of degree , also vanishes at , and so vanishes at every point of . Since , Lemma 2.10 implies that is the zero polynomial. This gives a contradiction.
Remark
Every line in can be extended to a projective line in by adding one point at infinity. If , then the line in extends to include the point at infinity in the equivalence class . Similarly, if , then the zero set of , , can be naturally extended to as follows: if , then the point at infinity lies in if and only if . In the proof of finite field Kakeya, we showed that if a line lies in the zero set of a polynomial of degree , then the point of at infinity also lies in . We can think of this as a version of the vanishing lemma in projective space.
Finite field Kakeya without polynomials
Proposition
Suppose . If are lines in , then their union has cardinality at least . In particular, if is a Kakeya set, then
Bush method
If are lines in , then the number of points in their union is at least . If is a Kakeya set, then
Hairbrush method
Suppose that are lines in , and suppose that at most of the lines lie in any plane. Then their union has cardinality at least . If is a Kakeya set, then
Remark
Compared to bush method, we get better bound by hairbrush method as we take the restriction of having at most lines in any plane into consideration. Instead of considering lines through a point(which the bound comes from geometric property independent of property of Kskeya set), we consider planes through a line.