• Nie Znaleziono Wyników

Asymptotic behaviour of some infinite products involving prime numbers

N/A
N/A
Protected

Academic year: 2021

Share "Asymptotic behaviour of some infinite products involving prime numbers"

Copied!
12
0
0

Pełen tekst

(1)

LXXV.4 (1996)

Asymptotic behaviour of some infinite products involving prime numbers

by

Hsien-Kuei Hwang (Taipei)

1. Introduction. Given an integer n ≥ 2, let ω(n) denote the number of distinct prime factors of n in the decomposition of n into prime factors. Let Q denote the set of square-free positive integers, namely, integers having no repeated prime factors in their factorizations. The distribution of the values of the arithmetic function ω(n) has received much attention in the literature (cf. [15, 16, 7, 6, 17, 13]). In particular, the Sathe–Selberg formulae state (cf. [16], [17, p. 231]):

(1) 1

x #{n : 1 ≤ n ≤ x and ω(n) = m}

= (log log x)

m−1

(m − 1)! log x



G(r) + O

 B

G

m (log log x)

2



, (2) 1

x #{n : 1 ≤ n ≤ x, n ∈ Q and ω(n) = m}

= (log log x)

m−1

(m − 1)! log x



F (r) + O

 B

F

m (log log x)

2



, uniformly for 1 ≤ m ≤ M log log x, for any fixed M > 0, where r = (m − 1)/(log log x), G and F are entire functions defined by

G(z) = 1 Γ (z + 1)

Y

p prime



1 + z p − 1



1 − 1 p



z

, (3)

F (z) = 1 Γ (z + 1)

Y

p prime

 1 + z

p



1 − 1 p



z

, (4)

and B

G

:= sup

|z|≤M

|G

′′

(z)|, B

F

being similarly defined. These two func- tions are related by

zG(z) = F (z − 1) as can easily be seen.

[339]

(2)

The asymptotic behaviour of these two entire functions is of some inde- pendent interest. Intuitively, such information sheds new light on the asymp- totic natures of (1) and (2). Indeed, using Stirling’s formula for 1/Γ (z+1) and formally differentiating both sides of (8) below with respect to z leads to

F

′′

(z)

F (z) = (log z)

2

+2(log z)(log log z)+O(log z) (|z| → ∞, |arg z| ≤ π −ε), a result that can be rigorously justified by the methods used in this paper.

Let N (x, m) denote the quantity on the left-hand side of (2). Then the right-hand side of (2) can be further made explicit by (cf. [17, p. 240], [8, p. 210])

N (x, m) = (log log x)

m−1

(m − 1)! log x F (r)



1− F

′′

(r)(m − 1)

2F (r)(log log x)

2

+ smaller order terms

 . Thus, as r = (m − 1)/(log log x) → ∞,

F

′′

(r)(m − 1)

2F (r)(log log x)

2

= F

′′

(r)r

F (r)log log x ∼ r(log r)

2

log log x ,

the rightmost term is o(1) if and only if r = o((log log x)/(log log log x)

2

);

or, equivalently, m = o((log log x)

2

/(log log log x)

2

). This suggests that (2) might still hold for m in this range. The justification of such a formal process requires, of course, a further argument.

Likewise, we can “guess” the same type of result for the left-hand side of (1), which is indeed true, as was shown by Hensley [6] (cf. also [7, 13]).

On the other hand, if we let F (z) = P

n≥0

α

n

z

n

, then the asymptotic behaviour of α

n

as n → ∞ is closely related to that of F (z) as z → ∞ by the formula

α

n

= 1 2iπ

L

|z|=r

z

−n−1

F (z) dz (r > 0), especially when we apply the saddle-point method (cf. [3]).

The aim of this paper is to derive asymptotic expansions of F (z) as

|z| → ∞ and |arg z| < π. Since the asymptotic behaviour of the entire function 1/Γ (z) is well known, it suffices to consider the series

(5) f (z) := X

p prime

 log

 1 + z

p



+ z log

 1 − 1

p



(z 6= −p, p prime).

Let H

0

denote a certain truncated Hankel contour around the origin

(counter-clockwise) in the s-plane (see the next section for precise defini-

tion). Throughout this paper, the symbol ε always denotes a small positive

