Fejér kernel explained

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

The Fejér kernel has many equivalent definitions. We outline three such definitions below:

1) The traditional definition expresses the Fejér kernel

F _{n(x)} in terms of the Dirichlet kernel: F _{n(x)} = (1)/(n) \sum ^{n -1} _{k =0} D _{k(x)}

where

D _{k(x)=\sum} ^{k} ^{s =- k} {\rm e} ^{isx} is the kth order Dirichlet kernel.

2) The Fejér kernel

F _{n(x)} may also be written in a closed form expression as follows^[1] F _{n(x)} = (1)/(\left( n) (\sin( (nx)/(2) ))/(\sin( (x)/(2) )) \right) ^{2} = (1)/(\left( n) (1- \cos(nx))/(1- \cos (x)) \right)

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

First, we use the fact that the Dirichlet kernel may be written as:^[2]

D _{k(x) = (\sin(k + (1)/()x 2))/(\sin (x)/(2))} Hence, using the definition of the Fejér kernel above we get:

$$F\_n(x)\; =\; \backslash frac\; \backslash sum\_^D\_k(x)\; =\; \backslash frac\; \backslash sum\_^\; \backslash frac\; =\; \backslash frac\; \backslash frac\backslash sum\_^\; \backslash sin((k+\backslash frac)x)\; =\; \backslash frac\; \backslash frac\backslash sum\_^\; [\backslash sin((k\; +\backslash frac\{1\}\{2\})x)\; \backslash cdot\; \backslash sin(\backslash frac\{x\}\{2\})]$$

Using the trigonometric identity:

\sin(\alpha) ⋅ \sin(\beta) = (1)/(2) (\cos(\alpha - \beta) - \cos(\alpha + \beta))

$$F\_n(x)\; =\backslash frac\; \backslash frac\backslash sum\_^\; [\backslash sin((k\; +\backslash frac\{1\}\{2\})x)\; \backslash cdot\; \backslash sin(\backslash frac\{x\}\{2\})]\; =\; \backslash frac\; \backslash frac\backslash sum\_^\; [\backslash cos(kx)-\backslash cos((k+1)x)]$$Hence it follows that:

$$F\_n(x)\; =\; \backslash frac\; \backslash frac\backslash frac2=\backslash frac\; \backslash frac\backslash sin^2(\backslash frac2)\; =\backslash frac\; (\backslash frac)^2$$3) The Fejér kernel can also be expressed as:

F _{n(x)=\sum} \left( 1- (|k|)/(n) \right)e ^{ikx}

Properties

The Fejér kernel is a positive summability kernel. An important property of the Fejér kernel is

F _{n(x)} \ge 0 with average value of 1 .

Convolution

The convolution F_n is positive: for

f \ge 0 of period 2 \pi it satisfies 0 \le (f*F _{n)(x) = (1)/(2 \pi)} \int ^{\pi} _{- \pi} f(y) F _{n(x-y)dy.}

Since

f*D _{n=S} _{n(f)=\sum} _{|j|\le} \widehat{f} ^{ijx} _{je} , we have f*F _{n = (1)/(n)} \sum ^{n -1} _{k =0} S _{k(f)} , which is Cesàro summation of Fourier series.

By Young's convolution inequality,

\|F _{n*f} \| _{L ^{p([-\pi,} \pi])} \le \|f\| _{L ^{p([-\pi,} \pi])} forevery 1 \le p \le inf ty for f\in L ^{p.}

Additionally, if

f\in L ^{1([-\pi,\pi])} , thenf*F _{n} → f a.e.Since [ - \pi,\pi] is finite, L ^{1([-\pi,\pi])\supset} L ^{2([-\pi,\pi])\supset … \supset} L ^{infty([-\pi,\pi])} , so the result holds for other L ^{p} spaces, p\ge 1 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,g\in L ^{1} with \hat{f} = \hat{g} , then f = g a.e. This follows from writing f*F _{n=\sum} _{|j|\le} \left( 1- (|j|)/(n) \right)\hat{f} ^{ijt} _{je} , which depends only on the Fourier coefficients.

• A second consequence is that if

\lim _{n\toinfty} S _{n(f)} exists a.e., then \lim _{n\toinfty} F _{n(f)=f} a.e., since Cesàro means F _{n*f} converge to the original sequence limit if it exists.

See also

• Fejér's theorem
• Dirichlet kernel
• Gibbs phenomenon
• Charles Jean de la Vallée-Poussin

References

1. Book: Hoffman, Kenneth . Banach Spaces of Analytic Functions . Dover . 1988 . 0-486-45874-1 . 17.
2. Book: Konigsberger, Konrad . Analysis 1 . Springer . 6th . 322 . German.