KNOWPIA
WELCOME TO KNOWPIA

In mathematical analysis, the **Dirichlet kernel**, named after the German mathematician Peter Gustav Lejeune Dirichlet, is the collection of periodic functions defined as

where n is any nonnegative integer. The kernel functions are periodic with period .

The importance of the Dirichlet kernel comes from its relation to Fourier series. The convolution of *D _{n}*(

Of particular importance is the fact that the *L*^{1} norm of *D _{n}* on diverges to infinity as

By using a Riemann-sum argument to estimate the contribution in the largest neighbourhood of zero in which is positive, and Jensen's inequality for the remaining part, it is also possible to show that: where is the sine integral

This lack of uniform integrability is behind many divergence phenomena for the Fourier series. For example, together with the uniform boundedness principle, it can be used to show that the Fourier series of a continuous function may fail to converge pointwise, in rather dramatic fashion. See convergence of Fourier series for further details.

A precise proof of the first result that is given by

where we have used the Taylor series identity that and where are the first-order harmonic numbers.

The Dirichlet kernel is a periodic function which becomes the Dirac comb, i.e. the periodic delta function, in the limit

with the angular frequency .

This can be inferred from the autoconjugation property of the Dirichlet kernel under forward and inverse Fourier transform:

and goes to the Dirac comb of period as , which remains invariant under Fourier transform: . Thus must also have converged to as .

In a different vein, consider ∆(x) as the identity element for convolution on functions of period 2π. In other words, we have
for every function *f* of period 2π. The Fourier series representation of this "function" is

(This Fourier series converges to the function almost nowhere.) Therefore, the Dirichlet kernel, which is just the sequence of partial sums of this series, can be thought of as an *approximate identity*. Abstractly speaking it is not however an approximate identity of *positive* elements (hence the failures in pointwise convergence mentioned above).

The trigonometric identity displayed at the top of this article may be established as follows. First recall that the sum of a finite geometric series is

In particular, we have

Multiply both the numerator and the denominator by , getting

In the case we have as required.

Start with the series Multiply both sides by and use the trigonometric identity to reduce the terms in the sum. which telescopes down to the result.

If the sum is only over non-negative integers (which may arise when computing a discrete Fourier transform that is not centered), then using similar techniques we can show the following identity:
Another variant is and this can be easily proved by using an identity .^{[1]}

- Andrew M. Bruckner, Judith B. Bruckner, Brian S. Thomson:
*Real Analysis*. ClassicalRealAnalysis.com 1996, ISBN 0-13-458886-X, S.620 (vollständige Online-Version (Google Books)) - Podkorytov, A. N. (1988), "Asymptotic behavior of the Dirichlet kernel of Fourier sums with respect to a polygon".
*Journal of Soviet Mathematics*, 42(2): 1640–1646. doi: 10.1007/BF01665052 - Levi, H. (1974), "A geometric construction of the Dirichlet kernel".
*Transactions of the New York Academy of Sciences*, 36: 640–643. doi: 10.1111/j.2164-0947.1974.tb03023.x - "Dirichlet kernel",
*Encyclopedia of Mathematics*, EMS Press, 2001 [1994] - Dirichlet kernel at PlanetMath