This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
0, the results of §§A.1-A.3 apply to EP, and there is, in particular, a constant bP such that the inequality f °° i for bo < T < a1. Then that ratio is still i for T = b1. This is true because n(B1)lpl B1I > i (lemma from the preceding stage), and
log(1+IPZx)I2) dx < bP fEP log (1 +IPZx)I2) dx
used in proving the second theorem of §A.3, holds for polynomials P.
446
VIII B The set E reduces to the integers
For this reason, given any M, the set of polynomials P such that log JE P
I P(x) I
1+x
dx 5 M
forms a normal family in the complex plane. Suppose now that p = 0. Then E. = Z, and the proof in §A of the above inequality involving bP, available when p > 0, cannot be made to work so as
to yield a relation of the form fOD log (I + IP(x)I2)
1+x2
°° log (I + I P(n)I2)
dx < C Y-
1+n2
That proof depends on the properties of harmonic measure for 2., = C - EP worked out in §A.1 (for p > 0); there is, however, no harmonic measure for -9 = C - Z. This makes it seem very unlikely that the set of polynomials P satisfying log+ I P(n) I
I+n
<M
for arbitrary given M would form a normal family in the complex plane, and
it is in fact easy to construct a counter example to such a claim. Take simply N
2
PN(x) = (1 - x2)[N/IogN] fl
1
k=1
x
for N >, 2, with [p] denoting the greatest integer 5 p as usual. Then it is not hard to verify that log+ Pn2n)I
(*)
Y
\ 20
for N > 8.
At the same time, PN() ->- 2[N/IogN] _i c0. N
Problem 20 Prove (*).
(Hint:-log+IPN(n)I 1n
N
LlogN
log(n2 - 1) n2
n=N+1 m
1
N
+ Y 2 Y- log N+1n
n2
k2-1
k=1
After replacing the sums on the right by suitable integrals and doing
1 Certain sums acting as upper bounds for integrals
447
some calculation, one obtains the upper bound
2+
2
°
2+2
log N +
1
log
(+1\d -1
.
Here, the integral can be worked out by contour integration.)
This example, however, does not invalidate the analogue (with obvious statement) of Akhiezer's theorem for weighted polynomial approximation
on Z. In order to disprove such a conjecture, one would (at least) need similar examples with the number 20 standing on the right side of (*) replaced by arbitrarily small quantities > 0. No matter how one tries to construct such examples, something always seems to go wrong. It seems impossible to diminish the number in (*) to less than a certain strictly positive quantity without forcing boundedness of the IPN(i)I. One comes in such fashion to believe in the existence of a number C > 0 such that the set of polynomials P with log+IP(n)I
Y-4 l+n 2
does form a normal family in the complex plane.
This partial extension of the result from §A.3 to the limiting case EP = Z turns out to be valid. With its help one can establish the complete analogue of Akhiezer's theorem for weighted polynomial approximation on Z; its interest is not, however, limited to that application. The extension is easily reduced to a special version of it for polynomials P of the particular form
P(x) = fl
x2 1 --
k
X k
with real roots Xk > 0, and most of the real work is involved in the treatment,
of this case, taking up all but the last two of the following articles. The investigation is straightforward but very laborious; although I have tried hard to simplify it, I have not succeeded too well. The difficulties are what they are, and there is no point in stewing over them. It is better to just take hold of the traces and forge ahead. 1.
Using certain sums as upper bounds for integrals corresponding to them
Our situation from now up to almost the end of the present § is as follows: we have a polynomial P(z) of the special form
P(z) = fl i k
z2 z
xk
,
448
VIII B The set E reduces to the integers
where the Xk are > 0 (in other words, P(z) is even, with all of its zeros real, and P(O) = 1), and we are given an upper bound for the sum log+IP(m)I
1+m2
00
or, what amounts to the same thing here, for EWlog+ I P(m)I
From this information we desire to obtain a bound on IP(z)I for each complex z. The first idea that comes to mind is to try to use our knowledge about the preceding sum in order to control the integral
-.
log+ I P(x) I
1+x2
dx;
we have indeed seen in Chapter VI, §B.1, how to deduce an upper bound on IP(z)I from one for this integral. This plan, although probably too simple to be carried out as it stands, does suggest a start on the study of our problem. For certain intervals I c (0, oo), (' log I P(x) I
f
x2
J
dx
I
is comparable with
MeInz
log+IP(m)I m2
We have d2 log I P(x) I
dx2
_ -21: x2 + xk < 0, (x2 - x2 )2 k
so log I P(x) I is concave (downward) on any real interval free of the zeros
± xk of P. This means that, if a < b and P has no zeros on [a, b], ('6
loglP(x)ldx 5 (b-a)logIP(m)I a
for the midpoint m of [a, b]:
1 Certain sums acting as upper bounds for integrals
449
Figure 133
Of course f b log I P(x) I dx is not the integral we are dealing with here. If, however, a > 0 is large and b - a not too big, the presence of the factor 1/x2 in front of logIP(x)I does not make much difference. A similar formula still holds, except that m is no longer exactly the midpoint
of [a, b].
Lemma. Let 0 < a < m < b, and suppose that P has no zeros on [a, b]. Then JbloIP(x)Idx 2 (log l P(m) 1)
x2
logba - =ma --
m b
Proof. Let M denote the slope of the graph of log I P(x) I vs. x at x = m. Then, since log I P(x) I is concave on [a, b], we have there log I P(x) I < log I P(m) I + M(x - m)
(see the previous figure). Hence logIP(x)I x2
dx \
(logIP(m)I)
f
-'Z\dx. + MJf 6i1 at x x x a
450
VIII B The set E reduces to the integers
The second term on the right is
Mloga - M(m-b
)
We will be interested in situations where the number m figuring in the above boxed relation is a positive integer, and where one of the two numbers
a, b (a < m 5 b) is to be found, the other being given. Regarding these, we have two estimates. Lemma. If m > 7 and m -1 < a 5 m, the number b > m such that log
b
a
=
m
m
a
b
is < m+2. Proof. Write p = a/b; then 0 < p 51, and the relation to be satisfied becomes log(1/p) = (m/a)(1- p). If a = m, this is obviously satisfied for p = 1, i.e., m = b; otherwise 0 < p < 1, and we have log
m
1
p
1-p
a
Now 1
log- = so the preceding relation implies that m
a
1> 1+2(l-p),
i.e.,
1-p <, 2m-a a and
3a - 2m P
a
Therefore b
_
a
p
5
a
z
3a-2m'
1 Certain sums acting as upper bounds for integrals
451
and
(2m-a)(m-a)
b-m <
3a-2m
m+1 5 m-3*
Here the right-hand side is 5 2 for m > 7. We are done. Lemma. If m >, 2 and m < b < m + 1, the number a < m such that
logba - =ma- -
m
b
is > m-2. Proof. Put p = alb as in proving the preceding lemma; here, it is also convenient to write
Then 0 < p 51 and 0 < y 51. In terms of y and p, our equation becomes 1
Y logy =P -y.
When y < 1, we must also have p < 1, and then
= p log (1/p)
1-p
Y
This yields, for 0 < p < 1, dy dp
-
109010-0 -P) _ 2+3(l-P)+4 ll-P) Z+... (1_p)2
Hence, since the value y = 1 corresponds to p = 1, we have, for 0 < y < 1,
i(1 - p) < 1 - y, i.e.,
p >, 1- 2(1- y). It was given that m , b _- m + 1, so
1_ Y
b-m
1
b
m+1
(the middle term here is a monotone function of b). Therefore, by the
452
VIII B The set E reduces to the integers
previous relation, 2
P '>
1
m+l'
and finally,
a = pb > pm % m-m+
1> m-2.
We are done. Theorem. Let 6 5 a < b. There is a number b*, b < b* < b + 3, such that (' 6log_P(x)Idx x
log+IP(m)I
5
a<m
m
provided that P has no zeros on [a, b*]. The sum on the right is taken over
the integers m with a < m < b*.
NO.
Definition. During the rest of this §, we will say that b* is well disposed with respect to a.
Proof. By repeated application of the first two of the above lemmas. Let the integer m1 be such that m1 - 1 a < m1; then ml > 7, so, by the second lemma, we can find a number a1, m1 < a1 s m1 + 2, with
loga1 =m1 a
a
-
ml a1
We have a1 a, a1
. -X2 logIP(x)dx
< logIP(m1)I
Jaldx
Here, a1 - a < 3 and m1/a 5 6, so C°' dx °
5
x2 \ mi
Therefore, f a, logIP(x)I dx x2
5log+IP(m1)I m2
1 Certain sums acting as upper bounds for integrals
453
If now a1 ,> b, we simply put b* =a I and the theorem is proved. Otherwise, a1 < b and we take the integer m2 such that m2 -15 a1 < m2. Since a1 > m1, m2 > ml, and we can find an a2, m2 < a2 m2 + 2, with
log a2 = a1
-
m2 a1
M2. a2
We have a2 5 a1 + 3 < b + 3, and, by -the first lemma, f a2,logIP(x)I
J
x
('a2 dx
51og+IP(m2)I
a, x
m22
dx < logIP(m2)I J z.
2
just as in the preceding step, provided that P has no zeros on [a1, a2]. If a2 >, b, we put b* = a2. If not, we continue as above, getting numbers a3 > a2, a4 > a3, and so forth, ak+ 1 K, ak + 3, until we first reach an a, with a, > b. We will then have a, < b + 3, and we put b* = a,. There are integers mk, m2 < m3 < < m,, with ak _ 1 < Mk < ak, k = 3, ... , 1, and, as in the previous steps, log I P(x) I
('ak
X k
2
dx
5log
I P(mk) I 2
Mk
1
for k = 3,..., 1, as long as P has no zeros on [ak _ 1, ak].
Write ao = a. Then, if P has no zeros on [a, b*] = [ao, all,
dx = ` fak
f w log I P(x) I a
x
k=1
i
k=1
ak-I
51og+ I P(mk) I Mk2
log I P(x) I
dx
x
E
5 log+ I P(m) I
a<m
m
2
meZ
We are done. In the result just proved, a is kept fixed and we move from b to a point b* well disposed with respect to a, lying between b and b + 3. One can obtain the same effect keeping b fixed and moving downward from a. Theorem. Let 10 < a < b. There is an a*, a - 3 < a* <, a, such that b is well disposed with respect to a*, i.e., (b logIP(x)I x J a*
f
dx < 5 , a'<m< b
log+IP(m)I m
provided that P(x) has no zeros on [a*, b].
The proof uses the first and third of the above lemmas, and is otherwise very much like the one of the previous theorem. Its details are left to the reader.
454
VIII B The set E reduces to the integers
2.
Construction of certain intervals containing the zeros of P(x)
We have seen in the preceding article how certain intervals 1 c (0, oo) can be obtained for which f log I P(x) I
x
dx 5 5
mel
log, I P(m) I m
as long as they are free of zeros of P. Our next step is to split up (0, oo) into two kinds of intervals: zero-free ones of the sort just mentioned and then some residual ones which, together, contain all the positive zeros of P(x).
The latter are closely related to some intervals used earlier by Vladimir Bernstein (not the S. Bernstein after whom the weighted polynomial approximation problem is named) in his study of Dirichlet series, and it is to their construction we now turn. Pop-
As is customary, we denote by n(t) the number of zeros Xk of P(x) in the
interval [0, t] for t > 0 (counting multiplicities as in Chapter III). When t < 0, we take n(t) = 0. The function n(t) is thus integer-valued and increasing. It is zero for all t > 0 sufficiently close to 0 (because the Xk > 0), and constant
for sufficiently large t (P being a polynomial). The graph of n(t) vs. t consists of some horizontal portions separated by jumps. At each jump, n(t) increases by an integral multiple of unity. In this quantization must lie the essential difference between the behaviour of subharmonic functions of the special form log I P(x) I with P a polynomial,
and that of general ones having at most logarithmic growth at oo, for which there holds no valid analogue of the theorem to be established in this
§.
(Just look at the subharmonic functions
rl log I PN(z) I ,
where
rl > 0 is arbitrarily small and the PN are the polynomials considered in Problem 20.) During the present article we will see precisely how the quantization affects matters. For the following work we fill in the vertical portions of the graph of n(t) vs. t. In other words, if n(t) has a jump discontinuity at to, we consider the vertical segment joining (to, n(to - )) to (to, n(to + )) as forming part of that graph. Our constructions are arranged in three stages.
First stage. Construction of the Bernstein intervals We begin by taking an arbitrary small number p > 0 (requiring, say, that p < 1/20). Once chosen, p is kept fixed during most of the discussion
of this and the following articles. Denote by (9 the set of points toeR with the property that a straight line of slope p through (to, n(to)) cuts or touches the graph of n(t) vs. t only
once. 0 is open and its complement in t consists of a finite number of
455
2 Inclusion of zeros of P(x) in special intervals Jk
closed intervals Bo, B1, B2,... called the Bernstein intervals for slope p associated with the polynomial P(x). (Together, the Bk make up what V. Bernstein called a neighborhood set for the positive zeros of P - see page 259 of his book on Dirichlet series. His construction of the Bk is different from the one given here.) It is best to show the formation of the Bk by a diagram:
n (t) oQi
Bo
B,
J
t
Figure 134
We see that all the positive zeros of P (points of discontinuity of n(t)) are contained in the union of the Bk. Also, taking any Bk and denoting it by [a, b]: The part of the graph of n(t) vs. t corresponding to the values of tin Bk lies between the two parallel lines of slope p through the points (a, n(a)) and (b, n(b)).
For a closed interval I = [a, l3], say, let us write n(I) for n(fi +) - n(a - ). The statement just made then implies that n(Bk)/PI BkI 5 1
for each Bernstein interval. An inequality in the opposite sense is less apparent. Lemma (Bernstein). For each of the Bk, n(Bk)/PI BkI
1>
1/2.
Proof. It is geometrically evident that a line of slope p which cuts (or touches) the graph of n(t) vs. t more than once must come into contact with some vertical portion of it - let the reader make a diagram.
456
VIII B The set E reduces to the integers
Take any interval Bk, denote it by [a, b], and denote the portion of the graph of n(t) vs. t corresponding to the values a < t < b by G. We indicate by L and M the lines of slope p through the points (a, n(a)) and (b, n(b)) respectively. According to our definition, any line N of slope p between
L and M must cut (or touch) the graph of n(t) vs. t at least twice, and
hence come into contact with some vertical portion of that graph. Otherwise such a line N, which surely cuts G, would intersect the graph only once, at some point with abscissa toe(a,b); to would then belong to (9 and thus not to Bk. The line N must in fact come into contact with a vertical portion of G, for, as a glance at the preceding figure shows, it can never touch any part of the graph that does not lie over [a, b]. In order to prove the lemma, it is therefore enough to show that if n(Bk)lplBkl < 1/2.
there must be some line N of slope p, lying between L and M, that does not come into contact with any vertical portion of G. Let V be the union of the vertical portions of G, and for X e V, denote by n(x) the downward projection, along a line with slope p, of the point
X onto the horizontal line through (a, n(a)).
1
a
t
k
Bk
13'
Figure 135
In this figure, I Bk I = PS and n(Bk) = QS. The result, II(V), of applying Il
to all the points of V is a certain closed subset of the segment PR, and, if we use I I to denote linear Lebesgue measure, it is clear that
If(V)I < IVI/p. We
have
i
pRS = QS,
n(Bk) = QS < p l Bk l = 2P-PS, Z and therefore PR > z'PS > QS/p = I V I/p. With the so,
if
2 Inclusion of zeros of P(x) in special intervals Jk
457
preceding relation, this yields
III(V)I < PR. There is thus a point Y on PR not belonging to the projection II(V). If, then, N is the line of slope p through Y, N cannot come into contact with V. This line N lies between L and M, so we are done. Second stage. Modification of the Bernstein intervals
The Bernstein intervals Bk just constructed include all the positive zeros of P(x), and I 2
<
n(Bk)
pIBkI
< 1.
We are going to modify them so as to obtain new closed intervals Ik g (0, co )
containing all the positive zeros of P(x), positioned so as to make f log I P(x) I
Ji
x
log, I P(m) I
dx < 5
m
mel
for each of the interval components I of (0, oo) ^ U lk. k
(Note that Bo need not even be contained in [0, oo).) For the calculations which come later on, it is also very useful to have all the ratios n(Ik)/Ilk) the same, and we carry out the construction so as to ensure this.
Specifically, the intervals Ik, which we will write as [ak, Nk] with k = 0, 1,2.... and 0 < ao < Ilo < a, < /i, < , are to have the following properties: (i) All the positive zeros of P(x) are contained in the union of the Ik,
k=0,1,2,...,
(ii) n(lk)/pIlkl =i, (iii) For ao < t < Qo,
n(llo) - n(t) <
1
pap (Qo -
t),
and, for ak < t < /lk with k > 1,
n(t) - n(ak) <
1
n(Nk) - n(t) < 1
pap (t - ak), p
ap 3p
- t),
(recall that we are assuming 0 < p < io),
VIII B The set E reduces to the integers
458
(iv) For k> 1, ak is well disposed with respect to /'k_1 (see the preceding article).
Denote the Bernstein intervals Bk, k = 0, 1, 2,..., by [ak, bk], arranging the indices so as to have bk -I < ak. We begin by constructing 10. Take ao as the smallest positive zero of P(x); a0 is the first point of discontinuity of n(t) and a0 < a0 < b0. We have n(Bo)
1
p(bo - ao) > plBol
n(B0)
2
n([ao,bo]) p(bo - ao)
by the lemma from the preceding (first) stage. For r > b0, let JT be the interval [ao, T]. As we have just seen, n(J,)lpI JLl > 1/2
for T = b0. When T increases from b0 to a1 (assuming that there is a Bernstein interval B1; there need not be!) the numerator of the left-hand ratio remains equal to n(B0), while the denominator increases. The ratio itself therefore decreases when T goes from b0 to a1, and either gets down to i in (b0, a1), or else remains > i there. (In case there is no Bernstein interval B1 we may take a1 = oc, and then the first possibility is realized.) Suppose that we do have n(JL)lpI J,I = i for some T, b0 < T < a1. Then we put /l0 equal to that value of T, and property (ii) certainly holds for to = [ao, /30]. Property (iii) does also. Indeed, by construction of the Bk, the line of slope p through (/30, n(/30)) cuts the graph of n(t) vs. t only once, so the portion of the graph corresponding to values of t < #0 lies entirely to the left of that line (look at the first of the diagrams in this article). That is,
n(llo) - n(t) < p(llo - t),
t < /lo,
whence, a fortiori, n(flo) - n(t)
p3p (fio - t),
t < #0
(since 0
n([ao,bl]) = n(a1-)-n(a0-)+n(B1), while
bl-a0 = a1-a0+IB1I.
2 Inclusion of zeros of P(x) in special intervals Jk
459
Thus, in our present case, n(JL)/pI J,I is >, i for t = b, and again decreases
as t moves from b, towards a2 > b,. (If there is no interval B2 we may take a2 = oo) If, for some -re[b,, a2), we have n(JT)/PI JAI = }, we take /30
equal to that value of t, and property (ii) holds for l0 = [ao, /30]. Also, for /0e[b,, a2), the part of the graph of n(t) vs. t corresponding to the values t < /l0 lies on or entirely to the left of the line of slope p through (/30, n(/3o)), as in the situation already discussed. Therefore, n($0) - n(t) < (p/(1 - 3p)) (/30 - t) for t < #0 as before, and property (iii) holds for lo. In case n(JT)/p I JL I
still remains > i for b, < t < a2, we will have
n(JT)/P I Jt I % z for t = b2 by an argument like the one used above, and we look for flo in the interval [b2, a3). The process continues in this way, and we either get a /o lying between two successive intervals Bk, Bk+1 (perhaps coinciding with the right endpoint of Bk), or else pass through
the half open interval separating the last two of the Bk without ever bringing the ratio n(JT)/p I Jt I down to 2. If this second eventuality occurs, suppose that B, = [a,, b,] is the last Bk; then n(JT)/PI JtI > i for t = b, by the reasoning already used. Here, n(JT) remains equal to n([0, b,]) for t > b, while I JL I increases without limit, so a value /o of t > b, will make n(Ji)/P I J, I = -. There is then only one interval Ik, namely, to = [ao, Qo], and our construction is finished, because properties (i) and (ii) obviously hold, while (iii) does by the above reasoning and (iv) is vacuously true. In the event that the process gives us a Qo lying between two successive
Bernstein intervals, we have to construct I, = [a,, /3,]. In these circumstances we must first choose a, so as to have it well disposed with respect to fio, ensuring property (iv) for k = 1.
00.
It is here that we make crucial use of the property that each jump in n(t) has height > 1.
Assume that bk < fio < ak+ 1 We have p(/30 - a0) = 2n(10) >,2 with
0 < p < o; therefore #0>40 and there is by the first theorem of the preceding article a number a,, ak+, < a, < ak+, + 3, which is well disposed with respect to fio.
Now a, may well lie to the right of ak+,. It is nevertheless true that n(a1) = n(ak+, -), and moreover n(t) - n(a1) <
P 1
3P (t
- a,)
for t > a, .
The following diagram shows how these properties follow from two facts:
460
VIII B The set E reduces to the integers
that n(t) increases by at least 1 at each jump, and that 1/p > 3: slope = p/(1 -3p)
o P-
t
3
Io
ak+1
al ak+1 +3 Bk+ I
Figure 136
For this choice of al, properties (i)-(iv) will hold, provided that /3,, a2 and so forth are correctly determined.
We go on to specify /3,. This is very much like the determination of /30. Since
n(bk+1)-n(al) = n(bk+l)-n(ak+l-) = n(Bk+1), we certainly have n([a,,bk+1])
_
n(Bk+1)
p(bk+l -al)
p(bk+l -al)
n(Bk+1)
1
pIBk+1I
2
by the lemma from the preceding stage. For T 1> bk+,, denote by JT the interval [a,, T]; then is >, i for T = bk+, and diminishes as T increases along [bk+1, ak+2). (If there is no Bk+2 we take ak+2 = oo.) We may evidently proceed just as above to get a r > bk+,, lying either in a half open interval separating two successive Bernstein intervals or else beyond all of the latter, such that n(J' )/pIJTI = z. That value of T is taken as f,. The part of the graph of n(t) vs. t corresponding to values of t 5 /3, lies, as before, on or to the left of the line through (/f,, n(/3,)) with slope p. Hence, a fortiori, n(131)-n(t)
1
pap (/31 -t)
for t
/31
We see that properties (ii) and (iii) hold for Io and I, = [a,, /31]. If Io u I, does not already include all of the Bk, /3, must lie between
2 Inclusion of zeros of P(x) in special intervals Jk
461
two of them, and we may proceed to find an a2 in the way that a, was found above. Then we can construct an I2. Since there are only a finite number of Bk, the process will eventually stop, and we will end with a finite number of intervals Ik = [ak, Nk] having properties (ii)-(iv). Property (i) will then also hold, since, when we finish, the union of the Ik includes that of the Bk.
Here is a picture showing the relation of the intervals Ik to the graph of n(t) vs. t: n(t)
P1i, 1/2
p111/2
it
pllo1/2
0
ao
go
'- I,
a,
01
a2
P2
L-12-J
Figure 137
Let us check the statement made before starting the construction of the Ik, to the effect that f logIP(x)I I
dx < 5
x
mCI
log, m
for each of the interval components I of the complement (0, oo)
U Ik. k
Since, for k > 0, ak is well disposed with respect to /3k_,, this is certainly true for the components I of the form ($k_,, ak), k 1 (if there are any!), by the first theorem of the preceding article. This is also true, and trivially so, for I = (0, ao), because
IP(x)I = II
< 1
k
for 0 < x < ao, all the positive zeros Xk of P(x) being , ao. Finally, if I, is the last of the Ik' our relation is true for 1= (/3,, co ). This follows because
462
VIII B The set E reduces to the integers
we can obviously get arbitrarily large numbers A > $, which are well disposed with respect to (3,. We then have (A logIp(X)I _2
dx \ 5
log+IP(m) Q,<m
m2
for each such A by the first theorem of the preceding article, and need only make A tend to oo. Third stage. Replacement of the first few int