Abstract.
Let denote the space of all real polynomials of degree at most on . We prove a new estimate for the logarithmic measure of the sublevel set of a polynomial . Using this estimate, we prove that
|
|
|
for some absolute positive constant c and every function with zero mean value on the unit sphere . This improves a result of Stein from [4].
1. Introduction
We denote by the vector space of all real polynomials of degree at most in . Let be a homogeneous function on , that is,
(1.1) |
|
|
|
where is some function on the unit sphere . Consider the principal value integral
|
|
|
Stein has proved in [4] that if has zero mean value on the unit sphere, then
(1.2) |
|
|
|
for some constant depending on . We wish to obtain sharp estimates of the form (1.2). The one dimensional analogue, namely the estimate
(1.3) |
|
|
|
which was proved in [3], suggests that the constant in (1.2) could be replaced by for some absolute positive constant . The fact that this is indeed the case is the content of the following theorem.
Theorem 1.1.
Suppose that where has zero mean value on the unit sphere . There exists an absolute positive constant such that
|
|
|
The main ingredient of the proof of Theorem 1.1 is an estimate for the logarithmic measure of the sublevel set of a real polynomial in one dimension. This is a lemma of independent interest which we now state.
Lemma 1.3 (The logarithmic measure lemma).
Let be a real valued polynomial of degree at most , and . If , then
|
|
|
where is an absolute positive constant.
Lemma 1.3 should be compared to the following variation of a classical result of Vinogradov which can be found in [6]:
Lemma 1.4.
Let be a real valued polynomial of degree at most , and . Let . Then
|
|
|
where is an absolute positive constant.
The estimates above depend on the length of the interval in all cases but the one where . The dependence on is sharp as can be seen by a scaling argument.
(1.4) |
|
|
|
The last inequality corresponds to the following more general result about sublevel sets which was proved in [1]:
Lemma 1.5.
Let be a function on the interval for some and . Suppose that on . Then
|
|
|
where is an absolute positive constant.
Observe that inequality (1.4) can be deduced by Lemma 1.5 by taking derivatives of the phase function .
In case the “linear” part of the estimate of in Lemma 1.3 is enough for the proof of Theorem 1.1. In fact, the author in [3] used Lemma 1.4 in some appropriate way to prove the above ”linear” estimate of Lemma 1.3.
In case the “logarithmic” part of the estimate of is essential in the proof of Theorem 1.1 as can easily be seen by examining the argument therein.
The structure of the rest of this work is as follows. In section 2 we state some preliminary results. In section 3 we present the proof of Lemma 1.3 and section 3 contains the proof of Theorem 1.1. Finally in section 4 we give a proof of Theorem 1.1 in case which uses (the ”linear” estimate in) Lemma 1.3 and not Lemma 1.4 and which is thus simpler than the proof appearing in [3].
Notation.
We will use the letter to denote an absolute positive constant which might change even in the same line of text.
3. The logarithmic measure lemma
The proof of Lemma 1.3 is motivated by an argument of Vinogradov from [6], used to estimate the Lebesgue measure of the sublevel set of a polynomial in a bounded interval. We fix a polynomial and look at the set . Note that by replacing with in the statement of the lemma, it is enough to consider the case . Since is a closed set we can find points such that and
|
|
|
We set and and we have that , . The Lagrange interpolation formula is
|
|
|
where means that is omitted. Thus,
|
|
|
where is the -th elementary symmetric function of its variables. Therefore
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
It is easy to see that there exists precisely one , , for which
(3.1) |
|
|
|
It is exactly for this that takes its minimum value as runs from to . On the other hand we have
|
|
|
and, hence
|
|
|
|
|
|
|
|
|
|
From (3.1) we easily see that and, since is increasing in the interval , we find
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Similarly, since is decreasing in the interval we get
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
We let
|
|
|
and, obviously, . From (3) and (3) we have
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
From (3.1) we get and, since
is decreasing in , we find
|
|
|
and, similarly,
|
|
|
Therefore
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Now
|
|
|
|
|
|
|
|
|
|
Using (3.1)
|
|
|
and we conclude that
|
|
|
|
|
|
|
|
|
|
Therefore
|
|
|
|
|
|
|
|
|
|
and, finally, (3) implies that for some
|
|
|
where is an absolute positive constant.
case 1: . Then, since , we get
|
|
|
which implies
|
|
|
and, finally,
|
|
|
case 2: , . Then
|
|
|
which shows that
|
|
|
case 3: , . Then and and, hence,
|
|
|
We conclude that
|
|
|
since .
fsectionProof of Theorem 1.1
Let be a function with zero mean value on the unit sphere belonging to the class , that is
|
|
|
Set and let . We will show the theorem for , for some . The general case is then an immediate consequence.
We set
|
|
|
where is a constant depending on , and .
For and we write,
|
|
|
For , we have that where is a homogeneous polynomial of degree . Observe that we can omit the constant term, without loss of generality. Set also . Since and are arbitrary positive numbers, by a dilation in we can assume that and, in particular, that for some . We also write . We split the integral in two parts as follows
|
|
|
|
|
|
|
|
|
|
For we have that
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
For we write
|
|
|
|
|
|
|
|
|
|
Since consists of at most intervals where is monotonic, a simple corollary to van der Corput’s lemma for the first derivative [5, corollary on p. 334] gives the bound
|
|
|
On the other hand, the logarithmic measure lemma implies that
|
|
|
|
|
|
|
|
|
|
Combining the estimates we get
|
|
|
and, from Young’s inequality,
|
|
|
|
|
|
|
|
|
|
Now, using corollary 2.3 we get
|
|
|
Since , this means that
|
|
|
Using induction on we get that . Observe that corresponds to some polynomial . We write
|
|
|
|
|
|
Using the simple estimate
|
|
|
we get
|
|
|
|
|
|
|
|
|
|
Hence,
and
|
|
|
The case of general d is now trivial. If then
|
|
|