Documentation

LeanPool.RellichKondrachov.Analysis.FunctionalSpaces.Sobolev.Euclidean.L2Compactness.Approximation

compactness criterion: approximation-by-translation bounds (Euclidean) #

This file will prove the key inequality used in the Fréchet–Kolmogorov approach: smoothing by a probability kernel controls the error by the translation modulus.

Main results (planned) #

The principal statement will control ‖smoothL2 ψ u - extendByZeroL2 u‖₂ by an average (or sup) of ‖translateL2 t (extendByZeroL2 u) - extendByZeroL2 u‖₂ over t in the support of ψ.

The measure with density ψ with respect to Lebesgue measure. This will be a probability measure once ψ ≥ 0 and ∫ ψ = 1.

Equations
Instances For

    The kernel measure kernelMeasure ψ is a probability measure when ψ is a continuous, compactly supported, nonnegative density integrating to 1.