• Nie Znaleziono Wyników

Then there is a con- stant C(N, n) such that (1.1) b R a eiP (x)|P(n)(x)|1/n+isdx ≤ C(N, n)(1 + |s|)1/n, for P ∈ PN, a &lt

N/A
N/A
Protected

Academic year: 2021

Share "Then there is a con- stant C(N, n) such that (1.1) b R a eiP (x)|P(n)(x)|1/n+isdx ≤ C(N, n)(1 + |s|)1/n, for P ∈ PN, a &lt"

Copied!
5
0
0

Pełen tekst

(1)

VOL. LXVI 1993 FASC. 1

A NOTE ON A CONJECTURE OF D. OBERLIN

BY

YIBIAO P A N (PITTSBURGH, PENNSYLVANIA)

1. Let N be a positive integer, PN be the set of all real-valued poly- nomials on R of degree at most N . In [1], D. Oberlin stated the following conjecture concerning uniform estimates for oscillatory integrals with poly- nomial phases:

Conjecture. Let n, N be two positive integers. Then there is a con- stant C(N, n) such that

(1.1)

b

R

a

eiP (x)|P(n)(x)|1/n+isdx

≤ C(N, n)(1 + |s|)1/n, for P ∈ PN, a < b and s ∈ R.

For the significance of such estimates in Fourier analysis, we refer the reader to [1] and [2].

Clearly, (1.1) holds if n ≥ N (for n > N it is trivial; for n = N it follows from van der Corput’s lemma). Hence we need to be concerned with n = 1, . . . , N − 1 only. For n = 1 or 2, the conjecture has been proved by Oberlin ([1], Theorem 2). The purpose of this note is to prove the conjectured estimate (1.1) in the case n = N − 1.

2. We state our result as the following theorem.

Theorem. Let N ≥ 2 be an integer. Then there exists a constant C(N ) > 0 such that

(2.1)

b

R

a

eiP (x)|P(N −1)(x)|1/(N −1)+isdx

≤ C(N )(1 + |s|)1/(N −1), for P ∈ PN, a < b and s ∈ R.

First we state a simple lemma whose proof is deferred until the end of this note.

1991 Mathematics Subject Classification: Primary 42B20.

(2)

Lemma 2.1. Let n be a positive integer , Q(x) be a monic polynomial with real coefficients and degree n. Suppose that the coefficient of the xn−1 term in Q(x) is zero. Then there are m (m ≤ n) disjoint intervals J1, . . . , Jm

and r1, . . . , rm∈ R such that Sm

k=1Jk = R and (2.2) |Q(x)| ≥ |x||x − rk|n−1, for x ∈ Jk, k = 1, . . . , m.

We shall need the following lemma which is due to van der Corput.

Lemma 2.2 ([3], p. 197). Suppose ϕ and ψ are smooth on [a, b] and ϕ is real-valued. If |ϕ0(x)| ≥ λ, and ϕ0 is monotone on [a, b], then

b

R

a

eiϕ(x)ψ(x) dx

≤ 4λ−1

|ψ(b)| +

b

R

a

0(x)| dx

 .

P r o o f o f t h e T h e o r e m. Let P ∈ PN, and deg(P ) = N . By a change of variable x → cx + d, for suitable c and d, we may assume that P (x) is of the form

(2.3) P (x) = xN + R(x) ,

with deg(R) ≤ N − 2. To prove the Theorem, it suffices to prove that, for a < b and s ∈ R,

(2.4)

b

R

a

eiP (x)|x|1/(N −1)+isdx

≤ C(N )(1 + |s|)1/(N −1).

Let n = N − 1, Q(x) = P0(x). We assume that n ≥ 2 (for n = 1 is covered by Oberlin’s result). By Lemma 2.1, there are disjoint intervals J1, . . . , Jm and r1, . . . , rm ∈ R (for some m ≤ n) such that Sm

k=1Jk = R and

|Q(x)| ≥ |x||x − rk|n−1,

for x ∈ Jk, k = 1, . . . , m. To prove (2.4), we may assume that P00(x) is of constant sign on I = [a, b]. As a further reduction, we shall consider the integral over each I ∩ Jk∩ (0, ∞) and I ∩ Jk∩ (−∞, 0), for k = 1, . . . , m.

Without loss of generality, we pick k = 1, and consider the integral over I ∩ J1∩ (0, ∞). For the sake of convenience, we still denote I ∩ J1∩ (0, ∞) by I. Let A = r1; we have

|P0(x)| ≥ |x||x − A|n−1, for x ∈ I. There are two cases.

C a s e I: A > 0. Let σ > 0 such that σn(A + σ) = 1 + |s|. Then, (2.5)

R

I∩[A,A+σ]

eiP (x)|x|1/n+isdx

≤ σ(A + σ)1/n = (1 + |s|)1/n.

(3)

On the other hand, by Lemma 2.2, we have, for j ≥ 0, (2.6)

R

I∩[2j(A+σ),2j+1(A+σ)]

eiP (x)|x|1/n+isdx

C(N )

2j(A + σ)σn−1



2(j+1)/n(A + σ)1/n+ 1 n+ |s|

 2

j+1(A+σ)

R

2j(A+σ)

x1/n−1dx



C(N )(1 + |s|)

(A + σ)(n−1)/nσn−12(1/n−1)j= C(N )(1 + |s|)1/n2(1/n−1)j. Hence we have

R

I∩[A+σ,∞)

eiP (x)|x|1/n+isdx

≤ C(N )(1 + |s|)1/nX

j≥0

2(1/n−1)j (2.7)

≤ C(N )(1 + |s|)1/n. It remains for us to show that

(2.8)

R

I∩[0,A]

eiP (x)|x|1/n+isdx

