In mathematics, a summability kernel is a family or sequence of periodic integrable functions satisfying a certain set of properties, listed below. Certain kernels, such as the Fejér kernel, are particularly useful in Fourier analysis. Summability kernels are related to approximation of the identity; definitions of an approximation of identity vary,[1] but sometimes the definition of an approximation of the identity is taken to be the same as for a summability kernel.

Definition

edit

Let . A summability kernel is a sequence in that satisfies

  1. (uniformly bounded)
  2. as , for every .

Note that if for all , i.e. is a positive summability kernel, then the second requirement follows automatically from the first.

With the more usual convention , the first equation becomes , and the upper limit of integration on the third equation should be extended to , so that the condition 3 above should be

as , for every .

This expresses the fact that the mass concentrates around the origin as increases.

One can also consider rather than ; then (1) and (2) are integrated over , and (3) over .

Examples

edit

Convolutions

edit

Let be a summability kernel, and denote the convolution operation.

  • If (continuous functions on ), then in , i.e. uniformly, as . In the case of the Fejer kernel this is known as Fejér's theorem.
  • If , then in , as .
  • If is radially decreasing symmetric and , then pointwise a.e., as . This uses the Hardy–Littlewood maximal function. If is not radially decreasing symmetric, but the decreasing symmetrization satisfies , then a.e. convergence still holds, using a similar argument.

References

edit
  1. ^ Pereyra, María; Ward, Lesley (2012). Harmonic Analysis: From Fourier to Wavelets. American Mathematical Society. p. 90.

📚 Artikel Terkait di Wikipedia

Fejér kernel

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

Poisson kernel

D. Convolutions with this approximate unit gives an example of a summability kernel for the Fourier series of a function in L1(T) (Katznelson 1976). Let

Kernel method

In machine learning, kernel machines are a class of algorithms for pattern analysis, whose best known member is the support-vector machine (SVM). These

Landau kernel

The Landau kernel is named after the German number theorist Edmund Landau. The kernel is a summability kernel defined as: L n ( t ) = { ( 1 − t 2 ) n c

Kernel (image processing)

In image processing, a kernel, convolution matrix, or mask is a small matrix used for blurring, sharpening, embossing, edge detection, and more. This is

Convergence of Fourier series

the partial sum SN is replaced by a suitable summability kernel (for example the Fejér sum obtained by convolution with the Fejér kernel), basic functional

Kernel density estimation

In statistics, kernel density estimation (KDE) is the application of kernel smoothing for probability density estimation, i.e., a non-parametric method

Dirichlet kernel

In mathematical analysis, the Dirichlet kernel, is the collection of periodic functions defined as D n ( x ) = ∑ k = − n n e i k x = ( 1 + 2 ∑ k = 1 n