The Bernstein and Nikolsky inequalities for trigonometric polynomials

Jordan Bell
January 28, 2015

1 Introduction

Let 𝕋=/2π. For a function f:𝕋 and τ𝕋, we define fτ:𝕋 by fτ(t)=f(t-τ). For measurable f:𝕋 and 0<r<, write

fr=(12π𝕋|f(t)|r𝑑t)1/r.

For f,gL1(𝕋), write

(f*g)(x)=12π𝕋f(t)g(x-t)𝑑t,x𝕋,

and for fL1(𝕋), write

f^(k)=12π𝕋f(t)e-ikt𝑑t,k.

This note works out proofs of some inequalities involving the support of f^ for fL1(𝕋).

Let 𝒯n be the set of trigonometric polynomials of degree n. We define the Dirichlet kernel Dn:𝕋 by

Dn(t)=|j|neijt,t𝕋.

It is straightforward to check that if T𝒯n then

Dn*T=T.

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 T𝒯n and T is real valued, then for all x𝕋,

T(x)2+n2T(x)2n2T2.
Proof.

If T=0 the result is immediate. Otherwise, take x𝕋, and for real c>1 define

Pc(t)=T(t+x)sgnT(x)cT,t𝕋.

Pc𝒯n, and satisfies

Pc(0)=T(x)sgnT(x)cT0

and Pc1c<1. Since Pc<1, in particular |Pc(0)|<1 and so there is some α, |α|<π2n, such that sinnα=Pc(0). We define S𝒯n by

S(t)=sinn(t+α)-Pc(t),t𝕋,

which satisfies S(0)=sinnα-Pc(0)=0. For k=-n,,n, let tk=-α+(2k-1)π2n, for which we have

sinn(tk+α)=sin(2k-1)π2=(-1)k+1.

Because Pc<1,

sgnS(tk)=(-1)k+1,

so by the intermediate value theorem, for each k=-n,,n-1 there is some ck(tk,tk+1) such that S(ck)=0. Because

tn-t-n=(2n-1)π2n-(-2n-1)π2n=2π,

it follows that if jk then cj and ck are distinct in 𝕋. It is a fact that a trigonometric polynomial of degree n has 2n distinct roots in 𝕋, so if t(tk,tk+1) and S(t)=0, then t=ck. It is the case that t1=-α+π2n>0 and t0=-α-π2<0, so 0(t0,t1). But S(0)=0, so c0=0. Using S(t1)=1>0 and the fact that S has no zeros in (0,t1) we get a contradiction from S(0)<0, so S(0)0. This gives

0Pc(0)=ncosnα-S(0)ncosnα=n1-sin2nα=n1-Pc(0)2.

Thus

Pc(0)n1-Pc(0)2,

or

n2Pc(0)+Pc(0)2n2.

Because

Pc(0)2=T(x)2c2T2,Pc(0)2=T(x)2c2T2

we get

n2T(x)2+T(x)2c2n2T2.

Because this is true for all c>1,

n2T(x)2+T(x)2n2T2,

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 T𝒯n, then

TnT.
Proof.

There is some x0𝕋 such that |T(x0)|=T. Let α be such that eiαT(x0)=T. Define S(x)=Re(eiαT(x)) for x𝕋, which satisfies S(x)=Re(eiαT(x)) and in particular

S(x0)=Re(eiαT(x0))=eiαT(x0)=T.

Because S𝒯n and S is real valued, Theorem 1 yields

S(x0)2+n2S(x0)2n2S2.

A fortiori,

S(x0)2n2S2,

giving, because S(x0)=T and ST,

T2n2T2,

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 T𝒯n and A𝕋 is a Borel set, there is some x0𝕋 such that

A|T(t)|𝑑tnA-x0|T(t)|𝑑t.
Proof.

Let A𝕋 be a Borel set with indicator function χA. Define Q:𝕋 by

