Math 2.0

Field theory and polynomials Irreducibility Theorem

Hilbert's irreducibility theorem

Builds on Irreducible polynomialPolynomials in several variables

Statement

Let r,s≥1r, s \ge 1 and let f1,…,fkf_1, \dots, f_k be irreducible elements of the polynomial ring ℚ[t1,…,tr,x1,…,xs]\Q[t_1, \dots, t_r, x_1, \dots, x_s], each of positive degree in the variables x1,…,xsx_1, \dots, x_s. Then there is a=(a1,…,ar)∈ℚra = (a_1, \dots, a_r) \in \Q^r such that each fi(a,x1,…,xs)f_i(a, x_1, \dots, x_s) is irreducible in ℚ[x1,…,xs]\Q[x_1, \dots, x_s].

Remarks

The set of good aa is large: one may take a∈ℤra \in \Z^r, and there are infinitely many such aa. Classical proofs expand the roots of ff as series in tt near infinity and show that rational specialisations giving a factor are rare. Example: x2−tx^2 - t is irreducible in ℚ[t,x]\Q[t, x]; the value t=2t = 2 gives the irreducible x2−2x^2 - 2, while t=4t = 4 gives (x−2)(x+2)(x - 2)(x + 2). So irreducibility can fail at some values, and the theorem only says that it survives at many. A stronger form preserves the Galois group: if an irreducible f∈ℚ(t)[x]f \in \Q(t)[x] has Galois group GG over ℚ(t)\Q(t), then f(a,x)f(a, x) has Galois group GG over ℚ\Q for infinitely many a∈ℚa \in \Q. The analogue fails over ℝ\R: x2−t2−1x^2 - t^2 - 1 is irreducible in ℝ[t,x]\R[t, x], but for every a∈ℝa \in \R the polynomial x2−a2−1x^2 - a^2 - 1 has the real roots ±a2+1\pm \sqrt{a^2 + 1}.

Going deeper

For a student

Fields with this property are called Hilbertian fields; number fields are Hilbertian, while finite fields and algebraically closed fields are not. The theorem is the main tool to pass from Galois groups over ℚ(t)\Q(t) to Galois groups over ℚ\Q. For example, the generic polynomial with Galois group the full symmetric group SnS_n over ℚ(t1,…,tn)\Q(t_1, \dots, t_n) specialises to polynomials over ℚ\Q with Galois group SnS_n. This is the starting point of many attacks on the inverse Galois problem.

Reading path

To understand this page from the ground up, read these 11 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Unit of a ring definition
  6. Zero divisor definition
  7. Polynomials in several variables definition
  8. Integral domain definition
  9. Irreducible element definition
  10. Irreducible polynomial definition
  11. Hilbert's irreducibility theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Hilbert%27s_irreducibility_theorem
About this page
TagN1V3YEYHNP
URIm2://N1V3YEYHNP
Kindstatement, theorem
WritingW0 stub
MSC12E25, 11R09
StatusThis copy of the site has no build data. Run m2 status N1V3YEYHNP.
AboutIrreducible polynomial, Hilbertian field
UsesIrreducible polynomial, Polynomials in several variables
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by