## A question related to Hilbert’s Irreducibility Theorem

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

My question is whether for every extension of number fields $L\subset K$, and for every $f_0(x),...,f_n(x)$ in $K[x]$, there is some $\alpha\in L$ such that $$f_n(\alpha)T^n+...+f_1(\alpha)T+f_0(\alpha)$$ is irreducible as a polynomial in $K[T]$.

If $L=K$ this is known from Hilbert's Irreducibility Theorem. I find it hard to believe that there is a counter-example to this, but on the other hand I can't seem to conjure up a proof.

-

## 1 Answer

The answer is yes, assuming that the two-variable polynomial $f_n(x)T^n + \dots + f_1(x)T + f_0(x)$ is irreducible over $K$.

This follows from the version of Hilbert's irreducibility theorem for number fields proved as Theorem 46 of p.298 of Schinzel's book Polynomials with special regard to reducibility: the relevant passage can be viewed on Google Books

In fact, if I'm reading it correctly, it looks like one has irreducibility for all rational integers $\alpha$ belonging to an appropriate residue class.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 9, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9306169748306274, "perplexity_flag": "head"}