advanced37 min studyLesson 376 in Mathematics

Convolution, approximate identities, and Young's inequality

Control convolution in Lebesgue spaces and state exactly when shrinking kernels recover a function in norm.

On this page

What you’ll understand

  • Apply Young's inequality with compatible exponents.
  • Verify the mass and concentration conditions behind a scaled approximate identity.
  • Distinguish finite-p norm convergence from failure in arbitrary L∞ inputs.

Convolution combines translated copies of one function using another as a weighting kernel. It appears in smoothing, probability, differential equations, and frequency filtering, but those interpretations do not replace its integrability conditions. A convolution integral may exist only almost everywhere, and a family of narrowing kernels may recover an input in one norm while failing in another. Young's inequality supplies stable norm bounds. Translation continuity then explains why a properly normalized approximate identity converges for finite Lebesgue exponents without requiring the input to be continuous.

Convolution and compatible exponents

On Rd\mathbb R^d with Lebesgue measure define (f∗g)(x)=∫f(x−y)g(y) dy(f*g)(x)=\int f(x-y)g(y)\,dy wherever the integral exists. Young's inequality says that for exponents 1≤p,q,r≤∞1\le p,q,r\le\infty with 1+1/r=1/p+1/q1+1/r=1/p+1/q, an LpL^p input and an LqL^q kernel produce an LrL^r convolution with norm at most the product of their norms. The relation between exponents is part of the theorem, not a menu of independently selectable spaces. The familiar integrable-kernel estimate is the case q=1q=1, r=pr=p.

For that case, view the convolution as an integral of translates of the input and apply the integral triangle inequality. Translation invariance keeps every translated Lᵖ norm unchanged, leaving the kernel's absolute integral as the multiplier. General Young bounds follow from Hölder-type arguments or interpolation, with endpoint cases handled carefully. A signed kernel is controlled by its absolute integral, not its signed mass. Thus a kernel integrating to one may still strongly amplify errors if its positive and negative parts are both large.

∥f∗g∥r≤∥f∥p∥g∥q,1+1r=1p+1q,1≤p,q,r≤∞\|f*g\|_r\le\|f\|_p\|g\|_q,\qquad 1+\frac1r=\frac1p+\frac1q,\qquad1\le p,q,r\le\infty
The inequality is on Euclidean Lebesgue spaces; the compatible exponents guarantee an almost-everywhere-defined Lʳ convolution.↔ Scroll wide equations horizontally.

Shrink a kernel while preserving mass

Take k∈L1(Rd)k\in L^1(\mathbb R^d) with integral one and define kε(x)=ε−dk(x/ε)k_\varepsilon(x)=\varepsilon^{-d}k(x/\varepsilon) for positive ε\varepsilon. Substitution preserves both signed mass and absolute integral. For every fixed positive radius, the absolute mass outside that radius tends to zero as the scale shrinks, by integrability of the original kernel. These conditions form an approximate identity. Positivity is convenient for interpretation as an average but is not required for this finite-p norm convergence theorem.

For f∈Lpf\in L^p with 1≤p<∞1\le p<\infty, subtract ff using the mass-one identity and bound the convolution error by an integral of translation differences. Small translations have small Lᵖ error, and the kernel mass of large translations becomes negligible. Translation continuity follows first for smooth compactly supported functions and then by density. The same argument works uniformly for bounded uniformly continuous functions, using their uniform translation continuity. It does not imply uniform recovery of every bounded measurable function.

kε(x)=ε−dk(x/ε),∫k=1⟹∥kε∗f−f∥p→0(1≤p<∞, f∈Lp)k_\varepsilon(x)=\varepsilon^{-d}k(x/\varepsilon),\quad\int k=1\quad\Longrightarrow\quad\|k_\varepsilon*f-f\|_p\to0\quad(1\le p<\infty,\ f\in L^p)
The kernel is integrable; its absolute mass is uniformly bounded and concentrates near zero under this scaling.↔ Scroll wide equations horizontally.

Norm recovery is not automatic pointwise recovery

An arbitrary integrable approximate identity has the finite-p conclusion above, but a pointwise theorem requires additional control of the kernels and a suitable local property of the input. Common positive radially decreasing kernels recover values at Lebesgue points under standard hypotheses. Do not infer that assertion merely from unit mass and Lᵖ convergence. In particular, values assigned on null sets remain invisible to integrals, and smoothing a jump must be interpreted through nearby averages rather than a demanded isolated value.

