Fejér kernel

From Wikipedia, the free encyclopedia
(Redirected from Fejer kernel)
Jump to navigation Jump to search
File:Fejér kernels.svg
Plot of several Fejér kernels

In mathematics, the Fejér kernel is a summability kernel used to express the effect of Cesàro summation on Fourier series. It is a non-negative kernel, giving rise to an approximate identity. It is named after the Hungarian mathematician Lipót Fejér (1880–1959).

Definition

[edit | edit source]

The Fejér kernel has many equivalent definitions. Three such definitions are outlined below:

1) The traditional definition expresses the Fejér kernel Fn(x) in terms of the Dirichlet kernel

Fn(x)=1nk=0n1Dk(x)

where

Dk(x)=s=kkeisx

is the kth order Dirichlet kernel.

2) The Fejér kernel Fn(x) may also be written in a closed form expression as follows[1]

Fn(x)=1n(sin(nx2)sin(x2))2=1n(1cos(nx)1cos(x))

This closed form expression may be derived from the definitions used above. A proof of this result goes as follows.

Using the fact that the Dirichlet kernel may be written as:[2]

Dk(x)=sin((k+12)x)sinx2,

one obtains from the definition of the Fejér kernel above:

Fn(x)=1nk=0n1Dk(x)=1nk=0n1sin((k+12)x)sin(x2)=1n1sin(x2)k=0n1sin((k+12)x)=1n1sin2(x2)k=0n1[sin((k+12)x)sin(x2)]

By the trigonometric identity: sin(α)sin(β)=12(cos(αβ)cos(α+β)), one has

Fn(x)=1n1sin2(x2)k=0n1[sin((k+12)x)sin(x2)]=1n12sin2(x2)k=0n1[cos(kx)cos((k+1)x)],

which allows evaluation of Fn(x) as a telescoping sum:

Fn(x)=1n1sin2(x2)1cos(nx)2=1n1sin2(x2)sin2(nx2)=1n(sin(nx2)sin(x2))2.

3) The Fejér kernel can also be expressed as:

Fn(x)=|k|n1(1|k|n)eikx

Properties

[edit | edit source]

The Fejér kernel is a positive summability kernel. An important property of the Fejér kernel is Fn(x)0 with average value of 1.

Convolution

[edit | edit source]

The convolution Fn is positive: for f0 of period 2π it satisfies

0(f*Fn)(x)=12πππf(y)Fn(xy)dy.

Since

f*Dn=Sn(f)=|j|nf^jeijx,

we have

f*Fn=1nk=0n1Sk(f),

which is Cesàro summation of Fourier series. By Young's convolution inequality,

Fn*fLp([π,π])fLp([π,π]) for every 1p for fLp.

Additionally, if fL1([π,π]), then

f*Fnf a.e.

Since [π,π] is finite, L1([π,π])L2([π,π])L([π,π]), so the result holds for other Lp spaces, p1 as well.

If f is continuous, then the convergence is uniform, yielding a proof of the Weierstrass theorem.

  • One consequence of the pointwise a.e. convergence is the uniqueness of Fourier coefficients: If f,gL1 with f^=g^, then f=g a.e. This follows from writing
f*Fn=|j|n(1|j|n)f^jeijt,

which depends only on the Fourier coefficients.

  • A second consequence is that if limnSn(f) exists a.e., then limnFn(f)=f a.e., since Cesàro means Fn*f converge to the original sequence limit if it exists.

Applications

[edit | edit source]

The Fejér kernel is used in signal processing and Fourier analysis.

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).