quantity whose value may vary from one occurrence to another. Our main

result is the following.

(3)

Theorem 1. The function f satisfies

(6) − f (z)

z + 1 = 1 2iπ

\

H0

πz

s

(1 + s) sin πs log(1/s) ds + R(z), where the error term R satisfies

(7) R(z) ≪ exp



− c log |z|

(log log |z|)

2/3

(log log log |z|)

1/3

 ,

uniformly as |z| → ∞ and |arg z| ≤ π − ε, ε > 0, c > 0 being some absolute constant. Moreover , R(z) ≪ |z|

−1/2+ε

under the Riemann hypothesis.

From (6), we deduce the following expansion. The symbol [z

n

]h(z) rep- resents the coefficient of z

n

in the Taylor expansion of h.

Theorem 2. If |z| → ∞ in the region |arg z| ≤ π − ε, ε > 0, then f satisfies

(8) − f (z)

z + 1 = log log z − γ + X

1≤j<ν

c

j

(j − 1)!

(log z)

j

+ O((log |z|)

−ν

),

uniformly with respect to z, where ν = 1, 2, . . . , γ is Euler’s constant and the coefficients c

j

are defined by

c

j

:= [z

j

] πz (1 − z) sin πz (9)

= 2 X

0≤l≤[j/2]

(−1)

l

(2l)! (1 − 2

2l−1

)B

2l

π

2l

(j = 0, 1, 2, . . .), the B

l

’s being Bernoulli numbers.

An alternative expression for c

j

is (10) c

j

= j + (−1)

j

2 + X

l≥2

(−1)

l

l

j

 1

l − 1 − (−1)

j

l + 1



(j = 0, 1, 2, . . .),

which is easily obtained by standard expansion of meromorphic functions and is both exact and asymptotic (as j → ∞). In particular, c

0

= c

1

= 1, c

2

= c

3

= 1 +

16

π

2

, c

4

= c

5

= 1 +

16

π

2

+

3607

π

4

. Obviously, c

j

is a polynomial in π

2

of degree [j/2] with positive coefficients.

Two closely related infinite products arise in the distribution of the num-

ber of distinct irreducible factors of a monic polynomial over a finite field

F

q

(cf. [1, 19] and [8, Ch. 5]):

(4)

G(z) = e Y

k≥1



1 + z q

k

− 1

 e

−z/qk



Ik

,

F (z) = e Y

k≥1



1 + z q

k

 e

−z/qk



Ik

, where

(11) I(z) := X

j≥1

I

j

z

j

= X

j≥1

µ(j)

j log 1

1 − qz

j

(|z| < 1/q), the µ(j) being the M¨obius function.

The asymptotic behaviours of log e F (z) and log e G(z) can be treated by the same approach.

Theorem 3. Let e f (z) = log e F (z), z ∈ C \ (−∞, −q]. Then e f satisfies

− f (z) e

z = 1

2iπ

\

H0

πz

s

(1 + s) sin πs log(1/s) ds + K

q

− log log q (12)

+ O(|z|

−1/2+ε

)

= log log z + K

q

− γ − log log q + X

1≤j<ν

c

j

(j − 1)!

(log z)

j

(13)

+ O((log |z|)

−ν

),

uniformly as |z| → ∞ in the sector |arg z| ≤ π − ε, where ν = 1, 2, . . . , c

j

is as in Theorem 2 and

K

q

:= X

j≥2

µ(j)

j log 1

1 − q

1−j

. As to the function e G, since

log e G(z) = log e F (z) + X

j≥1

I

j

 log



1 + z q

j

− 1



− log

 1 + z

q

j



, and the Mellin transform of the last series exists in the strip −1 < ℜs < 0, we conclude that the asymptotic behaviour of log e G is also characterized by (12) and (13).

While the leading term on the right-hand side of (8) may be derived by

Mertens’s formula (cf. [13, p. 239]), the methods developed here have wide

applications to other entire functions defined via infinite products issuing

from arithmetical functions or combinatorial structures: integers subject to

arithmetical constraints (cf. [14]), arithmetical semigroups under Axiom A

#

