Dependent type

From formulasearchengine
Revision as of 14:10, 2 January 2014 by 87.6.95.89 (talk)
Jump to navigation Jump to search

Template:More footnotes In number theory, Hilbert's irreducibility theorem, conceived by David Hilbert, states that every finite number of irreducible polynomials in a finite number of variables and having rational number coefficients admit a common specialization of a proper subset of the variables to rational numbers such that all the polynomials remain irreducible. This theorem is a prominent theorem in number theory.

Formulation of the theorem

Hilbert's irreducibility theorem. Let

f1(X1,,Xr,Y1,,Ys),,fn(X1,,Xr,Y1,,Ys)

be irreducible polynomials in the ring

[X1,,Xr,Y1,,Ys].

Then there exists an r-tuple of rational numbers (a1,...,ar) such that

f1(a1,,ar,Y1,,Ys),,fn(a1,,ar,Y1,,Ys)

are irreducible in the ring

[Y1,,Ys].

Remarks.

  • It follows from the theorem that there are infinitely many r-tuples. In fact the set of all irreducible specialization, called Hilbert set, is large in many senses. For example, this set is Zariski dense in r
  • There are always (infinitely many) integer specializations, i.e., the assertion of the theorem holds even if we demand (a1,...,ar) to be integers.
  • The irreducible specialization property stated in the theorem is the most general. There are many reductions, e.g., it suffices to take n=r=s=1 in the definition. A recent result of Bary-Soroker shows that for a field K to be Hilbertian it suffices to consider the case of n=r=s=1 and f=f1 absolutely irreducible, that is, irreducible in the ring Kalg[X,Y], where Kalg is the algebraic closure of K.

Applications

Hilbert's irreducibility theorem has numerous applications in number theory and algebra. For example:

  • The inverse Galois problem, Hilbert's original motivation. The theorem almost immediately implies that if a finite group G can be realized as the Galois group of a Galois extension N of
E=(X1,,Xr),
then it can be specialized to a Galois extension N0 of the rational numbers with G as its Galois group.[2] (To see this, choose a monic irreducible polynomial f(X1,…,Xn,Y) whose root generates N over E. If f(a1,…,an,Y) is irreducible for some ai, then a root of it will generate the asserted N0.)
  • Construction of elliptic curves with large rank.[2]
  • If a polynomial g(x)[x] is a perfect square for all large integer values of x, then g(x) is the square of a polynomial in [x]. This follows from Hilbert's irreducibility theorem with n=r=s=1 and
f1(X,Y)=Y2g(X).

(More elementary proofs exist.) The same result is true when "square" is replaced by "cube", "fourth power", etc.

Generalizations

It has been reformulated and generalized extensively, by using the language of algebraic geometry. See thin set (Serre).

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • J. P. Serre, Lectures on The Mordell-Weil Theorem, Vieweg, 1989.
  • M. D. Fried and M. Jarden, Field Arithmetic, Springer-Verlag, Berlin, 2005.
  • H. Völklein, Groups as Galois Groups, Cambridge University Press, 1996.
  • G. Malle and B. H. Matzat, Inverse Galois Theory, Springer, 1999.
  1. Lang (1997) p.41
  2. 2.0 2.1 Lang (1997) p.42