[Paper Review] Areas of triangles and Beck's theorem in planes over finite fields

Alex Iosevich, Misha Rudnev+1 more|arXiv (Cornell University)|May 1, 2012

Limits and Structures in Graph Theory20 references4 citations

TL;DR

This paper establishes finite field analogues of classical geometric combinatorics results, proving that subsets of $\mathbb{F}_q^2$ with size $|E| > q$ determine at least $\frac{q-1}{2}$ distinct triangle areas, with triangles sharing a common base. For larger sets ($|E| \geq 64q\log_2 q$), it shows there exists a point $z$ such that more than $\frac{q}{2}$ distinct areas arise from triangles pinned at $z$, using a combination of combinatorial incidence geometry and Fourier analytic techniques.

ABSTRACT

It is shown that any subset $E$ of a plane over a finite field $\F_q$, of cardinality $|E|>q$ determines not less than $\frac{q-1}{2}$ distinct areas of triangles, moreover once can find such triangles sharing a common base. It is also shown that if $|E|\geq 64q\log_2 q$, then there are more than $\frac{q}{2}$ distinct areas of triangles sharing a common vertex. The result follows from a finite field version of the Beck theorem for large subsets of $\F_q^2$ that we prove. If $|E|\geq 64q\log_2 q$, there exists a point $z\in E$, such that there are at least $\frac{q}{4}$ straight lines incident to $z$, each supporting the number of points of $E$ other than $z$ in the interval between $\frac{|E|}{2q}$ and $\frac{2|E|}{q}.$ This is proved by combining combinatorial and Fourier analytic techniques. We also discuss higher-dimensional implications of these results in light of recent developments.

Motivation & Objective

• To establish finite field analogues of classical triangle area theorems from Euclidean geometry.
• To prove that large subsets of $\mathbb{F}_q^2$ determine a linear number of distinct triangle areas.
• To extend these results to higher-dimensional volumes using induction and hyperplane slicing.
• To develop a finite field version of Beck's theorem for incidence geometry in $\mathbb{F}_q^2$.
• To combine combinatorial incidence bounds with Fourier analytic methods to derive quantitative estimates on area distributions.

Proposed method

• Prove a finite field version of Beck's theorem: if $|E| \geq 64q\log_2 q$, then some point $z \in E$ lies on at least $\frac{q}{4}$ lines, each supporting $\sim \frac{|E|}{q}$ points.
• Use incidence geometry and the pigeonhole principle to identify a large set of lines through a common point with controlled point distribution.
• Apply Fourier analytic techniques to estimate the number of non-zero determinants formed by vectors from $E$ relative to a fixed origin $z$, using $L^2$-restriction estimates.
• Refine the set $E$ to a subset $E'$ containing $z$ with exactly $2q^{-1}|E|$ points on $\frac{q}{4}$ lines through $z$, ensuring uniformity for Fourier analysis.
• Use the Cauchy-Schwarz inequality to lower-bound the number of distinct pinned triangle areas via the $L^2$-norm of the representation function.
• Apply induction on dimension, slicing $E \subset \mathbb{F}_q^d$ by hyperplanes $x_d = c$, and relate $d$-volume sets to $(d-1)$-volume sets in lower-dimensional subspaces.

Experimental results

Research questions

• RQ1 What is the minimal number of distinct triangle areas determined by a subset $E \subset \mathbb{F}_q^2$ with $|E| > q$?
• RQ2 Can one guarantee that these distinct areas arise from triangles sharing a common base?
• RQ3 For sufficiently large $E \subset \mathbb{F}_q^2$, does there exist a point $z$ such that more than $\frac{q}{2}$ distinct areas arise from triangles with vertex $z$?
• RQ4 How can combinatorial incidence geometry and Fourier analysis be combined to bound the number of distinct volumes in finite fields?
• RQ5 What is the higher-dimensional generalization of the triangle area result in $\mathbb{F}_q^d$?

Key findings

• If $|E| > q$, then $|V_2(E)| \geq \frac{q-1}{2}$, meaning at least $\frac{q-1}{2}$ distinct triangle areas are determined.
• These $\frac{q-1}{2}$ distinct areas can be realized by triangles sharing a common base.
• If $|E| \geq 64q\log_2 q$, then there exists a point $z \in E$ such that $|V_2^z(E)| > \frac{q}{2}$, i.e., more than half of the non-zero areas arise from triangles pinned at $z$.
• The proof relies on a finite field version of Beck's theorem, showing that a large set $E$ contains a point $z$ incident to at least $\frac{q}{4}$ lines, each supporting $\sim \frac{|E|}{q}$ points.
• The Fourier analytic method bounds the $L^2$-norm of the representation function of differences, showing that the second term in the estimate is dominated by the first, leading to a strong lower bound on distinct areas.
• The result generalizes to higher dimensions: for $|E| \geq 2q^{d-1}$, the number of non-zero $d$-volumes satisfies $|V_d(E)| \geq |V_{d-1}(E \cap H_0)|$, with induction preserving the lower bound.