(cf. [11, 12, 5]), the combinatorial schemes of Flajolet and Soria (cf. [5], [8,

Ch. 5]), “factorisatio numerorum” in arithmetical semigroups (cf. [10]), and

(5)

the combinatorial scheme developed by the author (having an exponential singularity) (cf. [8, Chs. 6, 9]), etc. Of these, an interesting example is the random mapping patterns (cf. [5]) in which the integrand in question (when applying the Mellin inversion formula) has both logarithmic and algebraic singularities, thus successive terms in the asymptotic expansion are of order (log z)

−j/2

in lieu of (log z)

−j

.

To avoid technical complications, we content ourselves with the proof of Theorems 1–3. The infinite products of e G and of e F (when taking loga- rithm) are special classes of the so-called harmonic sums (see [4] for a general introduction and survey).

2. The proof of the theorems

P r o o f o f T h e o r e m 1. Let π(x) = P

p≤x

1 denote the number of primes ≤ x for x ≥ 2 and π(x) = 0 for x < 2. By writing f (defined in (5)) as a Stieltjes integral and by an integration by parts, we have

(14) f (z) = −z(z + 1)

\

2

π(x)

x(x + 1)(x + z) dx =: −z(z + 1)h(z),

say. Thus h is the Stieltjes transform of the function x 7→ π(x)/(x(x − 1)).

Observe that h can be written in the form h(z) =

\

0

u(x)v

 z x

 dx, with v(x) = 1/(1 + x) and

u(x) =

