Distributions
Distributions
Distributions
Distribution Theory
Distributions/Generalized Functions
February 2024
Outline
1 Motivations
2 Distribution Theory
Duality framework
Calculus in the sense of distributions
Examples
Fourier calculus
Measure theory
The development of measure theory and the extension of Riesz
representation theorem led to a new understanding of the Dirac mass as
a specific (“Radon”) measure: instead of considering the Dirac mass
directly as if it were a function, characterize it by its effect through an
integral
w
def
ϕ(x) dµ = ϕ(x0 )
where dµ = δx0 (x) dx is a measure (different from the Lebesgue
measure dx): µ(A) = 1 iff x0 ∈ A and µ(A) = 0 otherwise.
Riesz representation theorem allows to define a function f (x)
alternatively to the “direct” characterization:
Classical definition: the complete collection of the real numbers
f (x) for x ∈ RN
Riesz
r definition: the complete collection of the real numbers
f (x)ϕ(x) dx for all “nice” functions ϕ(x)—test functions.
Test functions
The alternative definition of functions involves the choice of nice
functions. In the simplest case, these “test” functions are assumed to be
infinitely differentiable and with bounded support. The space of such
functions is denoted by D. Example in 1D:
(
1
exp(− x(1−x) ) if x ∈]0, 1[
ϕ(x) =
0 otherwise
0.02
0.018
0.016
0.014
0.012
φ(x)
0.01
0.008
0.006
0.004
0.002
0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
x
Definition of distributions
A distribution u(x) is a generalization of integrable functions to the
space of linear operators D ′ acting on D (its dual). More specifically, a
distribution is characterized by
1 its scalar product hu , ϕi with all test functions ϕ(x) ∈ D
2 its order L: for every closed bounded set K ⊂ RN , there exists a
constant CK such that for all ϕ supported within K†
| hu , ϕi | ≤ CK sup sup |∂ α ϕ(x)|
|α|≤L x∈K
∂ |α|
†α αn ; ∂ α =
P
= (α1 , α2 , . . . , αN ) nonnegative integers; |α| = n α α α .
∂x1 1 ∂x2 2 ···∂xNN
Prof. Thierry Blu Distributions/Generalized Functions 6/30
Duality framework
Motivations Calculus in the sense of distributions
Distribution Theory Examples
Fourier calculus
Support of distributions
Support
The support of a distribution u is the smallest closed set Su of RN such
that, for any ϕ ∈ D whose support does not intersect Su we have
hu , ϕi = 0
Gradient definition
The gradient of a scalar function is defined by a vector that satisfies the
duality formula
du(r) = h∇u(r) , dri
Here, hu , vi = uTv (no integral).
∇2 u , ψ = −
h∇u , ∇ψi
∂u ∂ψ 1 ∂u 1 ∂ψ 1 ∂u 1 ∂ψ
=− , − , − ,
∂ρ ∂ρ ρ ∂θ ρ ∂θ ρ sin θ ∂ϕ ρ sin θ ∂ϕ
w ∂u ∂ψ
1 ∂u ∂ψ 1 ∂u ∂ψ
=− + 2 + 2 2 ρ2 sin θ dρ dθ dϕ
∂ρ ∂ρ ρ ∂θ ∂θ ρ sin θ ∂ϕ ∂ϕ | {z }
Cartesian to spherical
coordinate change
w
∂ ρ2 ∂u
∂
∂u
1 ∂2u
= sin θ + sin θ + ψ dρ dθ dϕ
∂ρ ∂ρ ∂θ ∂θ sin θ ∂ϕ2
1 ∂ ρ2 ∂u 1 ∂ ∂u 1 ∂2u
= + sin θ + , ψ
ρ2 ∂ρ ∂ρ ρ2 sin θ ∂θ ∂θ ρ2 sin2 θ ∂ϕ2
Scaling distributions
1
For instance, this allows to see that δ(Ax) = δ(x).
| det A|
Differentiation
Derivatives of a distribution
By definition, the partial derivative of a distribution of order L with
respect to xn is a distribution of order L + 1 characterized by
∂u ∂ϕ
,ϕ = − u,
∂xk ∂xk
More generally, distributions can be differentiated infinitely
h∂ α u , ϕi = (−1)|α| hu , ∂ α ϕi
NOTE: The “minus” term results from the integration by part for normal
functions
w +∞ h i+∞ w +∞
u′ (x)ϕ(x) dx = u(x)ϕ(x) − u(x)ϕ′ (x) dx
−∞ −∞ −∞
| {z }
= 0 because ϕ has bounded support
Convolutions
Consider the function f (x0 ) = hu(x) , ϕ(x0 − x)i. This function is
infinitely differentiable (because of the order hypothesis). If the support
of u is bounded, then f ∈ D; i.e., it is infinitely differentiable with
bounded support. We denote it by (u ∗ ϕ)(x0 ).
def
It is possible to show that hu ∗ ϕ , ψi = hu , ϕ̌ ∗ ψi where ϕ̌(x) = ϕ(−x),
and ψ ∈ D.
Convolution of distributions
If u and v are two distributions, one of them with bounded support, then
their convolution product is defined by
hu ∗ v , ϕi = hu , v̌ ∗ ϕi, v has bounded support
hu ∗ v , ϕi = hv , ǔ ∗ ϕi, u has bounded support
where f is the distribution defined by fˇ , ϕ = hf , ϕ̌i.
ˇ
Multiplication of distributions
Limits
Regularizing sequence
Using the convolution property, this allows to see that any distribution u
is the limit of a sequence of infinitely differentiable functions
u ∗ ϕk ⇀ u
k→∞
3D Laplacian of 1/r
1
Hence, ∇2 = −4πδ(x, y, z).
ρ
Point distributions
The distributions whose support is restricted to one point {x0 } are all of
the form X
u(x) = ak ∂ α δ(x − x0 )
|α|≤L
where L ∈ N.
Proof : This is a consequence of the Lth order property, and of the use of
Taylor formula to approximate a test function ϕ in the neighborhood of x0 .
Tempered distributions
A function f (x) ∈ RN is said to be fastly decreasing if it decreases faster
than the inverse of any polynomial: for all n ≥ 0
lim kxkn |f (x)| = 0
kxk→∞
Schwartz class
The Schwartz class of functions S is made of the functions for which all
the derivatives have fast decrease. Of course, D ⊂ S .
Tempered distributions
Tempered distributions S ′ are the smaller set of distributions u for which
the scalar product hu , ϕi where ϕ ∈ S , can be defined.
Fourier
The Fourier transform of an L1 (RN ) function f (x) is defined by
w T
fˆ(ω) = f (x)e−iω x dN x
1 w ˆ T
and its inverse is given by f (x) = f (ω)eiω x dN ω.
2π N
r
Example: if u(x) = 1 then hu , ϕ̂i = ϕ̂(x) dN x = (2π)N ϕ(0), which
shows that û(ω) = (2π)N δ(ω).
NOTE: f ∈ S ⇔ fˆ ∈ S .
Fourier properties
Link with the convolution
Through a Fourier transform, the convolution becomes a simple
multiplication
f[
∗ g(ω) = fˆ(ω)ĝ(ω)
Other properties
Fourier
Duality: fˆ(x) −→ (2π)N f (−ω)
Fourier T
Translation: f (x − x0 ) −→ fˆ(ω)e−ix0 ω
T Fourier
Modulation: f (x)eiω0 x −→ fˆ(ω − ω0 )
Fourier
Differentiation: ∂ α f (x) −→ (iω)α fˆ(ω)
Fourier
Affine transformation: f (Ax) −→ det(A−1 ) fˆ (A−1 )Tω
Fourier
Hermitian symmetry: f ∗ (x) −→ fˆ∗D(−ω) E
Parseval theorem: (2π)N hf , g ∗ i = fˆ , ĝ ∗
1 w +∞ 2e−iωx dx w ∞ 2z −iω dz
If u(x) = then û(ω) = =
cosh(x) −∞ ex + e−x 0 1 + z2
by making the change of variables x = ln z. Im
x +i
For ω ≤ 0, consider the contour
Re
−R R
w R 2z −iω dz w 2z −iω dz w 0 2z −iω dz 2i−iω
+ + = 2iπ ×
0 1 + z2 half circle 1 + z 2 −R 1 + z 2
{z 2i }
| {z } | {z } | {z } |
−→ û(ω) −→ 0 −→ eπω û(ω) =2πeπω/2
R→∞ R→∞ R→∞
π
Hence û(ω) =
cosh(πω/2)
Poisson
For a function f (x) ∈ L1 (RN ) that decreases fastly enough, the Fourier
series decomposition formula becomes the Poisson summation formula
X X T
f (x + n) = fˆ(2πn)e2iπn x
n∈ZN n∈ZN
Poisson formula
X T X
e2iπn x = δ(x − n)
n∈ZN n∈ZN
Green’s Theorem
Consider a volume defined by V = {r ∈ R3 s.t. u3 (r) ≤ 0} and a vector
test function ϕ. We want to compute the volume integral †
w
∇· ϕ d3 r = H −u3 (r) , ∇· ϕ
V w
= δ u3 (r) ∇u3 , ϕ = δ u3 (r) ϕT ∇u3 d3 r
Green/Gauss/Ostrogradsky’s Theorem
More precisely, considering the reciprocal relation r = r(u1 , u2 , u3 ) of the
change of variables, the identity u r(u1 , u2 , u3 ) = (u1 , u2 , u3 ) implies
∇u∇r = Id which shows that
∂r ∂r ∂r
∇u3 ⊥ , , and ∇uT3 =1
∂u1 ∂u2 ∂u3
1 ∂r ∂r
hence that ∇u3 = × so that, finally
det ∇r ∂u1 ∂u2
Divergence formula
Assume that r = r(u1 , u2 , u3 ) defines a 3D change of variables such that
det ∇r > 0 and that in these new variables the volume V is characterized
by u3 ≤ 0; then
w w T ∂r ∂r
∇· ϕ(r) d3 r = ϕ r(u) × du1 du2
V ∂u1 ∂u2
| {z } u3 =0
dS