Plany Kakeya Sets in Finite Fields

• Plany Kakeya sets are Kakeya configurations with an added planar incidence constraint, where each point lies in an affine 2-plane containing all Kakeya lines through it.
• In the finite-field model, this local restriction enables the planebrush method to achieve a sharp lower bound of |K| ≥ Cq^(10/3) in F_q^4.
• The approach combines Córdoba’s lemma, Wolff’s hairbrush bound, and a novel planebrush estimate to aggregate local planar incidences into a global quantitative bound.

A plany Kakeya set is a Kakeya configuration endowed with a local planar incidence constraint. In the finite-field model, a set $K\subset \mathbb F_q^n$ is Kakeya if it contains one full $q$-point line in every direction, and it is called plany when, for every point $x\in K$, there exists an affine $2$-plane $\Pi_x$ containing $x$ such that every Kakeya line through $x$ lies entirely in $\Pi_x$. This hypothesis is much stronger than the ordinary Kakeya condition, and in $\mathbb F_q^4$ it yields the lower bound $|K|\ge C q^{10/3}$ by the planebrush method (Łaba et al., 13 Jul 2025). The subject belongs to the broader Kakeya program, whose planar Euclidean side includes boundary-optimal sets with $q$0 (Babichenko et al., 2012).

1. Classical Kakeya sets and the finite-field model

In the Euclidean plane, a Kakeya set is a planar set containing a unit-length line segment in every direction. A central refinement asks how small the area of the $q$1-neighborhood

$q$2

can be as $q$3. The lower bound $q$4 and constructions with $q$5 single out the boundary-optimal regime $q$6 (Babichenko et al., 2012).

The finite-field analogue replaces segments by affine lines. A line in $q$7 is an affine translate of a $q$8-dimensional subspace,

$q$9

where $x\in K$0 and $x\in K$1. Directions are the $x\in K$2-dimensional subspaces, i.e. the projective space $x\in K$3. A finite-field Kakeya set $x\in K$4 contains at least one line in every direction (Łaba et al., 13 Jul 2025).

Within this framework, the adjective “plany” isolates a structured subcase in which the local bush of lines through each point is confined to a single affine $x\in K$5-plane. The resulting incidence geometry is the central input behind the four-dimensional planebrush bound.

2. The plany hypothesis in $x\in K$6

Let $x\in K$7 be the family of Kakeya lines whose union is $x\in K$8. The family $x\in K$9, and hence $2$0, is called plany if for every point $2$1 there exists a $2$2-plane $2$3 containing $2$4 such that every line of $2$5 passing through $2$6 lies entirely in $2$7 (Łaba et al., 13 Jul 2025).

This condition can be read as a pointwise restriction on incidence patterns. In a general Kakeya set, multiple lines through a point may spread across many transverse directions. In a plany set, the full bush through $2$8 is trapped inside one affine plane. The paper presenting the finite-field planebrush method emphasizes that this is much stronger than the unstructured Kakeya condition and is precisely what allows a gain beyond the three-dimensional hairbrush exponent (Łaba et al., 13 Jul 2025).

In $2$9, a Kakeya set carries one line in each of the $\Pi_x$0 directions. The main theorem states that if such a set is plany, then there is an absolute constant $\Pi_x$1, independent of $\Pi_x$2, such that

$\Pi_x$3

Equivalently, one sometimes writes $\Pi_x$4, since $\Pi_x$5 is of order $\Pi_x$6 (Łaba et al., 13 Jul 2025).

The theorem is quantitative rather than merely structural: it does not classify plany Kakeya sets, but it forces any such set in four dimensions to occupy substantially more than $\Pi_x$7 points.

3. The combinatorial estimates behind the $\Pi_x$8 exponent

The planebrush argument rests on two standard combinatorial inputs and one new four-dimensional estimate. The first input is Córdoba’s union-of-lines estimate: if $\Pi_x$9 are finite sets with $x$0 for $x$1, then

$x$2

In particular, if $x$3 and every $x$4 has size at least $x$5, then

$x$6

This estimate is the finite-field “union-of-lines” lemma (Łaba et al., 13 Jul 2025).

The second input is Wolff’s hairbrush bound in $x$7. If $x$8 is a collection of distinct lines in $x$9, with no more than $x$0 of them in any single $x$1-plane and with $x$2, then

$x$3

Its geometric mechanism is the classical hairbrush picture: select a stem line meeting many others, decompose by the $x$4-planes through that stem, and apply Córdoba’s estimate in each slice (Łaba et al., 13 Jul 2025).

The new ingredient is the planebrush lemma in $x$5. If $x$6 is a plany family of lines in $x$7 such that at most $x$8 lie in any common $x$9-plane, at most $\Pi_x$0 lie in any common $\Pi_x$1-plane, and $\Pi_x$2, then

$\Pi_x$3

For the full Kakeya line set of a plany Kakeya set, these axioms are automatic. Combining them with the number of directions gives the lower bound of order $\Pi_x$4 (Łaba et al., 13 Jul 2025).

The shift from the hairbrush gain $\Pi_x$5 in $\Pi_x$6 to the planebrush gain $\Pi_x$7 in $\Pi_x$8 is not a deterioration but a dimensional tradeoff: the ambient family contains on the order of $\Pi_x$9 directions, so $\mathbb F_q^4$0 is exactly the scale needed to reach the exponent $\mathbb F_q^4$1.

4. Proof architecture of the planebrush method

The proof begins with multiplicity trimming. Let

$\mathbb F_q^4$2

The average multiplicity is $\mathbb F_q^4$3. One discards points with multiplicity much smaller than this average, losing at most $\mathbb F_q^4$4 of each line’s points, and calls the remaining set $\mathbb F_q^4$5 (Łaba et al., 13 Jul 2025).

