Chevalley–Warning theorem

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 Ewald Warning (1935) and a slightly weaker form of the theorem, known as Chevalley's theorem, was proved by Chevalley (1935). Chevalley's theorem implied Artin's and Dickson's conjecture that finite fields are quasi-algebraically closed fields (Artin 1982, page x).

Statement of the theorems

Let be a finite field and be a set of polynomials such that the number of variables satisfies

where is the total degree of . The theorems are statements about the solutions of the following system of polynomial equations

  • The Chevalley–Warning theorem states that the number of common solutions is divisible by the characteristic of . Or in other words, the cardinality of the vanishing set of is modulo .
  • The Chevalley theorem states that if the system has the trivial solution , that is, if the polynomials have no constant terms, then the system also has a non-trivial solution .

Chevalley's theorem is an immediate consequence of the Chevalley–Warning theorem since is at least 2.

Both theorems are best possible in the sense that, given any , the list has total degree and only the trivial solution. Alternatively, using just one polynomial, we can take f1 to be the degree n polynomial given by the norm of x1a1 + ... + xnan where the elements a form a basis of the finite field of order pn.

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 solutions where is the size of the finite field and . Chevalley's theorem also follows directly from this.

Proof of Warning's theorem

Remark: If then

so the sum over of any polynomial in of degree less than also vanishes.

The total number of common solutions modulo of is equal to

because each term is 1 for a solution and 0 otherwise. If the sum of the degrees of the polynomials 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 of the cardinality of dividing the number of solutions; here, if is the largest of the , then the exponent can be taken as the ceiling function of

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 divides each of these algebraic integers.

See also

References

  • Artin, Emil (1982), Lang, Serge.; Tate, John (eds.), Collected papers, Berlin, New York: Springer-Verlag, ISBN 978-0-387-90686-7, MR 0671416
  • Ax, James (1964), "Zeros of polynomials over finite fields", American Journal of Mathematics, 86: 255–261, doi:10.2307/2373163, MR 0160775
  • Chevalley, Claude (1935), "Démonstration d'une hypothèse de M. Artin", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (in French), 11: 73–75, doi:10.1007/BF02940714, JFM 61.1043.01, Zbl 0011.14504
  • Katz, Nicholas M. (1971), "On a theorem of Ax", Amer. J. Math., 93 (2): 485–499, doi:10.2307/2373389
  • Warning, Ewald (1935), "Bemerkung zur vorstehenden Arbeit von Herrn Chevalley", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (in German), 11: 76–83, doi:10.1007/BF02940715, JFM 61.1043.02, Zbl 0011.14601
  • Serre, Jean-Pierre (1973), A course in arithmetic, pp. 5–6, ISBN 0-387-90040-3
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.