Q(x)=𝕋χA(t)T(t+x)sgnT(t)𝑑t,x𝕋,

which we can write as

Q(x) =𝕋χA(t)jT^(j)eij(t+x)sgnT(t)dt
=jT^(j)(𝕋χA(t)eijtsgnT(t)𝑑t)eijx,

showing that Q𝒯n. Also,

Q(x)=𝕋χA(t)T(t+x)sgnT(t)𝑑t,x𝕋.

Let x0𝕋 with |Q(x0)|=Q. Applying Theorem 2 we get

QnQ.

Using

Q(0)=𝕋χA(t)T(t)sgnT(t)𝑑t=𝕋χA(t)|T(t)|𝑑t,

this gives

𝕋χA(t)|T(t)|𝑑t nQ
=n|Q(t0)|
=n|𝕋χA(t)T(t+x0)sgnT(t)𝑑t|
n𝕋χA(t)|T(t+x0)|𝑑t
=n𝕋χA-x0(t)|T(t)|𝑑t.

Applying the above with A=𝕋 gives the following version of Bernstein’s inequality, for the L1 norm.

Theorem 4 (L1 Bernstein’s inequality).

If T𝒯n, then

T1nT1.

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 T𝒯n and 0<qp, then for rq2 an integer,

Tp(2nr+1)1q-1pTq.
Proof.

Let m=nr. Then Tr𝒯m, so Tr*Dm=Tr, and using this and the Cauchy-Schwarz inequality we have, for x𝕋,

|T(x)r| =|12π𝕋T(t)rDm(x-t)|
12π𝕋|T(t)|r|Dm(x-t)|𝑑t
Tr-q212π𝕋|T(t)|q2|Dm(x-t)|𝑑t
Tr-q2|T|q/22Dm2
=Tr-q2Tqq2Dm^2()
=2m+1Tr-q2Tqq2.

Hence

Tr2m+1Tr-q2Tqq2,

thus

T(2m+1)1qTq.

Then, using TpT1-qpTqqp, we have

Tp(2m+1)1q-1pTq1-qpTqqp=(2m+1)1q-1pTq.

4 The complementary Bernstein inequality

We define a homogeneous Banach space to be a linear subspace B of L1(𝕋) with a norm fL1(𝕋)fB with which B is a Banach space, such that if fB and τ𝕋 then fτB and fτB=fB, and such that if fB then fτf in B as τ0.

Fejér’s kernel is, for n0,

Kn(t)=|j|n(1-|j|n+1)eijt=jχn(j)(1-|j|n+1)eijt  t𝕋.

One calculates that, for t4π,

Kn(t)=1n+1(sinn+12tsin12t)2.

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 1p<, Lp(𝕋) is a homogeneous Banach space, and so is C(𝕋) with the supremum norm.

Theorem 6.

Let B be a homogeneous Banach space and let m be a positive integer. Define Cm as Cm=m+1 if m is even and Cm=12m if m is odd. If

f(t)=|j|najeijt,t𝕋,

is m times differentiable and f(m)B, then fB and

fBCmn-mf(m)B.
Proof.

Suppose that m is even. It is a fact that if aj,j, is an even sequence of nonnegative real numbers such that aj0 as |j| and such that for each j>0,

aj-1+aj+1-2aj0,

then there is a nonnegative function fL1(𝕋) such that f^(j)=aj for all j.66 6 Yitzhak Katznelson, An Introduction to Harmonic Analysis, third ed., p. 24, Theorem 4.1. Define

