Dynamically distinguishing polynomials

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. We say a subset of $\mathbb{Z}[x]$ is dynamically distinguishable mod $p$ if the associated mod $p$ dynamical systems are pairwise non-isomorphic. For any $k,M\in\mathbb{Z}_{>1}$, we prove that there are infinitely many sets of integers $\mathcal{M}$ of size $M$ such that $\left\{ x^k+m\mid m\in\mathcal{M}\right\}$ is dynamically distinguishable mod $p$ for most $p$ (in the sense of natural density). Our proof uses the Galois theory of dynatomic polynomials largely developed by Morton, who proved that the Galois groups of these polynomials are often isomorphic to a particular family of wreath products. In the course of proving our result, we generalize Morton's work and compute statistics of these wreath products.

In this paper, we study the suggestion of Konyagin et al. [14] "in reverse"; that is, we fix (integer polynomial) maps and then vary the set upon which they act by reducing these polynomials modulo rational primes. Before stating our results, we introduce a bit of notation. Denote the set of rational primes by P. For f ∈ Z[x] and p ∈ P, write • f p for the polynomial in F p [x] obtained by reducing the coefficients of f mod p and • f,p for F p , [f ] p .
We say that a set F ⊆ Z[x] is dynamically distinguishable mod p if f,p g,p for all f, g ∈ F with f = g. Let μ be the natural density on P; that is, for any subset P ⊆ P, μ (P) := lim X→∞ |{p ∈ P | p ≤ X and p ∈ P}| |{p ∈ P | p ≤ X}| (if this limit exists).
In Sect. 4, we prove the following theorem.
Establishing the truth of the suggestion of Konyagin et al. [14] mentioned above would immediately produce the k = 2 case of Theorem 1.1 as a weaker corollary. For any f, g ∈ Z[x] and p ∈ P, the dynamical systems [f ] p , F p and [g] p , F p are isomorphic in the category of dynamical systems on the set F p if and only if f and g are dynamically indistinguishable mod p. In more generality, for any set S and set maps f, g : S → S, note that (S, f ) (S, g) if and only if there exists a bijective set map ϕ : S → S such that ϕ • f = g • ϕ. In many settings, researchers study subcategories of the category of dynamical systems on the set S by insisting that the maps f, g, and ϕ belong to the set of morphisms in an appropriate category containing S as an object. For example, suppose K is a field, S = P 1 (K ), and f, g : S → S are rational functions. Then in the subcategory of dynamical systems of P 1 (K ), with the self-maps of P 1 (K ) restricted to rational maps, the dynamical systems (P 1 (K ), f ) and (P 1 (K ), g) are isomorphic if and only if there exists a Möbius transformation ϕ such that ϕ • f = g • ϕ. Fixing an integer d ∈ Z >1 , setting F to be rational functions of degree d, and studying M P 1 (K ), F lead to an interesting moduli space problem, one studied by Silverman [26] using geometric invariant theory. See [3,8,17] for further work on this problem and extensions of it.
To prove Theorem 1.1, we will distinguish dynamical systems by their periodic points.
If (S, f ) is a dynamical system, let f n = ( n times f • · · · • f ) for any n ∈ Z >0 . If s ∈ S has the property that there is some n ∈ Z >0 with f n (s) = s, we say that s is periodic or a periodic point of (S, f ). The smallest such n is the period of s. As is standard, we will also refer to points of period one as fixed points. Points of period n are precisely those that lie in cycles of length n in the graph (S, f ). Periodic points are a classical object of study in discrete dynamical systems over C, going back at least to work of Fatou [9,10] and Julia [13] in the early twentieth century. Recently there has been much work on statistics of periodic points in families of dynamical systems over finite fields, partially motivated by an attempt started by Bach [1] to make rigorous the heuristic assumptions in Pollard's "rho method" for integer factorization [23]. For example, in [11], Flynn and Garton prove that for the family of polynomials in F q [x] of a fixed degree d, the average number of cycles in their associated functional graphs is at least 1 2 log q − 4, as long as d ≥ √ q. More recently, Bellah et al. [4] develop a heuristic that implies that this average is 1 2 log q + O(1) for any d. Burnette and Schmutz [6] prove, for this same family of polynomials, that if d = o √ q as d, q → ∞, then the average "ultimate period" of the associated functional graphs is at (1)). Our proof of Theorem 1.1 relies on the trivial observation that for any n ∈ Z >0 , if one directed graph has a cycle of length n and another does not, then the graphs are not isomorphic. As an illustration of our approach, consider the following example. Example 1.2 Let f = x 2 + 1 and g = x 2 + 2. If p ∈ P, then f,p has a point of period one if and only if there exists α ∈ F p such that Now, such an α exists if and only if the prime ideal (p) ⊆ Z splits (or ramifies) in the splitting field of f (x) − x = x 2 − x + 1 (over Q). Similarly, g,p has a fixed point if and only if (p) splits (or ramifies) in the splitting field of g(x) − x. Let K f and K g be the splitting fields of f (x) − x and g(x) − x, respectively. The Frobenius Density Theorem implies that the natural density of primes that split in K f and K g is the proportion of their Galois groups that fix a root of the polynomials whose roots we adjoin (that is, a root of f (x) − x and g(x) − x, respectively). Since Gal K f /Q Gal K g /Q Z/2Z, the natural density of primes that split in these fields is 1 2 . Moreover, since K f and K g are linearly disjoint, we know that Gal K f K g /Q Z/2Z × Z/2Z; thus, when we apply the theorem to the , we see that the splitting behavior of prime ideals in these two fields is independent. That is, The goal of this paper is to generalize this argument to points of period greater than one. However, to produce polynomials in Z[x] and apply the Frobenius density theorem, as in Example 1.2, we must prove several theorems to overcome various obstacles. Before describing them, we introduce the notational conventions we will use throughout the rest of the paper. If F is a field and f ∈ F [x], we will write Gal(f /F ) to denote the Galois group of the splitting field of f over F . Additionally, if F is a finite subset of F [x], say with splitting fields K f f ∈F , then we will write f ∈F K f for the splitting field of f ∈F f . (Of course, if we choose an algebraic closure of F , then f ∈F K f is isomorphic to the compositum of the images of the embeddings of the K f s in that algebraic closure.) Similarly, for any family of groups G, we will write G∈G G for their direct product. (If G = {G 1 , . . . , G n } for a positive integer n, we will write G 1 ×· · ·×G n for this group, and if there is some group G such that G i = G for all i ∈ {1, . . . , n}, we will write G n .) The following fact, which we will use often, relates these conventions: If F is a field and F is finite subset of F [x], say with splitting fields K f f ∈F , then the members of K f f ∈F are pairwise F -linearly disjoint if and only if Now, if G is a group and S r is the symmetric group on r letters, we write G S r to mean the wreath product G {1,...,r} S r . That is, G S r = G r S r , where S r acts on G r by permuting coordinates. In particular, we note that |G S r | = r!|G| r . See [12,Chap. 3A] for background on the wreath product. (In Sect. 3, we introduce and analyze the aspects of the wreath product that we require for this paper.) With these notations in hand, we can now describe the path to generalizing Example 1.2.
To generalize the argument of Example 1.2, we review the famous "dynatomic polynomials of f " in Sect. 2, which we will denote by f,n for any n ∈ Z >0 . These polynomials have the property that for any n ∈ Z >0 , every point of period . When K is the rational function field Q(c), Morton [19,Theorem D] proved that if f (x) = x k + c for some k ∈ Z >1 , then for any n, n ∈ Z >0 with n = n , the splitting fields of f,n and f,n are linearly disjoint. In Theorem 2.3, we generalize Morton's theorem to prove that for any k, M, N ∈ Z >1 , there exist infinitely many sets of integers M of size M such that for any f, g ∈ x k + (c + m) | m ∈ M ⊆ Q(c)[x] and n, n with n, n ≤ N , the splitting fields of f,n and g,n are linearly disjoint. We point out that this includes the case where n = n , which is quite important for our applications. • In Example 1.2, we set f (x) = x 2 + 1 and applied the Frobenius density theorem to Gal f,1 /Q Z/2Z. In general, the Galois groups of dynatomic polynomials are quite often wreath products of the form Z/nZ S r for n, r ∈ Z >0 . To apply the Frobenius density theorem, we must study the action of these wreath products on the roots of dynatomic polynomials. In Theorem 3.5, we prove that for any n, r ∈ Z >0 , the proportion of the group Z/nZ S r (considered with its natural action on Z/nZ × {1, . . . , r}) that acts with a fixed point is approximately 1 − e − 1 n . • In Example 1.2, with f (x) = x 2 +1, we used the fact that for any p ∈ P, the polynomial f (x) − x p has a root if and only if F p , [f ] p has a fixed point. Unfortunately, the picture is not quite so clear for points of period greater than one. For example, if we let g(x) = x 2 + 3, then g,2 5 has exactly one root (with multiplicity two), which happens to have period one in (F 5 , [g] 5 ). In Corollary 4.3, we provide a sufficient condition on f ∈ Z[x] and n ∈ Z >0 that ensures that f,n p has a root in F p if and only if F p , [f ] p has a point of period n for all but finitely many primes p. • Finally, in Sect. 4, we apply the Hilbert irreducibility theorem to the polynomials produced in Theorem 2.3 to prove Theorem 1.1.