≤ C(N )(1 + |s|)1/n. If A ≤ 4n/(n+1)(1 + |s|)1/(n+1), then

(2.9)

R

I∩[0,A]

eiP (x)|x|1/n+isdx

A

R

0

x1/ndx ≤ C(N )(1 + |s|)1/n.

If A > 4n/(n+1)(1 + |s|)1/(n+1) = 8B, we let σ0 = ((1 + |s|)/A)1/n ≤ A/4.

Let n1 and n2 be two integers such that

2n1 ≤ B < 2n1+1 and 2n2 ≤ A/4 < 2n2+1. We write

R

I∩[0,A]

eiP (x)|x|1/n+isdx

= R

I∩[0,2n1]

eiP (x)|x|1/n+isdx +

n2

X

j=n1

R

I∩[2j,2j+1]

eiP (x)|x|1/n+isdx

+ R

I∩[2n2+1,A−σ0]

eiP (x)|x|1/n+isdx + R

I∩[A−σ0,A]

eiP (x)|x|1/n+isdx .

The first term and fourth term are easily seen to be bounded by (1 + |s|)1/n. For the third term, one observes that

|P0(x)| ≥ |x||x − A|n−1≥ (A/4)(σ0)n−1,

(4)

for x ∈ I ∩ [2n2+1, A − σ0], and the desired bound follows from van der Corput’s lemma. To treat the second term, we use

|P0(x)| ≥ |x||x − A|n−1≥ (21−n)2jAn−1 for x ∈ I ∩ [2j, 2j+1], n1≤ j ≤ n2. Then

n2

X

j=n1

R

I∩[2j,2j+1]

eiP (x)|x|1/n+isdx

≤ C

n2

X

j=n1

(1 + |s|)

2jAn−12j/n≤ C(1 + |s|)A1−n2n1(1/n−1)

≤ C(1 + |s|)1−n−1n+1(1 + |s|)n+11 (n1−1)= C(1 + |s|)1/n. The above argument shows that (2.8) holds. Combining (2.5), (2.7) and (2.8), we see that case I is proved.

C a s e II: A ≤ 0. This case is actually easier than the previous case. Now we have |P0(x)| ≥ |x|nfor x ∈ I. Let δ = (1 + |s|)1/(n+1); we decompose the integral as

R

I

eiP (x)|x|1/n+isdx = R

I∩[0,δ]

eiP (x)|x|1/n+isdx

+

X

j=1

R

I∩[2jδ,2j+1δ]

eiP (x)|x|1/n+isdx .

While the first term is trivially bounded by (1 + |s|)1/n, an application of van der Corput’s lemma shows that the second term is also bounded by (1 + |s|)1/n.

The proof of the theorem is now complete.

P r o o f o f L e m m a 2.1. Let z1, . . . , zn be the n roots of Q(x), and

∆ = {z1, . . . , zn}. Then we have

(2.10) Q(x) =

n

Y

j=1

(x − zj) . Suppose

{Re z | z ∈ ∆} = {r1, . . . , rm} , and r1< . . . < rm. Define

J1=



− ∞,r1+ r2

2



, Jm= rm−1+ rm

2 , ∞

 ,

(5)

and

Jk = rk−1+ rk

2 ,rk+ rk+1

2



, for k = 2, . . . , m − 1 . For x ∈ Ik, 1 ≤ k ≤ m, we find

(2.11) |x − zj| ≥ |x − Re zj| ≥ |x − rk|, for all j = 1, . . . , n. On the other hand, we have

n

X

j=1

(x − zj) = nx −

n

X

j=1

zj = nx ,

where we used the fact that the coefficient of the xn−1 term in Q(x) is zero.

Hence, for every x ∈ R, there is a jx, 1 ≤ jx≤ n, such that

(2.12) |x − zjx| ≥ |x| .

(2.11) and (2.12) imply that

|Q(x)| ≥ |x||x − rk|n−1, for x ∈ Jk, k = 1, . . . , m.

REFERENCES

[1] D. O b e r l i n, Oscillatory integrals with polynomial phase, Math. Scand. 69 (1991), 145–156.

[2] E. M. S t e i n, Oscillatory integrals in Fourier analysis, in: Beijing Lectures in Har- monic Analysis, Princeton Univ. Press, Princeton, 1986, 307–355.

[3] A. Z y g m u n d, Trigonometric Series, Cambridge Univ. Press, Cambridge, 1959.

DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF PITTSBURGH

PITTSBURGH, PENNSYLVANIA 15260 U.S.A.

Re¸cu par la R´edaction le 19.10.1992

Cytaty

Powiązane dokumenty

Aby zbada¢ czy taki szereg jest zbie»ny korzystamy z kryterium pierwiastkowego Cauchyego.. Warto

Ekstrema funkcji i funkcji uwik lanych.. Ekstrema

Znaleźć największą liczbę n ∈ N, dla której umie Pan/i pokazać, że dla każdej nieparzystej m &lt; n, jeśli |G| = m, to G jest

Określ rezultat działania algorytmu rozważa- nego algorytmu... Matematyka Dyskretna – materiały

Lesieur qui a attir´ e mon attention sur les nombres Eul´ eriens, et plus sp´ ecialement sur les nombres M n , et les coll` egues de l’Universit´ e Nicolas Copernic de Toru´

tipli ative re urrent sequen es shrinks S to the lassi al system. Then, similar to the proof of

To estimate the mean square of L f (s, χ), we reduce the problem to the study of the mean square of the Dirichlet polynomial by using the approximate functional equation of L f (s,

By the reasoning in the proofs of Theo- rems 5 and 6, the other sets in the theorem are finite unions of contractions of T.. By reasoning similar to that in Theorem 3, the sets can