A base point $\mathbb F_q^4$6 is then selected by pigeonholing so that at least half the lines through $\mathbb F_q^4$7 still carry at least $\mathbb F_q^4$8 points of $\mathbb F_q^4$9. By planiness, all lines through $|K|\ge C q^{10/3}$0 lie in a single $|K|\ge C q^{10/3}$1-plane $|K|\ge C q^{10/3}$2. One next defines the planebrush $|K|\ge C q^{10/3}$3 as the subfamily of all lines of $|K|\ge C q^{10/3}$4 that meet or are parallel to $|K|\ge C q^{10/3}$5. A second pigeonhole argument yields

$|K|\ge C q^{10/3}$6

This is the key enlargement step: the local planar bush through $|K|\ge C q^{10/3}$7 controls a large global subfamily (Łaba et al., 13 Jul 2025).

The argument then splits into two cases.

In the first case, at least $|K|\ge C q^{10/3}$8 of the incidence pairs $|K|\ge C q^{10/3}$9 with $q$00 are unique inside $q$01. A direct count gives

$q$02

hence

$q$03

This is already the required bound (Łaba et al., 13 Jul 2025).

In the second case, at least $q$04 of the incidences come from points $q$05 lying on at least two lines of $q$06. The geometry of the planebrush implies that no line outside $q$07 can pass through such a point, so $q$08 is disjoint from the union of $q$09. One then keeps only those lines of $q$10 meeting $q$11 in at least $q$12 points, obtaining a large subfamily $q$13. Foliate $q$14 by $q$15-spaces containing $q$16, apply the three-dimensional hairbrush bound in each $q$17-space to the lines of $q$18 inside it, and use Córdoba’s lemma for the lines lying wholly in $q$19. This yields

$q$20

The remaining lines outside $q$21 are then handled by induction on $q$22 (Łaba et al., 13 Jul 2025).

The proof is therefore neither a purely local incidence argument nor a direct global counting lemma. Its central mechanism is the extraction of a large subfamily organized around one distinguished affine $q$23-plane.

5. Geometric intuition and the Euclidean comparison

In the unstructured finite-field Kakeya problem, the only universal information is that no two Kakeya lines share a direction. The summary exposition emphasizes that this yields the trivial bound $q$24 by Córdoba and, in dimensions $q$25, the hairbrush-scale bound $q$26 (Łaba et al., 13 Jul 2025).

The plany hypothesis adds a local flatness principle. At every point $q$27, the local fan of lines lies in a plane $q$28. Geometrically, this means that nearby incidences can be organized around common flats, so the proof can aggregate line families not merely around a stem line, as in a hairbrush, but around a distinguished $q$29-plane, hence the term “planebrush” (Łaba et al., 13 Jul 2025).

This same plany regime appears in the Euclidean four-dimensional theory. Katz and Zahl used a planebrush argument to prove that Kakeya sets in $q$30 have Hausdorff dimension at least $q$31, and in the special plany case their argument gives the stronger lower bound $q$32. The finite-field treatment is presented as a nontechnical model of that mechanism: it omits the real-analysis technicalities involving tubes, $q$33-removal, and multilinear restriction, but recovers exactly the exponent $q$34 (Łaba et al., 13 Jul 2025).

A plausible implication is that the finite-field planebrush result should be read less as an isolated counting theorem than as a structural model for how planar concentration of incidences can force additional volume in four-dimensional Kakeya problems.

6. Relation to other Kakeya variants

A common source of confusion is that several distinct notions carry the name “Kakeya,” but they address different geometric and analytic questions.

The planar “Kakeya property” studied by Csörnyei, Héra, and Laczkovich concerns rigid motions rather than incidence in all directions: a set $q$35 has property $q$36 if it can be continuously moved to a different position within a set of arbitrarily small area. For closed sets with this property, the union of the nontrivial connected components can be covered by a null union of parallel lines or a null union of concentric circles; in particular, a closed connected set with property $q$37 lies on a single line or a single circle (Csörnyei et al., 2018). This is a classification theorem for sweepable planar sets, not a plany incidence theorem.

Curved Kakeya sets replace lines by curved families. Yang and Zhong construct a compact set in $q$38 of measure $q$39 containing a piece of a parabola of every aperture between $q$40 and $q$41, and generalize the construction to suitable $q$42 families satisfying a cinematic-curvature condition (Yang et al., 2024). The geometry is governed by “cut-and-slide” tangency compression rather than pointwise planiness.

Directional Kakeya-type sets can also be formulated via lacunarity. Kroc and Pramanik define finite-order lacunarity for direction sets in $q$43 and show, in the planar case, that a direction set is sublacunary if and only if it admits Kakeya-type sets, equivalently if and only if the associated directional maximal operators are unbounded on every $q$44, $q$45 (Kroc et al., 2014). This is a characterization of direction sets, not a four-dimensional planebrush phenomenon.

Finite affine-plane Kakeya sets form yet another branch. In an affine plane of order $q$46, a Kakeya set is the union of $q$47 pairwise non-parallel lines. De Boeck and Van de Voorde show that Kakeya sets of size asymptotically at least

$q$48

contain a large knot, meaning a point lying on many of the defining lines (Boeck et al., 2020). Here the dominant issue is the upper end of the size spectrum and knot multiplicity, again distinct from the plany hypothesis in $q$49.

Taken together, these variants show that “Kakeya” is not a single problem but a family of tightly connected geometric regimes. Plany Kakeya sets occupy the regime where local planar concentration of line directions becomes strong enough to force the four-dimensional lower bound $q$50, making the planebrush method the natural analogue of the hairbrush argument for structured incidence configurations (Łaba et al., 13 Jul 2025).