Rahul Sharma (Editor)

Remez inequality

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, the Remez inequality, discovered by the Soviet mathematician Evgeny Yakovlevich Remez (Remez 1936), gives a bound on the sup norms of certain polynomials, the bound being attained by the Chebyshev polynomials.

Contents

The inequality

Let σ be an arbitrary fixed positive number. Define the class of polynomials πn(σ) to be those polynomials p of the nth degree for which

| p ( x ) | ≤ 1

on some set of measure ≥ 2 contained in the closed interval [−1, 1+σ]. Then the Remez inequality states that

sup p ∈ π n ( σ ) ∥ p ∥ ∞ = ∥ T n ∥ ∞

where Tn(x) is the Chebyshev polynomial of degree n, and the supremum norm is taken over the interval [−1, 1+σ].

Observe that Tn is increasing on [ 1 , + ∞ ] , hence

∥ T n ∥ ∞ = T n ( 1 + σ ) .

The R.i., combined with an estimate on Chebyshev polynomials, implies the following corollary: If J ⊂ R is a finite interval, and E ⊂ J is an arbitrary measurable set, then

max x ∈ J | p ( x ) | ≤ ( 4 mes J mes E ) n sup x ∈ E | p ( x ) | ( ∗ )

for any polynomial p of degree n.

Extensions: Nazarov–Turán Lemma

Inequalities similar to (*) have been proved for different classes of functions, and are known as Remez-type inequalities. One important example is Nazarov's inequality for exponential sums (Nazarov 1993):

Let

p ( x ) = ∑ k = 1 n a k e λ k x

be an exponential sum (with arbitrary λk ∈C), and let J ⊂ R be a finite interval, E ⊂ J — an arbitrary measurable set. Then

max x ∈ J | p ( x ) | ≤ e max k | ℜ λ k | m e s J ( C mes J mes E ) n − 1 sup x ∈ E | p ( x ) |   ,

where C>0 is a numerical constant.

In the special case when λk are pure imaginary and integer, and the subset E is itself an interval, the inequality was proved by Pál Turán and is known as Turán's lemma.

This inequality also extends to L p ( T ) ,   0 ≤ p ≤ 2 in the following way

∥ p ∥ L p ( T ) ≤ e A ( n − 1 ) mes ( T ∖ E ) ∥ p ∥ L p ( E )

for some A>0 independent of p, E, and n. When

m e s E < 1 − log ⁡ n n

a similar inequality holds for p>2. For p=∞ there is an extension to multidimensional polynomials.

Proof: Applying Nazarov's lemma to E = E λ = { x :   | p ( x ) | ≤ λ } ,   λ > 0 leeds to

max x ∈ J | p ( x ) | ≤ e max k | ℜ λ k | m e s J ( C mes J mes E λ ) n − 1 sup x ∈ E λ | p ( x ) |   , ≤ e max k | ℜ λ k | m e s J ( C mes J mes E λ ) n − 1 λ

thus

mes E λ ≤ C mes J ( λ e max k | ℜ λ k | m e s J max x ∈ J | p ( x ) | ) 1 / ( n − 1 )

Now fix a set E and take λ such that mes E λ ≤ mes E 2 , that is

λ = ( mes E 2 C m e s J ) n − 1 e − max k | ℜ λ k | m e s J max x ∈ J | p ( x ) |

Note that this implies that mes E ∩ ( J ∖ E λ ) ≥ mes E − mes E λ ≥ mes E 2

Now

∫ x ∈ E | p ( x ) | p d x ≥ ∫ x ∈ E ∩ ( J ∖ E λ ) | p ( x ) | p d x ≥ λ p m e s E ∩ ( J ∖ E λ ) ≥ mes E 2 ( mes E 2 C m e s J ) p ( n − 1 ) e − p max k | ℜ λ k | m e s J max x ∈ J | p ( x ) | p ≥ mes E 2 mes J ( mes E 2 C m e s J ) p ( n − 1 ) e − p max k | ℜ λ k | m e s J ∫ x ∈ J | p ( x ) | p d x

which completes the proof.

Pólya inequality

One of the corollaries of the R.i. is the Pólya inequality, which was proved by George Pólya (Pólya 1928), and states that the Lebesgue measure of a sub-level set of a polynomial p of degree n is bounded in terms of the leading coefficient LC(p) as follows:

mes { x ∈ R ∣ | P ( x ) | ≤ a } ≤ 4 ( a 2 L C ( p ) ) 1 / n   , a > 0   .

References

Remez inequality Wikipedia
(Text) CC BY-SA