Galois groups of dynatomic polynomials
As we intend to distinguish dynamical systems by analyzing their periodic points, we will make use of the theory of dynatomic polynomials (and their Galois groups). See [18,19,21] (and the correction in [20]), and [27,Chap. 4.1] for background in this area. We sketch an introduction, focusing on the aspects of the theory we will use in our results. Let K be a field, f ∈ K [x], and n ∈ Z >0 . The points of period n of the dynamical system (K, f ) are certainly roots of the polynomial f n (x) − x. However, if d ∈ Z >0 and d | n, then this polynomial vanishes on points of period d as well (e.g., if α ∈ K is a fixed point of (K, f ), i.e., f (α) = α, then f n (α) = α for all n ∈ Z >0 ). In an attempt to sieve out the points of lower period, one defines the nth dynatomic polynomial of f for any n ∈ Z >0 : follows quickly by applying the Möbius inversion formula. As usual, we omit "K " from the notation " f,n "; we will always specify the set of coefficients of f , so that the field K will be clear from context. As indicated by its name, the nth dynatomic polynomial is analogous to the nth cyclotomic polynomial, which vanishes precisely on primitive nth roots of unity. (As mentioned in the discussion following Example 1.2, it turns out that f,n may occasionally vanish on points of period d for d < n: see [27,Example 4.2]. In Corollary 4.3, we address this inconvenience.) We should mention that it is not a priori obvious that f,n is a polynomial. See [21, Theorem 2.5] for a proof that f, The degrees of certain dynatomic polynomials will be important quantities in many computations that follow, so we introduce the following notation.

