This paper extends the Schinzel hypothesis to polynomial rings, proving it for various classes of polynomials over integers and fields, and introduces related conjectures and spectral results.
Contribution
It develops a version of the Hilbert specialization property over rings and proves the Schinzel hypothesis for broad classes of polynomials.
Findings
01
Schinzel hypothesis proven for polynomials over integers and fields
02
A polynomial Goldbach conjecture is proposed
03
Results on spectra of rational functions are established
Abstract
The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is replaced by a polynomial ring and prove the Schinzel hypothesis for a wide class of them: polynomials in at least one variable over the integers, polynomials in several variables over an arbitrary field, etc. We achieve this goal by developing a version over rings of the Hilbert specialization property. A polynomial Goldbach conjecture is deduced, along with a result on spectra of rational functions.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Laboratoire Paul Painlevé, Mathématiques, Cité Scientifique, Université de Lille, 59655 Villeneuve d’Ascq Cedex, France
Laboratoire Paul Painlevé, Mathématiques, Cité Scientifique, Université de Lille, 59655 Villeneuve d’Ascq Cedex, France
Laboratoire ATRES, Faculté Polydisciplinaire de Khouribga, Université Sultan Moulay Slimane,
BP 145, Hay Ezzaytoune, 25000 Khouribga, Maroc.
Abstract.
The Schinzel hypothesis is a famous conjectural statement about primes
in value sets of polynomials, which generalizes the
Dirichlet theorem about primes in an arithmetic progression.
We consider the situation that the ring of integers is replaced by a polynomial ring
and prove the Schinzel hypothesis for a wide class
of them: polynomials in at least one variable over the integers, polynomials in several variables over an arbitrary field,
etc.
We achieve this goal by developing a version over rings of the Hilbert
specialization property.
A polynomial
Goldbach conjecture
is deduced, along with a result on spectra of rational functions.
Primary 12E05, 12E25, 12E30; Sec. 11C08, 11N80, 13Fxx
Acknowledgment.
This work was supported in part by the Labex CEMPI (ANR-11-LABX-0007-01)
and by the ANR project “LISA” (ANR-17-CE40–0023-01).
1. Introduction
The so-called Schinzel Hypothesis (H), which builds on an earlier conjecture of Bunyakovsky,
was stated in [SS58]. Consider a set P={P1,…,Ps} of s polynomials,
irreducible in Z[y], of degree ⩾1 and such that
(*) there is no prime p∈Z dividing all values ∏i=1sPi(m), m∈Z.
Hypothesis (H) concludes that there are infinitely many m∈Z
such that P1(m),…,Ps(m) are prime numbers.
If true, the Schinzel hypothesis would solve many classical problems in number theory:
the twin prime problem (take P={y,y+2}), the infiniteness
of primes of the form y2+1 (take P={y2+1}), the Sophie Germain prime problem (P={y,2y+1}), etc.
However it is wide open except for one polynomial P1 of degree one, in which case it
is the Dirichlet theorem about primes in an arithmetic progression.
We consider the situation that the ring Z is replaced by a
polynomial ring R[x] in n⩾1 variables
over some ring R, and
“prime” is understood as “irreducible”. We prove the Schinzel Hypothesis in this situation for a
wide class of rings R, for example Z, or k[u] with k an arbitrary field.
The infiniteness of integers m
is replaced by a degree condition.
1.1. Main result
Specifically, let R be a Unique Factorization Domain (UFD) with fraction field K. Our assumptions
include K being a field with the product formula. Definition is recalled in §4.
The basic example is K=Q. The product formula is: ∏p∣a∣p⋅∣a∣=1
for every a∈Q∗, where p ranges over all prime numbers, ∣⋅∣p is the p-adic absolute value
and ∣⋅∣ is the standard absolute value. The rational function field k(u1,…,ur) in r⩾1 variables over an arbitrary field k
is another example.
Given n indeterminates x1,…,xn, set R[x]=R[x1,…,xn] (n⩾0)111For n=0, we mean R[x]=R, which is the original context of Schinzel’s hypothesis..
Consider s⩾1 polynomials P1,…,Ps, irreducible in R[x,y], of degree ⩾1 in y.
Set P={P1,…,Ps} and let Irrn(R,P) be the set of polynomials
M∈R[x] such that P1(x,M(x)),…,Ps(x,M(x)) are irreducible in R[x].
For every n-tuple d=(d1,…,dn) of integers di⩾0,
denote the set of polynomials M∈R[x] such that degxi(M)⩽di, i=1,…,n, by PolR,n,d. It is an affine space
over R: the coordinates correspond to the coefficients.
Theorem 1.1**.**
Assume that n⩾1 and R is a UFD with fraction field a field K with the product formula,
imperfect if K is of characteristic p>0(i.e. Kp=K).
For every d∈(N∗)n such that d1+⋯+dn⩾1⩽i⩽smaxdegx(Pi)+2,
the set Irrn(R,P) is Zariski-dense in PolR,n,d.
In particular, the following Schinzel hypothesis for R[x] holds true:
(**) *there exist polynomials M∈R[x] with partial degrees any suitably large integers such that
P1(x,M(x)),…,Ps(x,M(x)) are irreducible in R[x]
222Up to adding P0=y to the set P, one may also require that M be irreducible in R[x].. *
Irreducibility over R is a main point. As a comparison, the Hilbert specialization property provides elements m∈K such that
P1(x,m),…,Ps(x,m) are
irreducible over K
(provided that
all degx(Pi) are ⩾1).
Developing a Hilbert property over rings will in fact be the core of our approach; we say more about this in §1.6.
Rings R satisfying the assumptions of Theorem 1.1 include:
(a) the ring Z of integers, and more generally, every ring Ok of integers of a number field k of class number 1,
(b) every polynomial ring k[u1,…,ur] with r⩾1 and k an arbitrary field.
(c) fields (so R=K) with the product formula, imperfect if of characteristic p>0 e.g. Q, k(u1,…,ur) (r⩾1, k arbitrary), their finite extensions.
As to the analog of assumption (*), it is automatically satisfied under our hypotheses
(Lemma 2.1).
Our approach also allows the situation that the polynomials Pi have several variables
y1,…,ym, which leads to a multivariable Schinzel hypothesis for polynomials (Theorem 5.3).
1.2. Examples
Take R[x] as above and Pi=bi(x)yρi+ai(x) with ρi∈N∗, ai,bi relatively prime in R[x] (possibly in R) and such that −ai/bi satisfies the Capelli condition that makes biyρi+ai irreducible in K(x)[y], i.e. −ai/bi∈/K(x)ℓ for every prime divisor ℓ of ρi and −ai/bi∈/−4K(x)4
if 4∣ρi. Then
(***) there exist polynomials M∈R[x] with partial degrees any suitably large integers such that
b1Mρ1+a1,…,bsMρs+as
are irreducible in R[x].
This solves the polynomial analogs of all famous number-theoretic problems mentioned above
(twin prime, etc.), and proves the Dirichlet theorem as well.
On the other hand, Schinzel’s hypothesis for R[x] obviously fails (hence Theorem 1.1 too) for n=1
if R=K is algebraically closed. It also fails for the finite field R=F2 and P={y8+x3}: from an example of Swan [Swa62, pp.1102-1103],
M(x)8+x3 is reducible in F2[x] for every M∈F2[x].
Interestingly enough, results of Kornblum-Landau [KL19] show that it does hold for Fq[x] in the degree one case and
for one polynomial, i.e., in the situation of the Dirichlet theorem; see also [Ros02, Theorem 4.7]. The situation that R=K is a finite field, and the related one that R=K is a PAC field333A field K is PAC if every curve over
K has infinitely many K-rational points. The first examples of PAC fields were ultraproducts of finite fields., and n=1, have led to valuable variants; see [BS09],
[BS12], [BW05].
1.3. Special rings
The special situation that R=K is a field is easier, and is dealt with in §2. In the addendum to Theorem 1.1 (in §2), K is assumed to be a Hilbertian field, more exactly a totally Hilbertian field
(definitions are in §4.1). This provides more fields than those in §1.1(c) for which Theorem 1.1 holds (with R=K): every abelian extension of Q, the field k((u1,…,ur)) of formal power series over a field k in at least two variables, etc.
For R=k[u] with k a field, we have this version of Theorem 1.1 in which the partial degrees of M are prescribed,
including the degree in u.
Theorem 1.2**.**
With P as above and n⩾1, assume R=k[u] with k an arbitrary field.
For every d∈(N∗)n satisfying d1+⋯+dn⩾1⩽i⩽smaxdegx(Pi)+2, there is an integer d0⩾1 such that for every integer δ⩾d0, there is a polynomial M∈Irrn(R,P)
satisfying
Identifying k[u][x1,…,xn] with a polynomial ring in n+1 variables, it follows that Schinzel’s hypothesis holds for polynomial rings in at least 2 variables over a field of characteristic [math].
In characteristic p>0, a weak version holds where one degree is allowed to be any suitably large multiple of p.
In the degree one case of the Schinzel hypothesis, i.e. in the Dirichlet situation, one can get rid of this last restriction.
Theorem 1.3**.**
Assume that n⩾2 and k is an arbitrary field.
Let (A1,B1),…,(As,Bs) be s pairs of nonzero relatively prime polynomials in k[x]. There is an integer d0⩾1 with this property: for all integers d1,…,dn larger than d0, there exists an irreducible polynomial M∈k[x] such that Ai+BiM is irreducible in k[x], i=1,…,s,
and degxj(M)=dj,
j=1,…,n.
To our knowledge, this was unknown, even for s=1. When k is infinite, we have a stronger version,
not covered either by Theorems 1.1
and 1.2. Let k denote an algebraic closure of k.
Theorem 1.4**.**
Assume n⩾2 and k is an infinite field. Let A,B∈k[x] be two nonzero relatively prime polynomials and
Irrn(k,A,B) the set of polynomials M∈k[x] such that A+BM is irreducible in k[x]. For every d∈(N∗)n, Irrn(k,A,B)
contains a nonempty Zariski open subset of Polk,n,d(k).
1.4. The Goldbach problem
The analog of the Goldbach conjecture for a polynomial ring R[x] is that every nonconstant polynomial Q∈R[x] is the sum of two irreducible polynomials F,G∈R[x] with deg(F)⩽deg(Q) (and so deg(G)⩽deg(Q) too).
Pollack [Pol11] showed it in the 1-variable case when R is a Noetherian integral domain with infinitely many maximal ideals, or, if R=S[u] with S an integral domain. His method relies on a clever use of the Eisenstein criterion.
Finding Goldbach decompositions for Q∈R[x] (n⩾1) corresponds to the special situation of the degree 1 case of the Schinzel hypothesis for which P={P1,P2} with P1=−y and P2=y+Q. We obtain this result.
Corollary 1.5**.**
Let R be a ring as in Theorem 1.1. Every nonconstant polynomial Q∈R[x] is the sum of two irreducible polynomials F,G∈R[x] with F=a+bx1d1⋯xndn(a,b∈R) a binomial of degree d1+⋯+dn⩽deg(Q).
One can even take d1+⋯+dn=1 when R=K is a Hilbertian field, or when n⩾2 and R=K is an infinite field (the latter was already known from [BDN09, Corollary 4.3(2)]). On the other hand, the Goldbach conjecture fails for F2[x] and Q(x)=x2+x (note that x2+x+1 is the only irreducible polynomial in F2[x] of degree 2). From Corollary 1.5 however, it holds true for Fq[x,y] if condition deg(F)⩽deg(Q) is replaced by degx(F)⩽degx(Q).
1.5. Spectra
The following result uses Theorem 1.3 as a main ingredient.
Corollary 1.6**.**
Assume that n⩾2 and k is an arbitrary field.
Let S⊂k be a finite subset, a0∈k∖S, separable over k
and V∈k[x] a nonzero polynomial. Then, for all suitably large integers d1,…,dn(larger than some d0 depending on S, a0, V), there is a polynomial U∈k[x]
such that:
If S=k, e.g. if k is infinite, a0 can be chosen in k itself.
A more precise version of Corollary 1.6, given in §5.5, shows that one can even prescribe all irreducible factors but one of each polynomial U(x)−aV(x), a∈S, provided that these factors satisfy some standard condition.
If k is algebraically closed, the irreducibility condition (b) implies that the rational function U/V is indecomposable [Bod08, Theorem 2.2]; “indecomposable” means that U/V cannot be written h∘H with h∈k(u) and H∈k(x) with deg(h)⩾2. The set of all a∈k such that U(x)−aV(x) is reducible in k[x] is called the spectrum of U/V and the indecomposability condition equivalent to the spectrum being finite.
Corollary 1.6 rephrases to conclude that
given S and V as above, indecomposable rational functions U/V∈k(x)
exist with a spectrum containing S and satisfying (c). See
[Naj04] [Naj05] for the special case V=1
and [BDN17, §3.1.1] for further results.
1.6. Hilbertian rings
Except for Theorem 1.4 for which we use geometrical tools (§3),
we follow a Hilbert like specialization approach.
Given an irreducible polynomial F(λ,x)∈R[λ,x] with degx(F)⩾1, the
Hilbert
property provides specializations λ1∗,…,λr∗∈K of the indeterminates from λ such that
F(λ1∗,…,λr∗,x) is irreducible in K[x] (§4.1).
As suggested above and detailed in §2, the challenge for our purpose is to make it work over the ring R, i.e., to be able to find λ1∗,…,λr∗ in R such that F(λ1∗,…,λr∗,x) is irreducible in R[x]. A problem however is that this is false in general, even with R=Z. Take F=(λ2−λ)x+(λ2−λ+2) in Z[λ,x]; for every λ∗∈Z, F(λ∗,x) is divisible by 2, hence reducible in Z[x].
To remedy this problem, we develop the notion of Hilbertian ring introduced in [FJ08, §13.4].
The defining property is that, for separable polynomials F(λ,x) in the one variable x, tuples (λ1∗,…,λr∗) can be found with coordinates in the ring R and satisfying the specialization property over K.
Our approach
to reach irreducibility over R
can be summarized as follows.
It may be of interest for the sole sake of the Hilbertian field theory.
(Hilbert sections 4 and 5)
Assume that K is of characteristic [math],
or K is of characteristic p>0 and imperfect (the imperfectness assumption).
(a)
We extend the property of Hilbertian rings to all irreducible polynomials F(λ,x) (not just the separable ones F(λ,x)), and show in fact a stronger version: λ1∗,…,λr∗ can be chosen pairwise relatively prime (Prop.4.2); and for R=k[u],
their degrees in u can be prescribed off a finite range (Theorem 4.8).
(b) We show that if K is a field with the product formula, then R is a Hilbertian ring (Theorem 4.6); this improves on [FJ08, Prop.13.4.1] where the assumption is that R is finitely generated over Z, or over k[u] for some field k.
(c) For R both a UFD and a Hilbertian ring, we show that our polynomials F(λ,x), due to their structure, satisfy the specialization property over the ring R,
and we prove Theorem 1.1 in this situation (§5).
The imperfectness assumption relates to a classical subtlety in positive characteristic. There are two notions of Hilbertian fields, depending on whether the specialization property is requested for all irreducible polynomials or only for the separable ones.
We follow [FJ08] and use the name Hilbertian for the weaker (the latter), and we say totally Hilbertian for the stronger (precise definitions are in §4.1). They are equivalent under the imperfectness assumption [Uch80] [FJ08, Proposition 12.4.3].
Final note.
The original Schinzel hypothesis has also appeared in Arithmetic Geometry, notably around the question of whether, for appropriate varieties over a number field k, the Brauer-Manin
obstruction is the only obstruction to the Hasse principle: if rational points exist locally (over all completions of k), they should exist globally (over k). In 1979, Colliot-Thélène and Sansuc [CTS82] noticed that this is true for a large family of conic bundle surfaces over PQ1 if one assumes Schinzel’s hypothesis. This conjectural statement has become since a working hypothesis of the area. See for example [HW16] for some last developments. Although the number field environment seems closely tied to the question, it could be interesting to investigate the potential use of our polynomial version of the Schinzel hypothesis to some similar questions over appropriate fields like rational function fields.
The paper is organized as follows. The strategy is detailed in §2. §3 is devoted to the geometric case that R=k[x] with n⩾2 and k is an infinite field; Theorem 1.4 is proved. §4 is the Hilbert part. The main results from §1 (other than Theorem 1.4) are finally proved in §5.
2. General strategy
Throughout the paper, R is a UFD with fraction field K. Recall that a polynomial with coefficients
in R is said to be primitive w.r.t. R if its coefficients are relatively prime in R.
All indeterminates are algebraically
independent over K.
Let x=(x1,…,xn) (n⩾1) and λ=(λ0,λ1,…,λℓ)
(ℓ⩾1) be two tuples of indeterminates and let Q=(Q0,Q1,…,Qℓ) with Q0=1
be a (ℓ+1)-tuple of nonzero polynomials in R[x], distinct up to multiplicative constants
in K×. Set
M(λ,x)=∑i=0ℓλiQi(x).
Consider a set P={P1,…,Ps} of s polynomials
Pi(x,y)=Piρi(x)yρi+⋯+Pi1(x)y+Pi0(x),
irreducible in R[x,y] and of degree ρi⩾1 in y, i=1,…,s.
Each polynomial Pi(x,y) is irreducible in K(x)[y] and is
primitive w.r.t. R[x].
In the case ρi=1, i.e., Pi=Ai(x)+Bi(x)y, the polynomial Fi rewrites
Fi(λ,x)=Ai(x)+Bi(x)(∑j=0ℓλjQj(x))).
Lemma 2.1**.**
(a)* Each polynomial Fi(λ,x) is irreducible in R[λ,x] and of degree ⩾1 in x. Furthermore,
if degy(Pi)=1, Fi(λ,x) is irreducible
in K[λ,x].*
(b)* If R is infinite and Π=∏i=1sPi, there is no irreducible polynomial p∈R[x] dividing all polynomials Π(x,M(x)) with M∈R[x].*
Note that (b) fails if R is finite: with R=F2 and P={x,x+1}, the polynomial x divides all polynomials M(x)(M(x)+1) (M∈F2[x]).
Proof.
(a) Fix an integer i∈{1,…,s}. By assumption, the polynomial Pi(x,λ0) is irreducible in R[x,λ0]. It is also irreducible in the bigger ring R[x,λ]. Consider the ring automorphism R[x,λ]→R[x,λ] that is the identity on R[x,λ1,…,λℓ] and maps λ0 to
the polynomial λ0+∑i=1ℓλiQi(x). The polynomial Fi(λ,x) is the image of Pi(x,λ0) by this isomorphism. Hence it is irreducible in R[x,λ].
To see that degx(Fi)⩾1, write Fi as a polynomial in λ1. The leading coefficient is Piρi(x)Q1(x)ρi; it is of positive degree in x since Q1 is by assumption. This proves that
degx(Fi)⩾1.
In the case ρi=1, irreducibility of Fi(λ,x) in K[x,λ] follows from the above case, applied with R taken to be K, and the fact that the polynomial Pi(x,y)=Ai(x)+Bi(x)y is irreducible in K[x,y]. Namely Pi(x,y) is of degree 1 in y and is primitive w.r.t. K[x]. Primitivity follows from the fact that, as Ai and Bi are relatively prime in R[x], then
they are relatively prime in K[x] (an application of Gauss’s lemma), and,
they are relatively prime in K[x].
For lack of reference for this last point, we provide below a quick argument.
Prove by induction on n that for every field K, for every nonzero A,B∈K[x], if A and B have a common divisor D∈K[x] with deg(D)>0, they have a common divisor C∈K[x] with deg(C)>0. The case n=1 follows from the Bézout theorem. Then, for n⩾2, if D is as in the claim, we may assume that deg(x2,…,xn)(D)>0. Observe then that D divides A and B in K(x1)[x2,…,xn]. By induction A and B have a common divisor C∈K(x1)[x2,…,xn] with deg(x2,…,xn)(C)>0. Using Gauss’s lemma, one easily constructs a polynomial C0=c(x1)C∈K[x1][x2,…,xn] (with c(x1)∈K[x1]) dividing both A and B in K[x1][x2,…,xn].
(b) If the claim is false, there is an irreducible polynomial p∈R[x] such that
Π(x,M(x))=0 in the quotient ring R[x]/(p(x)) for all M∈R[x].
But R[x]/(p(x)) is an integral domain, and it is infinite. Indeed, if p is nonconstant, say d=degx1(p)⩾1, the elements ∑i=0d−1rix1i with r0,…,rd−1∈R are infinitely many different elements in
R[x]/(p(x)); and if p∈R, then the quotient ring
is R/(p)[x], which is infinite too. Conclude that the polynomial Π(x,y) which has infinitely many
roots in R[x]/(p(x)) is zero in the ring (R[x]/(p(x))[y]. As this ring is an integral domain, there is an index i∈{1,…,s} such that Pi(x,y) is zero in (R[x]/(p(x))[y]. This contradicts Pi(x,y) being primitive w.r.t. R[x].
∎
Denote the set of polynomials F1,…,Fs by F
and consider the subset
HR(F)⊂Rℓ+1,
of all (ℓ+1)-tuples λ∗=(λ0∗,…,λℓ∗) such that
Fi(λ∗,x) is irreducible in R[x], for each i=1,…,s. It can be equivalently viewed as the set of all
polynomials of the form m(x)=∑j=0ℓmjQj(x) (m0,…,mℓ∈R) such that
Pi(x,m(x)) is irreducible in R[x], i=1,…,s.
Theorems 1.1 – 1.3
will be obtained via
the following special case of our situation: for a given d=(d1,…,dn)∈(N∗)n, the polynomials Qi are
all the monic monomials Q0,Q1,…,QNd in PolR,n,d. The polynomial
Md(λ,x)=∑i=0NdλiQi(x)
is then the generic polynomial in n variables of i-th partial degree di, i=1,…,n, and
Theorems 1.2 and 1.3 are about the set
HR(F)=Irrn(R,P)∩PolR,n,d
For example, anticipating on the reminder on Hilbertian fields in §4.1,
we can immediately prove this statement, already alluded to in §1.
Addendum to Theorem 1.1.The set Irrn(R,P) is Zariski-dense in PolR,n,d for every d∈(N∗)n, in each of these two situations:
(a)* R=K is a totally Hilbertian field,*
(b)* R=K is a Hilbertian field and degy(P1)=…=degy(Ps)=1.
*
Proof.
By definition, HK(F) is a Hilbert subset. Furthermore, from Remark 5.5, it contains a separable Hilbert subset if degy(P1)=…=degy(Ps)=1. It follows from the definitions that HK(F) is Zariski-dense in KNd+1=PolK,n,d in both situations. One does not even need to assume that d1+⋯+dn⩾1⩽i⩽smaxdegx(Pi)+2; the statement holds for example for d1=…=dn=1.∎
When R is more generally a ring, we have to further guarantee that:
the Hilbert subset HK(F) contains (ℓ+1)-tuples with coordinates in R,
for some of these (ℓ+1)-tuples λ∗, the corresponding polynomials Fi(λ∗,x) are primitive w.r.t. R, and so irreducible in R[x].
For R=k[u1,…,ur], polynomials in R[x] can be viewed as polynomials in at least two variables over the field k.
We explain in §3 how geometric specialization techniques can be used, if k is also infinite.
For more general rings R, more arithmetic specialization tools are needed, which we develop in §4. The specific argument for the primitivity point is given in §5.1; it takes advantage of the special form of the polynomial Fi and, as mentioned before, cannot extend to arbitrary polynomials F∈R[λ,x].
3. The geometric part
Lemma 3.1 is our specialization tool here. Based on results of Bertini, Krull and Noether, it is in the same vein as those from [BDN09], [BDN17].
We prove it in §3.1, then deduce Theorem 1.4 in §3.2.
3.1. The specialization lemma
Notation is as in §2. Consider the special case of the general situation from §2 for which s=1=ρ1. One degree 1 polynomial P(x,y) is given: P(x,y)=A(x)+B(x)y with A,B∈R[x] two nonzero relatively prime polynomials,
or P(x,y)=y.
We then have:
Assume that n⩾2, R=K is an algebraically closed field
and the following holds (which implies ℓ⩾1):
(a)* there is an index i0∈{1,…,ℓ} such that*
- deg(Qi0)≡0 modulo p if char(K)=p>0,
- deg(Qi0)=0 if char(K)=0.
(b)* there is no polynomial χ∈K[x] such that A,B,Q1,…,Qℓ∈K[χ].*
Then the set HK(F) of all (ℓ+1)-tuples λ∗=(λ0∗,…,λℓ∗) such that
F(λ∗,x) is irreducible in K[x] contains a nonempty Zariski
open subset of Kℓ+1.
Remark 3.2*.*
Assumptions (a) and (b) can probably be improved but the following examples show they cannot be totally removed. In each of them, F(λ,x) is reducible in K(λ)[x] and every non-trivial factorization yields a Zariski dense subset of λ∗∈Kℓ+1 such that F(λ∗,x) is reducible in K[x].
∙ If A,B,Q1,…,Qℓ∈K[χ] for some χ∈K[x], one can write
F(λ,x)=h(χ) with h∈K(λ)[u]. If deg(h)⩾2, h is reducible and so is
F(λ,x) in K(λ)[x].
Assume that the conclusion of Lemma 3.1 is false.
From the Bertini-Noether theorem [FJ08, Prop. 9.4.3], F(λ,x) is reducible in K(λ)[x]. Clearly then polynomials F(x,λ∗) are reducible in K[x] for all λ∗∈Kℓ+1 such that deg(F(x,λ∗))=degx(F).
The Bertini-Krull theorem [Sch00, Theorem 37] then yields that one
of the following conditions holds:
(1)
char(K)=p>0 and
F(λ,x)∈K[λ,xp] with xp=(x1p,…,xnp),
2. (2)
there exist ϕ,ψ∈K[x] with
degx(F)>max(deg(ϕ),deg(ψ)) satisfying the following:
there is an integer δ⩾1 and ℓ+2 polynomials H,H0,H1,…,Hℓ∈K[u,v]
homogeneous of degree δ such that
[TABLE]
The rest of the proof consists in ruling out both conditions (1) and (2).
For condition (1), this readily follows from the assumption on deg(Qi0): if char(k)=p>0, the polynomials B and BQi0 cannot be both in K[xp].
Assume condition (2) holds. Note that the polynomials ϕ and ψ are relatively prime in
K[x] as a consequence of A,B being relatively prime in
K[x]. We claim that the two conditions
lead to this conclusion: there is (β,γ)∈K2 such that βϕ(x)+γψ(x)=1. We show it by induction on the common degree δ of
H0 and Hi0.
For δ=1, write B=aϕ+bψ and BQi0=a′ϕ+b′ψ with a,b,a′,b′∈K. If deg(B)=0, then aϕ+bψ∈K∖{0} and the claim is established. Assume deg(B)>0. If ab′−a′b=0, any irreducible factor π of B divides
aϕ+bψ and a′ϕ+b′ψ,
hence divides both
ϕ and ψ in K[x], which contradicts ϕ and ψ being relatively prime. As there is at least one such factor π, we have
(a,b)=κ(a′,b′) for some nonzero κ∈K. It follows that B=κBQi0 and deg(Qi0)=0.
This contradicts our assumption. Hence the claim is established for δ=1.
for some (δ+1)-tuples ((a1,b1),…,(aδ+1,bδ+1)) and ((a1′,b1′),…,(aδ+1′,bδ+1′)) with components in K2.
If deg(B)=0, all polynomials ajϕ+bjψ, j=1,…,δ+1, are of degree [math]. Hence there exists (β,γ)∈K2 such that βϕ+γψ=1. Assume deg(B)>0. As above in the case δ=1, use an irreducible factor of B in
K[x] to conclude that there exist two indices j, j′ such that
this irreducible factor divides both ajϕ+bjψ and aj′′ϕ+bj′′ψ. We may assume that
j=j′=δ+1. As above in the case δ=1, it follows from ϕ, ψ relatively prime in K[x]
that
aδ+1ϕ+bδ+1ψ=κ(aδ+1′ϕ+bδ+1′ψ)
for some nonzero κ∈K. Consider the polynomial B1=B/(aδ+1ϕ+bδ+1ψ).
It is nonzero and we have
From the induction hypothesis, applied to B1 and κB1Qi0, there is (β,γ)∈K2 such that βϕ+γψ=1. This completes the proof of our claim.
Fix (β,γ)∈K2 such that βϕ+γψ=1. Pick (a,b)∈K2 such that
aγ−βb=0
and set χ=aϕ+bψ.
We have deg(χ)>0.
Then Kϕ+Kψ=Kχ+K and so A,B,BQ1,…,BQℓ are in K[χ]. It follows that A,B,Q1,…,Qℓ are in K[χ] too. Here is an argument. Fix i∈{1,…,ℓ}. Since B,BQi∈K[χ], Qi writes Qi=(p/q)(χ) for some p,q∈K[t] relatively prime. But then there exists u,v∈K[t] such that u(χ)p(χ)+v(χ)q(χ)=1. Since q(χ) divides p(χ) in K[x], we have deg(q)=0.
Hence Qi∈K[χ].
∎
Assume n⩾2, fix an infinite field k, two nonzero relatively prime polynomials A, B in k[x] and a n-tuple d∈(N∗)n. As explained in §2, consider the special case of Lemma 3.1 for which the polynomials Qi are all the monomials Q0,…,QNd in Polk,n,d (with Q0=1). We then have F(λ,x)=A(x)+B(x)Md(λ,x) with Md=∑i=0NdλiQi the generic polynomial in n variables of partial degree di in xi, i=1,…,n.
Lemma 3.1 concludes that Hk(F)=Irrn(k,A,B)∩Polk,n,d(k) contains a nonempty Zariski open subset of Polk,n,d(k).
As k is infinite, the set Irrn(k,A,B)∩Polk,n,d(k) also contains a nonempty Zariski open subset of Polk,n,d(k). This proves Theorem 1.4.
Remark 3.3*.*
(a) If k is finite however, non emptyness of Irrn(k,A,B) cannot be guaranteed at this stage: each finite set Irrn(k,A,B)∩Polk,n,d(k) (d∈(N∗)n) could be covered by an hypersurface.
For infinite fields, Theorem 1.4 clearly covers Theorem 1.3. We will use a different method, in §4, to prove Theorem 1.3 for finite fields (which will also reprove the infinite case).
(b) Lemma 3.1 can be used in other situations. For example, let A,B,C∈K[x] be nonzero polynomials, with A, B relatively prime and C∈K[x] distinct from A, B, up to multiplicative constants in K×. Assume hypotheses (a) and (b) of Lemma 3.1 respectively hold for Qi0=C and for A,B,C. Lemma 3.1 shows that the set of (λ,μ)∈K2 such that A+B(λC+μ) is irreducible in K[x] contains a nonempty Zariski open subset of AK2.
4. The Hilbert side
This section introduces the notion of Hilbertian ring and establishes some corresponding
specialization tools, which will be important ingredients of the proofs of the main theorems in §5.
4.1. Basics from the Hilbertian field theory
We recall the basic definitions and refer to chapters 12 and 13 of [FJ08] for more. Other classical references include
[Sch82], [Sch00], [Lan83].
Consider a field K and two tuples λ=(λ1,…,λr) and x=(x1,…,xn) (r⩾1, n⩾1) of indeterminates. Given m polynomials f1(λ,x),…,fm(λ,x) (m⩾1) in x with coefficients in K(λ), irreducible in the ring K(λ)[x]
and a polynomial g∈K[λ], g=0,
consider the set
HK(f1,…,fm;g)=⎩⎨⎧λ∗∈Krfi(λ∗,x)irreducible in K[x]for each i=1,…,m,\hfillandg(λ∗)=0.\hfill⎭⎬⎫
Call HK(f1,…,fm;g) a Hilbert subset ofKr. If in addition n=1 and each fi is separable in x (i.e., fi has no multiple root in K(λ)), call
HK(f1,…,fm;g) a separable Hilbert subset of Kr. The field K is called Hilbertian if every separable Hilbert subset
of Kr is nonempty and totally Hilbertian if every Hilbert subset of Kr is nonempty (r⩾1).
Equivalently, “nonempty” can be replaced by “Zariski-dense in Kr” in
the definitions.
As recalled earlier, a field K is totally Hilbertian if and only if it is Hilbertian and the imperfectness condition holds: K is imperfect if
of characteristic p>0.
Classical Hilbertian fields include the field Q, the rational function fields Fq(u) (with u some indeterminate) and all of their finitely generated extensions [FJ08, Theorem 13.4.2], every abelian extension of Q [FJ08, Theorem 16.11.3], fields k((u1,…,ur)) of formal power series in r⩾2 variables over a field k [FJ08, Theorem 15.4.6]; all of them are also
totally Hilbertian. Algebraically closed fields, the fields R, Qp of real, of p-adic numbers, more generally Henselian fields are non-Hilbertian. The fraction field of a UFD R need not be Hilbertian (take R=Zp), even if R has infinitely many distinct prime ideals: a counter-example
is given in [FJ08, Example 15.5.8].
Fields with the product formula provide other examples of Hilbertian fields. Recall from [FJ08, §15.3] that a nonempty set S of primes p of K, with associated absolute value ∣∣p, is said to satisfy the product formula if for each p∈S, there exists βp>0 such that:
(1) For each a∈K×, the set {p∈S∣∣a∣p=1} is finite and ∏p∈S∣a∣pβp=1.
In this case call K a field with the product formula. From a result of Weissauer, such fields are Hilbertian [FJ08, Theorem 15.3.3].
The fields Q, k(λ1,…,λr) with k any field and r⩾1, and their finite extensions, are fields
with the product formula.
4.2. Hilbertian ring
The following definition is given in [FJ08, §13.4].
Definition 4.1*.*
An integral domain R with fraction field K is said to be a Hilbertian ring if every separable Hilbert subset of Kr (r⩾1) contains r-tuples λ∗=(λ1∗,…,λr∗) with coordinates in R.
Since Zariski open subsets of Hilbert subsets remain Hilbert subsets, it is equivalent to require that a Zariski dense subset of tuples λ∗ exist in Definition 4.1.
Under the imperfectness assumption, a better property holds for Hilbertian rings, and extends to arbitrary Hilberts sets.
Proposition 4.2**.**
Let R be an integral domain such that the fraction field K is imperfect if of characteristic p>0.
The following are equivalent.
(i)* R is a Hilbertian ring.*
(ii)* Every separable Hilbert subset of K contains elements λ∗∈R.*
(iii)* For every nonzero λ0∗∈R and every a=(a1,…,ar)∈Rr, every Hilbert subset of Kr(r⩾1) contains r-tuples λ∗=(λ1∗,…,λr∗) with nonzero coordinates in R and such that
λi∗≡ai[modλ0∗⋯λi−1∗], i=1,…,r.*
Clearly, it suffices to prove (ii)⇒(iii). This is done in §4.4 by reducing the number of variables to reach the separable situation r=n=1 of Definition 4.1.
We recall a classical tool.
4.3. The Kronecker substitution
Given an arbitrary field K, an irreducible polynomial f∈K[λ,y],
of degree ⩾1 in y=(y1,…,ym) and an integer D>1⩽i⩽mmaxdegyi(f),
the Kronecker substitution is the map
SD:PolK(λ),m,D→PolK(λ),1,Dm, with D=(D,…,D),
deriving from the substitution of yDi−1 for yi, i=1,…,m, and leaving the coefficients in the field K(λ) unchanged.
Proposition 4.3**.**
There exist a finite set S(f) of irreducible polynomials g∈K[λ][y] of degree ⩾1 in y and a nonzero polynomial φ∈K[λ] such that the Hilbert subset HK(f)⊂Kr contains the Hilbert subset
HK(S(f);φ)
Furthermore, the finite set S(f) can be taken to be the set of irreducible divisors of SD(f) in K[λ][y].
Proof.
See [FJ08, Lemma 12.1.3]. The statement is only stated for r=1 but the proof carries over to the situation r⩾1 by merely changing the single variable for an r-tuple λ=(λ1,…,λr) of variables.
∎
We will also use several times the following observation.
Lemma 4.4**.**
Let R be a Hilbertian ring with a fraction field
K of characteristic p>0 and imperfect. There are
infinitely many a∈R that are different modulo Kp.
Proof.
Let R be a Hilbertian ring. Clearly
K is Hilbertian, in particular it
is infinite. Assume further that K is of characteristic p>0 and imperfect. Then K=Kp and K/Kp is a nonzero vector space over the infinite field Kp.
Thus K/Kp is infinite. It follows
that if h∈N is an integer, one can find h+1 elements k1,…,kh+1 of K that are different
modulo Kp. If δ∈R is a common denominator of k1,…,kh+1, then δk1,…,δkh+1 are elements
of R that are distinct modulo Kp. The conclusion follows.
∎
Fix an integral domain R satisfying the imperfectness assumption and assume that condition (ii) holds.
Let λ0∗∈R∖{0}, a=(a1,…,ar)∈Rr and H⊂Kr be a Hilbert subset.
4.4.1. First reductions
Consider the Hilbert subset Hλ0∗,a1 deduced from H by substituting λ0∗λ1+a1 to λ1 in the polynomials involved in H. This first reduction is used at the end of the proof in §4.4.4.
From the standard reduction Lemma 12.1.1 from [FJ08], the Hilbert
subset Hλ0∗,a1 contains a Hilbert subset of the form
HK(f1,…,fm;g)=⎩⎨⎧λ∗∈Krfi(λ∗,x)irreducible in K[x]for eachi=1,…,m,\hfillg(λ∗)=0⎭⎬⎫
with f1,…,fm irreducible polynomials in K[λ,x],
of degree at least 1 in x and g∈K[λ], g=0.
For i=1,…,m, view fi as a polynomial in y=(λ2,…,λr,x1,…,xn) with coefficients in K[λ1]. From Proposition 4.3, there is a finite set S(fi) of irreducible polynomials g∈K[λ1][y] of degree ⩾1 in y and a nonzero polynomial φi∈K[λ1] such that the Hilbert subset HK(fi)⊂K contains the Hilbert subset HK(S(fi);φi)⊂K.
Consider the Hilbert subset
HK(S(f1)∪⋯∪S(fm);φ1⋯φm)⊂K.
From the standard
reduction Lemma 12.1.4 from [FJ08], this Hilbert
subset contains a Hilbert subset of the form
HK(g1,…,gν)={λ1∗∈Kgi(λ1∗,y)irreducible in K[y]for eachi=1,…,ν,\hfill}
with g1,…,gν irreducible polynomials in K[λ1,y],
monic and of degree at least 2 in y.
4.4.2. 1st case:g1,…,gν are separable in y
From
assumption (ii),
there is an element λ1∗∈R∖{−a1/λ0∗}
such that, for each i=1,…,ν,
gi(λ1∗,y) is irreducible in K[y] and degx(fi(λ1∗,λ2,…,λr,x))⩾1.
We refer to §4.4.4 for the end of the proof which is common to 1st and 2nd cases.
4.4.3. 2nd case:
g1,…,gν are not all separable in y.
Necessarily K is of characteristic p>0.
The following lemma (which we will use a second time) adjusts arguments from [FJ08, Prop. 12.4.3].
For simplicity, set λ=λ1.
Lemma 4.5**.**
Under the 2nd case assumption, for every nonzero λ0∗∈R, there is a nonzero b∈λ0∗R with this property:
there exist irreducible polynomials Q1,…,Qν in K[λ,y], separable, monic of degree ⩾1 in y such that for all but finitely many τ∈HK(Q1,…,Qν), τp+b is in HK(g1,…,gν).
Assume g1,…,gℓ are not separable in y (with ℓ⩾1) and gℓ+1,…,gν are separable in y.
For each i=1,…,ℓ, there exists Qi∈K[λ,y] irreducible, separable, monic and of degree
⩾1 in y and qi a power of p different from 1 such that gi(λ,y)=Qi(λ,yqi). Since gi(λ,y) is irreducible in K[λ,y], Qi has a coefficient hi∈K[λ] which is not a pth power. Choose ai∈R
with hi(λ+ai)∈Kp[λ] if there exists any, otherwise let ai=0. Also set Qi=gi for i=ℓ+1,…,ν.
Consider the elements a∈R from Lemma 4.4. Among the corresponding elements
aλ0∗∈R, which are also different modulo Kp, there is at least one, say b=aλ0∗,
such that
b∈R∖⋃i=1ℓ(ai+Kp).
By [FJ08, Lemma 12.4.2(b)], hi(λ+b)∈/Kp[λ],
i=1,…,ℓ.
Consider the polynomials Qi(λ,y)=Qi(λp+b,y), i=1,…,ν. They are monic and separable in y. Furthermore, as detailed in §12.4 from [FJ08] (and [FJ] which clarifies the argument), they are irreducible in K[λ,y].
Let τ∈HK(Q1,…,Qν) but not in the set C, finite by [FJ08, Lemma 12.4.2(c)], of all elements c∈R with hi(cp+b)∈Kp for some i=1,…,ℓ. For i=ℓ+1,…,ν, we have Qi(τ,y)=gi(τp+b,y)
and so gi(τp+b,y) is irreducible in K[y]. Let i∈{1,…,ℓ}. Since τ∈/C, we have hi(τp+b)∈/Kp. Hence Qi(τp+b,y)=Qi(τ,y)∈/Kp[y]. From the choice of τ, this polynomial is irreducible in K[y].
By [FJ08, Lemma 12.4.1], we obtain that
Qi(τ,yqi)=Qi(τp+b,yqi)=gi(τp+b,y)
is irreducible in K[y]. Whence finally: τp+b∈HK(g1,…,gν). ∎
Use then the assumption (ii) of Proposition 4.2
to conclude that
for the element b and the polynomials Q1,…,Qν given by Lemma 4.5,
the Hilbert subset HK(Q1,…,Qν) contains infinitely many elements τ∈R.
Fix one off the finite list of exceptions in the final sentence of Lemma 4.5 and such that λ1∗=τp+b is different from −a1/λ0∗. The element λ1∗∈R is then in HK(g1,…,gν) and λ0∗λ1∗+a1=0. Up to excluding finitely many more τ above, we may also assure that degx(fi(λ1∗,λ2,…,λr,x))⩾1 (i=1,…,ν).
(We have only used here that b∈R. The possible choice of b in λ0∗R will be used later (§4.6.1)).
Applying Prop.4.3 and taking into account the first reduction changing H to Hλ0∗,a1 yields in both cases that
(2) there is λ1∗∈R∖{0} such that λ1∗≡a1[modλ0∗], fi(λ1∗,λ2,…,λr,x) is irreducible in K[λ2,…,λr,x] and is of degree at least 1 in x, i=1,…,m.
Repeating this argument provides a r-tuple λ∗=(λ1∗,…,λr∗) in (R∖{0})r such that f1(λ∗,x),…,fm(λ∗,x) are irreducible in K[x] (so λ∗ is in the original Hilbert subset H) and such that λi∗≡ai[modλ0∗⋯λi−1∗], i=1,…,r.
4.5. UFD with fraction field with the product formula
Theorem 4.6**.**
If R is an integral domain such that the fraction field K has the product formula and is imperfect if of characteristic p>0, then R is a Hilbertian ring.
Fix a ring R as in the statement.
Theorem 4.6 relies on the following lemma, whose main ingredient is a result for fields with the product formula. Recall a useful tool in a field K with a set S of primes p satisfying the product formula. For every a∈K, the (logarithmic) heighth(a) of a is defined by:
h(a)=∑p∈Slog(max(1,∣a∣p)).
Clearly h(an)=nh(a) (n∈N) and
h(1/a)=h(a) if a=0.
Lemma 4.7**.**
Let f1,…,fm be m irreducible polynomials in K(λ)[y]. For all but finitely many t0∈R, there is a nonzero element a∈R with
the following property: if b∈R is of height h(b)>0, the
Hilbert subset HK(f1,…,fm) contains infinitely many elements of R of
the form t0+abℓ(ℓ>0).
Proof.
[Dèb99, Theorem 3.3] proves the weaker
version for which the element a is only
asserted to lie in K.
However the proof can be adjusted so that a∈R.
Specifically, the same argument there
leads to the stronger conclusion provided that, if K is of characteristic p>0, infinitely
many a∈R can be found that are different
modulo Kp. This is the conclusion of Lemma 4.4.
∎
We prove condition (ii) from Proposition 4.2. Let H⊂K be a separable Hilbert subset.
From Lemmas 12.1.1 and 12.1.4 of [FJ08], the Hilbert
subset H contains a separable Hilbert subset of the form
HK(f1,…,fm)={λ∗∈Kfi(λ∗,y)irreducible in K[y]for eachi=1,…,m,\hfill}
with f1,…,fm irreducible polynomials in K[λ,y],
monic, separable and of degree at least 2 in y.
Pick an element t0∈R
that avoids the finite set of exceptions in Lemma 4.7.
Consider an element a∈R associated to this t0 in Lemma 4.7. Choose an element
b∈R of height h(b)>0.
Here is an argument showing that such b exist.
Fix a prime p∈S. Recall that by definition, the corresponding absolute value is nontrivial [FJ08, §13.3]: there exists b∈K such that ∣b∣p=1. One may assume that b∈R. From the product formula, there is a prime p0∈S such that ∣b∣p0>1.
We have h(b)⩾log(max(1,∣b∣p0))>0.
From Lemma 4.7, λ1∗=t0+abℓ∈R is in the Hilbert subset HK(f1,…,fm), hence in
the Hilbert subset H,
for infinitely many
integers ℓ>0.
∎
4.6. Polynomial rings in one variable
Theorem 4.8**.**
Assume that R=k[u] with k an arbitrary field. Let H be a Hilbert subset of Kr(r⩾1),
λ0∗∈R a nonzero element of R and d1⩾1 an integer. Define p by
\widetilde{p}=\left\{\begin{matrix}1\hskip 14.22636pt\hbox{if {\rm char}(k)=0or{\mathcal{H}} is a separable Hilbert subset}\hfill\\
p\hskip 14.22636pt\hbox{otherwise}.\hfill\\
\end{matrix}\right.
Denote the subset of H of
r-tuples λ∗=(λ1∗,…,λr∗)∈Rr such that
λ1∗ and λ0∗λ2∗⋯λr∗ are relatively prime in R
and max1⩽i⩽rdeg(λi∗)=pd1 by
Hλ0∗,pd1.
There is an integer d0 such that if d1⩾d0, the set Hλ0∗,pd1
is nonempty.
When R=k[u], statement (iii) from Proposition 4.2 also holds for the Hilbert subset H: there the congruence conditions are stronger but no control is given on the degree in u of λ1∗,…,λr∗ as in Theorem 4.8.
We divide the proof of Theorem 4.8 into two parts. The situation: one parameter, one variable, is considered in §4.6.1,
the general one in §4.6.2.
We are given a Hilbert subset H⊂K=k(u), a nonzero element λ0∗∈k[u], an integer d1⩾1 and we need to find an element λ1∗∈k[u] such that λ1∗∈H, λ1∗ and λ0∗ are relatively prime and deg(λ1∗)=pd1.
From Lemmas 12.1.1 and 12.1.4 from [FJ08], the Hilbert
subset H contains a Hilbert subset of the form
HK(f1,…,fm)={λ∗∈Kfi(λ∗,y)irreducible in K[y]for eachi=1,…,m.\hfill}
with f1,…,fm irreducible polynomials in K[λ,y],
monic and of degree at least 2 in y.
We distinguish the two cases corresponding to the definition of p.
Separable case: char(k)=0 or H is a separable Hilbert subset. As n=1, the Hilbert subset H is also separable under the assumption char(k)=0. So we may assume that the polynomials f1,…,fm above are separable in y. We distinguish two sub-cases.
1st sub-case: k is infinite. Use [Lan83, Prop.4.1 p.236]
to assert that there exists a nonempty Zariski open subset V⊂Ak2 such that for all but finitely many γ∈k,
{τ+γ(u−β)d1∈k[u]∣(τ,β)∈V}⊂HK(f1,…,fm).
Fix a nonzero γ∈k off the finite exceptional list. There are infinitely many different (τ,β)∈V such that
no root in k of the polynomial λ0∗∈k[u] is a root of τ+γ(u−β)d1, and so
τ+γ(u−β)d1 and λ0∗ are relatively prime. The corresponding elements λ1∗=τ+γ(u−β)d1 are infinitely many different elements of the set Hλ0∗,d1.
In this case, one can take d0=1.
2nd sub-case: k is finite.
Start with another classical reduction, namely [FJ08, Lemma 13.1.2], to conclude that there exist
polynomials Q1,…,Qν in K[λ,y], irreducible in K[λ,y], monic and separable
in y, of degree ⩾2 in y and such that the Hilbert subset HK(f1,…,fm)
contains the set
HK′(Q1,…,Qν)={λ∗∈KQi(λ∗,y)has no root in Kfor eachi=1,…,ν}
Consider the set {pi∣i∈I} of irreducible factors of the given polynomial λ0∗∈k[u];
view them as primes of K. Apply [FJ08, Lemma 13.3.4] to assert that, for each j=1,…,ν, there are infinitely primes pj of K such that there is an apj∈R with this property: if a∈R satisfies a≡apjmodpj, then Qj(a,v)=0 for every v∈K. For each j=1,…,ν, pick one such prime pj that is different from all primes pi with i∈I.
Denote the ideal (∏j=1νpj)(∏i∈Ipi)⊂R by I. From the Chinese Remainder Theorem, there exists a0∈R such that every a∈a0+I satisfies
Consider such an a and rename it λ1∗. It follows from the first condition that λ1∗∈HK′(Q1,…,Qν) and so λ1∗∈HK(f1,…,fm)⊂H. It follows from the second condition that λ1∗≡0modpi for every i∈I.
Hence λ1∗ and λ0∗ are relatively prime.
Finally when λ1∗=a ranges over a0+I, deg(λ1∗) assumes all but finitely many
values in N. Therefore there is an integer d0 such that Hλ0∗,d1=∅ for every d1⩾d0.
2nd case: char(k)=p>0* and H is not a separable Hilbert subset*.
Not all the polynomials f1,…,fm are separable in y.
Proceed as in
§4.4.3. From Lemma
4.5, there is a nonzero b∈λ0∗R and some irreducible polynomials Q1,…,Qm in K[λ,y], separable, monic of degree ⩾1 in y such that for all but finitely many τ∈HK(Q1,…,Qm), τp+b is in HK(f1,…,fm).
From the separable case of the current proof, there is an integer d0⩾1 with the following property: the Hilbert subset HK(Q1,…,Qν) contains infinitely many elements τ∈R such that τ and λ0∗ are relatively prime and deg(τ)=d1. Fix one off the finite list of exceptions in the final sentence of Lemma 4.5 and set λ1∗=τp+b. We then have λ1∗∈HK(f1,…,fm).
Furthermore λ1∗ and λ0∗ are relatively prime in R. Finally assuming that d0 is also
larger than deg(b), we have deg(λ1∗)=pd1 if d1⩾d0, thus finally proving that λ1∗∈Hλ0∗,pd1.
4.6.2. Proof of Theorem 4.8 – situation r⩾1, n⩾1 –
As in §4.6.1 we distinguish two cases according to the definition of p.
Separable case: H is a separable Hilbert subset (in particular n=1). From Lemma 12.1.1 and Lemma 12.1.4 from [FJ08], the separable Hilbert
subset H⊂Kr contains a Hilbert subset of the form
HK(f1,…,fm)={λ∗∈Krfi(λ∗,x)irreducible in K[x]for eachi=1,…,m,\hfill}
with f1,…,fm irreducible polynomials in K[λ,x],
separable, monic and of degree at least 2 in x.
Set K=K(λ3,…,λr) (with K=K if r=2) and regard f1,…,fm as polynomials in the ring K(λ1)[λ2,x]. By [FJ08, Proposition 13.2.1], there exists a nonempty Zariski open subset U⊂AK2 such that
{a+bλ1∣(a,b)∈U}⊂HK(λ1)(f1,…,fm).
Furthermore, up to shrinking U, one may require that the polynomials
(4) fi(λ1,aλ1+b,λ3,…,λr,x), i=1,…,m
are separable and of degree at least 2 in x, and that b=0. As R=k[u]⊂K is infinite,
the open subset U contains elements (a,b)∈R2. For such (a,b), the polynomials above in (4)
are in K[λ1,λ3,…,λr,x] and are
irreducible in K(λ1,λ3,…,λr)[x].
Repeating this procedure provides an (r−1)-tuple ((a2,b2),…,(ar,br))∈(R2)r−1 with b2⋯br=0 such that the polynomials
are in K[λ1,x], irreducible in K(λ1)[x], separable and of degree ⩾2 in x.
From the proof in situation r=n=1 and in the separable case (in §4.6.1), there is an integer δ0⩾1 with this property:
the Hilbert subset HK(g1,…,gm) contains
an element λ1∗∈R relatively prime to
λ0∗⋅b2⋯br and such that deg(λ1∗)=δ1 if δ1⩾δ0. Request further to δ0 to satisfy:
(5) δ0>max2⩽i⩽rdeg(bi).
Set d0=δ0+max2⩽i⩽rdeg(ai) and fix an integer d1⩾d0. It follows from d1−max2⩽i⩽rdeg(ai)⩾δ0 that the Hilbert subset HK(g1,…,gm) contains
an element λ1∗∈R
such that deg(λ1∗)=d1−max2⩽i⩽rdeg(ai).
Consequently we have the following:
the r-tuple λ∗=(λ1∗,a2λ1∗+b2,…,ar−1λ1∗+br−1,arλ1∗+br)∈Rr is in the original Hilbert subset H,
and,
denoting the i-th component of λ∗ by λi∗,
λ1∗ is relatively prime to λ0∗λ2∗⋯λr∗,
the largest degree of λ1∗,…,λr∗ is d1 (due to condition (5),
this largest degree is max2⩽i⩽rdeg(aiλ1∗)).
This proves that λ∗∈Hλ0∗,d1.
General case: We will use the Kronecker substitution.
The Hilbert subset H contains a Hilbert subset
HK(f1,…,fm;g)=⎩⎨⎧λ∗∈Krfi(λ∗,x)irreducible in K[x]for eachi=1,…,m,\hfillg(λ∗)=0⎭⎬⎫
with f1,…,fm irreducible polynomials in K[λ,x],
of degree at least 1 in x and g∈K[λ], g=0.
As in §4.4, Proposition 4.3, followed by [FJ08, Lemma 12.1.4], provides polynomials g1,…,gν, irreducible in K[λ1,y],
monic and of degree ⩾2 in y with this property. For every λ1∗∈HK(g1,…,gν),
each of the polynomials
fi(λ1∗,λ2,…,λr,x), i=1,…,m,
is irreducible in K[λ2,…,λr,x]. From the proof in situation r=n=1 (§4.6.1),
the Hilbert subset HK(g1,…,gν) contains infinitely many λ1∗∈R relatively prime to
λ0∗.
Repeating this argument (r−2) times provides λ1∗,…,λr−1∗∈R
such that fi(λ1∗,…,λr−1∗,λr,x) is irreducible in K[λr,x] (i=1,…,m) and λi∗ and λ0∗λ1∗⋯λi−1∗ are relatively prime (i=1,…,r−1).
Repeating the argument once more but applying this time the full conclusion of the case r=n=1 of the proof including the degree condition, we obtain that there is an integer d0, which we may also choose to be larger than max1⩽i⩽r−1deg(λi∗), with the following property: if d1⩾d0, there exists an element λr∗∈R such that
fi(λ1∗,…,λr−1∗,λr∗,x) is irreducible in K[x], i=1,…,m,
λr∗ and λ0∗λ1∗⋯λr−1∗ are relatively prime,
deg(λr∗)=pd1.
Finally the r-tuple λ∗ is in the original Hilbert subset H, λi∗ and λ0∗λ1∗⋯λi−1∗ are relatively prime (i=1,…,r), and consequently, λ1∗ is relatively prime to λ0∗λ2∗⋯λr∗, and max1⩽i⩽rdeg(λi∗)=pd1. Thus
the set Hλ0∗,d1 is nonempty.
Recall the notation from §2: R is a UFD with fraction field K, x=(x1,…,xn), λ=(λ0,λ1,…,λℓ) (n⩾1, ℓ⩾1) are two tuples of indeterminates, Q=(Q0,Q1,…,Qℓ), with Q0=1, is a (ℓ+1)-tuple of nonzero polynomials in R[x], distinct up to multiplicative
constants in K×, P={P1,…,Ps} is a set of s polynomials
Pi(x,y)=Piρi(x)yρi+⋯+Pi1(x)y+Pi0(x),
irreducible in R[x,y] and of degree ρi⩾1 in y, i=1,…,s. We also set
The polynomials F1,…,Fs are irreducible in R[λ,x] (Lemma 2.1).
Finally, for F={F1,…,Fs}, we introduced the subset
HR(F)⊂Rℓ+1
of all (ℓ+1)-tuples λ∗ (or equivalently, of polynomials
Λ(x)=∑j=0ℓλi∗Qj(x)) such that
Fi(λ∗,x)=Pi(x,Λ(x)) is irreducible in R[x], i=1,…,s.
Given a nonzero element λ−1∗∈R and a tuple a=(a0,…,aℓ)∈Rℓ+1, consider the subset
HR,λ−1∗,a(F)⊂HR(F)
of those (ℓ+1)-tuples λ∗=(λ0∗,…,λℓ∗)∈HR(F) which further satisfy
the congruences λi∗≡ai[modλ−1∗λ0∗⋯λi−1∗], i=0,…,ℓ.
Make this additional assumption on Q0,…,Qℓ (which implies ℓ⩾2):
(1) Q0,…,Qℓ* are monomials with coefficient 1, Q0=1 and*
min(deg(Q1),deg(Q2))>1⩽i⩽smaxdegx(Pi).
Theorem 5.1**.**
Let λ−1 be a nonzero element of R and a=(1,…,1)∈Rℓ+1.
(a)* Assume that R is a UFD and a Hilbertian ring and K is imperfect if it is of characteristic p>0. The subset
HR,λ−1∗,a(F) is Zariski-dense in Rℓ+1.*
(b)* If R=k[u] with k an arbitrary field and d1 is a suitably large integer, then
HR(F) contains
a polynomial Λ=∑j=0ℓλi∗Qj(x) with λ∗=(λ0∗,…,λℓ∗)∈Rℓ+1
such that λ1∗ and λ−1∗λ0∗λ2∗⋯λℓ∗ are relatively prime and degu(Λ)=pd1.*
Proof.
The number of monomials Qi is ℓ+1⩾3. Each Fi is of degree ⩾1 in x and is irreducible in K(λ)[x], i=1,…,s (Lemma 2.1). Let g∈K[λ] be a nonzero
polynomial and consider the Hilbert subset
HK(F;g)⊂Kℓ+1.
In situation (a), it follows from Proposition 4.2 that the Hilbert subset HK(F;g) contains
an (ℓ+1)-tuple λ∗=(λ0∗,…,λℓ∗)∈Rℓ+1 satisfying the congruences
λi∗≡1[modλ−1∗λ0∗⋯λi−1∗], i=0,…,ℓ.
In situation (b), from Theorem 4.8, the Hilbert subset HK(F;g) contains an (ℓ+1)-tuple λ∗ such that λ1∗ and λ−1∗λ0∗λ2∗⋯λℓ∗ are relatively prime and 0⩽i⩽ℓmaxdeg(λi∗)=pd1, i.e,
degu(Λ)=pd1 for Λ=∑j=0ℓλi∗Qj(x).
Each Fi(λ∗,x) being irreducible in K[x], to finish the proof, it suffices to
show that Fi(λ∗,x) is primitive w.r.t. R (i=1,…,s).
Assume otherwise, i.e., for some i=1,…,s, there is an irreducible element π∈R dividing all the coefficients
of Fi(λ∗,x). The quotient ring R=R/(π) is an integral domain. Use the notation U to denote the class modulo (π) of polynomials U with coefficients in R.
We have:
1st case: π divides all polynomials Pij(x), j=1,…,ρi. From (2), π also
divides Pi0(x). This contradicts Pi(x,y) being primitive w.r.t. R.
2nd case: there is an index j∈{1,…,ρi} such that π does not divides Pij(x).
As λ1∗ and λ2∗ are relatively prime (in both situations (a) and (b)), one of the two is not divisible by π. Conjoin this with our monomials Qi being of coefficient 1 to conclude that M(λ∗,x)=0 in R/(π)[x] and that there is at least one nonzero term Pij(x)M(λ∗,x)j with j∈{1,…,ρi}.
Furthermore we have:
deg(M(λ∗,x))⩾min(deg(Q1),deg(Q2)).
Using next the following inequality (coming from assumption (1)):
we obtain that all nonzero terms Pij(x)M(λ∗,x)j with j∈{1,…,ρi} are of different degrees: otherwise, for two integers j,k∈{1,…,ρi} with k>j, we would have the following, where δ=deg(M(λ∗,x)):
which contradicts the preceding inequalities. It follows that the left-hand side of (2) is of degree ⩾deg(M(λ∗,x)).
But then the following inequality (using again assumption (1)):
From Theorem 4.6, the assumption on R in Theorem 1.1 implies that of Theorem 5.1(a), and R=k[u] in both Theorem 1.2 and Theorem 5.1(b). Theorems 1.1 and 1.2 then correspond to the special case of Theorem 5.1 for which, for a given d∈(N∗)n, the Qi are all the monomials
Q0,Q1,…,QNd in Polk,n,d
and Q1, Q2 are monomials of degree
d1+⋯+dn and d1+⋯+dn−1. Assumption on d1,…,dn in Theorems 1.1 and 1.2 guarantees assumption (1) of Theorem 5.1.
∎
Remark 5.2*.*
The proof shows that Theorem 1.1 holds under the more general assumption that R is a UFD, a Hilbertian ring and K is imperfect if of characteristic p>0. We note that there exist UFD with a Hilbertian
fraction field satisfying the imperfectness assumption but not Hilbertian as a ring, e.g. the ring C[[u1,…,un]] of formal power series with n⩾2 [FJ08, Example 15.5]. It is unclear whether Theorem 1.1 holds for these
rings.
5.2. The multivariable Schinzel hypothesis
Theorem 5.1 offers more flexibility than Theorem 1.1 and Theorem 1.2. Instead
of taking for Q0,…,Qℓ all the monomials in Polk,n,d, one may want to work with a proper subset of them and construct irreducible polynomials of the form Pi(x,M(x)) with some of the coefficients in M(x) equal to [math].
In this manner one can extend Theorems 1.1 and 1.2 to the situation that P1,…,Ps are polynomials in m variables y1,…,ym.
Let R be a UFD with fraction field a field K with the product formula, imperfect if K is of characteristic p>0. Let x=(x1,…,xn) (n⩾1) and y=(y1,…,ym) (m⩾1) be two tuples of
indeterminates.
Theorem 5.3**.**
Let P={P1,…,Ps} be a set of polynomials, irreducible in R[x,y]
and of degree ⩾1 in y.
Let Irrn(R,P) be the set of all m-tuples M=(M1,…,Mm)∈R[x]m such that Pi(x,M(x)) is irreducible in R[x], i=1,…,s.
For every d∈(N∗)n such that
D:=d1+⋯+dn⩾1⩽i⩽smax(deg(Pi)+2),
the set
Irrn(R,P) is
Zariski-dense in PolR,n,d×⋯×PolR,n,Dm−1d.
The proof is an easy induction left to the reader: use Theorem 5.1 to successively specialize in R[x] the indeterminates y1,…,ym.
Fix an integral domain R as in Theorem 1.1, an integer n⩾1 and a nonconstant polynomial Q∈R[x].
Let P={P1,P2} with P1=−y and P2=y+Q. We will proceed as in Theorem 5.1 but with only two monomials Q0,Q1 (so ℓ=1) and without assuming condition (1) from §5.1.
Assume that we are not in the case n=1=deg(Q); this case is dealt with separately. Let Q∞ be a monic nonconstant monomial appearing in Q with a nonzero coefficient. Denote this coefficient by q∞. Let Q1 be a nonconstant monomial distinct from Q∞ and of degree deg(Q1)⩽deg(Q). Denote the coefficient of Q0=1 in Q by q0 (the constant coefficient).
As in the proof of Theorem 5.1, Proposition 4.2 provides nonzero λ0∗,λ1∗ in R satisfying the following: for M=λ0∗+λ1∗Q1, both M and M+Q are irreducible in K[x], λ0∗≡1−q0[modq∞] and λ1∗≡1[modλ0∗]
(the elements q∞,λ0∗,λ1∗ play the respective roles of λ0∗,λ1∗,λ2∗ from Proposition 4.2).
To conclude, it suffices to show that M and M+Q are primitive. As λ0∗ and λ1∗ are relatively prime, M is primitive. As for
M+Q, it follows from this: the coefficients of Q∞ and Q0 in M+Q are relatively prime. Indeed the former is q∞ and the latter is λ0∗+q0 which is congruent to 1 modulo q∞.
Finally, in the case n=1=deg(Q), write Q=q1x+q0. We can take:
The more specific conclusion, alluded to in §1.4, that one can further take deg(Q1)=1 if R=K is a Hilbertian field, or if R=K is an infinite field and n⩾2, can be obtained from similar arguments but using the Addendum to Theorem 1.1 (in §2) and Theorem 1.4 instead
of Theorem 5.1.
Assume further that
the polynomials Qi are the
monomials
Q0,Q1,…,QNd in Polk,n,d for some d∈(N∗)n,
with as before Q0=1 and Q1 and Q2 monomials of degree
d1+⋯+dn and d1+⋯+dn−1.
Lemma 5.4**.**
If as above degy(P1)=…=degy(Ps)=1, then the Hilbert subset HK(F1,…,Fs)⊂KNd+1 contains a separable Hilbert subset.
Fix D>max1⩽i⩽s1⩽j⩽ndegxj(Fi) and consider the Kronecker substitution:
SD:PolK(λ),n,D→PolK(λ),1,Dn, with D=(D,…,D),
mapping xj to xDj−1, j=1,…,n (introduced in §4.2). Fix i∈{1,…,s}.
From Proposition 4.3, there exist a finite set S(Fi) of irreducible polynomials in K[λ][x] of degree ⩾1 in x and a nonzero polynomial φi∈K[λ] such that the Hilbert subset HK(Fi)⊂KNd+1 contains the Hilbert subset
HK(S(Fi);φi).
Furthermore, one can take for S(Fi) the set of irreducible divisors in K[λ][x] of
the following polynomial (in which Md=∑h=0NdλhQh):
The polynomials SD(Qh) are distinct monomials in x (up to multiplicative constants in K×): this indeed follows from the fact that two different integers between [math] and Dn−1−1 have different D-adic expansions a1+a2D+⋯+an−1Dn−2 with 0⩽aj⩽D−1, j=1,…,n−1.
Note that SD(Ai) and SD(Bi) may not be relatively prime (take for example Ai=x2−1 and Bi=x3−1) and so Lemma 2.1 cannot be used directly. Denote the gcd of SD(Ai) and SD(Bi) by Δ∈K[x].
Conclude from Lemma 2.1 that the polynomial
is irreducible in K[λ,x]. Since Δ∈K[x], its irreducible factors f in K[λ,x] are in fact in K[x], and so satisfy HK(f)=KNd+1. Conclude that one can take S(Fi)={fi} where fi is the polynomial displayed above.
The polynomial fi has an additional property: it is separable in x. Indeed, if p>0, not all exponents of x in fi are divisible by p (note that ∑h=0NdλhSD(Qh) is the generic polynomial in one variable of degree Dn−1).
We have thus proved that the Hilbert subset HK(F1,…,Fs)⊂KNd+1 contains the separable Hilbert subset HK(f1,…,fs;φ1⋯φs).
∎
The statement is about polynomials in at least 2 variables that are denoted x1,…,xn there. For consistency with the previous notation, we relabel them here u,x1,…,xn, with n⩾1. Set R=k[u] and view k[u,x1,…,xn] as R[x].
Up to adding it to the given list (A1,B1),…,(As,Bs) of couples of relatively prime polynomials in R[x], one may assume that the couple (1,0) is in this list;
this will guarantee that the desired polynomial M is itself irreducible in R[x] as requested.
With the notation from this subsection, Lemma 5.4 gives that the Hilbert subset HK(F1,…,Fs)⊂KNd+1 contains a separable Hilbert subset, say HK(f1,…,fs;φ).
From the separable case of Theorem 4.8, there is an integer d0 such that for every integer δ⩾d0,
HK(f1,…,fs;φ) contains a tuple λ∗∈RNd+1 such that
λ1∗ and λ2∗ are relatively prime in R and degu(Md(λ∗,x))=δ. We have a fortioriλ∗∈HK(F1,…,Fs)⊂KNd+1:
Fi(λ∗,x)=Ai(x)+Bi(x)Md(λ∗,x) is irreducible in K[x], i=1,…,s.
Assume d0 large enough so that, if di⩾d0, i=1,…,n, then
d1+⋯+dn−1>i=1,…,smaxmax(deg(Ai),deg(Bi)).
Irreduciblility of each Ai(x)+Bi(x)Md(λ∗,x) in R[x] is deduced by proving it is primitive from λ1∗, λ2∗ being relatively prime as in the proof of Theorem 5.1.
Finally, up to multiplying φ by the coordinate λh corresponding to the monomial x1d1⋯xndn, one guarantees degxi(Md(λ∗,x))=di, i=1,…,n. This completes the proof: Md(λ∗,x) is the requested polynomial.
∎
Remark 5.5*.*
Lemma 5.4 also shows that the degree 1 case of the Schinzel hypothesis holds when R is a Hilbertian field (totally Hilbertian is not needed), thus completing the proof of the addendum to Theorem 1.1 in situation (b).
Assume n⩾2, fix an arbitrary field k, a subset S={a1,…,at}⊂k, a0∈k∖S, separable over k, and V∈k[x], V=0. We will show this more precise version of Corollary 1.6.
Corollary 1.6(explicit form).Let w0,…,wt∈k[x] be t+1 nonzero polynomials with w0=1. Assume that (wi)+(wj)=k[x]
for i=j and each wi is relatively prime to V. For all suitably large integers d1,…,dn(larger than some d0 depending on S,a0,V,w1,…,wt), there is a polynomial U∈k[x] such that these three conclusions hold:
In order to obtain the version of Corollary 1.6 from §1, it suffices to choose w1,…,wt as in the statement
but not in k and
d1>max(deg(V),deg(w1),…,deg(wt)).
It then follows from deg(U)⩾degx1(U)=d1 (using (c)) that deg(U−aiV)=deg(U),
and next from (a) that U−aiV is reducible, i=1,…,t.
Remark 5.6*.*
The assumption (wi)+(wj)=k[x] is necessary when V=1: if we have U−aiV=wiHi and U−ajV=wjHj for two distinct indices i,j, then wiHi−wjHj=(aj−ai)V.
Proof.
As (wi)+(wj)=k[x], i=j, the Chinese Remainder Theorem may be used to conclude that there is a polynomial U0∈k[x]
such that
U0−aiV=wipi with pi∈k[x], i=1,…,t.
As w0=1, we also have U0−a0V=w0p0
for some p0, but here p0 is in k(a0)[x]. Furthermore the polynomials U∈k(a0)[x]
satisfying the same (t+1) conditions are of the form
U(x)=U0(x)+M(x)i=0∏twi(x)
for some M∈k(a0)[x]. For such a polynomial U, we have
U−aiV=wi(pi+M∏j=iwi(x)),i=0,…,t.
Up to changing U0, we may assume that p0,…,pt are nonzero.
For each i=0,…,t, the polynomials Ai=pi and Bi=∏j=iwi(x) are relatively prime in k(a0)[x].
Namely if π∈k(a0)[x] is a common irreducible divisor in k(a0)[x] of these two polynomials, then π divides pi and π
divides wj for some j=i and hence, π is a common divisor of U0−aiV and
U0−ajV. Therefore π divides V and wj, which contradicts the assumption (V,wj)=1.
Set R=k(a0)[xn], K=k(a0)(xn), x=(x1,…,xn−1) and, for d∈(N∗)n−1 and i=0,…,t,
As in the proof of Theorem 1.3,
the Hilbert subset HK(F0,…,Ft) contains a separable Hilbert subset
HK(f0,…,ft,φ) with f0,…,ft∈K[λ,x] of degree ⩾1 in x and φ∈K[λ], φ=0.
The field extension k(a0)/k is finite and separable. Setting R0=k[xn] and K0=k(xn), so is the extension K/K0.
From [FJ08, Corollary 12.2.3],
HK(f0,…,ft,φ) contains a separable Hilbert subset HK0 of K0Nd+1.
Proceed as in the proof of Theorem 1.3 to conclude that there is an integer d0 with the following property:
if δ1, δ2,…,δn are integers ⩾d0, the Hilbert subset HK0, and so the Hilbert subset HK(F0,…,Ft) too, contains a tuple λ∗=(λ0∗,…,λNd∗)∈R0Nd+1 such that λ1∗ and λ2∗ are irreducible in R0, and degxi(Md(λ∗,x))=δi, i=1,…,n. Choosing again for Q1,Q2 monomials of respective degrees d1+⋯+dn−1 and d1+⋯+dn−1−1 and assuming d0 suitably large, we obtain as for Theorem 1.3 that each of the polynomials
Fi(x)=Ai(x)+Bi(x)Md(λ∗,x)
is irreducible in k(a0)[xn][x1,…,xn−1], i=0,…,t.
Up to increasing d0, one can further guarantee that δ1,…,δn are large enough so that
deg(Md(λ∗,x))>deg(U0) and Fi does not divide wi, i=1,…,s.
The polynomial
U(x)=U0(x)+Md(λ∗,x)∏i=0twi(x)
is in k[x] and satisfies the required condition U−aiV=wiHi, with Hi=Fi irreducible in k(a0)[x], i=0,…,t. Up to replacing the Hilbert subset HK(f0,…,ft,φ) by a Zariski open subset of it, one can also request that deg(U−a0V)=max(deg(U),deg(V)).
Finally degxi(U)=δi+∑j=1tdegxi(wj) can be taken to be any given suitably large integer di, i=1,…,n.
∎
Bibliography22
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BDN 09] Arnaud Bodin, Pierre Dèbes, and Salah Najib. Irreducibility of hypersurfaces. Comm. Algebra , 37(6):1884–1900, 2009.
2[BDN 17] Arnaud Bodin, Pierre Dèbes, and Salah Najib. Families of polynomials and their specializations. J. Number Theory , 170:390–408, 2017.
3[Bod 08] Arnaud Bodin. Reducibility of rational functions in several variables. Israel J. Math. , 164:333–347, 2008.
4[BS 09] Lior Bary-Soroker. Dirichlet’s theorem for polynomial rings. Proc. Amer. Math. Soc. , 137:73–83, 2009.
6[BW 05] Andreas O. Bender and Olivier Wittenberg. A potential analogue of Schinzel’s hypothesis for polynomials with coefficients in 𝔽 q [ t ] subscript 𝔽 𝑞 delimited-[] 𝑡 {\mathbb{F}}_{q}[t] . Int. Math. Res. Not. , (36):2237–2248, 2005.
7[CTS 82] Jean-Louis Colliot-Thélène and Jean-Jacques Sansuc. Sur le principe de Hasse et l’approximation faible, et sur une hypothèse de Schinzel. Acta Arith. , 41:33–53, 1982.
8[Dèb 99] Pierre Dèbes. Density results for Hilbert subsets. Indian J. Pure Appl. Math. , 30(1):109–127, 1999.