Chevalley–Warning theorem explained

In number theory, the Chevalley–Warning theorem implies that certain polynomial equations in sufficiently many variables over a finite field have solutions. It was proved by and a slightly weaker form of the theorem, known as Chevalley's theorem, was proved by . Chevalley's theorem implied Artin's and Dickson's conjecture that finite fields are quasi-algebraically closed fields .

Statement of the theorems

Let

F be a finite field and \{f _{j\}} ^{r\subseteq F [X} ^{1 ,\ldots,X} _{n]} be a set of polynomials such that the number of variables satisfiesn>\sum ^{r} _{j =1} d _{j}

where

d _{j} is the total degree of f _{j} . The theorems are statements about the solutions of the following system of polynomial equationsf _{j(x} _{1,...,x} _{n)=0 for} j =1 ,\ldots, r.

• The Chevalley–Warning theorem states that the number of common solutions

(a _{1,...,a} _{n)} \in F ^{n} is divisible by the characteristic p of F . Or in other words, the cardinality of the vanishing set of \{f _{j\}} ^{r} ^{j =1} is 0 modulo p .

• The Chevalley theorem states that if the system has the trivial solution

( 0 , ... , 0 ) \in F ^{n} , that is, if the polynomials have no constant terms, then the system also has a non-trivial solution (a _{1,...,a} _{n)} \in F ^{n} \backslash \{( 0 , ... , 0 )\} .

Chevalley's theorem is an immediate consequence of the Chevalley–Warning theorem since

p is at least 2.

Both theorems are best possible in the sense that, given any

n , the list f _{j} = x _{j,} j =1 , ... ,n has total degree n and only the trivial solution. Alternatively, using just one polynomial, we can take f₁ to be the degree n polynomial given by the norm of x₁a₁ + ... + x_na_n where the elements a form a basis of the finite field of order pⁿ.

Warning proved another theorem, known as Warning's second theorem, which states that if the system of polynomial equations has the trivial solution, then it has at least

q ^{n-d} solutions where q is the size of the finite field and d : = d _{1} + ... + d _{r} . Chevalley's theorem also follows directly from this.

Proof of Warning's theorem

Remark:^[1] If

i<q -1 then \sum _{x\inF} x ^{i=0} so the sum over F ^{n} of any polynomial in x _{1,\ldots,x} _{n} of degree less than n(q -1 ) also vanishes.

The total number of common solutions modulo

p of f _{1,} \ldots, f _{r} = 0 is equal to\sum _{x\in F ^{n}} ( 1- f ^{q -1} _{1} (x)) ⋅ \ldots ⋅ ( 1- f ^{q -1} _{r} (x)) because each term is 1 for a solution and 0 otherwise.If the sum of the degrees of the polynomials f _{i} is less than n then this vanishes by the remark above.

Artin's conjecture

It is a consequence of Chevalley's theorem that finite fields are quasi-algebraically closed. This had been conjectured by Emil Artin in 1935. The motivation behind Artin's conjecture was his observation that quasi-algebraically closed fields have trivial Brauer group, together with the fact that finite fields have trivial Brauer group by Wedderburn's theorem.

The Ax–Katz theorem

The Ax–Katz theorem, named after James Ax and Nicholas Katz, determines more accurately a power

q ^{b} of the cardinality q of F dividing the number of solutions; here, if d is the largest of the d _{j} , then the exponent b can be taken as the ceiling function of(n - \sum _{j} d _{j})/(d) .

The Ax–Katz result has an interpretation in étale cohomology as a divisibility result for the (reciprocals of) the zeroes and poles of the local zeta-function. Namely, the same power of

q divides each of these algebraic integers.

See also

• Combinatorial Nullstellensatz

External links

• Web site: Proofs of the Chevalley-Warning theorem.

Notes and References

1. Web site: Number of Solutions to Polynomials in Finite Fields . StackExchange.