Definition 2.1
For any n ∈ Z >0 and k ∈ Z >1 , let As mentioned in Example 1.2, our proof of Theorem 1.1 relies in part on the knowledge of the structure of the Galois groups of f,n , where n ∈ Z >0 and f (x) = x k + m ∈ Z[x] for k ∈ Z >1 and m ∈ Z. Moreover, we must find arbitrarily large finite sets of polynomials of this form that have the property that the splitting fields of their dynatomic polynomials are linearly disjoint. For a specific polynomial f ∈ Z[x] of this form and any large n, it is difficult to compute the Galois group of f,n , since the degree of f,n is so large, but-thanks to work of Morton [19, Theorem D]-the Galois groups of f,n for f ( are known. The remainder of this section addresses the question of linear disjointness in the function field setting.
We will need the following elementary lemma of field theory.

Lemma 2.2 Let K be a field and let
be an irreducible polynomial, and let f σ be the polynomial in K [x] obtained by applying σ to each of the coefficients of f . Let L, L σ be the splitting fields of f, f σ , respectively. Then L and L σ are isomorphic as fields.
In particular,

is the fraction field of a Dedekind domain and p is a prime of K , then
p ramifies in L if and only if σ (p) ramifies in L σ .
Proof Let K be an algebraic closure of K containing both L and L σ . Then we can extend σ ∈ Aut(K ) to some automorphism σ ∈ Aut(K ) [16,Theorem V.2.2.8]. It is easy to see that σ furnishes a one-to-one correspondence between the roots of f and the roots of f σ ; thus σ | L : L → L σ is an isomorphism. Statement (1) follows immediately, and the map from Gal(L/K ) to Gal(L σ /K ) is given by For (2), if the prime p of K ramifies in L, there is a prime q of L with e(q/p) > 1, and Replacing σ by its inverse shows that the converse holds as well.
For the rest of this section, we will work with polynomials f (x) ∈ Q(c) [x]. For any n ∈ Z >0 , let • f,n denote the splitting field of f,n , and • K f,n denote the splitting field of f n (x) − x.
These splitting fields will be defined over Q(c) or Q(c), depending on context. There should be no ambiguity about which definition is intended. Note that in either case, K f,n is the compositum of the fields f,d for all positive integers d dividing n.
The next theorem generalizes the first part of Theorem D in [19].

Theorem 2.3 Let k ≥ 2 be an integer and f
Proof Following the proof of Theorem 10 in [19], for any n ∈ Z >0 , there exists a polynomial The roots of δ n (x) are the roots of the hyperbolic components of the degree-k Multibrot set, which is the famous Mandelbrot set when k = 2. It is a consequence of the structure of the Multibrot set that δ n (x) and δ d (x) have no roots in common if d = n. (Closures of hyperbolic components of different periods may only intersect at a root of the component of higher period, see [5,24].) For any m ∈ Z, consider the unique σ ∈ Aut(Q(c)/Q) defined by σ (c) = c + m. Then f + m = f σ in the notation of Lemma 2.2, so the primes that ramify in f +m,n have the form With the above facts in mind, let R be the (finite) set Recall that for any m ∈ Q and n ∈ Z >0 , we have K f +m,n = d|n f +m,d . Thus By our choice of the m i s, these two fields have no finite ramified primes in common, so they are linearly disjoint over Q(c). Therefore the fields K f +m 1 ,N , . . . , K f +m M ,N are linearly disjoint over Q(c). The result now follows by elementary Galois theory.
The corollary below follows immediately from Theorem 2.3 and by work of Morton. It will be crucial in the proof of Theorem 1.1.

Corollary 2.4 Keep the same hypotheses as Theorem 2.3, and for any
Then there exist infinitely many m ∈ Z M such that • any field in F (m) is linearly disjoint from the compositum of the others, (Recall that dr k (d) is the degree of the dth dynatomic polynomial of f (x), see Definition 2.1.) Proof Theorem 9 in [19] shows that f (x) = x k + c ∈ Q(c)[x] satisfies the assumptions of Theorem B in the same paper, which proves that for any n ∈ Z >0 , both Gal( f,n /Q(c)) and Gal( f,n /Q(c)) are isomorphic to Z/dZ S r k (d) . Applying Lemma 2.2, with σ : c → c + m, we see that the same is true of the Galois group of f +m,n for any m ∈ Q.

Fixed-point proportions in wreath products
In this section, we analyze some statistics of a certain family of wreath products. As these groups appear as Galois groups of dynatomic polynomials, these statistics are a vital component of our proof of Theorem 1.1. We begin with some definitions.
Suppose that n, r ∈ Z >0 . Recall the definition of Z/nZ S r from the end of Sect. 1. Let  B(n, r) denote Z/nZ × {1, . . . , r}. The group Z/nZ S r acts on the set B(n, r); concretely, for any σ = ((a 1 , . . . , a r ) , π) ∈ Z/nZ S r , this action is For any σ ∈ Z/nZ S r , define In many cases, this action matches the action of the Galois groups of dynatomic polynomials on the roots of those polynomials, so we make the following definition. Definition 3.1 For any k ∈ Z >1 and n ∈ Z >0 , let P k (n) = P r k (n),n , where r k (n) = d|n k d μ n d as in Definition 2.1.

Remark 3.2
When we apply the results of this section in the proof of Theorem 1.1, the groups Z/nZ S r k (n) will be isomorphic to the groups Gal( f,n /Q) in a setting where f ∈ Z[x] and the roots of f,n are exactly the nr k (n) points of period n in Q, f . In this setting, we can identify B (n, r k (n)) with the union of the r k (n) cycles of length n in (Q, f ) in such a way that the permutation action of Gal f,n /Q on the roots of f,n is precisely the action of Z/nZ S r k (n) on B(n, r) described above (see Sect. 4 of [21] for details). In particular, in the proof of Theorem 1.1, we will exploit the fact that for the polynomials f ∈ Z[x] and integers n ∈ Z >0 under consideration. Now, the Galois groups in the conclusion of Corollary 2.4 are isomorphic to direct sums of the wreath products defined above. With this in mind, we need a bit more notation before proceeding-notation whose purpose will become clear in the proof of Theorem 1.1.
If G, H are groups acting on sets B, C, say with actions G , H , respectively, define the product action of G × H on B × C to be the action Suppose k ∈ Z >1 and let A = (b i ) i∈Z >0 be any increasing arithmetic progression of positive integers. For any i ∈ Z >0 , define so that W A,i acts on B A,i with the product action defined above. Next, for any n ∈ Z >0 , let W A (n) = W A,1 × · · · × W A,n and B A (n) = B 1 × · · · × B n ; once again, W A (n) acts on B A (n) with the product action induced from the action of the W A,i s on the B A,i s. In the proof of Theorem 1.1, we require knowledge of the proportion of these groups that act with a fixed point. To begin specifying the quantity we need, we first set, for any i ∈ {1, . . . , n}, The main technical result of this section is Corollary 3.3, which exhibits a recurrence relation on the terms of sequences of the form s A,n and computes the limit of this sequence; the recurrence relation uses the quantities P k (b), for b ∈ A-these quantities were defined in Definition 3.1. We defer the proof until the end of the section, after establishing some estimates on fixed-point proportions in wreath products.

Corollary 3.3
If k ∈ Z >1 and A = (b i ) i∈Z >0 is any increasing arithmetic progression of positive integers, then for any n ∈ Z >0 , Moreover, lim n→∞ s A,n = 1.
We turn to computing P r,k for general r ∈ Z >0 and k ∈ Z >1 . To do so, we recall the rencontres numbers from combinatorics. For any r ∈ Z >0 and i ∈ {0, . . . , r}, we will denote the (r, i)th rencontres number by D r,i ; that is, D r,i is the number of permutations of {1, . . . , r} with exactly i fixed points. In particular, the number of derangements of {1, . . . , r} is D r,0 . For convenience, we set D 0,0 = 1. We now record some basic identities involving rencontres numbers, which we will use in the proof of Theorem 3.5.

Lemma 3.4 For all i, r
Proof For (1), note that a permutation of {1, . . . , r} with precisely i fixed points is completely determined by choosing its i fixed points and specifying its action on the r − i remaining non-fixed points. For (2), observe that r i=0 D r,i = |S r | = r!, as each permutation in S r contributes to exactly one term in the sum, then apply (1).
We now prove an important estimate on P r,n for all wreath products defined above (that is, a larger class of wreath products than those which arise as Galois groups of dynatomic polynomials).
Using Lemma 3.4, we see that Thus, Using the Taylor expansion of e x evaluated at x = 1 − 1 n , we see that Finally, we use the well-known fact that i! e − 1 < D i,0 < i! e + 1 to conclude We record a simple bound we will use in our study of fixed-point proportions. The goal is to prove that P k (n)(1 − P k (n)) is close enough to 1 n to satisfy the hypotheses of Lemma 3.7, so the exact error bound does not matter much.
Proof Using Theorem 3.5, we see that Writing the Taylor series of e x (1 − e x ) shows so by the triangle inequality, Since 0 < P k (n) (1 − P k (n)) < 1 4 , we know that P k (n) (1 − P k (n)) − 1 n < 1 for all n; in particular, the statement is true for all n ≤ 11. Thus, we may assume that n ≥ 12. This implies immediately that r k (n) > k n−1 n > 7 and k n−1 > n 3 . Next, we note that Putting these estimates together, we obtain 3 · 1 + 2 r k (n) (r k (n))! < 1 r k (n) < n k n−1 < 1 n 2 when n ≥ 12.
So for all such n, we conclude that Before proving the corollary we will use in the proof of Theorem 1.1, we prove a short lemma about a certain class of recurrence relations. Lemma 3.7 Suppose (a n ) n∈Z >0 is a sequence of real numbers that satisfies ∞ n=1 a n = ∞, lim n→∞ a n = 0, and a n ∈ [0, 1] for all n ∈ Z >0 .
Proof A short induction argument shows that (t n ) is non-decreasing and bounded above by 1. So (t n ) converges; suppose for a contradiction that it converges to L ∈ [0, 1). Note that t n − t n−1 = a n (1 − t n−1 ) ≥ a n (1 − L).
Summing both sides of this inequality over all n ∈ Z ≥0 yields the contradiction lim n→∞ (t n − t 0 ) = ∞.
Putting together the results in this section, we can now prove Corollary 3.3.

Proof of Corollary 3.3
Recall that W A (n) = W A,1 × · · · × W A,n , that C A,i (n) = ((σ 1 , τ 1 ), . . . , (σ n , τ n )) ∈ W A (n) | exactly one of Fix σ i , Fix τ i is empty , and that s A,n is defined by s A,0 = 0 and Thus, the sequence s A,n satisfies the recurrence relation Since 0 < P k (b n ) < 1 for all n, we note that 0 < 2P k (b n ) (1 − P k (b n )) < 1 for all n as well. Setting a n = 2P k (b n ) (1 − P k (b n )), Theorem 3.6 implies that (a n ) satisfies the hypotheses of Lemma 3.7, which we apply to conclude the proof.

Applying the Hilbert Irreducibility and the Frobenius Density Theorems
In this section, for any polynomial f (c, x) ∈ Q[c][x] and any a ∈ Q, we will write f a for the specialization of f at c = a; that is, Below is a version of the Hilbert irreducibility theorem, one which we will apply in the proof of Theorem 1.1.
, let K be the splitting field of f (c, x) over Q(c), and for any a ∈ Z, let K a be the splitting field of f a over Q. Suppose that f (c, x) has no repeated roots (in Q(c)). Then there exists a "thin set" A ⊂ Z such that for all a ∈ Z \ A, f a has no repeated roots and Gal (K a /Q) Gal (K /Q(c)).

Remark 4.1
The Hilbert irreducibility theorem is normally stated for irreducible polynomials (as in [25]). To obtain the version stated above, let g(c, x) be the minimal polynomial of a primitive element of K /Q(c), which is irreducible over Q(c). Then specialize g(c, x) instead of f (c, x). Moreover, if f (c, x) has no repeated roots in Q(c), then there are only finitely many a ∈ Q for which f a (x) has a repeated root in Q (these are precisely the a for which the discriminant Disc f (c, x) vanishes under the specialization at c = a). For more on the connection between the Hilbert irreducibility theorem and Galois theory, see, for example, [7], [15,Chap. VIII], and [30,Chap. 1].
As for the size of the "thin set" A, we know there is some constant C such that for all [25,Sect. 9.7], for more details). In particular, there are infinitely many integers for which the conclusion of the theorem is true.
Next, we recall a case of the Frobenius density theorem (See [28] for more details). are probabilistically independent (in the sense that μ P f ∩ P g = μ P f · μ P g ) if and only if the splitting fields of f and g are linearly disjoint over Q. This follows immediately from the fact that the Galois group of a compositum of fields is the direct product of the Galois groups if and only if the fields are linearly disjoint.

