Worked solution: The polynomial method resolves the cap set problem (Croot-Lev-Pach, Ellenberg-Gijswijt, 2016)
Over the field , every element satisfies (a tiny instance of Fermat's little theorem), so any function on can be written uniquely as a polynomial where each variable's exponent is capped at . This turns a purely combinatorial question about a subset into an algebraic one about polynomials of a certain degree, opening the door to linear-algebra tools like rank and dimension.
Ellenberg and Gijswijt (2017, opening lemma, generalising Croot-Lev-Pach) let be the set of monomials in of degree at most in each variable, and the vector space they span; the evaluation map sending a polynomial to its table of values is a linear isomorphism, since both sides have dimension . Restricting to total degree at most gives the subspace of dimension , the key quantity that will measure how many polynomials of bounded complexity are available.
- Monomial space
- The vector space spanned by all monomials with each and total degree , of dimension .