This paper investigates the distribution of integers related to the values of univariate polynomials, focusing on the asymptotic behavior of integers satisfying specific divisibility and valuation conditions involving prime sets and polynomial roots.
Contribution
It introduces a new measure called the $f$-normalized $S$-part and derives asymptotic formulas for the count of integers meeting certain polynomial-related inequalities, extending previous understanding of polynomial value distributions.
Findings
01
Asymptotic estimate for the count of integers with bounded size satisfying polynomial divisibility conditions.
02
Explicit asymptotic formula involving powers of B and logarithmic factors depending on the roots of the polynomial.
03
Conditions under which the asymptotic behavior simplifies to a constant multiple of a main term.
Abstract
Let S={p1β,β¦,psβ} be a finite non-empty set of distinct prime numbers, let fβZ[X] be a polynomial of degree nβ₯1, and let Sβ²βS be the subset of all pβS such that f has a root in Zpβ. For any non-zero integer y, write y=p1k1βββ¦psksββy0β, where k1β,β¦,ksβ are non-negative integers and y0β is an integer coprime to p1β,β¦,psβ. We define the f-normalized S-part of y by [y]f,Sβ:=p1k1βrp1β,Sβ(f)ββ¦psksβrpsβ,Sβ(f)β, with rp,Sβ(f)=1 if pβSβSβ² and rp,Sβ(f)=RSβ²β(f)/Rpβ(f) if pβSβ², where Rpβ(f) denotes the largest multiplicity of a root of f in Zpβ and RSβ²β(f):=maxpβSβ²βRpβ(f). For positive real numbers Ξ΅,B with Ξ΅<RSβ²β(f)/n, we consider the number N(f,S,Ξ΅,B) of integers x such thatβ¦
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.
Let S={p1β,β¦,psβ} be a finite non-empty set of distinct prime numbers, let fβZ[X] be a polynomial of degree nβ₯1, and let Sβ²βS be the subset of all pβS such that f has a root in Zpβ. For any non-zero integer y, write y=p1k1βββ¦psksββy0β, where k1β,β¦,ksβ are non-negative integers and y0β is an integer coprime to p1β,β¦,psβ. We define the f-normalized S-part of y by [y]f,Sβ:=p1k1βrp1β,Sβ(f)ββ¦psksβrpsβ,Sβ(f)β, with rp,Sβ(f)=1 if pβSβSβ² and rp,Sβ(f)=RSβ²β(f)/Rpβ(f) if pβSβ², where Rpβ(f) denotes the largest multiplicity of a root of f in Zpβ and RSβ²β(f):=maxpβSβ²βRpβ(f). For positive real numbers Ξ΅,B with Ξ΅<RSβ²β(f)/n, we consider the number N(f,S,Ξ΅,B) of integers x such that β£xβ£β€B and 0<β£f(x)β£Ξ΅β€[f(x)]f,Sβ. We prove that if sβ²:=#Sβ²β₯1, then N(f,S,Ξ΅,B)βf,S,Ξ΅βB1β(nΞ΅)/RSβ²β(f)(logB)sβ²β1 as Bββ. Moreover, if f
has no multiple roots in Zpβ for any pβSβ² and sβ²:=#Sβ²β₯2, then there exists a constant C(f,S,Ξ΅)>0 such that N(f,S,Ξ΅,B)βΌC(f,S,Ξ΅)B1βnΞ΅(logB)sβ²β1 as Bββ.
Let S be a finite non-empty set of primes. For any non-zero integer y, let
[TABLE]
be the prime factorization of β£yβ£, where p runs over the set of all prime numbers. The S-part of y is defined by
[TABLE]
Motivated by previous work of Gross and Vincent ([History]), Bugeaud, Evertse and GyΕry proved in [Preprint] that if fβZ[X] is a polynomial of degree nβ₯1 without multiple roots, then for any Ξ΄>0 and any xβZ with f(x)ξ =0 one has
[TABLE]
Furthermore, the exponent 1/n is the best possible, in the sense that there exist infinitely many primes p and infinitely many xβZ such that
[TABLE]
If Ξ΅β(0,1/n), then the set of integers x such that
[TABLE]
is infinite as soon as f has a root in Zpβ for some pβS. More precisely, the following result for the asymptotic rate of the quantity
[TABLE]
as Bββ holds.
Theorem A** ([Preprint]*Theorem 2.3).**
Let f(X)βZ[X] be a polynomial of degree nβ₯1 without multiple roots, let S be a finite set of primes, and let Sβ²βS be the subset of all pβS such that f has a root in Zpβ.
Suppose that sβ²:=#Sβ²β₯1. Then, for any Ξ΅β(0,1/n) one has
[TABLE]
Such result of Bugeaud, Evertse and GyΕry is where the motivation for the present paper is to be found.
The first main result of this paper appears already (in a slightly less general formulation) in the authorβs masterβs thesis [Thesis], and it says that under the assumptions of theorem A an exact asymptotics for N(f,S,Ξ΅,B) as Bββ is possible if and only if sβ²β₯2.
Theorem I**.**
Let f(X)βZ[X] be a polynomial of degree nβ₯1, and let Ξ΅β(0,1/n). Also, let S be a finite set of primes, and let Sβ²βS be the subset of all pβS such that f has a root in Zpβ. Suppose that f does not have multiple roots in Zpβ for any pβSβ². We denote sβ²:=#Sβ². If sβ²β₯2, then there exists a constant C(f,S,Ξ΅)>0 such that
[TABLE]
If sβ²=1, then N(f,S,Ξ΅,B)βf,S,Ξ΅βB1βnΞ΅ as Bββ, but an exact asymptotics is not possible.
Going through the proof of theorem A in [Preprint], it is not difficult to realize that the polynomial factor and the logarithmic factor in the asymptotic rate of N(f,S,Ξ΅,B) as Bββ have a very different nature. If Sβ²={p}, then the rate of N(f,S,Ξ΅,B) as Bββ is polynomial with exponent independent of the specific prime p, fact that is intimately related to the existence of an elementary asymptotic rate for N(f,S,Ξ΅,B) as Bββ in the case #Sβ²β₯2. If Sβ²={p1β,β¦,psβ²β} with sβ²:=#Sβ²β₯2, then the logarithmic term that appears in the rate encodes information about the distribution of the numbers p1k1βββ¦psβ²ksβ²ββ((k1β,β¦,ksβ²β)βZβ₯0sβ²β) over the positive real line.
If we allow the polynomial f(X)βZ[X] to have multiple roots in Zpβ, then we can prove that in the case Sβ²={p} one has
[TABLE]
where Rpβ(f) denotes the largest multiplicity of a root of f in Zpβ.
The rate in (1.2) suggests that, in order to get an elementary asymptotic rate for N(f,S,Ξ΅,B) as Bββ when #Sβ²β₯2, we need to require that the value Rpβ(f) be the same for all pβSβ², in which case we say that S is f-balanced. The asymptotic rate of N(f,S,Ξ΅,B) as Bββ under this condition is a special case of our second main result.
For f, S and Sβ² as above, we introduce the notation
[TABLE]
and for any pβS,
[TABLE]
The f-normalized S-part of a non-zero integer y is defined by
[TABLE]
The second main result of this paper, the proof of which is given in section 4 below, concerns the asymptotic rate of the quantity
[TABLE]
as Bββ.
Theorem II**.**
Let f(X)βZ[X] be a polynomial of degree nβ₯1. Let S be a finite set of primes, and let Sβ²βS be the subset of all pβS such that f has a root in Zpβ.
Suppose that sβ²:=#Sβ²β₯1. Then, for any Ξ΅β(0,RSβ²β(f)/n) one has
[TABLE]
Definitions (1.1) and (1.4) agree precisely when S is f-balanced, in which case theorem II provides the asymptotic rate of N(f,S,Ξ΅,B) as Bββ. The condition of S being f-balanced is trivially satisfied when sβ²=1 (which yields (1.2)) or when f has no multiple roots (which recovers theorem A). Another remarkable case is when for all the primes p in Sβ² one has that p splits completely in a splitting field K of f over Q and that deg(fmodp)=degf. Since in this case K embeds in Qpβ for all pβSβ², all the roots of f in Cpβ are Qpβ-rational, hence in Zpβ (because of the condition on the degree of the reduction of f modulo p), for all pβSβ². Theorem II implies, therefore, the following corollary.
Corollary**.**
Let f(X)βZ[X] be a polynomial of degree nβ₯1 with splitting field K over Q and leading coefficient cfβ, let S be a finite set of primes, and let Sβ²βS be the subset of all pβS such that f has a root in Zpβ. Suppose that sβ²:=#Sβ²β₯1 and that all pβSβ² split completely in K and do not divide cfβ. Then, for any Ξ΅β(0,R(f)/n) one has
[TABLE]
where R(f) denotes the largest multiplicity of a root of f in K.
In the proofs of theorems I and II, we make use of two main technical tools. The first one is a formula, which we derive in section 2, for the Igusa local zeta functions of univariate polynomials. Such formula is, in fact, a special case of a formula given by Igusa in [Igusabook] (last formula of page 123). However, in the case of univariate polynomials lots of technicalities can be avoided, and a fairly explicit formula can be obtained by direct computation.
The second tool is a careful asymptotic analysis of power sums indexed over sets of the form
[TABLE]
where Ξ£={q1β,β¦,qsβ} is a non-empty Q-multiplicatively independent subset of R>1β (i.e. {logq1β,β¦,logqsβ} is a Q-linearly independent subset of R>0β).
Section 3 is dedicated to the development of such tool. Modulo the omission, for the sake of brevity, of a few elementary details, the treatment is the same that can be found in sections 2.1β2.3 of the authorβs masterβs thesis [Thesis].
The techniques in this paper can be adapted to the similar problems considered in [Preprint] in the context of decomposable forms. This leads to significant improvements on the corresponding results in [Preprint]. We will present our results on decomposable forms in a subsequent paper.
2. Igusa local zeta functions of univariate polynomials
Let fβZpβ[X] be a polynomial of degree nβ₯1. We denote by ΞΌpβ the Haar probability measure on Zpβ (cf. [Koblitz]). The Igusa local zeta function of f is the holomorphic function on the right half plane defined by
[TABLE]
We know from [Igusabook]*Theorem 8.2.1 that ΞΆf,pβ has a meromorphic continuation to the whole complex plane as rational function of t=pβs. In this section, we recover, by direct computation, an explicit version of the formula given by Igusa in the proof of the above mention result.
For any kβZβ₯0β, we denote
[TABLE]
so that we get the identity
[TABLE]
Let us first consider the case in which f has no roots in Zpβ. Since the polynomial function f:ZpββZpβ is continuous, so is also the composition β£fβ£pβ:ZpββpZβ€0ββͺ{0}. This implies that the image of β£fβ£pβ is compact. On the other hand, since f has no zeros in Zpβ, the image of β£fβ£pβ is also contained in the discrete subset pZβ€0β, hence finite. We can then consider the maximum value of vpβ(f(x)) for x ranging Zpβ. Denoting such value by upβ(f), we get the identity
[TABLE]
on the right half s-plane, which provides a holomorphic continuation of ΞΆf,pβ to C as a polynomial in t=pβs.
Suppose now that f has roots in Zpβ. Let Ξ±1β,β¦,Ξ±lβ(lβ₯1) be the list of distinct roots of f in Zpβ, of multiplicities r1β,β¦,rlβ respectively. Then we have the factorization
[TABLE]
for some polynomial gβZpβ[X] without zeros in Zpβ.
Consistently with the introduction, we denote Rpβ(f):=maxiβriβ. Moreover, we introduce the quantities Ξ»pβ(f) and apβ(f) in the following definition.
Definition 2.1**.**
Let f(X)βZpβ[X] be a polynomial factorizing as in (2.2).
(1)
We define the quantity Ξ»pβ(f) to be the smallest non-negative integer Ξ» such that
(a)
β£Ξ±iββΞ±jββ£pββ₯pβΞ»* for all i,jβ{1,β¦,l} with iξ =j, and*
2. (b)
β£g(y+Ξ±iβ)β£pβ=β£g(Ξ±iβ)β£pβ* for all iβ{1,β¦,l} and all yβZpβ with β£yβ£pβ<pβΞ».*
2. (2)
If xβWiβ, then we have x=Ξ±iβ+y for some yβW and thus
[TABLE]
by definition of Ξ»pβ(f) (and W).
It follows that
[TABLE]
where
[TABLE]
For the integral over Wβ², it is enough to note that for any xβWβ² one has β£xβΞ±iββ£β₯pβΞ»pβ(f)βiβ{1,β¦,l} and β£g(x)β£pββ₯pβupβ(g), hence
[TABLE]
Putting everything together, we arrive to the identity
[TABLE]
on the right half s-plane, where Upkβ²β(f) denotes the set of all x in Wβ² such that β£f(x)β£pβ=pβk and apβ²β(f):=apβ(f)βRpβ(f)+1β€apβ(f). This provides the desired meromorphic continuation of ΞΆf,pβ to C as a rational function of t=pβs.
(here ΞΆriββ denotes a primitive riβ-th root of unity).
The following proposition (cf. [AnalComb]*Theorem IV.9) is an immediate consequence of (2.3).
Proposition 2.2**.**
Let f(X)βZpβ[X] be a polynomial with lβ₯1 distinct roots in Zpβ. Then
(a)
for any integer kβ₯apβ(f)+1, one has
[TABLE]
2. (b)
for any iβ{1,β¦,l} such that riβ=Rpβ(f) and any integer kβ₯apβ(f)+1 with kβ‘kiβmodRpβ(f), one has
[TABLE]
3. (c)
in the case all the roots of f in Zpβ are simple, one has
[TABLE]
Proof.
Taking coefficients in (2.3), we see that for all kβ₯apβ(f)+1 one has
[TABLE]
where
[TABLE]
All the three claims follow immediately.
β
3. Power sums over NΞ£β
Let Ξ£={q1β,β¦,qsβ} be a non-empty Q-multiplicatively independent subset of R>1β. For each hβNΞ£β (cf. (1.5)), the numbers vq1ββ(h),β¦,vqsββ(h)βZβ₯0β are uniquely determined by the writing h=q1vq1ββ(h)ββ¦qsvqsββ(h)β.
In this section, we study the asymptotic behaviour as Lββ of power sums of the form
[TABLE]
where Ξ±βR>0β.
If Ξ£={q} for some qβR>1β, then these two sums are given, for all LβRβ₯1β, by the geometric sums
[TABLE]
and
[TABLE]
respectively.
Note that
[TABLE]
and
[TABLE]
but the sequences that realize the first liminf (e.g. Lmβ=qmβ1/m) are exactly the sequences which realize the second limsup and, conversely, the sequences that realize the second liminf (e.g. Lmβ=qm) are exactly the sequences which realize the first limsup.
We prove the following proposition for future purposes.
Proposition 3.1**.**
For any qβR>1β and any Ξ±,Ξ±β²βR>0β, one has
From the surjectivity of the map Rβ[0,1), Lβ¦{logqβL}, it follows that
[TABLE]
and
[TABLE]
where L:Rβ(0,β) is defined by
[TABLE]
The function L is convex, so it has a unique stationary point uββR, at which L assumes its global minimum over R. A straightforward computation shows that
[TABLE]
from which it follows that
[TABLE]
β
Let us now move to the case Ξ£={q1β,β¦,qsβ}, with sβ₯2. In this case, we want to show that the sums (3.1) admit exact asymptotics as Lββ.
Definition 3.2**.**
Let Ξ£={q1β,β¦,qsβ} be a Q-multiplicatively independent subset of R>1β, with sβ₯2. For any Ξ²βR>1β,tβZβ₯0β, we define
[TABLE]
If Ξ²=e, then we drop the superscript.
The following lemma is the key result in the proof of the claimed exact asymptotics.
Lemma 3.3**.**
Let Ξ£={q1β,β¦,qsβ} be a Q-multiplicatively independent subset of R>1β, with sβ₯2. Then, there exists a constant c(Ξ£)βR>0β such that for any Ξ²βR>1β one has
[TABLE]
Proof.
For any tβZβ₯0β, we can write MtΞ²β(Ξ£)=Bt+1Ξ²β(Ξ£)βBtΞ²β(Ξ£), where
[TABLE]
From [Beta]*Theorem 1, it follows that there exist constants cβ²(Ξ£),cβ²β²(Ξ£)βR>0β such that for any Ξ²βR>1β one has
[TABLE]
as tββ. The claim follows then with c(Ξ£):=cβ²(Ξ£)β s.
β
For any Ξ²>1, the regions MtΞ²β(tβZβ₯0β) give rise to a partition
[TABLE]
according to which we may split the power sums (3.1). The partition (3.4) becomes finer and finer as Ξ²β1+. The idea is then to estimate the summands, on each MtΞ²β(Ξ£), from below (resp. above) with the minimum (resp. the maximum) value they assume on MtΞ²β(Ξ£) (note that the ratio between these two values tends to 1 as Ξ²β1+). Combined with lemma 3.3, this provides lower and upper bounds on the sums (3.1), from which we deduce the asymptotic rates of the sums (3.1) as Lββ. The existence of the desired exact asymptotics can then be proved by taking the limit Ξ²β1+.
The above paragraph describes the strategy for the proof of proposition 3.5 below. The following elementary lemma from discrete calculus is going to be necessary as well.
Lemma 3.4**.**
Let Ξ²βR>1β,Ξ±βR>0β,rβZβ₯0β. Then
[TABLE]
Proof.
Both claims can be easily proved by induction on r, making use of the (discrete) summation by parts formula.
β
Proposition 3.5**.**
Let Ξ£={q1β,β¦,qsβ} be a Q-multiplicatively independent subset of R>1β, with sβ₯2. For any Ξ±βR>0β, one has
Estimating every hβNΞ£β such that logΞ²βhβMtΞ²β(Ξ£) (for any tβZβ₯0β) with Ξ²t from below and with Ξ²t+1 from above, lemma 3.4(a) yields
[TABLE]
[TABLE]
from which it follows that
[TABLE]
Similarly, one has
[TABLE]
and thus
[TABLE]
2. (b)
The proof follows exactly the same lines as (a), using 3.4(b) in place of 3.4(a).
β
In the rest of this section, we give an application of propositions 3.1 and 3.5. Proposition 3.7 below is an important intermediate step in the proofs of theorems I and II.
Let fβR[X] be a polynomial of degree nβ₯1. For any B,MβR>0β, we introduce the notation
[TABLE]
Let also Ξ³βR>0β, ΟβR<0β, Ξ΅β(0,β1/(Οn)), and let Ξ£={q1β,β¦,qsβ} (sβ₯1) be a Q-multiplicative independent subset of R>1β. Propositions 3.1 and 3.5, together with a careful use of the polynomial growth, provide a precise description of the asymptotic behaviour of the quantity
[TABLE]
as Bββ, where ΞΌββ denotes the Lebesgue measure on R.
In the case Ξ£={q}, we introduce the following auxiliary notation.
Definition 3.6**.**
For any nβZβ₯1β, ΟβR<0β, qβR>1β, Ξ΅β(0,β1/(Οn)), we denote
[TABLE]
Proposition 3.7**.**
Let fβR[X] be a polynomial of degree nβ₯1 and leading coefficient cfβ. Let also Ξ³βR>0β, ΟβR<0β, Ξ΅β(0,β1/(Οn)), and let Ξ£={q1β,β¦,qsβ}(sβ₯1) be a Q-multiplicative independent subset of R>1β.
(a)
If Ξ£={q}, then one has
[TABLE]
2. (b)
If sβ₯2, then
[TABLE]
as Bββ, where c(Ξ£) is the constant from lemma 3.3.
Proof.
For any Ξ΄β(0,1/2) there exists BΞ΄β>1 such that for all xβR with β£xβ£β₯BΞ΄β one has
Let fβZ[X] be a polynomial of degree nβ₯1, let S be a finite non-empty set of primes, and let Sβ²βS be the subset of all p in S such that f has a root in Zpβ.
The numbers rp,Sβ(f) (pβS) are defined as in (1.3). Let also Ξ΅β(0,RSβ²β(f)/n) and Ξ³,BβR>0β. Adjusting an idea from [LiuThesis], we interpret the set of integers x with β£xβ£β€B and 0<β£f(x)β£Ξ΅β€Ξ³β [f(x)]f,Sβ as the set of integer points in the subset
[TABLE]
of RΓZ, with Z embedded diagonally in RΓZ. Therefore
[TABLE]
For any hβNSβ, let Ahβ(f,S,Ξ΅,B,Ξ³)βA(f,S,Ξ΅,B,Ξ³) be the subset of all (xvβ)vβ in A(f,S,Ξ΅,B,Ξ³) such that β£f(xpβ)β£pβ=pβvpβ(h) for all pβS. These sets are all pluri-rectangles, because of the decomposition
[TABLE]
where
[TABLE]
Denoting by ΞΌ:=β¨vβΞΌvβ (v running over all places of Q) the product measure on RΓZ, we get thus
[TABLE]
for all hβNSβ.
For any hβNSβ, we can write h=h0βhβ² for some h0ββNSβSβ²β, hβ²βNSβ²β. It follows from (4.1) that Ahβ(f,S,Ξ΅,B,Ξ³)=β unless h0β is a divisor of
[TABLE]
This gives us the disjoint union decomposition
[TABLE]
Furthermore, we see from (4.2) that for any h0ββNSβSβ²β, hβ²βNSβ²β one has
The asymptotic rate of ΞΌ(A(f,S,Ξ΅,B,Ξ³)) as Bββ is obtained by combining the results from sections 2 and 3.
Proposition 4.1**.**
Let fβZ[X] be a polynomial of degree nβ₯1, let S be a finite non-empty set of primes, and let Sβ²βS be the subset of all p in S such that f has a root in Zpβ. Suppose that sβ²:=#Sβ²β₯1. Then, for any Ξ΅β(0,RSβ²β(f)/n) and any Ξ³βR>0β one has
[TABLE]
with implied constants independent of Ξ³.
Proof.
Because of the above discussion, we may assume S=Sβ² without loss of generality. From proposition 2.2 (points (a) and (b)), it follows that there exist constants C>0 and hββNSβ such that
[TABLE]
and
[TABLE]
where S:={pRpβ(f):pβS}.
Note that the rule hβ¦ΞΎfβ(h)1/RSβ(f) yields a bijection NSββNΞ£β, with Ξ£:={p1/Rpβ(f):pβS}. Together with (4.5), this tells us that
[TABLE]
Similarly, the fact that the rule hβ¦ΞΎfβ(h)1/RSβ(f) yields a bijection NSββNSβ, together with (4.6), give us
[TABLE]
The claim follows now directly from proposition 3.7.
β
In order to deduce theorem II from proposition 4.1, what is left to show is that the difference
[TABLE]
is negligible with respect to ΞΌ(A(f,S,Ξ΅,B,Ξ³)) as Bββ. In fact, in a similar fashion to the proof of [LiuThesis]*Proposition 1.4.6, we show that (4.7) is bounded from above by a power of logB as Bββ.
Lemma 4.2**.**
Let f(X)βR[X]. For any aβR and any Ξ»,B,MβR>0β, one has
[TABLE]
Proof.
Note that the set Vfβ(B,M) can be written as a disjoint union of Nβ€n+1 intervals I1β,β¦,INβ. Therefore
[TABLE]
β
Proposition 4.3**.**
Let fβZ[X] be a polynomial of degree nβ₯1, let S be a finite set of primes, and let Sβ² denote the subset of all pβS such that f has a root in Zpβ. Denote the cardinality of Sβ² by sβ². Then, one has
[TABLE]
with implied constant independent of Ξ΅ and Ξ³.
Proof.
Let K be a splitting field of f over Q and let
[TABLE]
be the factorization of f in K[X], where cβZξ =0β denotes the leading coefficient of f and Ξ±1β,β¦,Ξ±nβ are the (not necessarily distinct) roots of f in K.
Let now pβS, and let p be a prime of K above p. Since K is Galois over Q, the ramification index e(p/p) does not depend on the particular choice of p, so we can denote it by epβ without creating any confusion. We also denote by Ξ±pjβ the image of Ξ±jβ under the embedding KβͺKpβ, for any jβ{1,β¦,n}. Recall that if Ο is a local uniformizer parameter for Kpβ, then one has β£Οβ£pβ=p1/epβ (cf. [Neukirch]).
Let us fix hβNSβ for the moment, and let
J0β denote the set of all pairs (p,j) with pβS and jβ{1,β¦,n}. Moreover, we denote by Khβ(B) the subset of all tuples kβZJ0β such that the set
[TABLE]
is non-empty.
We get then the disjoint union of non-empty sets
[TABLE]
For any Ο=(Οpβ)pββSnSβ, we consider the subset KhΟβ(B)βKhβ(B) of all kβKhβ(B) with kpΟpβ(1)ββ€β―β€kpΟpβ(n)β for all pβS.
Pick (Οpβ)pββSnSβ such that KhΟβ(B)ξ =β , and let kβKhΟβ(B), (xvβ)vββVhβ(k;B). For some indexes 1=j1β<β―<jtββ€n, one has
[TABLE]
and
[TABLE]
For all lβ{1,β¦,tβ1} we have then β£xpββΞ±pΟpβ(jlβ)ββ£pβ>β£xpββΞ±pΟpβ(jl+1β)ββ£pβ, which implies
[TABLE]
This shows that the components
[TABLE]
of k are univocally determined by Ξ±p1β,β¦,Ξ±pnβ. On the other hand, from the condition
[TABLE]
we see that kpΟpβ(jtβ)β, hence the whole k, is univocally determined by Ξ±p1β,β¦,Ξ±pnβ as well.
It follows that
[TABLE]
and thus
[TABLE]
Let now kβKhβ(B). For each JβJ0β, we consider the subset Vhβ(k,J;B) of Ahβ(f,S,Ξ΅,B,Ξ³) defined by the inequalities
[TABLE]
Since
[TABLE]
the inclusion-exclusion principle yields
[TABLE]
and
[TABLE]
If the set Vhβ(k,J;B) is non-empty, then it is of the form
[TABLE]
for some MβR>0β, ΞΊpββZβ₯0β, Ξ±pββ{0,β¦,pΞΊpββ1} (pβS), with
[TABLE]
Together with the Chinese remainder theorem, this implies that for some Ξ±β{0,β¦,hβ1} one has
which, combined with proposition 4.1, proves theorem II.
Remark 4.4**.**
Note that (4.10) also holds when Sβ²=β , in which case it tells us that N(f,S,Ξ΅,B)=Of,S,Ξ΅β(1) as Bββ. However, this is trivial, because from section 2 we know that if Sβ²=β then there exists HβNSβ such that [f(x)]Sββ€H for all xβZ. It follows that all xβZ such that β£f(x)β£Ξ΅β€[f(x)]f,Sβ must satisfy β£f(x)β£β€ΞΎfβ(H)1/Ξ΅, and there are only finitely many integer x for which this can be true. This of course implies that if Sβ²=β then for all B big enough (depending on f,S,Ξ΅) one has
To the setting of the previous section, we add now the assumption that f has no multiple roots in Zpβ for any pβSβ². Since the set S is in this case trivially f-balanced, theorem II tells us that as long as sβ²:=#Sβ²β₯1 one has
[TABLE]
for all Ξ΅β(0,1/n).
The goal of this section is to show that the limit
[TABLE]
exists if and only if sβ²β₯2, which is the content of theorem I.
By proposition 2.2(c), we have that for all p for which f has a root in Zpβ one has
which shows that the limit (5.1) does not exist (cf. definition 3.6).
In the case SβSβ²={p}, proposition 4.3 tells us similarly that
[TABLE]
The non-existence of the limit (5.1) can proved in this case by working out the analogues of the results in section 3 that led to the proof of the non-existence of the limit (5.1) in the case S=Sβ²={p}. However, the oscillation is now more complicated to describe, and the actual (quite tedious) computation is not too enlightening. For this reason, we prefer to omit it.
Let us now suppose sβ²β₯2. Then, by proposition 4.3, we have
[TABLE]
as Bββ. Moreover, for any Ξ³βR>0β, propositions 2.2 and 3.7 give us
[TABLE]
with implied constants independent of Ξ³, and thus
*If fβZ[X] is a polynomial of degree nβ₯2 and discriminant Ξ(f)ξ =0, then for all pβSβ² one can replace apβ(f) with vpβ(Ξ(f)) in the above formula for C(f,S,Ξ΅). Indeed, it is an immediate consequence of [Stewart]Theorem 2 that ΞΌ(Upkβ(f))pk=ΞΌ(Upvpβ(Ξ(f))+1β(f))pvpβ(Ξ(f))+1 for all kβ₯vpβ(Ξ(f))+1. Under the additional assumption that the leading coefficient of f be invertible in Zpβ, an easy application of Krasnerβs lemma tells us that apβ(f)β€vpβ(Ξ(f)). To see this, let Kpβ be a splitting field of f over Qpβ and let Ξ±1β,β¦,Ξ±nββOKpββ be the roots of f in Kpβ, with Ξ±1β,β¦,Ξ±lββZpβ and Ξ±l+1β,β¦,Ξ±nβξ βZpβ for some lβ{1,β¦,nβ2}βͺ{n}.
If l=n, then one has
[TABLE]
where the last inequality follows immediately from the definition of Ξ»pβ(f).
Suppose now that lβ€nβ2, and let g(X):=(XβΞ±l+1β)β¦(XβΞ±nβ). If xβZpβ and iβ{l+1,β¦,n}, then by Krasnerβs lemma there exists jβ{l+1,β¦,n} distinct from i such that β£xβΞ±iββ£pββ₯β£Ξ±jββΞ±iββ£pβ. It follows that
[TABLE]
and thus
[TABLE]
which shows that upβ(g)β€vpβ(Ξ(g)).
If l=1, then we have
[TABLE]
Finally, in the case 2β€lβ€nβ2 we get
[TABLE]
which concludes the proof.
Acknowledgements
Most of the research work behind this paper has been performed in the context of the authorβs masterβs thesis. The author is extremely grateful to his masterβs thesis advisor Dr. Jan-Hendrik Evertse for the suggestion of the topic and all the helpful tips.
This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.