Hilbert's irreducibility theorem

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

f_1(X_1,\ldots, X_r, Y_1,\ldots, Y_s), \ldots, f_n(X_1,\ldots, X_r, Y_1,\ldots, Y_s) \,

be irreducible polynomials in the ring

 \mathbb{Q}[X_1,\ldots, X_r, Y_1,\ldots, Y_s]. \,

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

f_1(a_1,\ldots, a_r, Y_1,\ldots, Y_s), \ldots, f_n(a_1,\ldots, a_r, Y_1,\ldots, Y_s) \,

are irreducible in the ring

 \mathbb{Q}[Y_1,\ldots, Y_s]. \,

Remarks.

Applications

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

E=\mathbb{Q}(X_1,\ldots, X_r),
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.)
f_1(X, Y)\, = Y^2 - g(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

  1. Lang (1997) p.41
  2. 1 2 Lang (1997) p.42
This article is issued from Wikipedia - version of the Thursday, March 17, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.