Definition
Let . A summability kernel is a sequence in that satisfies # # (uniformly bounded) # 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 convention , the first equation becomes , and the upper limit of integration on the third equation should be extended to . One can also consider rather than ; then (1) and (2) are integrated over , and (3) over .Examples
* The Fejér kernel * The Poisson kernel (continuous index) * The Dirichlet kernel is ''not'' a summability kernel, since it fails the second requirement.Convolutions
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
*{{citation , first=Yitzhak , last=Katznelson , authorlink=Yitzhak Katznelson , title=An introduction to Harmonic Analysis , year=2004 , publisher=Cambridge University Press , isbn=0-521-54359-2 Mathematical analysis Fourier series