On the Fourier side, convolution becomes multiplication when justified, for example for Schwartz functions or integrable inputs with the relevant transform identities. An approximate identity has multipliers tending to one at each fixed frequency, but this pointwise multiplier limit alone does not prove convergence in every norm. Uniform operator bounds and approximation arguments supply the missing control. Conversely a large L¹ kernel norm warns of possible amplification even if its multiplier looks benign at a few sampled frequencies. Both spatial and frequency descriptions need their corresponding estimates.

Two intervals produce a triangle

Let f=g be the indicator of [0,1] on the line. Compute f*g, its L¹ norm, its supremum norm, and its squared L² norm.

  1. For a fixed x, the integrand is one where y lies in both [0,1] and [x−1,x]. The convolution is therefore the length of that overlap: x on [0,1], 2−x on [1,2], and zero outside [0,2].

  2. Integrate the two triangles to obtain L¹ norm 1/2+1/2=1. The maximum overlap length is one, reached at x=1, so the supremum norm is one.

  3. Square the two linear pieces and integrate: the squared L² norm is the integral of x² from zero to one plus its reflected copy, giving 2/3. Young's L²-by-L¹ estimate bounds the L² norm by 1, consistent with √(2/3).

The result

Convolution is a triangular function with mass one, maximum one, and squared L² norm 2/3. The exponent relation in Young's inequality identifies which of these norms can be compared.

Explore the model

Interactive lab

Interactive lab · heat

An averaging operator contracts a mode

Pause and Reset, then set both controls to mode n=2 and diffusivity κ=0.50. At time zero predict unit amplitude. After one Step, time is 0.5 and the amplitude is exp(−1). Reset and set n=1 and κ=0.50; after one Step predict exp(−0.25). Periodic heat evolution is convolution with a positive mass-one heat kernel, while this scene shows only one analytic mode rather than an arbitrary kernel or input.

An averaging operator contracts a modeThe exact periodic heat-equation mode is u(x,t) = exp(−κn²t) sin(nx), on [0,2π]. Playback advances physical time. The initial sine is shown separately, and the unnormalized L² norm is √π exp(−κn²t). This analytic instrument does not run a finite-difference solver or test discretization stability. Current readings: Current amplitude: 1; Spatial L² norm: 1.772; Decay rate · κn²: 3.6 /s. All parameters are adjustable with the labeled controls below.Periodic heat equation mode 3 at time 0: the amplitude is 1.0π/2π3π/22π−1−0.500.51x · periodic intervalTemperature perturbation uExact mode · n = 3
Current temperature modeInitial sineCurrent amplitude
Current amplitude
1
Spatial L² norm
1.772
Decay rate · κn²
3.6 /s
t = 0 s

The exact periodic heat-equation mode is u(x,t) = exp(−κn²t) sin(nx), on [0,2π]. Playback advances physical time. The initial sine is shown separately, and the unnormalized L² norm is √π exp(−κn²t). This analytic instrument does not run a finite-difference solver or test discretization stability. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forA positive normalized smoothing kernel contracts each displayed mode, but the general norm theorem still requires its stated function-space hypotheses.

Check your understanding

For an integrable mass-one kernel scaled as an approximate identity, which general norm convergence statement is valid?

Try it yourself

Let f be the indicator of [0,1] and k_epsilon the uniform density on [−epsilon,epsilon], with 0<epsilon<1/2. Find the smoothed value at zero, the essential-supremum error, and the L¹ error.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Near each endpoint the convolution is a linear ramp over an interval of width 2epsilon. Split the error into four triangles.

Compare with the solution

At zero exactly half the averaging interval lies in [0,1], so the value is 1/2. The error approaches 1/2 from either side of each jump, giving essential-supremum error 1/2 for every scale. Each of the four triangular error pieces has base epsilon and height 1/2, hence area epsilon/4; total L¹ error is epsilon. Thus the approximations converge in L¹ but not in L∞, despite being uniformly bounded positive averages with narrowing support.

Take it with you

  • Young's inequality includes an essential relation between its three exponents.
  • Mass preservation, bounded absolute mass, and concentration support approximate-identity arguments.
  • Finite-p recovery does not automatically imply uniform or everywhere pointwise recovery.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.