Summability kernel

From testwiki
Jump to navigation Jump to search

Template:Short description 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

Let 𝕋:=/. A summability kernel is a sequence (kn) in L1(𝕋) that satisfies

  1. 𝕋kn(t)dt=1
  2. 𝕋|kn(t)|dtM (uniformly bounded)
  3. δ|t|12|kn(t)|dt0 as n, for every δ>0.

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

With the more usual convention 𝕋=/2π, the first equation becomes 12π𝕋kn(t)dt=1, and the upper limit of integration on the third equation should be extended to π, so that the condition 3 above should be

δ|t|π|kn(t)|dt0 as n, for every δ>0.

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

One can also consider rather than 𝕋; then (1) and (2) are integrated over , and (3) over |t|>δ.

Examples

Convolutions

Let (kn) be a summability kernel, and * denote the convolution operation.

  • If (kn),f𝒞(𝕋) (continuous functions on 𝕋), then kn*ff in 𝒞(𝕋), i.e. uniformly, as n. In the case of the Fejer kernel this is known as Fejér's theorem.
  • If (kn),fL1(𝕋), then kn*ff in L1(𝕋), as n.
  • If (kn) is radially decreasing symmetric and fL1(𝕋), then kn*ff pointwise a.e., as n. This uses the Hardy–Littlewood maximal function. If (kn) is not radially decreasing symmetric, but the decreasing symmetrization k~n(x):=sup|y||x|kn(y) satisfies supnk~n1<, then a.e. convergence still holds, using a similar argument.

References

Template:Reflist