The Bernstein and Nikolsky inequalities for trigonometric polynomials
1 Introduction
Let . For a function and , we define by . For measurable and , write
For , write
and for , write
This note works out proofs of some inequalities involving the support of for .
Let be the set of trigonometric polynomials of degree . We define the Dirichlet kernel by
It is straightforward to check that if then
2 Bernstein’s inequality for trigonometric polynomials
DeVore and Lorentz attribute the following inequality to Szegö.11 1 Ronald A. DeVore and George G. Lorentz, Constructive Approximation, p. 97, Theorem 1.1.
Theorem 1.
If and is real valued, then for all ,
Proof.
If the result is immediate. Otherwise, take , and for real define
, and satisfies
and . Since , in particular and so there is some , , such that . We define by
which satisfies . For , let , for which we have
Because ,
so by the intermediate value theorem, for each there is some such that . Because
it follows that if then and are distinct in . It is a fact that a trigonometric polynomial of degree has distinct roots in , so if and , then . It is the case that and , so . But , so . Using and the fact that has no zeros in we get a contradiction from , so . This gives
Thus
or
Because
we get
Because this is true for all ,
completing the proof. ∎
Using the above we now prove Bernstein’s inequality.22 2 Ronald A. DeVore and George G. Lorentz, Constructive Approximation, p. 98.
Theorem 2 (Bernstein’s inequality).
If , then
Proof.
There is some such that . Let be such that . Define for , which satisfies and in particular
Because and is real valued, Theorem 1 yields
A fortiori,
giving, because and ,
proving the claim. ∎
The following is a version of Bernstein’s inequality.33 3 Ronald A. DeVore and George G. Lorentz, Constructive Approximation, p. 101, Theorem 2.4.
Theorem 3.
If and is a Borel set, there is some such that
Proof.
Let be a Borel set with indicator function . Define by
which we can write as
showing that . Also,
Let with . Applying Theorem 2 we get
Using
this gives
∎
Applying the above with gives the following version of Bernstein’s inequality, for the norm.
Theorem 4 ( Bernstein’s inequality).
If , then
3 Nikolsky’s inequality for trigonometric polynomials
DeVore and Lorentz attribute the following inequality to Sergey Nikolsky.44 4 Ronald A. DeVore and George G. Lorentz, Constructive Approximation, p. 102, Theorem 2.6.
Theorem 5 (Nikolsky’s inequality).
If and , then for an integer,
Proof.
Let . Then , so , and using this and the Cauchy-Schwarz inequality we have, for ,
Hence
thus
Then, using , we have
∎
4 The complementary Bernstein inequality
We define a homogeneous Banach space to be a linear subspace of with a norm with which is a Banach space, such that if and then and , and such that if then in as .
Fejér’s kernel is, for ,
One calculates that, for ,
Bernstein’s inequality is a statement about functions whose Fourier transform is supported only on low frequencies. The following is a statement about functions whose Fourier transform is supported only on high frequencies.55 5 Yitzhak Katznelson, An Introduction to Harmonic Analysis, third ed., p. 55, Theorem 8.4. In particular, for , is a homogeneous Banach space, and so is with the supremum norm.
Theorem 6.
Let be a homogeneous Banach space and let be a positive integer. Define as if is even and if is odd. If
is times differentiable and , then and
Proof.
Suppose that is even. It is a fact that if , is an even sequence of nonnegative real numbers such that as and such that for each ,
then there is a nonnegative function such that for all .66 6 Yitzhak Katznelson, An Introduction to Harmonic Analysis, third ed., p. 24, Theorem 4.1. Define
It is apparent that is even and tends to as . For ,
For ,
The function is convex on , as , so for we have . Therefore, there is some nonnegative such that
Because is nonnegative, and using ,
Define . For ,
For , since we have
so for all ,
This implies that , which in particular tells us that . Then,
This shows what we want in the case that is even, with .
Suppose that is odd. For a positive integer, define by
There is a unique such that . For an integer, define by
satisfies
On the one hand, for , from the definition of we have , hence . On the other hand, for we assert that
We define by
We calculate the Fourier coefficients of . For ,
As well,
We now define
which satisfies for ,
and hence
Because for , for , it follows that for any ,
and therefore,
Then
That is, with we have
For , we define
for which we have, for ,
It follows that
whence
That is, with , we have
completing the proof. ∎