MathLabs

Worked solution: The polynomial method resolves the cap set problem (Croot-Lev-Pach, Ellenberg-Gijswijt, 2016)

Step 2 of 7: Sets as polynomials: the polynomial method's dictionary
In plain words

Over the field F3\mathbb{F}_3, every element satisfies t3=tt^3 = t (a tiny instance of Fermat's little theorem), so any function on F3n\mathbb{F}_3^n can be written uniquely as a polynomial where each variable's exponent is capped at 22. This turns a purely combinatorial question about a subset AA into an algebraic one about polynomials of a certain degree, opening the door to linear-algebra tools like rank and dimension.

md=dim⁡Sn≤dm_d = \dim S_n^{\le d}
Detailed analysis

Ellenberg and Gijswijt (2017, opening lemma, generalising Croot-Lev-Pach) let MnM_n be the set of monomials in x1,…,xnx_1,\ldots,x_n of degree at most q−1q-1 in each variable, and SnS_n the vector space they span; the evaluation map Sn→FqFqnS_n \to \mathbb{F}_q^{\mathbb{F}_q^n} sending a polynomial to its table of values is a linear isomorphism, since both sides have dimension qnq^n. Restricting to total degree at most dd gives the subspace Sn≤dS_n^{\le d} of dimension md=dim⁡Sn≤dm_d = \dim S_n^{\le d}, the key quantity that will measure how many polynomials of bounded complexity are available.

Terms in this step
Monomial space Sn≤dS_n^{\le d}
The vector space spanned by all monomials x1e1⋯xnenx_1^{e_1}\cdots x_n^{e_n} with each ei≤q−1e_i \le q-1 and total degree ∑ei≤d\sum e_i \le d, of dimension md=dim⁡Sn≤dm_d = \dim S_n^{\le d}.