Frobenius
In light of the Frobenius density theorem, one might hope that given f ∈ Z[x] and p ∈ P, the roots of f,n p are precisely the points of F p , [f ] p of period n, but-as mentioned in Sect. 1-this hope would be in vain. Indeed, even before reducing mod p, if α ∈ Q is a point of period n in Q, f , then f,n (α) = 0, but the converse is not always true-that is, there are examples of (K, f ), n, α, and d, where d < n, α is a point of period d, but period d for some d ≤ n, and d < n is possible only if the polynomial derivative of f d evaluated at α is a root of unity; this quantity is known as the multiplier of α. The way in which the period depends on the multiplier is the content of the following theorem [27,Theorem 4.5].
Roots and multipliers theorem. Suppose that K is a field, f ∈ K [x], n ∈ Z >0 , and α ∈ K satisfies f,n (α) = 0. Let λ = (f m ) (α) where m is the (least) period of α. Then either n = mj, when λ is a primitive jth root of unity, or (3) n = mjp e , with e ∈ Z >0 , when λ is a primitive jth root of unity and char K = p > 0.
Luckily, given f ∈ Z[x] and n ∈ Z >0 , the following corollary provides a sufficient condition that ensures that for all but finitely many primes p ∈ P, the dynamical system F p , [f ] p has a point of period n if and only if f,n p has a root. In the proof of Theorem 1.1, we will use the work in Sect. 2 to ensure that the polynomials obtained by applying the Hilbert irreducibility theorem satisfy this sufficient condition. As usual, for any α ∈ Q and p ∈ P, we say p divides α if there exists a number field K containing α and a prime ideal p ⊆ O K such that p | (p) and ord p (α) > 0.
Let p ∈ P, and suppose that f,n p has a root. Let K be the splitting field of f,n , choose any prime p lying over p, and denote by · the reduction O K → O K /p. Since O K /p is an extension of F p and f,n p has a root, there exists a ∈ Z ⊆ O K such that f,n p (a) = 0. Since f,n splits in K , we know that f,n p splits in O K /p and the roots of f,n map onto the roots of f,n p under ·; choose any α ∈ K such that f,n (α) = 0 and α = a. Now, by the roots and multipliers theorem, we know that a is a periodic point of F p , [f ] p of period at most n; let us suppose its period is strictly less than n (so in particular, n > 1). This implies that there exists j ∈ {1, . . . , n − 1} such that We know that α has period n in (K, f )  for all i ∈ Z >0 . By Corollary 3.3, for each choice of J we know s A J ,i → 1 as i → ∞. Thus, there exists N 0 ∈ Z >0 such that s A J ,N 0 > 1− t for all J ∈ T . Let N = (tN 0 )! and set f = x k +c ∈ Q(c)[x], so that for any a ∈ Z, f a = x k + a ∈ Z[x]. Next, let where f a ,d is the splitting field of f a ,d over Q. By Theorem D of [19], we know that f N (x) − x has no repeated roots in Q(c), so by Lemma 2.2, for any m ∈ Z, we see that (f + m) N  We will prove that for any such (m 1 , . . . , m M ), To begin, fix such an M-tuple (m 1 , . . . , m M ). We introduce a bit of simplifying notation. For any J = j, j ∈ T , we will compare those x k +m j ,i , x k +m j ,i for i in the truncated arithmetic progression (β(J ) + t(i − 1) | i ∈ {1, . . . , N 0 }). To make this analysis more convenient, for any J ∈ T and j ∈ J , write J,j,i = x k +m j ,β(J )+t(i−1) .
Using this notation, we can define for any J ∈ T : Next, we introduce the sets of primes whose natural densities we will compute; namely, for any J ∈ T and i ∈ {1, . . . , N 0 }, define P J,i = {p ∈ P | exactly one of { x k +m j ,p | j ∈ J } has a (β(J ) + t(i − 1))-cycle}, P J,i = {p ∈ P | exactly one of {[ J,j,i ] p | j ∈ J } has a root in F p }.
As we will compare these sets to proportions of Galois groups, we define for any J ∈ T , C J = σ ∈ G J | for some i ∈ {1, . . . , N 0 } , σ fixes a root of exactly one of J,j,i | j ∈ J .
Now, set P J = N 0 i=1 P J,i and apply the Frobenius density theorem to J to see that Next, recall that Corollary 4.3 implies that for any J ∈ T and i ∈ {1, . . . , N 0 }, the symmetric difference of P J,i and P J,i is finite. Thus,