aj={j-m|j|nn-m+(n-|j|)(n-m-(n+1)-m)|j|n-1.

It is apparent that aj is even and tends to 0 as |j|. For 1jn-2,

aj-1+aj+1-2aj=0.

For j=n-1,

aj-1+aj+1-2aj =n-m+(n-(n-2))(n-m-(n+1)-m)+n-m
-2(n-m+(n-(n-1))(n-m-(n+1)-m))
=0.

The function jj-m is convex on {n,n+1,}, as m1, so for jn we have aj-1+aj+1-2aj0. Therefore, there is some nonnegative ϕm,nL1(𝕋) such that

ϕm,n^(j)=aj,j.

Because ϕm,n is nonnegative, and using n-m-(n+1)-m<mnn-m,

ϕm,n1=ϕm,n^(0)=n-m+n(n-m-(n+1)-m)<(m+1)n-m.

Define dμm,n(t)=12πϕm,n(t)dt. For |j|n,

f(m)*μm,n^(j) =f(m)^(j)μm,n^(j)
=(ij)mf^(j)ϕm,n^(j)
=(ij)mf^(j)|j|-m
=imf^(j).

For |j|<n, since f^(j)=0 we have

f(m)*μm,n^(j)=(ij)mf^(j)ϕm,n^(j)=0=imf^(j),

so for all j,

f(m)*μm,n^(j)=imf^(j).

This implies that f(m)*μm,n=imf, which in particular tells us that fB. Then,

fB =imfB
=f(m)*μm,nB
f(m)Bμm,nM(𝕋)
=ϕm,n1f(m)B
(m+1)n-mf(m)B.

This shows what we want in the case that m is even, with Cm=m+1.

Suppose that m is odd. For l a positive integer, define ψl:𝕋 by

ψl(t)=(e2lit+12e3lit)Kl-1(t),t𝕋.

There is a unique ln such that n{2ln,2ln+1}. For k0 an integer, define Ψn,k:𝕋 by

Ψn,k(t)=ψln2k(t),t𝕋.

Ψn,k satisfies

Ψn,k132Kk-11=3212π𝕋|Kk-1(t)|𝑑t=3212π𝕋Kk-1(t)𝑑t=32.

On the one hand, for j0, from the definition of ψl we have Ψn,k^(j)=0, hence k=0Ψn,k^(j)=0. On the other hand, for jn we assert that

k=0Ψn,k^(j)=1.

We define Φn:𝕋 by

Φn(t)=k=0(Ψn,k*ϕ1,n2k)(t),t𝕋.

We calculate the Fourier coefficients of Φn. For jn,

Φn^(j)=k=0Φn,k^(j)ϕ1,n2k^(j)=1jk=0Φn,k^(j)=1j.

As well,

Φn1k=0Ψn,k*ϕ1,n2k1k=0Ψn,k1ϕ1,n2k132k=02(n2k)-1=6n

We now define

dμ1,n(t)=12π(Φn(t)-Φn(-t))dt,

which satisfies for |j|n,

μ1,n^(j)=Φn^(j)-Φn^(-j)=1j

and hence

f*μ1,n^(j)=f^(j)μ1,n^(j)=ijf^(j)1j=if^(j).

Because f^(j)=0 for |j|<n, f*μ1,n^(j)=0 for |j|<n, it follows that for any j,

f*μ1,n^(j)=if^(j),

and therefore,

f*μ1,n=if.

Then

fB=ifB=f*μ1,nBμ1,nM(𝕋)fB2Φn1fB12nfB.

That is, with C1=12 we have

fB12n-1fB.

For m=2ν+1, we define

μm,n=μ1,n*μ2ν,n,

for which we have, for |j|n,

f(m)*μm,n^(j)=(ij)mf^(j)μ1,n^(j)μ2ν,n^(j)=(ij)mf^(j)1jj-2ν=imf^(j).

It follows that

f(m)*μm,n=imf,

whence

fB =imfB
=f(m)*μm,nB
μm,nM(𝕋)f(m)B
μ1,nM(𝕋)μ2ν,nM(𝕋)f(m)B
12n(2ν+1)n-2νf(m)B
=12mn-mf(m)B.

That is, with Cm=12m, we have

fBCmn-mf(m)B,

completing the proof. ∎