( π(x)

x

2

(x − 1) for x ≥ 2, 0 for 0 ≤ x < 2.

Thus the Mellin transform of h satisfies

M [h; s] = M [v; s]M [u; 1 + s],

and h is expressible by the Parseval formula (cf. [20, Ch. 3]):

(15) h(z) = 1

2iπ

σ+i∞

\

σ−i∞

z

−s

M [v; s]M [u; 1 + s] ds

for z 6∈ (−∞, 0], where z

−s

= exp(−s log z), log having its principal value, and σ is any real number lying on the common strip of M [v; s] and M [u; 1 + s]. It remains to find explicit representations for the Mellin trans- forms of u and of v. Now, from the table of Mellin transforms in [20, p. 193], we find

M [v; s] = π

sin πs (0 < ℜs < 1),

(6)

and the Mellin transform M [u; 1 + s] is easily seen to exist in the half plane ℜs < 1, since u(x) ≪ x

−2

(log x)

−1

as x → ∞. Substituting these into (15) and carrying out the change of variables s → −s yields

(16) h(z) = 1

2iπ

−1/2+i∞

\

−1/2−i∞

−πz

s

sin πs M [u; 1 − s] ds.

Using the formula (cf. [18, §3.7])

\

2

π(x)

x(x

s

− 1) dx = log ζ(s)

s (ℜs > 1), ζ being Riemann’s zeta function, we have

M [u; 1 − s] =

\

2

π(x)

x

s+2

(x − 1) dx = log ζ(s + 2)

s + 2 + ̟(s + 2), for ℜs > −1, where

(17) ̟(s) =

\

2

(x

s

− x)π(x)

x

s+1

(x

s

− 1)(x − 1) dx,

is regular and bounded for ℜs ≥ 1/2 + ε and satisfies ̟(1) = 0. Thus

(18) h(z) = I

1

+ I

2

,

where

I

1

= 1 2iπ

−1/2+i∞

\

−1/2−i∞

−πz

s

(s + 2) sin πs log ζ(s + 2) ds,

I

2

= 1 2iπ

−1/2+i∞

\

−1/2−i∞

−πz

s

(s + 2) sin πs ̟(s + 2) ds.

The integrand of I

2

having a removable singularity at s = −1, it follows, by (17) and the absolute convergence of the integral, that

(19) |I

2

| ≪ |z|

−3/2+ε

(ε > 0).

To evaluate the integral I

1

, we use the following zero-free region for ζ(s + 2) (cf. [9]):

σ ≥ −1 − c

(log |t|)

2/3

(log log |t|)

1/3

(s = σ + it, |t| ≥ t

0

> e

e

, c > 0), in which log ζ(s + 2) satisfies the estimate

(20) log ζ(σ + 2 + it) ≪ (log |t|)

2/3

(log log |t|)

1/3

.

(7)

We now take a large positive number T > t

0

and a small quantity 0<δ<1/2 and set

a = −1 + (log |z|)

−1

and b = −1 − c(log T )

−2/3

(log log T )

−1/3

. Move the line of integration of I

2

to the contour C shown in Figure 1. The integration contour C consists of 7 parts described as follows:

C

1

= (a−i∞, a−iT ], C

2

= [a−iT, b−iT ], C

3

= {s : s = b+it; −T ≤ t ≤ −δ}, H

−1

= H

−1

(T, δ)

= [b − iδ, −1 − iδ] ∪ {s : s = δe

, −π/2 ≤ θ ≤ π/2} ∪ [−1 + iδ, b + iδ], C

4

= {s : s = b+it; δ ≤ t ≤ T }, C

5

= [b+iT, a+iT ], C

6

= [a+iT, a+i∞).

Fig 1. The contour C

For convenience, let J

k

denote the integral J

k

:= 1

2iπ

\

Ck

−πz

s

(s + 2) sin πs log ζ(s + 2) ds for k = 1, 2, . . . , 6.

From (20) and the bound

−πz

σ+it

sin π(σ + it) ≪ |z|

σ

e

−(π+θz)|t|

(−π + ε ≤ θ

z

= arg z ≤ π − ε),

we deduce the following estimates:

(8)

J

1

+ J

6

= 1 2π

\

|t|≥T

−πz

a+it

(a + 2 + it) sin π(a + it) log ζ(a + 2 + it) dt

≪ |z|

a

e

−(π+θz)T

, J

2

+ J

5

≪ |z|

a

log |z| e

−(π+θz)T

, J

3

+ J

4

= 1

\

δ≤|t|≤T

−πz

b+it

(b + 2 + it) sin π(b + it) log ζ(b + 2 + it) dt ≪ |z|

b

. Thus, letting

J

H

= 1 2iπ

\

H−1

−πz

s

(s + 2) sin πs log ζ(s + 2) ds, we have

(21) I

1

= J

H

+ R

0

(z),

where

R

0

(z) ≪ |z|

a

e

−(π+θz)T

+ |z|

b

≪ |z|

−1

e

−(π+θz)T

+ |z|

b

. Taking

T = c log |z|

(π + θ

z

)(log log |z|)

2/3

(log log log |z|)

1/3

,

so as to balance the two error terms of R

0

, we obtain the estimate (compare (7))

(22) R

0

(z) ≪ |z|

−1

exp



− c log |z|

(log log |z|)

2/3

(log log log |z|)

1/3

 .

It remains to evaluate the integral J

H

which can be decomposed into two parts:

J

H

= 1 2iπ

\

H−1

−πz

s

(s + 2) sin πs log(1/(s + 1)) ds + 1

2iπ

\

H−1

−πz

s

(s + 2) sin πs log((s + 1)ζ(s + 2)) ds,

where the integrand of the second integral is regular on the path of the integration and single-valued along the cut; it is therefore regular inside the contour H

−1

. By Cauchy’s theorem,

(23) 1

2iπ

\

H−1

−πz

s

(s + 2) sin πs log((s + 1)ζ(s + 2)) ds ≪ |z|

b

,

which is of the same order as R

0

(z).

(9)

Collecting the above results we obtain (6) by (14), (16), (18), (19), (21)–

(23) and 1 2iπ

\

H−1

−πz

s

(s + 2) sin πs log(1/(s + 1)) ds = 1 2iπ

\

H0

πz

s−1

(s + 1) sin πs log(1/s) ds, H

0

being the translated contour of H

−1

from −1 to the origin.

Finally, from the above proof, it is obvious that R

0

(z) ≪ |z|

−3/2+ε

under the Riemann hypothesis (cf. [18, Ch. XIV]); or, equivalently, the error term R(z) in (6) satisfies R(z) ≪ |z|

−1/2+ε

.

This completes the proof of Theorem 1.

P r o o f o f T h e o r e m 2. To evaluate the asymptotic behaviour of the integral

J := 1 2iπ

\

H0

πz

s

(s + 1) sin πs log(1/s) ds

as |z| → ∞ in the sector |arg z| ≤ π −ε, we start from the Laurent expansion (cf. (9))

π

(1 + s) sin πs = 1

s + X

1≤j<ν

(−1)

j

c

j

s

j−1

+ ̺

ν

(s) (s 6= 0, |s| < 1), for any ν = 1, 2, . . . , where ̺

ν

is analytic in the unit circle and satisfies

̺

ν

(s) ≪ |s|

ν−1

there. Substituting this expansion into J yields J = 1

2iπ

\

H0

z

s

s log(1/s) ds + X

1≤j<ν

(−1)

j

c

j

1 2iπ

\

H0

s

j−1

z

s

log(1/s) ds + Y

ν

(z), where

Y

ν

(z) = 1 2iπ

\

H0

̺

ν

(s)z

s

log(1/s) ds (ν = 1, 2, . . .).

By Hankel’s representation of the entire function 1/Γ (s) (cf. [17, p. 205]) and by extending the integration contour H

0

to −∞ ± iδ, we deduce, for any fixed α ∈ R,

1 2iπ

\

H0

z

s

s

α

log(1/s) ds = (log z)

α−1

 log log z

Γ (α) + Γ

(α) Γ (α)

2



+ O(|z|

b+1

).

Using the relations (cf. [2, p. 15]) Γ

(1) = −γ and (cf. [2, p. 46]) Γ

(−k)

Γ

2

(−k) = (−1)

k−1

k! (k = 0, 1, 2, . . .), we obtain

J = log log z − γ + X

1≤j<ν

c

j

(j − 1)!

(log z)

j

+ O 

|z|

b+1

X

1≤j<ν

c

j

(j − 1)! 

+ Y

ν

(z).

(10)

Now, by (10), c

j

≪ j, it follows that

|z|

b+1

X

1≤j<ν

c

j

(j − 1)! ≪ ν! |z|

b+1

≪ |z|

b+1

≍ |R(z)|,

and it remains to estimate Y

ν

for which the change of variables w = s log z gives

Y

ν

(z) = 1 2iπ

\

H0

̺

ν

 w

log z



e

w

(log log z − log w) dw log z ,

where H

0

is the transformed contour of H

0

. The function ̺

ν

being regular in the unit circle, we deduce

1 2iπ

\

H0

̺

ν

 w

log z



e

w

dw ≪ |z|

b+1

.

Now take δ = (log |z|)

−1

. By the definition of H

0

and the estimate ̺

ν

(s) ≪

|s|

ν−1

, we obtain

−1 2iπ

\

H0

̺

ν

 w

log z



e

w

log w log z dw

|1+b|log |z|

\

0

|− σ + iδ|

ν−1

(log |z|)

ν

e

−σ

|log(σ

2

+ δ

2

)|dσ + δ

ν

≪ (log |z|)

−ν

.

Finally, (9) follows from the expansion (cf. [2, Eq. (5), p. 51]) z

sin z = 2 X

j≥0

(−1)

j

B

2j

(2j)! (1 − 2

2j−1

)z

2j

(|z| < π).

This completes the proof.

P r o o f o f T h e o r e m 3 (sketch). By definition, f (z) = e X

k≥1

I

k

 log

 1 + z

q

k



− z q

k

 ,

the right-hand side is a harmonic sum (cf. [4]) and its Mellin transform (cf.

[20, p. 193]) is given by

M [ e f ; s] = π

s sin πs I(q

s

) (−2 < ℜs < −1).

(11)

Thus

f (z) = e 1 2iπ

−3/2+i∞

\

−3/2−i∞

πz

−s

s sin πs I(q

s

) ds.

Using the expansion (cf. (11)) I(q

s

) = log 1

1 − q

1+s

+ K

q

+ O(|1 + s|) (s ∼ −1),

and proceeding along the same lines as above (with much simpler analysis), we deduce the estimates (12) and (13).

References

[1] M. C a r, Factorisation dans F

q

[X], C. R. Acad. Sci. Paris S´er. I Math. 294 (1982), 147–150.

[2] A. E r d´el y i, Higher Transcendental Functions, Vol. I, Krieger, Malabar, Fla., 1953.

[3] M. A. E v g r a f o v, Asymptotic Estimates and Entire Functions, Gordon and Breach, New York, 1961 (translated from Russian by A. L. Shields).

[4] P. F l a j o l e t, X. G o u r d o n, and P. D u m a s, Mellin transforms and asymptotics:

harmonic sums, Theoret. Comput. Sci. 144 (1995), 3–58.

[5] P. F l a j o l e t and M. S o r i a, Gaussian limiting distributions for the number of com- ponents in combinatorial structures, J. Combin. Theory Ser. A 53 (1990), 165–182.

[6] D. H e n s l e y, The distribution of round numbers, Proc. London Math. Soc. (3) 54 (1987), 412–444.

[7] A. H i l d e b r a n d and G. T e n e n b a u m, On the number of prime factors of an integer, Duke Math. J. 56 (1988), 471–501.

[8] H.-K. H w a n g, Th´eor`emes limites pour les structures combinatoires et les fonctions arithm´ etiques, Th`ese, Ecole Polytechnique, 1994.

[9] A. I v i´c, The Riemann Zeta-Function, Wiley, New York, 1985.

[10] A. K n o p f m a c h e r, J. K n o p f m a c h e r, and R. W a r l i m o n t, “Factorisatio nu- merorum” in arithmetical semigroups, Acta Arith. 61 (1992), 327–336.

[11] J. K n o p f m a c h e r, Abstract Analytic Number Theory, North-Holland, Amsterdam, 1975.

[12] —, Analytic Arithmetic of Algebraic Function Fields, Lecture Notes in Pure and Appl. Math. 50, Dekker, New York, 1979.

[13] K. K. N o r t o n, On the frequencies of large values of divisor functions, Acta Arith.

68 (1994), 219–244.

[14] G. J. R i e g e r, Zum Teilerproblem von Atle Selberg, Math. Nachr. 30 (1965), 181–192.

[15] L. G. S a t h e, On a problem of Hardy and Ramanujan on the distribution of integers having a given number of prime factors, I , II , III , IV , J. Indian Math. Soc. 17 (1953), 63–141; 18 (1954), 27–81.

[16] A. S e l b e r g, Note on a paper by L. G. Sathe, ibid. 18 (1954), 83–87.

[17] G. T e n e n b a u m, Introduction ` a la th´ eorie analytique et probabiliste des nombres,

Institut Elie Cartan, Universit´e de Nancy I, Nancy, 1990.

(12)

[18] E. C. T i t c h m a r s h, The Theory of the Riemann Zeta-Function, Oxford, 1951; 2nd ed., revised and edited by D. R. Heath-Brown, Oxford Sci. Publ., Clarendon Press, Oxford, 1986.

[19] R. W a r l i m o n t, Arithmetical semigroups IV : Selberg’s analysis, Arch. Math.

(Basel) 60 (1993), 58–72.

[20] R. W o n g, Asymptotic Approximations of Integrals, Academic Press, Boston, 1989.

Institute of Statistical Science Academia Sinica

Taipei 11529, Taiwan

E-mail: hkhwang@stat.sinica.edu.tw

Received on 10.8.1995 (2841)

Cytaty

Powiązane dokumenty

Application of a linear Padé approximation In a similar way as for standard linear systems Kaczorek, 2013, it can be easily shown that if sampling is applied to the

Before we start the derivation of the fundamental pursuit equation in the electromagnetic and gravitational field, we remind the basic notions of the relativistic theory

Assume that in every time interval [t, t + ∆t] the particle has the probability c∆t+o(∆t) of changing its position from x to (x+ξ)/a, where ξ is a random variable with distribution

The parameter σ α has appeared in many papers on exponential sums but we are not aware of an upper bound of the type (1.13) ever appearing before, even for the case of

We did not use Watt’s mean-value bound (Theorem 2 of [12]) in prov- ing Lemma 6, because the hypothesis T ≥ K 4 (in our notation) limits the former’s usefulness in this problem to

As mentioned in Section 5, the plan is to apply Theorem 3.1 to equations of the form (3.2) defined by certain minimal forms L ∈ L(T ).. Since we must apply transformations to the

The new tool here is an improved version of a result about enumerating certain lattice points due to E.. A result about enumerating certain

The purpose of this section is to develop the method of proof of Theorem 2 and prove the following theorem..