Distribution (mathematics)

<h2 id="history">History</h2>
The practical use of distributions can be traced back to the use of <a href="/facts/Green%27s_function/rKxKKPcp">Green's functions</a> in the 1830s to solve ordinary differential equations, but was not formalized until much later. According to Kolmogorov & Fomin (1957), generalized functions originated in the work of <a href="/facts/Sergei_Lvovich_Sobolev/YyBWWYzj">Sergei Sobolev</a> (1936) on <a href="/facts/Second-order_differential_equation/9MGbE3Ca">second-order</a> <a href="/facts/Hyperbolic_partial_differential_equation/znXgGuvh">hyperbolic partial differential equations</a>, and the ideas were developed in somewhat extended form by <a href="/facts/Laurent_Schwartz/Kxelk3ju">Laurent Schwartz</a> in the late 1940s. According to his autobiography, Schwartz introduced the term "distribution" by analogy with a distribution of electrical charge, possibly including not only point charges but also dipoles and so on. Gårding (1997) comments that although the ideas in the transformative book by Schwartz (1951) were not entirely new, it was Schwartz's broad attack and conviction that distributions would be useful almost everywhere in analysis that made the difference. A detailed history of the theory of distributions was given by Lützen (1982).

<h2 id="notation">Notation</h2>
The following notation will be used throughout this article:

<ul><li>
 
 
 
 n
 
 
 {\displaystyle n}
 
 is a fixed positive integer and 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is a fixed non-empty <a href="/facts/Open_set/QfTCIqMu">open subset</a> of <a href="/facts/Euclidean_space/R2UbzmzM">Euclidean space</a> 
 
 
 
 
 
 R
 
 
 n
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{n}.}
 
</li>
<li>
 
 
 
 
 
 N
 
 
 0
 
 
 =
 {
 0
 ,
 1
 ,
 2
 ,
 …
 }
 
 
 {\displaystyle \mathbb {N} _{0}=\{0,1,2,\ldots \}}
 
 denotes the <a href="/facts/Natural_number/u65og8JE">natural numbers</a>.</li>
<li>
 
 
 
 k
 
 
 {\displaystyle k}
 
 will denote a non-negative integer or 
 
 
 
 ∞
 .
 
 
 {\displaystyle \infty .}
 
</li>
<li>If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a <a href="/facts/Function_(mathematics)/CdReEKCh">function</a> then 
 
 
 
 Dom
 ⁡
 (
 f
 )
 
 
 {\displaystyle \operatorname {Dom} (f)}
 
 will denote its <a href="/facts/Domain_of_a_function/FQvoeUpX">domain</a> and the <a href="/facts/Support_(mathematics)/BTuMGbsb">support</a> of 
 
 
 
 f
 ,
 
 
 {\displaystyle f,}
 
 denoted by 
 
 
 
 supp
 ⁡
 (
 f
 )
 ,
 
 
 {\displaystyle \operatorname {supp} (f),}
 
 is defined to be the <a href="/facts/Closure_(topology)/9x2wlgUW">closure</a> of the set 
 
 
 
 {
 x
 ∈
 Dom
 ⁡
 (
 f
 )
 :
 f
 (
 x
 )
 ≠
 0
 }
 
 
 {\displaystyle \{x\in \operatorname {Dom} (f):f(x)\neq 0\}}
 
 in 
 
 
 
 Dom
 ⁡
 (
 f
 )
 .
 
 
 {\displaystyle \operatorname {Dom} (f).}
 
</li>
<li>For two functions 
 
 
 
 f
 ,
 g
 :
 U
 →
 
 C
 
 ,
 
 
 {\displaystyle f,g:U\to \mathbb {C} ,}
 
 the following notation defines a canonical <a href="/facts/Dual_system/2Y8KyofV">pairing</a>: 
 
 
 
 ⟨
 f
 ,
 g
 ⟩
 :=
 
 ∫
 
 U
 
 
 f
 (
 x
 )
 g
 (
 x
 )
 
 d
 x
 .
 
 
 {\displaystyle \langle f,g\rangle :=\int _{U}f(x)g(x)\,dx.}
 
</li>
<li>A <a href="/facts/Multi-index_notation/2wjdPgzS">multi-index</a> of size 
 
 
 
 n
 
 
 {\displaystyle n}
 
 is an element in 
 
 
 
 
 
 N
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {N} ^{n}}
 
 (given that 
 
 
 
 n
 
 
 {\displaystyle n}
 
 is fixed, if the size of multi-indices is omitted then the size should be assumed to be 
 
 
 
 n
 
 
 {\displaystyle n}
 
). The length of a multi-index 
 
 
 
 α
 =
 (
 
 α
 
 1
 
 
 ,
 …
 ,
 
 α
 
 n
 
 
 )
 ∈
 
 
 N
 
 
 n
 
 
 
 
 {\displaystyle \alpha =(\alpha _{1},\ldots ,\alpha _{n})\in \mathbb {N} ^{n}}
 
 is defined as 
 
 
 
 
 α
 
 1
 
 
 +
 ⋯
 +
 
 α
 
 n
 
 
 
 
 {\displaystyle \alpha _{1}+\cdots +\alpha _{n}}
 
 and denoted by 
 
 
 
 
 |
 
 α
 
 |
 
 .
 
 
 {\displaystyle |\alpha |.}
 
 Multi-indices are particularly useful when dealing with functions of several variables, in particular, we introduce the following notations for a given multi-index 
 
 
 
 α
 =
 (
 
 α
 
 1
 
 
 ,
 …
 ,
 
 α
 
 n
 
 
 )
 ∈
 
 
 N
 
 
 n
 
 
 
 
 {\displaystyle \alpha =(\alpha _{1},\ldots ,\alpha _{n})\in \mathbb {N} ^{n}}
 
: 
 
 
 
 
 
 
 
 
 x
 
 α
 
 
 
 
 
 =
 
 x
 
 1
 
 
 
 α
 
 1
 
 
 
 
 ⋯
 
 x
 
 n
 
 
 
 α
 
 n
 
 
 
 
 
 
 
 
 
 ∂
 
 α
 
 
 
 
 
 =
 
 
 
 ∂
 
 
 |
 
 α
 
 |
 
 
 
 
 ∂
 
 x
 
 1
 
 
 
 α
 
 1
 
 
 
 
 ⋯
 ∂
 
 x
 
 n
 
 
 
 α
 
 n
 
 
 
 
 
 
 
 
 
 
 
 
 
 {\displaystyle {\begin{aligned}x^{\alpha }&=x_{1}^{\alpha _{1}}\cdots x_{n}^{\alpha _{n}}\\\partial ^{\alpha }&={\frac {\partial ^{|\alpha |}}{\partial x_{1}^{\alpha _{1}}\cdots \partial x_{n}^{\alpha _{n}}}}\end{aligned}}}
 
 We also introduce a partial order of all multi-indices by 
 
 
 
 β
 ≥
 α
 
 
 {\displaystyle \beta \geq \alpha }
 
 if and only if 
 
 
 
 
 β
 
 i
 
 
 ≥
 
 α
 
 i
 
 
 
 
 {\displaystyle \beta _{i}\geq \alpha _{i}}
 
 for all 
 
 
 
 1
 ≤
 i
 ≤
 n
 .
 
 
 {\displaystyle 1\leq i\leq n.}
 
 When 
 
 
 
 β
 ≥
 α
 
 
 {\displaystyle \beta \geq \alpha }
 
 we define their multi-index binomial coefficient as: 
 
 
 
 
 
 
 (
 
 
 β
 α
 
 
 )
 
 
 
 :=
 
 
 
 (
 
 
 
 β
 
 1
 
 
 
 α
 
 1
 
 
 
 
 )
 
 
 
 ⋯
 
 
 
 (
 
 
 
 β
 
 n
 
 
 
 α
 
 n
 
 
 
 
 )
 
 
 
 .
 
 
 {\displaystyle {\binom {\beta }{\alpha }}:={\binom {\beta _{1}}{\alpha _{1}}}\cdots {\binom {\beta _{n}}{\alpha _{n}}}.}
 
</li></ul>
<h2 id="definitions-of-test-functions-and-distributions">Definitions of test functions and distributions</h2>
In this section, some basic notions and definitions needed to define real-valued distributions on U are introduced. Further discussion of the topologies on the spaces of test functions and distributions is given in the article on <a href="/facts/Spaces_of_test_functions_and_distributions/DKvhBcdc">spaces of test functions and distributions</a>.

Notation: 
<ol><li>Let 
 
 
 
 k
 ∈
 {
 0
 ,
 1
 ,
 2
 ,
 …
 ,
 ∞
 }
 .
 
 
 {\displaystyle k\in \{0,1,2,\ldots ,\infty \}.}
 
</li>
<li>Let 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 denote the <a href="/facts/Vector_space/M1pxMLx2">vector space</a> of all k-times <a href="/facts/Continuously_differentiable/jQqTgLk1">continuously differentiable</a> real or complex-valued functions on U.</li>
<li>For any compact subset 
 
 
 
 K
 ⊆
 U
 ,
 
 
 {\displaystyle K\subseteq U,}
 
 let 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 and 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 both denote the vector space of all those functions 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{k}(U)}
 
 such that 
 
 
 
 supp
 ⁡
 (
 f
 )
 ⊆
 K
 .
 
 
 {\displaystyle \operatorname {supp} (f)\subseteq K.}

<ul><li>If 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle f\in C^{k}(K)}
 
 then the domain of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is U and not K. So although 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 depends on both K and U, only K is typically indicated. The justification for this common practice is detailed below. The notation 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 will only be used when the notation 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 risks being ambiguous.</li>
<li>Every 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 contains the constant 0 map, even if 
 
 
 
 K
 =
 ∅
 .
 
 
 {\displaystyle K=\varnothing .}
 
</li></ul></li>
<li>Let 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 denote the set of all 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{k}(U)}
 
 such that 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle f\in C^{k}(K)}
 
 for some compact subset K of U.
<ul><li>Equivalently, 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 is the set of all 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{k}(U)}
 
 such that 
 
 
 
 f
 
 
 {\displaystyle f}
 
 has compact support.</li>
<li>
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 is equal to the union of all 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 as 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 ranges over all compact subsets of 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
</li>
<li>If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a real-valued function on 
 
 
 
 U
 
 
 {\displaystyle U}
 
, then 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is an element of 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 if and only if 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a 
 
 
 
 
 C
 
 k
 
 
 
 
 {\displaystyle C^{k}}
 
 <a href="/facts/Bump_function/ExdBtMHN">bump function</a>. Every real-valued test function on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is also a complex-valued test function on 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
</li></ul></li></ol>

For all 
 
 
 
 j
 ,
 k
 ∈
 {
 0
 ,
 1
 ,
 2
 ,
 …
 ,
 ∞
 }
 
 
 {\displaystyle j,k\in \{0,1,2,\ldots ,\infty \}}
 
 and any compact subsets 
 
 
 
 K
 
 
 {\displaystyle K}
 
 and 
 
 
 
 L
 
 
 {\displaystyle L}
 
 of 
 
 
 
 U
 
 
 {\displaystyle U}
 
, we have:

C
                  
                    k
                  
                
                (
                K
                )
              
              
                
                ⊆
                
                  C
                  
                    c
                  
                  
                    k
                  
                
                (
                U
                )
                ⊆
                
                  C
                  
                    k
                  
                
                (
                U
                )
              
            
            
              
                
                  C
                  
                    k
                  
                
                (
                K
                )
              
              
                
                ⊆
                
                  C
                  
                    k
                  
                
                (
                L
                )
              
              
              
                
                  if 
                
                K
                ⊆
                L
              
            
            
              
                
                  C
                  
                    k
                  
                
                (
                K
                )
              
              
                
                ⊆
                
                  C
                  
                    j
                  
                
                (
                K
                )
              
              
              
                
                  if 
                
                j
                ≤
                k
              
            
            
              
                
                  C
                  
                    c
                  
                  
                    k
                  
                
                (
                U
                )
              
              
                
                ⊆
                
                  C
                  
                    c
                  
                  
                    j
                  
                
                (
                U
                )
              
              
              
                
                  if 
                
                j
                ≤
                k
              
            
            
              
                
                  C
                  
                    k
                  
                
                (
                U
                )
              
              
                
                ⊆
                
                  C
                  
                    j
                  
                
                (
                U
                )
              
              
              
                
                  if 
                
                j
                ≤
                k
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}C^{k}(K)&\subseteq C_{c}^{k}(U)\subseteq C^{k}(U)\\C^{k}(K)&\subseteq C^{k}(L)&&{\text{if }}K\subseteq L\\C^{k}(K)&\subseteq C^{j}(K)&&{\text{if }}j\leq k\\C_{c}^{k}(U)&\subseteq C_{c}^{j}(U)&&{\text{if }}j\leq k\\C^{k}(U)&\subseteq C^{j}(U)&&{\text{if }}j\leq k\\\end{aligned}}}

Definition: Elements of 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 are called test functions on U and 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is called the space of test functions on U. We will use both 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 and 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 to denote this space.
Distributions on U are <a href="/facts/Continuous_linear_functional/KcqjDBrJ">continuous linear functionals</a> on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 when this vector space is endowed with a particular topology called the canonical LF-topology. The following proposition states two necessary and sufficient conditions for the continuity of a linear function on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 that are often straightforward to verify.
Proposition: A <a href="/facts/Linear_form/oGh7Asrz">linear functional</a> T on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is continuous, and therefore a distribution, if and only if any of the following equivalent conditions is satisfied:

<ol><li>For every compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 there exist constants 
 
 
 
 C
 >
 0
 
 
 {\displaystyle C>0}
 
 and 
 
 
 
 N
 ∈
 
 N
 
 
 
 {\displaystyle N\in \mathbb {N} }
 
 (dependent on 
 
 
 
 K
 
 
 {\displaystyle K}
 
) such that for all 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C_{c}^{\infty }(U)}
 
 with support contained in 
 
 
 
 K
 
 
 {\displaystyle K}
 
,<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a><a class="footnote-ref" id="fnref:2" href="#fn:2">2</a> 
 
 
 
 
 |
 
 T
 (
 f
 )
 
 |
 
 ≤
 C
 sup
 {
 
 |
 
 
 ∂
 
 α
 
 
 f
 (
 x
 )
 
 |
 
 :
 x
 ∈
 U
 ,
 
 |
 
 α
 
 |
 
 ≤
 N
 }
 .
 
 
 {\displaystyle |T(f)|\leq C\sup\{|\partial ^{\alpha }f(x)|:x\in U,|\alpha |\leq N\}.}
 
</li>
<li>For every compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 and every sequence 
 
 
 
 {
 
 f
 
 i
 
 
 
 }
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \{f_{i}\}_{i=1}^{\infty }}
 
 in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 whose supports are contained in 
 
 
 
 K
 
 
 {\displaystyle K}
 
, if 
 
 
 
 {
 
 ∂
 
 α
 
 
 
 f
 
 i
 
 
 
 }
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \{\partial ^{\alpha }f_{i}\}_{i=1}^{\infty }}
 
 converges uniformly to zero on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 for every <a href="/facts/Multi-index/2wjdPgzS">multi-index</a> 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
, then 
 
 
 
 T
 (
 
 f
 
 i
 
 
 )
 →
 0.
 
 
 {\displaystyle T(f_{i})\to 0.}
 
</li></ol>
<h3>Topology on Ck(U)</h3>
We now introduce the <a href="/facts/Seminorm/vMuescKp">seminorms</a> that will define the topology on 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(U).}
 
 Different authors sometimes use different families of seminorms so we list the most common families below. However, the resulting topology is the same no matter which family is used.

Suppose 
 
 
 
 k
 ∈
 {
 0
 ,
 1
 ,
 2
 ,
 …
 ,
 ∞
 }
 
 
 {\displaystyle k\in \{0,1,2,\ldots ,\infty \}}
 
 and 
 
 
 
 K
 
 
 {\displaystyle K}
 
 is an arbitrary compact subset of 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 Suppose 
 
 
 
 i
 
 
 {\displaystyle i}
 
 is an integer such that 
 
 
 
 0
 ≤
 i
 ≤
 k
 
 
 {\displaystyle 0\leq i\leq k}
 
<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a> and 
 
 
 
 p
 
 
 {\displaystyle p}
 
 is a multi-index with length 
 
 
 
 
 |
 
 p
 
 |
 
 ≤
 k
 .
 
 
 {\displaystyle |p|\leq k.}
 
 For 
 
 
 
 K
 ≠
 ∅
 
 
 {\displaystyle K\neq \varnothing }
 
 and 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle f\in C^{k}(U),}
 
 define:

 
 
 
 
 
 
 
 
  (1) 
 
  
 
 
 
 s
 
 p
 ,
 K
 
 
 (
 f
 )
 
 
 
 
 :=
 
 sup
 
 
 x
 
 0
 
 
 ∈
 K
 
 
 
 |
 
 
 ∂
 
 p
 
 
 f
 (
 
 x
 
 0
 
 
 )
 
 |
 
 
 
 
 
 
  (2) 
 
  
 
 
 
 q
 
 i
 ,
 K
 
 
 (
 f
 )
 
 
 
 
 :=
 
 sup
 
 
 |
 
 p
 
 |
 
 ≤
 i
 
 
 
 (
 
 
 sup
 
 
 x
 
 0
 
 
 ∈
 K
 
 
 
 |
 
 
 ∂
 
 p
 
 
 f
 (
 
 x
 
 0
 
 
 )
 
 |
 
 
 )
 
 =
 
 sup
 
 
 |
 
 p
 
 |
 
 ≤
 i
 
 
 
 (
 
 
 s
 
 p
 ,
 K
 
 
 (
 f
 )
 
 )
 
 
 
 
 
 
  (3) 
 
  
 
 
 
 r
 
 i
 ,
 K
 
 
 (
 f
 )
 
 
 
 
 :=
 
 sup
 
 
 
 
 
 x
 
 0
 
 
 ∈
 K
 
 
 
 |
 
 p
 
 |
 
 ≤
 i
 
 
 
 
 
 
 |
 
 
 ∂
 
 p
 
 
 f
 (
 
 x
 
 0
 
 
 )
 
 |
 
 
 
 
 
 
  (4) 
 
  
 
 
 
 t
 
 i
 ,
 K
 
 
 (
 f
 )
 
 
 
 
 :=
 
 sup
 
 
 x
 
 0
 
 
 ∈
 K
 
 
 
 (
 
 
 ∑
 
 
 |
 
 p
 
 |
 
 ≤
 i
 
 
 
 |
 
 
 ∂
 
 p
 
 
 f
 (
 
 x
 
 0
 
 
 )
 
 |
 
 
 )
 
 
 
 
 
 
 
 {\displaystyle {\begin{alignedat}{4}{\text{ (1) }}\ &s_{p,K}(f)&&:=\sup _{x_{0}\in K}\left|\partial ^{p}f(x_{0})\right|\\[4pt]{\text{ (2) }}\ &q_{i,K}(f)&&:=\sup _{|p|\leq i}\left(\sup _{x_{0}\in K}\left|\partial ^{p}f(x_{0})\right|\right)=\sup _{|p|\leq i}\left(s_{p,K}(f)\right)\\[4pt]{\text{ (3) }}\ &r_{i,K}(f)&&:=\sup _{\stackrel {|p|\leq i}{x_{0}\in K}}\left|\partial ^{p}f(x_{0})\right|\\[4pt]{\text{ (4) }}\ &t_{i,K}(f)&&:=\sup _{x_{0}\in K}\left(\sum _{|p|\leq i}\left|\partial ^{p}f(x_{0})\right|\right)\end{alignedat}}}

while for 
 
 
 
 K
 =
 ∅
 ,
 
 
 {\displaystyle K=\varnothing ,}
 
 define all the functions above to be the constant 0 map.
All of the functions above are non-negative 
 
 
 
 
 R
 
 
 
 {\displaystyle \mathbb {R} }
 
-valued<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a> <a href="/facts/Seminorm/vMuescKp">seminorms</a> on 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(U).}
 
 As explained in <a href="/facts/Locally_convex_topological_vector_space/AGrPrayC">this article</a>, every set of seminorms on a vector space induces a <a href="/facts/Locally_convex_topological_vector_space/AGrPrayC">locally convex</a> <a href="/facts/Topological_vector_space/XRex1ChN">vector topology</a>.
Each of the following sets of seminorms

A
                 
                :=
                
              
              
                
                {
                
                  q
                  
                    i
                    ,
                    K
                  
                
              
              
              
                
                :
                
                K
                
                   compact and 
                
                
              
              
              
                i
                ∈
                
                  N
                
                
                   satisfies 
                
                
              
              
              
                0
                ≤
                i
                ≤
                k
                }
              
            
            
              
                B
                 
                :=
                
              
              
                
                {
                
                  r
                  
                    i
                    ,
                    K
                  
                
              
              
              
                
                :
                
                K
                
                   compact and 
                
                
              
              
              
                i
                ∈
                
                  N
                
                
                   satisfies 
                
                
              
              
              
                0
                ≤
                i
                ≤
                k
                }
              
            
            
              
                C
                 
                :=
                
              
              
                
                {
                
                  t
                  
                    i
                    ,
                    K
                  
                
              
              
              
                
                :
                
                K
                
                   compact and 
                
                
              
              
              
                i
                ∈
                
                  N
                
                
                   satisfies 
                
                
              
              
              
                0
                ≤
                i
                ≤
                k
                }
              
            
            
              
                D
                 
                :=
                
              
              
                
                {
                
                  s
                  
                    p
                    ,
                    K
                  
                
              
              
              
                
                :
                
                K
                
                   compact and 
                
                
              
              
              
                p
                ∈
                
                  
                    N
                  
                  
                    n
                  
                
                
                   satisfies 
                
                
              
              
              
                
                
                  |
                
                p
                
                  |
                
                ≤
                k
                }
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{4}A~:=\quad &\{q_{i,K}&&:\;K{\text{ compact and }}\;&&i\in \mathbb {N} {\text{ satisfies }}\;&&0\leq i\leq k\}\\B~:=\quad &\{r_{i,K}&&:\;K{\text{ compact and }}\;&&i\in \mathbb {N} {\text{ satisfies }}\;&&0\leq i\leq k\}\\C~:=\quad &\{t_{i,K}&&:\;K{\text{ compact and }}\;&&i\in \mathbb {N} {\text{ satisfies }}\;&&0\leq i\leq k\}\\D~:=\quad &\{s_{p,K}&&:\;K{\text{ compact and }}\;&&p\in \mathbb {N} ^{n}{\text{ satisfies }}\;&&|p|\leq k\}\end{alignedat}}}

generate the same <a href="/facts/Locally_convex_topological_vector_space/AGrPrayC">locally convex</a> <a href="/facts/Topological_vector_space/XRex1ChN">vector topology</a> on 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 (so for example, the topology generated by the seminorms in 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is equal to the topology generated by those in 
 
 
 
 C
 
 
 {\displaystyle C}
 
). 

The vector space 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 is endowed with the <a href="/facts/Locally_convex_topological_vector_space/AGrPrayC">locally convex</a> topology induced by any one of the four families 
 
 
 
 A
 ,
 B
 ,
 C
 ,
 D
 
 
 {\displaystyle A,B,C,D}
 
 of seminorms described above. This topology is also equal to the vector topology induced by all of the seminorms in 
 
 
 
 A
 ∪
 B
 ∪
 C
 ∪
 D
 .
 
 
 {\displaystyle A\cup B\cup C\cup D.}

With this topology, 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 becomes a locally convex <a href="/facts/Fr%C3%A9chet_space/9gXkQu2u">Fréchet space</a> that is not <a href="/facts/Normable_space/rmDljfyE">normable</a>. Every element of 
 
 
 
 A
 ∪
 B
 ∪
 C
 ∪
 D
 
 
 {\displaystyle A\cup B\cup C\cup D}
 
 is a continuous seminorm on 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(U).}

Under this topology, a <a href="/facts/Net_(mathematics)/msmsvMTT">net</a> 
 
 
 
 (
 
 f
 
 i
 
 
 
 )
 
 i
 ∈
 I
 
 
 
 
 {\displaystyle (f_{i})_{i\in I}}
 
 in 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 converges to 
 
 
 
 f
 ∈
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{k}(U)}
 
 if and only if for every multi-index 
 
 
 
 p
 
 
 {\displaystyle p}
 
 with 
 
 
 
 
 |
 
 p
 
 |
 
 <
 k
 +
 1
 
 
 {\displaystyle |p|<k+1}
 
 and every compact 
 
 
 
 K
 ,
 
 
 {\displaystyle K,}
 
 the net of partial derivatives 
 
 
 
 
 
 (
 
 
 ∂
 
 p
 
 
 
 f
 
 i
 
 
 
 )
 
 
 i
 ∈
 I
 
 
 
 
 {\displaystyle \left(\partial ^{p}f_{i}\right)_{i\in I}}
 
 <a href="/facts/Uniform_convergence/ecz9eNWn">converges uniformly</a> to 
 
 
 
 
 ∂
 
 p
 
 
 f
 
 
 {\displaystyle \partial ^{p}f}
 
 on 
 
 
 
 K
 .
 
 
 {\displaystyle K.}
 
<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> For any 
 
 
 
 k
 ∈
 {
 0
 ,
 1
 ,
 2
 ,
 …
 ,
 ∞
 }
 ,
 
 
 {\displaystyle k\in \{0,1,2,\ldots ,\infty \},}
 
 any <a href="/facts/Bounded_set_(topological_vector_space)/bTsWeU9g">(von Neumann) bounded subset</a> of 
 
 
 
 
 C
 
 k
 +
 1
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k+1}(U)}
 
 is a <a href="/facts/Relatively_compact/z5uIqMDp">relatively compact</a> subset of 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(U).}
 
<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> In particular, a subset of 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 is bounded if and only if it is bounded in 
 
 
 
 
 C
 
 i
 
 
 (
 U
 )
 
 
 {\displaystyle C^{i}(U)}
 
 for all 
 
 
 
 i
 ∈
 
 N
 
 .
 
 
 {\displaystyle i\in \mathbb {N} .}
 
<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a> The space 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 is a <a href="/facts/Montel_space/HLXqXHzs">Montel space</a> if and only if 
 
 
 
 k
 =
 ∞
 .
 
 
 {\displaystyle k=\infty .}
 
<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a>
A subset 
 
 
 
 W
 
 
 {\displaystyle W}
 
 of 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 is open in this topology if and only if there exists 
 
 
 
 i
 ∈
 
 N
 
 
 
 {\displaystyle i\in \mathbb {N} }
 
 such that 
 
 
 
 W
 
 
 {\displaystyle W}
 
 is open when 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 is endowed with the <a href="/facts/Subspace_topology/NjU6z4Ca">subspace topology</a> induced on it by 
 
 
 
 
 C
 
 i
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{i}(U).}

<h4>Topology on Ck(K)</h4>
As before, fix 
 
 
 
 k
 ∈
 {
 0
 ,
 1
 ,
 2
 ,
 …
 ,
 ∞
 }
 .
 
 
 {\displaystyle k\in \{0,1,2,\ldots ,\infty \}.}
 
 Recall that if 
 
 
 
 K
 
 
 {\displaystyle K}
 
 is any compact subset of 
 
 
 
 U
 
 
 {\displaystyle U}
 
 then 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 ⊆
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(K)\subseteq C^{k}(U).}

Assumption: For any compact subset 
 
 
 
 K
 ⊆
 U
 ,
 
 
 {\displaystyle K\subseteq U,}
 
 we will henceforth assume that 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 is endowed with the <a href="/facts/Subspace_topology/NjU6z4Ca">subspace topology</a> it inherits from the <a href="/facts/Fr%C3%A9chet_space/9gXkQu2u">Fréchet space</a> 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(U).}

If 
 
 
 
 k
 
 
 {\displaystyle k}
 
 is finite then 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 is a <a href="/facts/Banach_space/sDEIk7EC">Banach space</a><a class="footnote-ref" id="fnref:9" href="#fn:9">9</a> with a topology that can be defined by the <a href="/facts/Norm_(mathematics)/xIbR4uE1">norm</a>

r
 
 K
 
 
 (
 f
 )
 :=
 
 sup
 
 
 |
 
 p
 
 |
 
 <
 k
 
 
 
 (
 
 
 sup
 
 
 x
 
 0
 
 
 ∈
 K
 
 
 
 |
 
 
 ∂
 
 p
 
 
 f
 (
 
 x
 
 0
 
 
 )
 
 |
 
 
 )
 
 .
 
 
 {\displaystyle r_{K}(f):=\sup _{|p|<k}\left(\sup _{x_{0}\in K}\left|\partial ^{p}f(x_{0})\right|\right).}

<h4>Trivial extensions and independence of Ck(K)'s topology from U</h4>
Suppose 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is an open subset of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 and 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 is a compact subset. By definition, elements of 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 are functions with domain 
 
 
 
 U
 
 
 {\displaystyle U}
 
 (in symbols, 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 ⊆
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(K)\subseteq C^{k}(U)}
 
), so the space 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 and its topology depend on 
 
 
 
 U
 ;
 
 
 {\displaystyle U;}
 
 to make this dependence on the open set 
 
 
 
 U
 
 
 {\displaystyle U}
 
 clear, temporarily denote 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 by 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 .
 
 
 {\displaystyle C^{k}(K;U).}
 
 
Importantly, changing the set 
 
 
 
 U
 
 
 {\displaystyle U}
 
 to a different open subset 
 
 
 
 
 U
 ′
 
 
 
 {\displaystyle U'}
 
 (with 
 
 
 
 K
 ⊆
 
 U
 ′
 
 
 
 {\displaystyle K\subseteq U'}
 
) will change the set 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 from 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 to 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 
 U
 ′
 
 )
 ,
 
 
 {\displaystyle C^{k}(K;U'),}
 
<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> so that elements of 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 will be functions with domain 
 
 
 
 
 U
 ′
 
 
 
 {\displaystyle U'}
 
 instead of 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 
Despite 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 depending on the open set (
 
 
 
 U
 
  or 
 
 
 U
 ′
 
 
 
 {\displaystyle U{\text{ or }}U'}
 
), the standard notation for 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 makes no mention of it. 
This is justified because, as this subsection will now explain, the space 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 is canonically identified as a subspace of 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 
 U
 ′
 
 )
 
 
 {\displaystyle C^{k}(K;U')}
 
 (both algebraically and topologically). 
It is enough to explain how to canonically identify 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 with 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 
 U
 ′
 
 )
 
 
 {\displaystyle C^{k}(K;U')}
 
 when one of 
 
 
 
 U
 
 
 {\displaystyle U}
 
 and 
 
 
 
 
 U
 ′
 
 
 
 {\displaystyle U'}
 
 is a subset of the other. The reason is that if 
 
 
 
 V
 
 
 {\displaystyle V}
 
 and 
 
 
 
 W
 
 
 {\displaystyle W}
 
 are arbitrary open subsets of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 containing 
 
 
 
 K
 
 
 {\displaystyle K}
 
 then the open set 
 
 
 
 U
 :=
 V
 ∩
 W
 
 
 {\displaystyle U:=V\cap W}
 
 also contains 
 
 
 
 K
 ,
 
 
 {\displaystyle K,}
 
 so that each of 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 V
 )
 
 
 {\displaystyle C^{k}(K;V)}
 
 and 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 W
 )
 
 
 {\displaystyle C^{k}(K;W)}
 
 is canonically identified with 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 V
 ∩
 W
 )
 
 
 {\displaystyle C^{k}(K;V\cap W)}
 
 and now by transitivity, 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 V
 )
 
 
 {\displaystyle C^{k}(K;V)}
 
 is thus identified with 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 W
 )
 .
 
 
 {\displaystyle C^{k}(K;W).}
 
 
So assume 
 
 
 
 U
 ⊆
 V
 
 
 {\displaystyle U\subseteq V}
 
 are open subsets of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 containing 
 
 
 
 K
 .
 
 
 {\displaystyle K.}

Given 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle f\in C_{c}^{k}(U),}
 
 its trivial extension to 
 
 
 
 V
 
 
 {\displaystyle V}
 
 is the function 
 
 
 
 F
 :
 V
 →
 
 C
 
 
 
 {\displaystyle F:V\to \mathbb {C} }
 
 defined by:

F
        (
        x
        )
        =
        
          
            {
            
              
                
                  f
                  (
                  x
                  )
                
                
                  x
                  ∈
                  U
                  ,
                
              
              
                
                  0
                
                
                  
                    otherwise
                  
                  .
                
              
            
            
          
        
      
    
    {\displaystyle F(x)={\begin{cases}f(x)&x\in U,\\0&{\text{otherwise}}.\end{cases}}}

This trivial extension belongs to 
 
 
 
 
 C
 
 k
 
 
 (
 V
 )
 
 
 {\displaystyle C^{k}(V)}
 
 (because 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C_{c}^{k}(U)}
 
 has compact support) and it will be denoted by 
 
 
 
 I
 (
 f
 )
 
 
 {\displaystyle I(f)}
 
 (that is, 
 
 
 
 I
 (
 f
 )
 :=
 F
 
 
 {\displaystyle I(f):=F}
 
). The assignment 
 
 
 
 f
 ↦
 I
 (
 f
 )
 
 
 {\displaystyle f\mapsto I(f)}
 
 thus induces a map 
 
 
 
 I
 :
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 →
 
 C
 
 k
 
 
 (
 V
 )
 
 
 {\displaystyle I:C_{c}^{k}(U)\to C^{k}(V)}
 
 that sends a function in 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 to its trivial extension on 
 
 
 
 V
 .
 
 
 {\displaystyle V.}
 
 This map is a linear <a href="/facts/Injective_function/5ES6tqf5">injection</a> and for every compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 (where 
 
 
 
 K
 
 
 {\displaystyle K}
 
 is also a compact subset of 
 
 
 
 V
 
 
 {\displaystyle V}
 
 since 
 
 
 
 K
 ⊆
 U
 ⊆
 V
 
 
 {\displaystyle K\subseteq U\subseteq V}
 
),

I
                
                  (
                  
                    
                      C
                      
                        k
                      
                    
                    (
                    K
                    ;
                    U
                    )
                  
                  )
                
              
              
                 
                =
                 
                
                  C
                  
                    k
                  
                
                (
                K
                ;
                V
                )
                
                
                   and thus 
                
              
            
            
              
                I
                
                  (
                  
                    
                      C
                      
                        c
                      
                      
                        k
                      
                    
                    (
                    U
                    )
                  
                  )
                
              
              
                 
                ⊆
                 
                
                  C
                  
                    c
                  
                  
                    k
                  
                
                (
                V
                )
                .
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{4}I\left(C^{k}(K;U)\right)&~=~C^{k}(K;V)\qquad {\text{ and thus }}\\I\left(C_{c}^{k}(U)\right)&~\subseteq ~C_{c}^{k}(V).\end{alignedat}}}

If 
 
 
 
 I
 
 
 {\displaystyle I}
 
 is restricted to 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 then the following induced linear map is a <a href="/facts/Homeomorphism/jMfWg3Mn">homeomorphism</a> (linear homeomorphisms are called <a href="/facts/TVS-isomorphism/XRex1ChN">TVS-isomorphisms</a>):

C
                  
                    k
                  
                
                (
                K
                ;
                U
                )
              
              
              
                
                →
                
              
              
              
                
                  C
                  
                    k
                  
                
                (
                K
                ;
                V
                )
              
            
            
              
              
                f
              
              
              
                
                ↦
                
              
              
              
                I
                (
                f
                )
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{4}\,&C^{k}(K;U)&&\to \,&&C^{k}(K;V)\\&f&&\mapsto \,&&I(f)\\\end{alignedat}}}

and thus the next map is a <a href="/facts/Topological_embedding/HKeVKc42">topological embedding</a>:

C
                  
                    k
                  
                
                (
                K
                ;
                U
                )
              
              
              
                
                →
                
              
              
              
                
                  C
                  
                    k
                  
                
                (
                V
                )
              
            
            
              
              
                f
              
              
              
                
                ↦
                
              
              
              
                I
                (
                f
                )
                .
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{4}\,&C^{k}(K;U)&&\to \,&&C^{k}(V)\\&f&&\mapsto \,&&I(f).\\\end{alignedat}}}

Using the injection

I
        :
        
          C
          
            c
          
          
            k
          
        
        (
        U
        )
        →
        
          C
          
            k
          
        
        (
        V
        )
      
    
    {\displaystyle I:C_{c}^{k}(U)\to C^{k}(V)}

the vector space 
  
    
      
        
          C
          
            c
          
          
            k
          
        
        (
        U
        )
      
    
    {\displaystyle C_{c}^{k}(U)}
  
 is canonically identified with its image in 
  
    
      
        
          C
          
            c
          
          
            k
          
        
        (
        V
        )
        ⊆
        
          C
          
            k
          
        
        (
        V
        )
        .
      
    
    {\displaystyle C_{c}^{k}(V)\subseteq C^{k}(V).}
  
 Because 
  
    
      
        
          C
          
            k
          
        
        (
        K
        ;
        U
        )
        ⊆
        
          C
          
            c
          
          
            k
          
        
        (
        U
        )
        ,
      
    
    {\displaystyle C^{k}(K;U)\subseteq C_{c}^{k}(U),}
  
 through this identification, 
  
    
      
        
          C
          
            k
          
        
        (
        K
        ;
        U
        )
      
    
    {\displaystyle C^{k}(K;U)}
  
 can also be considered as a subset of 
  
    
      
        
          C
          
            k
          
        
        (
        V
        )
        .
      
    
    {\displaystyle C^{k}(V).}

Thus the topology on 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 
 
 {\displaystyle C^{k}(K;U)}
 
 is independent of the open subset 
 
 
 
 U
 
 
 {\displaystyle U}
 
 of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 that contains 
 
 
 
 K
 ,
 
 
 {\displaystyle K,}
 
<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a> which justifies the practice of writing 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 instead of 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 .
 
 
 {\displaystyle C^{k}(K;U).}

<h3>Canonical LF topology</h3>
Main article: <a href="/facts/Spaces_of_test_functions_and_distributions/DKvhBcdc">Spaces of test functions and distributions</a>
See also: <a href="/facts/LF-space/voQHEeGI">LF-space</a> and <a href="/facts/Topology_of_uniform_convergence/TVmUH4ao">Topology of uniform convergence</a>
Recall that 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 denotes all functions in 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C^{k}(U)}
 
 that have compact support in 
 
 
 
 U
 ,
 
 
 {\displaystyle U,}
 
 where note that 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 is the union of all 
 
 
 
 
 C
 
 k
 
 
 (
 K
 )
 
 
 {\displaystyle C^{k}(K)}
 
 as 
 
 
 
 K
 
 
 {\displaystyle K}
 
 ranges over all compact subsets of 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 Moreover, for each 
 
 
 
 k
 ,
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle k,\,C_{c}^{k}(U)}
 
 is a dense subset of 
 
 
 
 
 C
 
 k
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{k}(U).}
 
 The special case when 
 
 
 
 k
 =
 ∞
 
 
 {\displaystyle k=\infty }
 
 gives us the space of test functions.

C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is called the space of test functions on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 and it may also be denoted by 
 
 
 
 
 
 D
 
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}(U).}
 
 Unless indicated otherwise, it is endowed with a topology called the canonical LF topology, whose definition is given in the article: <a href="/facts/Spaces_of_test_functions_and_distributions/DKvhBcdc">Spaces of test functions and distributions</a>.
The canonical LF-topology is not metrizable and importantly, it is <a href="/facts/Comparison_of_topologies/5Q9F2fjf">strictly finer</a> than the <a href="/facts/Subspace_topology/NjU6z4Ca">subspace topology</a> that 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 induces on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C_{c}^{\infty }(U).}
 
 However, the canonical LF-topology does make 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 into a <a href="/facts/Complete_topological_vector_space/e6qtS76j">complete</a> <a href="/facts/Reflexive_space/g7Cjbw0S">reflexive</a> <a href="/facts/Nuclear_space/4FLPWdfp">nuclear</a><a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> <a href="/facts/Montel_space/HLXqXHzs">Montel</a><a class="footnote-ref" id="fnref:13" href="#fn:13">13</a> <a href="/facts/Bornological_space/kpl5B2Ez">bornological</a> <a href="/facts/Barrelled_space/r2H58TN3">barrelled</a> <a href="/facts/Mackey_space/X2d6rBTI">Mackey space</a>; the same is true of its <a href="/facts/Strong_dual_space/4RI1SYl6">strong dual space</a> (that is, the space of all distributions with its usual topology). The canonical <a href="/facts/LF-space/voQHEeGI">LF-topology</a> can be defined in various ways.

<h3>Distributions</h3>
See also: <a href="/facts/Continuous_linear_functional/KcqjDBrJ">Continuous linear functional</a>
As discussed earlier, continuous <a href="/facts/Linear_form/oGh7Asrz">linear functionals</a> on a 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 are known as distributions on 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 Other equivalent definitions are described below.

By definition, a distribution on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is a <a href="/facts/Continuous_linear_operator/KcqjDBrJ">continuous</a> <a href="/facts/Linear_form/oGh7Asrz">linear functional</a> on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C_{c}^{\infty }(U).}
 
 Said differently, a distribution on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is an element of the <a href="/facts/Continuous_dual_space/4Uw4Knz1">continuous dual space</a> of 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 when 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is endowed with its canonical LF topology.
There is a canonical <a href="/facts/Dual_system/2Y8KyofV">duality pairing</a> between a distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 and a test function 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle f\in C_{c}^{\infty }(U),}
 
 which is denoted using <a href="/facts/Angle_brackets/yzGM9J8A">angle brackets</a> by

{
            
              
                
                  
                    
                      
                        D
                      
                    
                    ′
                  
                  (
                  U
                  )
                  ×
                  
                    C
                    
                      c
                    
                    
                      ∞
                    
                  
                  (
                  U
                  )
                  →
                  
                    R
                  
                
              
              
                
                  (
                  T
                  ,
                  f
                  )
                  ↦
                  ⟨
                  T
                  ,
                  f
                  ⟩
                  :=
                  T
                  (
                  f
                  )
                
              
            
            
          
        
      
    
    {\displaystyle {\begin{cases}{\mathcal {D}}'(U)\times C_{c}^{\infty }(U)\to \mathbb {R} \\(T,f)\mapsto \langle T,f\rangle :=T(f)\end{cases}}}

One interprets this notation as the distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 acting on the test function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 to give a scalar, or symmetrically as the test function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 acting on the distribution 
 
 
 
 T
 .
 
 
 {\displaystyle T.}

<h4>Characterizations of distributions</h4>
Proposition. If 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is a <a href="/facts/Linear_form/oGh7Asrz">linear functional</a> on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 then the following are equivalent:

<ol><li>T is a distribution;</li>
<li>T is <a href="/facts/Continuous_function/sKbl02pB">continuous</a>;</li>
<li>T is <a href="/facts/Continuous_function/sKbl02pB">continuous</a> at the origin;</li>
<li>T is <a href="/facts/Uniform_continuity/hjvw7tII">uniformly continuous</a>;</li>
<li>T is a <a href="/facts/Bounded_operator/LYmDTIqR">bounded operator</a>;</li>
<li>T is <a href="/facts/Sequentially_continuous/xAjFpdfR">sequentially continuous</a>;
<ul><li>explicitly, for every sequence 
 
 
 
 
 
 (
 
 f
 
 i
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(f_{i}\right)_{i=1}^{\infty }}
 
 in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 that converges in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 to some 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle f\in C_{c}^{\infty }(U),}
 
 
 
 
 
 
 lim
 
 i
 →
 ∞
 
 
 T
 
 (
 
 f
 
 i
 
 
 )
 
 =
 T
 (
 f
 )
 ;
 
 
 {\textstyle \lim _{i\to \infty }T\left(f_{i}\right)=T(f);}
 
<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a></li></ul></li>
<li>T is <a href="/facts/Sequentially_continuous/xAjFpdfR">sequentially continuous</a> at the origin; in other words, T maps null sequences<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a> to null sequences;
<ul><li>explicitly, for every sequence 
 
 
 
 
 
 (
 
 f
 
 i
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(f_{i}\right)_{i=1}^{\infty }}
 
 in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 that converges in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 to the origin (such a sequence is called a null sequence), 
 
 
 
 
 lim
 
 i
 →
 ∞
 
 
 T
 
 (
 
 f
 
 i
 
 
 )
 
 =
 0
 ;
 
 
 {\textstyle \lim _{i\to \infty }T\left(f_{i}\right)=0;}
 
</li>
<li>a null sequence is by definition any sequence that converges to the origin;</li></ul></li>
<li>T maps null sequences to bounded subsets;
<ul><li>explicitly, for every sequence 
 
 
 
 
 
 (
 
 f
 
 i
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(f_{i}\right)_{i=1}^{\infty }}
 
 in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 that converges in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 to the origin, the sequence 
 
 
 
 
 
 (
 
 T
 
 (
 
 f
 
 i
 
 
 )
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(T\left(f_{i}\right)\right)_{i=1}^{\infty }}
 
 is bounded;</li></ul></li>
<li>T maps <a href="/facts/Mackey_convergence/kpl5B2Ez">Mackey convergent</a> null sequences to bounded subsets;
<ul><li>explicitly, for every Mackey convergent null sequence 
 
 
 
 
 
 (
 
 f
 
 i
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(f_{i}\right)_{i=1}^{\infty }}
 
 in 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle C_{c}^{\infty }(U),}
 
 the sequence 
 
 
 
 
 
 (
 
 T
 
 (
 
 f
 
 i
 
 
 )
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(T\left(f_{i}\right)\right)_{i=1}^{\infty }}
 
 is bounded;</li>
<li>a sequence 
 
 
 
 
 f
 
 ∙
 
 
 =
 
 
 (
 
 f
 
 i
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle f_{\bullet }=\left(f_{i}\right)_{i=1}^{\infty }}
 
 is said to be <a href="/facts/Mackey_convergence/kpl5B2Ez">Mackey convergent</a> to the origin if there exists a divergent sequence 
 
 
 
 
 r
 
 ∙
 
 
 =
 
 
 (
 
 r
 
 i
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 →
 ∞
 
 
 {\displaystyle r_{\bullet }=\left(r_{i}\right)_{i=1}^{\infty }\to \infty }
 
 of positive real numbers such that the sequence 
 
 
 
 
 
 (
 
 
 r
 
 i
 
 
 
 f
 
 i
 
 
 
 )
 
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \left(r_{i}f_{i}\right)_{i=1}^{\infty }}
 
 is bounded; every sequence that is Mackey convergent to the origin necessarily converges to the origin (in the usual sense);</li></ul></li>
<li>The kernel of T is a closed subspace of 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 ;
 
 
 {\displaystyle C_{c}^{\infty }(U);}
 
</li>
<li>The graph of T is closed;</li>
<li>There exists a continuous seminorm 
 
 
 
 g
 
 
 {\displaystyle g}
 
 on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 such that 
 
 
 
 
 |
 
 T
 
 |
 
 ≤
 g
 ;
 
 
 {\displaystyle |T|\leq g;}
 
</li>
<li>There exists a constant 
 
 
 
 C
 >
 0
 
 
 {\displaystyle C>0}
 
 and a finite subset 
 
 
 
 {
 
 g
 
 1
 
 
 ,
 …
 ,
 
 g
 
 m
 
 
 }
 ⊆
 
 
 P
 
 
 
 
 {\displaystyle \{g_{1},\ldots ,g_{m}\}\subseteq {\mathcal {P}}}
 
 (where 
 
 
 
 
 
 P
 
 
 
 
 {\displaystyle {\mathcal {P}}}
 
 is any collection of continuous seminorms that defines the canonical LF topology on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
) such that 
 
 
 
 
 |
 
 T
 
 |
 
 ≤
 C
 (
 
 g
 
 1
 
 
 +
 ⋯
 +
 
 g
 
 m
 
 
 )
 ;
 
 
 {\displaystyle |T|\leq C(g_{1}+\cdots +g_{m});}
 
<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a></li>
<li>For every compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 there exist constants 
 
 
 
 C
 >
 0
 
 
 {\displaystyle C>0}
 
 and 
 
 
 
 N
 ∈
 
 N
 
 
 
 {\displaystyle N\in \mathbb {N} }
 
 such that for all 
 
 
 
 f
 ∈
 
 C
 
 ∞
 
 
 (
 K
 )
 ,
 
 
 {\displaystyle f\in C^{\infty }(K),}
 
<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a> 
 
 
 
 
 |
 
 T
 (
 f
 )
 
 |
 
 ≤
 C
 sup
 {
 
 |
 
 
 ∂
 
 α
 
 
 f
 (
 x
 )
 
 |
 
 :
 x
 ∈
 U
 ,
 
 |
 
 α
 
 |
 
 ≤
 N
 }
 ;
 
 
 {\displaystyle |T(f)|\leq C\sup\{|\partial ^{\alpha }f(x)|:x\in U,|\alpha |\leq N\};}
 
</li>
<li>For every compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 there exist constants 
 
 
 
 
 C
 
 K
 
 
 >
 0
 
 
 {\displaystyle C_{K}>0}
 
 and 
 
 
 
 
 N
 
 K
 
 
 ∈
 
 N
 
 
 
 {\displaystyle N_{K}\in \mathbb {N} }
 
 such that for all 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C_{c}^{\infty }(U)}
 
 with support contained in 
 
 
 
 K
 ,
 
 
 {\displaystyle K,}
 
<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a> 
 
 
 
 
 |
 
 T
 (
 f
 )
 
 |
 
 ≤
 
 C
 
 K
 
 
 sup
 {
 
 |
 
 
 ∂
 
 α
 
 
 f
 (
 x
 )
 
 |
 
 :
 x
 ∈
 K
 ,
 
 |
 
 α
 
 |
 
 ≤
 
 N
 
 K
 
 
 }
 ;
 
 
 {\displaystyle |T(f)|\leq C_{K}\sup\{|\partial ^{\alpha }f(x)|:x\in K,|\alpha |\leq N_{K}\};}
 
</li>
<li>For any compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 and any sequence 
 
 
 
 {
 
 f
 
 i
 
 
 
 }
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \{f_{i}\}_{i=1}^{\infty }}
 
 in 
 
 
 
 
 C
 
 ∞
 
 
 (
 K
 )
 ,
 
 
 {\displaystyle C^{\infty }(K),}
 
 if 
 
 
 
 {
 
 ∂
 
 p
 
 
 
 f
 
 i
 
 
 
 }
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \{\partial ^{p}f_{i}\}_{i=1}^{\infty }}
 
 converges uniformly to zero for all <a href="/facts/Multi-index/2wjdPgzS">multi-indices</a> 
 
 
 
 p
 ,
 
 
 {\displaystyle p,}
 
 then 
 
 
 
 T
 (
 
 f
 
 i
 
 
 )
 →
 0
 ;
 
 
 {\displaystyle T(f_{i})\to 0;}
 
</li></ol>
<h4>Topology on the space of distributions and its relation to the weak-* topology</h4>
The set of all distributions on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is the <a href="/facts/Continuous_dual_space/4Uw4Knz1">continuous dual space</a> of 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle C_{c}^{\infty }(U),}
 
 which when endowed with the <a href="/facts/Strong_topology_(polar_topology)/4RI1SYl6">strong dual topology</a> is denoted by 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'(U).}
 
 Importantly, unless indicated otherwise, the topology on 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 is the <a href="/facts/Strong_dual_topology/4RI1SYl6">strong dual topology</a>; if the topology is instead the <a href="/facts/Weak-*_topology/XJASE9Up">weak-* topology</a> then this will be indicated. Neither topology is metrizable although unlike the weak-* topology, the strong dual topology makes 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 into a <a href="/facts/Complete_topological_vector_space/e6qtS76j">complete</a> <a href="/facts/Nuclear_space/4FLPWdfp">nuclear space</a>, to name just a few of its desirable properties.
Neither 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 nor its strong dual 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 is a <a href="/facts/Sequential_space/xAjFpdfR">sequential space</a> and so neither of their topologies can be fully described by sequences (in other words, defining only what sequences converge in these spaces is not enough to fully/correctly define their topologies).
However, a sequence in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 converges in the strong dual topology if and only if it converges in the <a href="/facts/Weak-*_topology/XJASE9Up">weak-* topology</a> (this leads many authors to use pointwise convergence to define the convergence of a sequence of distributions; this is fine for sequences but this is not guaranteed to extend to the convergence of <a href="/facts/Net_(mathematics)/msmsvMTT">nets</a> of distributions because a net may converge pointwise but fail to converge in the strong dual topology).
More information about the topology that 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 is endowed with can be found in the article on <a href="/facts/Spaces_of_test_functions_and_distributions/DKvhBcdc">spaces of test functions and distributions</a> and the articles on <a href="/facts/Polar_topology/WutbMK1V">polar topologies</a> and <a href="/facts/Dual_system/2Y8KyofV">dual systems</a>.
A <a href="/facts/Linear_map/Q1PBKNVV">linear map</a> from 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 into another <a href="/facts/Locally_convex_topological_vector_space/AGrPrayC">locally convex topological vector space</a> (such as any <a href="/facts/Normed_space/rmDljfyE">normed space</a>) is <a href="/facts/Continuous_function_(topology)/sKbl02pB">continuous</a> if and only if it is <a href="/facts/Sequentially_continuous/xAjFpdfR">sequentially continuous</a> at the origin. However, this is no longer guaranteed if the map is not linear or for maps valued in more general <a href="/facts/Topological_space/v2ut7CbK">topological spaces</a> (for example, that are not also locally convex <a href="/facts/Topological_vector_space/XRex1ChN">topological vector spaces</a>). The same is true of maps from 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 (more generally, this is true of maps from any locally convex <a href="/facts/Bornological_space/kpl5B2Ez">bornological space</a>).

<h2 id="localization-of-distributions">Localization of distributions</h2>
There is no way to define the value of a distribution in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 at a particular point of U. However, as is the case with functions, distributions on U restrict to give distributions on open subsets of U. Furthermore, distributions are locally determined in the sense that a distribution on all of U can be assembled from a distribution on an open cover of U satisfying some compatibility conditions on the overlaps. Such a structure is known as a <a href="/facts/Sheaf_(mathematics)/MM3hcRw4">sheaf</a>.

<h3>Extensions and restrictions to an open subset</h3>
Let 
 
 
 
 V
 ⊆
 U
 
 
 {\displaystyle V\subseteq U}
 
 be open subsets of 
 
 
 
 
 
 R
 
 
 n
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{n}.}
 
 
Every function 
 
 
 
 f
 ∈
 
 
 D
 
 
 (
 V
 )
 
 
 {\displaystyle f\in {\mathcal {D}}(V)}
 
 can be extended by zero from its domain V to a function on U by setting it equal to 
 
 
 
 0
 
 
 {\displaystyle 0}
 
 on the <a href="/facts/Complement_(set_theory)/yWUePIYY">complement</a> 
 
 
 
 U
 ∖
 V
 .
 
 
 {\displaystyle U\setminus V.}
 
 This extension is a smooth compactly supported function called the trivial extension of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 to 
 
 
 
 U
 
 
 {\displaystyle U}
 
 and it will be denoted by 
 
 
 
 
 E
 
 V
 U
 
 
 (
 f
 )
 .
 
 
 {\displaystyle E_{VU}(f).}

This assignment 
  
    
      
        f
        ↦
        
          E
          
            V
            U
          
        
        (
        f
        )
      
    
    {\displaystyle f\mapsto E_{VU}(f)}
  
 defines the trivial extension operator

E
 
 V
 U
 
 
 :
 
 
 D
 
 
 (
 V
 )
 →
 
 
 D
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle E_{VU}:{\mathcal {D}}(V)\to {\mathcal {D}}(U),}
 
 
which is a continuous injective linear map. It is used to canonically identify 
 
 
 
 
 
 D
 
 
 (
 V
 )
 
 
 {\displaystyle {\mathcal {D}}(V)}
 
 as a <a href="/facts/Vector_subspace/2wtKTgHL">vector subspace</a> of 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 (although not as a <a href="/facts/Topological_subspace/NjU6z4Ca">topological subspace</a>). 
Its transpose (explained here)

ρ
          
            V
            U
          
        
        :=

t
 
 
 
 E
 
 V
 U
 
 
 :
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 →
 
 
 
 D
 
 
 ′
 
 (
 V
 )
 ,
 
 
 {\displaystyle \rho _{VU}:={}^{t}E_{VU}:{\mathcal {D}}'(U)\to {\mathcal {D}}'(V),}
 
 
is called the restriction to 
 
 
 
 V
 
 
 {\displaystyle V}
 
 of distributions in 
 
 
 
 U
 
 
 {\displaystyle U}
 
<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a> and as the name suggests, the image 
 
 
 
 
 ρ
 
 V
 U
 
 
 (
 T
 )
 
 
 {\displaystyle \rho _{VU}(T)}
 
 of a distribution 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 under this map is a distribution on 
 
 
 
 V
 
 
 {\displaystyle V}
 
 called the restriction of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 to 
 
 
 
 V
 .
 
 
 {\displaystyle V.}
 
 The defining condition of the restriction 
 
 
 
 
 ρ
 
 V
 U
 
 
 (
 T
 )
 
 
 {\displaystyle \rho _{VU}(T)}
 
 is:

⟨
        
          ρ
          
            V
            U
          
        
        T
        ,
        ϕ
        ⟩
        =
        ⟨
        T
        ,
        
          E
          
            V
            U
          
        
        ϕ
        ⟩
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        V
        )
        .
      
    
    {\displaystyle \langle \rho _{VU}T,\phi \rangle =\langle T,E_{VU}\phi \rangle \quad {\text{ for all }}\phi \in {\mathcal {D}}(V).}

If 
 
 
 
 V
 ≠
 U
 
 
 {\displaystyle V\neq U}
 
 then the (continuous injective linear) trivial extension map 
 
 
 
 
 E
 
 V
 U
 
 
 :
 
 
 D
 
 
 (
 V
 )
 →
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle E_{VU}:{\mathcal {D}}(V)\to {\mathcal {D}}(U)}
 
 is not a topological embedding (in other words, if this linear injection was used to identify 
 
 
 
 
 
 D
 
 
 (
 V
 )
 
 
 {\displaystyle {\mathcal {D}}(V)}
 
 as a subset of 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 then 
 
 
 
 
 
 D
 
 
 (
 V
 )
 
 
 {\displaystyle {\mathcal {D}}(V)}
 
's topology would <a href="/facts/Comparison_of_topologies/5Q9F2fjf">strictly finer</a> than the <a href="/facts/Subspace_topology/NjU6z4Ca">subspace topology</a> that 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 induces on it; importantly, it would not be a <a href="/facts/Topological_subspace/NjU6z4Ca">topological subspace</a> since that requires equality of topologies) and its range is also not dense in its <a href="/facts/Codomain/MGc43nwQ">codomain</a> 
 
 
 
 
 
 D
 
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}(U).}
 
<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a> Consequently if 
 
 
 
 V
 ≠
 U
 
 
 {\displaystyle V\neq U}
 
 then the restriction mapping is neither injective nor surjective.<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> A distribution 
 
 
 
 S
 ∈
 
 
 
 D
 
 
 ′
 
 (
 V
 )
 
 
 {\displaystyle S\in {\mathcal {D}}'(V)}
 
 is said to be extendible to U if it belongs to the range of the transpose of 
 
 
 
 
 E
 
 V
 U
 
 
 
 
 {\displaystyle E_{VU}}
 
 and it is called extendible if it is extendable to 
 
 
 
 
 
 R
 
 
 n
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{n}.}
 
<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a>
Unless 
 
 
 
 U
 =
 V
 ,
 
 
 {\displaystyle U=V,}
 
 the restriction to V is neither <a href="/facts/Injective/5ES6tqf5">injective</a> nor <a href="/facts/Surjective/KezhLpCb">surjective</a>. Lack of surjectivity follows since distributions can blow up towards the boundary of V. For instance, if 
 
 
 
 U
 =
 
 R
 
 
 
 {\displaystyle U=\mathbb {R} }
 
 and 
 
 
 
 V
 =
 (
 0
 ,
 2
 )
 ,
 
 
 {\displaystyle V=(0,2),}
 
 then the distribution

T
        (
        x
        )
        =
        
          ∑
          
            n
            =
            1
          
          
            ∞
          
        
        n
        
        δ
        
          (
          
            x
            −
            
              
                1
                n
              
            
          
          )
        
      
    
    {\displaystyle T(x)=\sum _{n=1}^{\infty }n\,\delta \left(x-{\frac {1}{n}}\right)}

is in 
  
    
      
        
          
            
              D
            
          
          ′
        
        (
        V
        )
      
    
    {\displaystyle {\mathcal {D}}'(V)}
  
 but admits no extension to 
  
    
      
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        .
      
    
    {\displaystyle {\mathcal {D}}'(U).}

<h3>Gluing and distributions that vanish in a set</h3>

Theorem<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a>—Let 
 
 
 
 (
 
 U
 
 i
 
 
 
 )
 
 i
 ∈
 I
 
 
 
 
 {\displaystyle (U_{i})_{i\in I}}
 
 be a collection of open subsets of 
 
 
 
 
 
 R
 
 
 n
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{n}.}
 
 For each 
 
 
 
 i
 ∈
 I
 ,
 
 
 {\displaystyle i\in I,}
 
 let 
 
 
 
 
 T
 
 i
 
 
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 U
 
 i
 
 
 )
 
 
 {\displaystyle T_{i}\in {\mathcal {D}}'(U_{i})}
 
 and suppose that for all 
 
 
 
 i
 ,
 j
 ∈
 I
 ,
 
 
 {\displaystyle i,j\in I,}
 
 the restriction of 
 
 
 
 
 T
 
 i
 
 
 
 
 {\displaystyle T_{i}}
 
 to 
 
 
 
 
 U
 
 i
 
 
 ∩
 
 U
 
 j
 
 
 
 
 {\displaystyle U_{i}\cap U_{j}}
 
 is equal to the restriction of 
 
 
 
 
 T
 
 j
 
 
 
 
 {\displaystyle T_{j}}
 
 to 
 
 
 
 
 U
 
 i
 
 
 ∩
 
 U
 
 j
 
 
 
 
 {\displaystyle U_{i}\cap U_{j}}
 
 (note that both restrictions are elements of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 
 U
 
 i
 
 
 ∩
 
 U
 
 j
 
 
 )
 
 
 {\displaystyle {\mathcal {D}}'(U_{i}\cap U_{j})}
 
). Then there exists a unique 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 ⋃
 
 i
 ∈
 I
 
 
 
 U
 
 i
 
 
 )
 
 
 {\textstyle T\in {\mathcal {D}}'(\bigcup _{i\in I}U_{i})}
 
 such that for all 
 
 
 
 i
 ∈
 I
 ,
 
 
 {\displaystyle i\in I,}
 
 the restriction of T to 
 
 
 
 
 U
 
 i
 
 
 
 
 {\displaystyle U_{i}}
 
 is equal to 
 
 
 
 
 T
 
 i
 
 
 .
 
 
 {\displaystyle T_{i}.}

Let V be an open subset of U. 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 is said to vanish in V if for all 
 
 
 
 f
 ∈
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle f\in {\mathcal {D}}(U)}
 
 such that 
 
 
 
 supp
 ⁡
 (
 f
 )
 ⊆
 V
 
 
 {\displaystyle \operatorname {supp} (f)\subseteq V}
 
 we have 
 
 
 
 T
 f
 =
 0.
 
 
 {\displaystyle Tf=0.}
 
 T vanishes in V if and only if the restriction of T to V is equal to 0, or equivalently, if and only if T lies in the <a href="/facts/Kernel_(algebra)/GGSpUPMJ">kernel</a> of the restriction map 
 
 
 
 
 ρ
 
 V
 U
 
 
 .
 
 
 {\displaystyle \rho _{VU}.}

Corollary<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a>—Let 
 
 
 
 (
 
 U
 
 i
 
 
 
 )
 
 i
 ∈
 I
 
 
 
 
 {\displaystyle (U_{i})_{i\in I}}
 
 be a collection of open subsets of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 and let 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 ⋃
 
 i
 ∈
 I
 
 
 
 U
 
 i
 
 
 )
 .
 
 
 {\textstyle T\in {\mathcal {D}}'(\bigcup _{i\in I}U_{i}).}
 
 
 
 
 
 T
 =
 0
 
 
 {\displaystyle T=0}
 
 if and only if for each 
 
 
 
 i
 ∈
 I
 ,
 
 
 {\displaystyle i\in I,}
 
 the restriction of T to 
 
 
 
 
 U
 
 i
 
 
 
 
 {\displaystyle U_{i}}
 
 is equal to 0.

Corollary<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a>—The union of all open subsets of U in which a distribution T vanishes is an open subset of U in which T vanishes.

<h3>Support of a distribution</h3>
This last corollary implies that for every distribution T on U, there exists a unique largest subset V of U such that T vanishes in V (and does not vanish in any open subset of U that is not contained in V); the complement in U of this unique largest open subset is called the support of T.<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a> Thus

supp
        ⁡
        (
        T
        )
        =
        U
        ∖
        ⋃
        {
        V
        ∣
        
          ρ
          
            V
            U
          
        
        T
        =
        0
        }
        .
      
    
    {\displaystyle \operatorname {supp} (T)=U\setminus \bigcup \{V\mid \rho _{VU}T=0\}.}

If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a locally integrable function on U and if 
 
 
 
 
 D
 
 f
 
 
 
 
 {\displaystyle D_{f}}
 
 is its associated distribution, then the support of 
 
 
 
 
 D
 
 f
 
 
 
 
 {\displaystyle D_{f}}
 
 is the smallest closed subset of U in the complement of which 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is <a href="/facts/Almost_everywhere/1quRFtJE">almost everywhere</a> equal to 0.<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a> If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is continuous, then the support of 
 
 
 
 
 D
 
 f
 
 
 
 
 {\displaystyle D_{f}}
 
 is equal to the closure of the set of points in U at which 
 
 
 
 f
 
 
 {\displaystyle f}
 
 does not vanish.<a class="footnote-ref" id="fnref:28" href="#fn:28">28</a> The support of the distribution associated with the <a href="/facts/Dirac_measure/mj8Qfhr2">Dirac measure</a> at a point 
 
 
 
 
 x
 
 0
 
 
 
 
 {\displaystyle x_{0}}
 
 is the set 
 
 
 
 {
 
 x
 
 0
 
 
 }
 .
 
 
 {\displaystyle \{x_{0}\}.}
 
<a class="footnote-ref" id="fnref:29" href="#fn:29">29</a> If the support of a test function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 does not intersect the support of a distribution T then 
 
 
 
 T
 f
 =
 0.
 
 
 {\displaystyle Tf=0.}
 
 A distribution T is 0 if and only if its support is empty. If 
 
 
 
 f
 ∈
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{\infty }(U)}
 
 is identically 1 on some open set containing the support of a distribution T then 
 
 
 
 f
 T
 =
 T
 .
 
 
 {\displaystyle fT=T.}
 
 If the support of a distribution T is compact then it has finite order and there is a constant 
 
 
 
 C
 
 
 {\displaystyle C}
 
 and a non-negative integer 
 
 
 
 N
 
 
 {\displaystyle N}
 
 such that:<a class="footnote-ref" id="fnref:30" href="#fn:30">30</a>

|
        
        T
        ϕ
        
          |
        
        ≤
        C
        ‖
        ϕ
        
          ‖
          
            N
          
        
        :=
        C
        sup
        
          {
          
            
              |
              
                
                  ∂
                  
                    α
                  
                
                ϕ
                (
                x
                )
              
              |
            
            :
            x
            ∈
            U
            ,
            
              |
            
            α
            
              |
            
            ≤
            N
          
          }
        
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle |T\phi |\leq C\|\phi \|_{N}:=C\sup \left\{\left|\partial ^{\alpha }\phi (x)\right|:x\in U,|\alpha |\leq N\right\}\quad {\text{ for all }}\phi \in {\mathcal {D}}(U).}

If T has compact support, then it has a unique extension to a continuous linear functional 
 
 
 
 
 
 
 T
 ^
 
 
 
 
 
 {\displaystyle {\widehat {T}}}
 
 on 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
; this function can be defined by 
 
 
 
 
 
 
 T
 ^
 
 
 
 (
 f
 )
 :=
 T
 (
 ψ
 f
 )
 ,
 
 
 {\displaystyle {\widehat {T}}(f):=T(\psi f),}
 
 where 
 
 
 
 ψ
 ∈
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle \psi \in {\mathcal {D}}(U)}
 
 is any function that is identically 1 on an open set containing the support of T.<a class="footnote-ref" id="fnref:31" href="#fn:31">31</a>
If 
 
 
 
 S
 ,
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle S,T\in {\mathcal {D}}'(U)}
 
 and 
 
 
 
 λ
 ≠
 0
 
 
 {\displaystyle \lambda \neq 0}
 
 then 
 
 
 
 supp
 ⁡
 (
 S
 +
 T
 )
 ⊆
 supp
 ⁡
 (
 S
 )
 ∪
 supp
 ⁡
 (
 T
 )
 
 
 {\displaystyle \operatorname {supp} (S+T)\subseteq \operatorname {supp} (S)\cup \operatorname {supp} (T)}
 
 and 
 
 
 
 supp
 ⁡
 (
 λ
 T
 )
 =
 supp
 ⁡
 (
 T
 )
 .
 
 
 {\displaystyle \operatorname {supp} (\lambda T)=\operatorname {supp} (T).}
 
 Thus, distributions with support in a given subset 
 
 
 
 A
 ⊆
 U
 
 
 {\displaystyle A\subseteq U}
 
 form a vector subspace of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'(U).}
 
<a class="footnote-ref" id="fnref:32" href="#fn:32">32</a> Furthermore, if 
 
 
 
 P
 
 
 {\displaystyle P}
 
 is a differential operator in U, then for all distributions T on U and all 
 
 
 
 f
 ∈
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{\infty }(U)}
 
 we have 
 
 
 
 supp
 ⁡
 (
 P
 (
 x
 ,
 ∂
 )
 T
 )
 ⊆
 supp
 ⁡
 (
 T
 )
 
 
 {\displaystyle \operatorname {supp} (P(x,\partial )T)\subseteq \operatorname {supp} (T)}
 
 and 
 
 
 
 supp
 ⁡
 (
 f
 T
 )
 ⊆
 supp
 ⁡
 (
 f
 )
 ∩
 supp
 ⁡
 (
 T
 )
 .
 
 
 {\displaystyle \operatorname {supp} (fT)\subseteq \operatorname {supp} (f)\cap \operatorname {supp} (T).}
 
<a class="footnote-ref" id="fnref:33" href="#fn:33">33</a>

<h3>Distributions with compact support</h3>
<h4>Support in a point set and Dirac measures</h4>
For any 
 
 
 
 x
 ∈
 U
 ,
 
 
 {\displaystyle x\in U,}
 
 let 
 
 
 
 
 δ
 
 x
 
 
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle \delta _{x}\in {\mathcal {D}}'(U)}
 
 denote the distribution induced by the Dirac measure at 
 
 
 
 x
 .
 
 
 {\displaystyle x.}
 
 For any 
 
 
 
 
 x
 
 0
 
 
 ∈
 U
 
 
 {\displaystyle x_{0}\in U}
 
 and distribution 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 ,
 
 
 {\displaystyle T\in {\mathcal {D}}'(U),}
 
 the support of T is contained in 
 
 
 
 {
 
 x
 
 0
 
 
 }
 
 
 {\displaystyle \{x_{0}\}}
 
 if and only if T is a finite linear combination of derivatives of the Dirac measure at 
 
 
 
 
 x
 
 0
 
 
 .
 
 
 {\displaystyle x_{0}.}
 
<a class="footnote-ref" id="fnref:34" href="#fn:34">34</a> If in addition the order of T is 
 
 
 
 ≤
 k
 
 
 {\displaystyle \leq k}
 
 then there exist constants 
 
 
 
 
 α
 
 p
 
 
 
 
 {\displaystyle \alpha _{p}}
 
 such that:<a class="footnote-ref" id="fnref:35" href="#fn:35">35</a>

T
        =
        
          ∑
          
            
              |
            
            p
            
              |
            
            ≤
            k
          
        
        
          α
          
            p
          
        
        
          ∂
          
            p
          
        
        
          δ
          
            
              x
              
                0
              
            
          
        
        .
      
    
    {\displaystyle T=\sum _{|p|\leq k}\alpha _{p}\partial ^{p}\delta _{x_{0}}.}

Said differently, if T has support at a single point 
 
 
 
 {
 P
 }
 ,
 
 
 {\displaystyle \{P\},}
 
 then T is in fact a finite linear combination of distributional derivatives of the 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 function at P. That is, there exists an integer m and complex constants 
 
 
 
 
 a
 
 α
 
 
 
 
 {\displaystyle a_{\alpha }}
 
 such that

T
        =
        
          ∑
          
            
              |
            
            α
            
              |
            
            ≤
            m
          
        
        
          a
          
            α
          
        
        
          ∂
          
            α
          
        
        (
        
          τ
          
            P
          
        
        δ
        )
      
    
    {\displaystyle T=\sum _{|\alpha |\leq m}a_{\alpha }\partial ^{\alpha }(\tau _{P}\delta )}

where 
 
 
 
 
 τ
 
 P
 
 
 
 
 {\displaystyle \tau _{P}}
 
 is the translation operator.

<h4>Distribution with compact support</h4>

Theorem<a class="footnote-ref" id="fnref:36" href="#fn:36">36</a>—Suppose T is a distribution on U with compact support K. There exists a continuous function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 defined on U and a multi-index p such that

T
        =
        
          ∂
          
            p
          
        
        f
        ,
      
    
    {\displaystyle T=\partial ^{p}f,}

where the derivatives are understood in the sense of distributions. That is, for all test functions 
  
    
      
        ϕ
      
    
    {\displaystyle \phi }
  
 on U,

T
        ϕ
        =
        (
        −
        1
        
          )
          
            
              |
            
            p
            
              |
            
          
        
        
          ∫
          
            U
          
        
        f
        (
        x
        )
        (
        
          ∂
          
            p
          
        
        ϕ
        )
        (
        x
        )
        
        d
        x
        .
      
    
    {\displaystyle T\phi =(-1)^{|p|}\int _{U}f(x)(\partial ^{p}\phi )(x)\,dx.}

<h4>Distributions of finite order with support in an open subset</h4>

Theorem<a class="footnote-ref" id="fnref:37" href="#fn:37">37</a>—Suppose T is a distribution on U with compact support K and let V be an open subset of U containing K. Since every distribution with compact support has finite order, take N to be the order of T and define 
 
 
 
 P
 :=
 {
 0
 ,
 1
 ,
 …
 ,
 N
 +
 2
 
 }
 
 n
 
 
 .
 
 
 {\displaystyle P:=\{0,1,\ldots ,N+2\}^{n}.}
 
 There exists a family of continuous functions 
 
 
 
 (
 
 f
 
 p
 
 
 
 )
 
 p
 ∈
 P
 
 
 
 
 {\displaystyle (f_{p})_{p\in P}}
 
 defined on U with support in V such that

T
        =
        
          ∑
          
            p
            ∈
            P
          
        
        
          ∂
          
            p
          
        
        
          f
          
            p
          
        
        ,
      
    
    {\displaystyle T=\sum _{p\in P}\partial ^{p}f_{p},}

where the derivatives are understood in the sense of distributions. That is, for all test functions 
  
    
      
        ϕ
      
    
    {\displaystyle \phi }
  
 on U,

T
        ϕ
        =
        
          ∑
          
            p
            ∈
            P
          
        
        (
        −
        1
        
          )
          
            
              |
            
            p
            
              |
            
          
        
        
          ∫
          
            U
          
        
        
          f
          
            p
          
        
        (
        x
        )
        (
        
          ∂
          
            p
          
        
        ϕ
        )
        (
        x
        )
        
        d
        x
        .
      
    
    {\displaystyle T\phi =\sum _{p\in P}(-1)^{|p|}\int _{U}f_{p}(x)(\partial ^{p}\phi )(x)\,dx.}

<h3>Global structure of distributions</h3>
The formal definition of distributions exhibits them as a subspace of a very large space, namely the topological dual of 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 (or the <a href="/facts/Schwartz_space/B035faw7">Schwartz space</a> 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n})}
 
 for tempered distributions). It is not immediately clear from the definition how exotic a distribution might be. To answer this question, it is instructive to see distributions built up from a smaller space, namely the space of continuous functions. Roughly, any distribution is locally a (multiple) derivative of a continuous function. A precise version of this result, given below, holds for distributions of compact support, tempered distributions, and general distributions. Generally speaking, no proper subset of the space of distributions contains all continuous functions and is closed under differentiation. This says that distributions are not particularly exotic objects; they are only as complicated as necessary.

<h4>Distributions as <a href="/facts/Sheaf_(mathematics)/MM3hcRw4">sheaves</a></h4>

Theorem<a class="footnote-ref" id="fnref:38" href="#fn:38">38</a>—Let T be a distribution on U.
There exists a sequence 
 
 
 
 (
 
 T
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (T_{i})_{i=1}^{\infty }}
 
 in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 such that each Ti has compact support and every compact subset 
 
 
 
 K
 ⊆
 U
 
 
 {\displaystyle K\subseteq U}
 
 intersects the support of only finitely many 
 
 
 
 
 T
 
 i
 
 
 ,
 
 
 {\displaystyle T_{i},}
 
 and the sequence of partial sums 
 
 
 
 (
 
 S
 
 j
 
 
 
 )
 
 j
 =
 1
 
 
 ∞
 
 
 ,
 
 
 {\displaystyle (S_{j})_{j=1}^{\infty },}
 
 defined by 
 
 
 
 
 S
 
 j
 
 
 :=
 
 T
 
 1
 
 
 +
 ⋯
 +
 
 T
 
 j
 
 
 ,
 
 
 {\displaystyle S_{j}:=T_{1}+\cdots +T_{j},}
 
 converges in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 to T; in other words we have:

T
        =
        
          ∑
          
            i
            =
            1
          
          
            ∞
          
        
        
          T
          
            i
          
        
        .
      
    
    {\displaystyle T=\sum _{i=1}^{\infty }T_{i}.}

Recall that a sequence converges in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 (with its strong dual topology) if and only if it converges pointwise.

<h4>Decomposition of distributions as sums of derivatives of continuous functions</h4>
By combining the above results, one may express any distribution on U as the sum of a series of distributions with compact support, where each of these distributions can in turn be written as a finite sum of distributional derivatives of continuous functions on U. In other words, for arbitrary 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 we can write:

T
        =
        
          ∑
          
            i
            =
            1
          
          
            ∞
          
        
        
          ∑
          
            p
            ∈
            
              P
              
                i
              
            
          
        
        
          ∂
          
            p
          
        
        
          f
          
            i
            p
          
        
        ,
      
    
    {\displaystyle T=\sum _{i=1}^{\infty }\sum _{p\in P_{i}}\partial ^{p}f_{ip},}

where 
 
 
 
 
 P
 
 1
 
 
 ,
 
 P
 
 2
 
 
 ,
 …
 
 
 {\displaystyle P_{1},P_{2},\ldots }
 
 are finite sets of multi-indices and the functions 
 
 
 
 
 f
 
 i
 p
 
 
 
 
 {\displaystyle f_{ip}}
 
 are continuous.

Theorem<a class="footnote-ref" id="fnref:39" href="#fn:39">39</a>—Let T be a distribution on U. For every multi-index p there exists a continuous function 
 
 
 
 
 g
 
 p
 
 
 
 
 {\displaystyle g_{p}}
 
 on U such that

<ol><li>any compact subset K of U intersects the support of only finitely many 
 
 
 
 
 g
 
 p
 
 
 ,
 
 
 {\displaystyle g_{p},}
 
 and</li>
<li>
 
 
 
 T
 =
 
 ∑
 
 p
 
 
 
 ∂
 
 p
 
 
 
 g
 
 p
 
 
 .
 
 
 {\displaystyle T=\sum \nolimits _{p}\partial ^{p}g_{p}.}
 
</li></ol>
Moreover, if T has finite order, then one can choose 
 
 
 
 
 g
 
 p
 
 
 
 
 {\displaystyle g_{p}}
 
 in such a way that only finitely many of them are non-zero.

Note that the infinite sum above is well-defined as a distribution. The value of T for a given 
 
 
 
 f
 ∈
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle f\in {\mathcal {D}}(U)}
 
 can be computed using the finitely many 
 
 
 
 
 g
 
 α
 
 
 
 
 {\displaystyle g_{\alpha }}
 
 that intersect the support of 
 
 
 
 f
 .
 
 
 {\displaystyle f.}

<h2 id="operations-on-distributions">Operations on distributions</h2>
Many operations which are defined on smooth functions with compact support can also be defined for distributions. In general, if 
 
 
 
 A
 :
 
 
 D
 
 
 (
 U
 )
 →
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle A:{\mathcal {D}}(U)\to {\mathcal {D}}(U)}
 
 is a linear map that is continuous with respect to the <a href="/facts/Weak_topology/XJASE9Up">weak topology</a>, then it is not always possible to extend 
 
 
 
 A
 
 
 {\displaystyle A}
 
 to a map 
 
 
 
 
 A
 ′
 
 :
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle A':{\mathcal {D}}'(U)\to {\mathcal {D}}'(U)}
 
 by classic extension theorems of topology or linear functional analysis.<a class="footnote-ref" id="fnref:40" href="#fn:40">40</a> The “distributional” extension of the above linear continuous operator A is possible if and only if A admits a Schwartz adjoint, that is another linear continuous operator B of the same type such that

⟨
 A
 f
 ,
 g
 ⟩
 =
 ⟨
 f
 ,
 B
 g
 ⟩
 
 
 {\displaystyle \langle Af,g\rangle =\langle f,Bg\rangle }
 
,
for every pair of test functions. In that condition, B is unique and the extension A’ is the transpose of the Schwartz adjoint B. <a class="footnote-ref" id="fnref:41" href="#fn:41">41</a>

<h3>Preliminaries: Transpose of a linear operator</h3>

Main article: <a href="/facts/Transpose_of_a_linear_map/uv0JWTHq">Transpose of a linear map</a>
Operations on distributions and spaces of distributions are often defined using the <a href="/facts/Transpose_of_a_linear_map/uv0JWTHq">transpose</a> of a linear operator. This is because the transpose allows for a unified presentation of the many definitions in the theory of distributions and also because its properties are well-known in <a href="/facts/Functional_analysis/MIp233MT">functional analysis</a>.<a class="footnote-ref" id="fnref:42" href="#fn:42">42</a> For instance, the well-known <a href="/facts/Hermitian_adjoint/gN6RHphd">Hermitian adjoint</a> of a linear operator between <a href="/facts/Hilbert_space/aDFMh4lV">Hilbert spaces</a> is just the operator's transpose (but with the <a href="/facts/Riesz_representation_theorem/9CjKDUII">Riesz representation theorem</a> used to identify each Hilbert space with its <a href="/facts/Strong_dual_space/4RI1SYl6">continuous dual space</a>). In general, the transpose of a continuous linear map 
 
 
 
 A
 :
 X
 →
 Y
 
 
 {\displaystyle A:X\to Y}
 
 is the linear map

t
          
        
        A
        :
        
          Y
          ′
        
        →
        
          X
          ′
        
        
        
           defined by

t
          
        
        A
        (
        
          y
          ′
        
        )
        :=
        
          y
          ′
        
        ∘
        A
        ,
      
    
    {\displaystyle {}^{t}A:Y'\to X'\qquad {\text{ defined by }}\qquad {}^{t}A(y'):=y'\circ A,}
  
 
or equivalently, it is the unique map satisfying 
  
    
      
        ⟨
        
          y
          ′
        
        ,
        A
        (
        x
        )
        ⟩
        =
        
          ⟨

t
              
            
            A
            (
            
              y
              ′
            
            )
            ,
            x
          
          ⟩
        
      
    
    {\displaystyle \langle y',A(x)\rangle =\left\langle {}^{t}A(y'),x\right\rangle }
  
 for all 
  
    
      
        x
        ∈
        X
      
    
    {\displaystyle x\in X}
  
 and all 
  
    
      
        
          y
          ′
        
        ∈
        
          Y
          ′
        
      
    
    {\displaystyle y'\in Y'}
  
 (the prime symbol in 
  
    
      
        
          y
          ′
        
      
    
    {\displaystyle y'}
  
 does not denote a derivative of any kind; it merely indicates that 
  
    
      
        
          y
          ′
        
      
    
    {\displaystyle y'}
  
 is an element of the continuous dual space 
  
    
      
        
          Y
          ′
        
      
    
    {\displaystyle Y'}
  
). Since 
  
    
      
        A
      
    
    {\displaystyle A}
  
 is continuous, the transpose

t
 
 
 A
 :
 
 Y
 ′
 
 →
 
 X
 ′
 
 
 
 {\displaystyle {}^{t}A:Y'\to X'}
 
 is also continuous when both duals are endowed with their respective <a href="/facts/Strong_dual_space/4RI1SYl6">strong dual topologies</a>; it is also continuous when both duals are endowed with their respective <a href="/facts/Weak*_topology/XJASE9Up">weak* topologies</a> (see the articles <a href="/facts/Polar_topology/WutbMK1V">polar topology</a> and <a href="/facts/Dual_system/2Y8KyofV">dual system</a> for more details).
In the context of distributions, the characterization of the transpose can be refined slightly. Let 
 
 
 
 A
 :
 
 
 D
 
 
 (
 U
 )
 →
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle A:{\mathcal {D}}(U)\to {\mathcal {D}}(U)}
 
 be a continuous linear map. Then by definition, the transpose of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is the unique linear operator

t
          
        
        A
        :
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        →
        
          
            
              D
            
          
          ′
        
        (
        U
        )
      
    
    {\displaystyle {}^{t}A:{\mathcal {D}}'(U)\to {\mathcal {D}}'(U)}
  
 that satisfies:

⟨

t
          
        
        A
        (
        T
        )
        ,
        ϕ
        ⟩
        =
        ⟨
        T
        ,
        A
        (
        ϕ
        )
        ⟩
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        
           and all 
        
        T
        ∈
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        .
      
    
    {\displaystyle \langle {}^{t}A(T),\phi \rangle =\langle T,A(\phi )\rangle \quad {\text{ for all }}\phi \in {\mathcal {D}}(U){\text{ and all }}T\in {\mathcal {D}}'(U).}

Since 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 is dense in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 (here, 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 actually refers to the set of distributions 
 
 
 
 
 {
 
 
 D
 
 ψ
 
 
 :
 ψ
 ∈
 
 
 D
 
 
 (
 U
 )
 
 }
 
 
 
 {\displaystyle \left\{D_{\psi }:\psi \in {\mathcal {D}}(U)\right\}}
 
) it is sufficient that the defining equality hold for all distributions of the form 
 
 
 
 T
 =
 
 D
 
 ψ
 
 
 
 
 {\displaystyle T=D_{\psi }}
 
 where 
 
 
 
 ψ
 ∈
 
 
 D
 
 
 (
 U
 )
 .
 
 
 {\displaystyle \psi \in {\mathcal {D}}(U).}
 
 Explicitly, this means that a continuous linear map 
 
 
 
 B
 :
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle B:{\mathcal {D}}'(U)\to {\mathcal {D}}'(U)}
 
 is equal to

t
          
        
        A
      
    
    {\displaystyle {}^{t}A}
  
 if and only if the condition below holds:

⟨
        B
        (
        
          D
          
            ψ
          
        
        )
        ,
        ϕ
        ⟩
        =
        ⟨

t
          
        
        A
        (
        
          D
          
            ψ
          
        
        )
        ,
        ϕ
        ⟩
        
        
           for all 
        
        ϕ
        ,
        ψ
        ∈
        
          
            D
          
        
        (
        U
        )
      
    
    {\displaystyle \langle B(D_{\psi }),\phi \rangle =\langle {}^{t}A(D_{\psi }),\phi \rangle \quad {\text{ for all }}\phi ,\psi \in {\mathcal {D}}(U)}

where the right-hand side equals 
  
    
      
        ⟨

t
          
        
        A
        (
        
          D
          
            ψ
          
        
        )
        ,
        ϕ
        ⟩
        =
        ⟨
        
          D
          
            ψ
          
        
        ,
        A
        (
        ϕ
        )
        ⟩
        =
        ⟨
        ψ
        ,
        A
        (
        ϕ
        )
        ⟩
        =
        
          ∫
          
            U
          
        
        ψ
        ⋅
        A
        (
        ϕ
        )
        
        d
        x
        .
      
    
    {\displaystyle \langle {}^{t}A(D_{\psi }),\phi \rangle =\langle D_{\psi },A(\phi )\rangle =\langle \psi ,A(\phi )\rangle =\int _{U}\psi \cdot A(\phi )\,dx.}

<h3>Differential operators</h3>
<h4>Differentiation of distributions</h4>
Let 
 
 
 
 A
 :
 
 
 D
 
 
 (
 U
 )
 →
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle A:{\mathcal {D}}(U)\to {\mathcal {D}}(U)}
 
 be the partial derivative operator 
 
 
 
 
 
 
 ∂
 
 ∂
 
 x
 
 k
 
 
 
 
 
 
 .
 
 
 {\displaystyle {\tfrac {\partial }{\partial x_{k}}}.}
 
 To extend 
 
 
 
 A
 
 
 {\displaystyle A}
 
 we compute its transpose:

⟨

t
                  
                
                A
                (
                
                  D
                  
                    ψ
                  
                
                )
                ,
                ϕ
                ⟩
              
              
                
                =
                
                  ∫
                  
                    U
                  
                
                ψ
                (
                A
                ϕ
                )
                
                d
                x
              
              
              
                
                  (See above.)
                
              
            
            
              
              
                
                =
                
                  ∫
                  
                    U
                  
                
                ψ
                
                  
                    
                      ∂
                      ϕ
                    
                    
                      ∂
                      
                        x
                        
                          k
                        
                      
                    
                  
                
                
                d
                x
              
            
            
              
              
                
                =
                −
                
                  ∫
                  
                    U
                  
                
                ϕ
                
                  
                    
                      ∂
                      ψ
                    
                    
                      ∂
                      
                        x
                        
                          k
                        
                      
                    
                  
                
                
                d
                x
              
              
              
                
                  (integration by parts)
                
              
            
            
              
              
                
                =
                −
                
                  ⟨
                  
                    
                      
                        
                          ∂
                          ψ
                        
                        
                          ∂
                          
                            x
                            
                              k
                            
                          
                        
                      
                    
                    ,
                    ϕ
                  
                  ⟩
                
              
            
            
              
              
                
                =
                −
                ⟨
                A
                ψ
                ,
                ϕ
                ⟩
                =
                ⟨
                −
                A
                ψ
                ,
                ϕ
                ⟩
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}\langle {}^{t}A(D_{\psi }),\phi \rangle &=\int _{U}\psi (A\phi )\,dx&&{\text{(See above.)}}\\&=\int _{U}\psi {\frac {\partial \phi }{\partial x_{k}}}\,dx\\[4pt]&=-\int _{U}\phi {\frac {\partial \psi }{\partial x_{k}}}\,dx&&{\text{(integration by parts)}}\\[4pt]&=-\left\langle {\frac {\partial \psi }{\partial x_{k}}},\phi \right\rangle \\[4pt]&=-\langle A\psi ,\phi \rangle =\langle -A\psi ,\phi \rangle \end{aligned}}}

Therefore

t
          
        
        A
        =
        −
        A
        .
      
    
    {\displaystyle {}^{t}A=-A.}
  
 Thus, the partial derivative of 
  
    
      
        T
      
    
    {\displaystyle T}
  
 with respect to the coordinate 
  
    
      
        
          x
          
            k
          
        
      
    
    {\displaystyle x_{k}}
  
 is defined by the formula

⟨
          
            
              
                
                  ∂
                  T
                
                
                  ∂
                  
                    x
                    
                      k
                    
                  
                
              
            
            ,
            ϕ
          
          ⟩
        
        =
        −
        
          ⟨
          
            T
            ,
            
              
                
                  ∂
                  ϕ
                
                
                  ∂
                  
                    x
                    
                      k
                    
                  
                
              
            
          
          ⟩
        
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle \left\langle {\frac {\partial T}{\partial x_{k}}},\phi \right\rangle =-\left\langle T,{\frac {\partial \phi }{\partial x_{k}}}\right\rangle \qquad {\text{ for all }}\phi \in {\mathcal {D}}(U).}

With this definition, every distribution is infinitely differentiable, and the derivative in the direction 
 
 
 
 
 x
 
 k
 
 
 
 
 {\displaystyle x_{k}}
 
 is a <a href="/facts/Linear_operator/Q1PBKNVV">linear operator</a> on 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'(U).}

More generally, if 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 is an arbitrary <a href="/facts/Multi-index/2wjdPgzS">multi-index</a>, then the partial derivative 
 
 
 
 
 ∂
 
 α
 
 
 T
 
 
 {\displaystyle \partial ^{\alpha }T}
 
 of the distribution 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 is defined by

⟨
        
          ∂
          
            α
          
        
        T
        ,
        ϕ
        ⟩
        =
        (
        −
        1
        
          )
          
            
              |
            
            α
            
              |
            
          
        
        ⟨
        T
        ,
        
          ∂
          
            α
          
        
        ϕ
        ⟩
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle \langle \partial ^{\alpha }T,\phi \rangle =(-1)^{|\alpha |}\langle T,\partial ^{\alpha }\phi \rangle \qquad {\text{ for all }}\phi \in {\mathcal {D}}(U).}

Differentiation of distributions is a continuous operator on 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 ;
 
 
 {\displaystyle {\mathcal {D}}'(U);}
 
 this is an important and desirable property that is not shared by most other notions of differentiation.
If 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is a distribution in 
 
 
 
 
 R
 
 
 
 {\displaystyle \mathbb {R} }
 
 then

lim
          
            x
            →
            0
          
        
        
          
            
              T
              −
              
                τ
                
                  x
                
              
              T
            
            x
          
        
        =
        
          T
          ′
        
        ∈
        
          
            
              D
            
          
          ′
        
        (
        
          R
        
        )
        ,
      
    
    {\displaystyle \lim _{x\to 0}{\frac {T-\tau _{x}T}{x}}=T'\in {\mathcal {D}}'(\mathbb {R} ),}

where 
 
 
 
 
 T
 ′
 
 
 
 {\displaystyle T'}
 
 is the derivative of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 and 
 
 
 
 
 τ
 
 x
 
 
 
 
 {\displaystyle \tau _{x}}
 
 is a translation by 
 
 
 
 x
 ;
 
 
 {\displaystyle x;}
 
 thus the derivative of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 may be viewed as a limit of quotients.<a class="footnote-ref" id="fnref:43" href="#fn:43">43</a>

<h4>Differential operators acting on smooth functions</h4>
A linear differential operator in 
 
 
 
 U
 
 
 {\displaystyle U}
 
 with smooth coefficients acts on the space of smooth functions on 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 Given such an operator

P
        :=
        
          ∑
          
            α
          
        
        
          c
          
            α
          
        
        
          ∂
          
            α
          
        
        ,
      
    
    {\textstyle P:=\sum _{\alpha }c_{\alpha }\partial ^{\alpha },}

we would like to define a continuous linear map, 
 
 
 
 
 D
 
 P
 
 
 
 
 {\displaystyle D_{P}}
 
 that extends the action of 
 
 
 
 P
 
 
 {\displaystyle P}
 
 on 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 to distributions on 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 In other words, we would like to define 
 
 
 
 
 D
 
 P
 
 
 
 
 {\displaystyle D_{P}}
 
 such that the following diagram <a href="/facts/Commutative_diagram/bdG8xuer">commutes</a>:

D
                    
                  
                  ′
                
                (
                U
                )
              
              
                
                  
                    
                      
                        ⟶
                      
                      
                        
                          D
                          
                            P
                          
                        
                      
                    
                  
                
              
              
                
                  
                    
                      D
                    
                  
                  ′
                
                (
                U
                )
              
            
            
              
                ↑
              
              
              
                ↑
              
            
            
              
                
                  C
                  
                    ∞
                  
                
                (
                U
                )
              
              
                
                  
                    
                      
                        ⟶
                      
                      
                        P
                      
                    
                  
                
              
              
                
                  C
                  
                    ∞
                  
                
                (
                U
                )
              
            
          
        
      
    
    {\displaystyle {\begin{matrix}{\mathcal {D}}'(U)&{\stackrel {D_{P}}{\longrightarrow }}&{\mathcal {D}}'(U)\\[2pt]\uparrow &&\uparrow \\[2pt]C^{\infty }(U)&{\stackrel {P}{\longrightarrow }}&C^{\infty }(U)\end{matrix}}}

where the vertical maps are given by assigning 
  
    
      
        f
        ∈
        
          C
          
            ∞
          
        
        (
        U
        )
      
    
    {\displaystyle f\in C^{\infty }(U)}
  
 its canonical distribution 
  
    
      
        
          D
          
            f
          
        
        ∈
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        ,
      
    
    {\displaystyle D_{f}\in {\mathcal {D}}'(U),}
  
 which is defined by:

D
          
            f
          
        
        (
        ϕ
        )
        =
        ⟨
        f
        ,
        ϕ
        ⟩
        :=
        
          ∫
          
            U
          
        
        f
        (
        x
        )
        ϕ
        (
        x
        )
        
        d
        x
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle D_{f}(\phi )=\langle f,\phi \rangle :=\int _{U}f(x)\phi (x)\,dx\quad {\text{ for all }}\phi \in {\mathcal {D}}(U).}
  
 
With this notation, the diagram commuting is equivalent to:

D
          
            P
            (
            f
            )
          
        
        =
        
          D
          
            P
          
        
        
          D
          
            f
          
        
        
        
           for all 
        
        f
        ∈
        
          C
          
            ∞
          
        
        (
        U
        )
        .
      
    
    {\displaystyle D_{P(f)}=D_{P}D_{f}\qquad {\text{ for all }}f\in C^{\infty }(U).}

To find 
 
 
 
 
 D
 
 P
 
 
 ,
 
 
 {\displaystyle D_{P},}
 
 the transpose

t
          
        
        P
        :
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        →
        
          
            
              D
            
          
          ′
        
        (
        U
        )
      
    
    {\displaystyle {}^{t}P:{\mathcal {D}}'(U)\to {\mathcal {D}}'(U)}
  
 of the continuous induced map 
  
    
      
        P
        :
        
          
            D
          
        
        (
        U
        )
        →
        
          
            D
          
        
        (
        U
        )
      
    
    {\displaystyle P:{\mathcal {D}}(U)\to {\mathcal {D}}(U)}
  
 defined by 
  
    
      
        ϕ
        ↦
        P
        (
        ϕ
        )
      
    
    {\displaystyle \phi \mapsto P(\phi )}
  
 is considered in the lemma below. 
This leads to the following definition of the differential operator on 
  
    
      
        U
      
    
    {\displaystyle U}
  
 called the formal transpose of 
  
    
      
        P
        ,
      
    
    {\displaystyle P,}
  
 which will be denoted by 
  
    
      
        
          P
          
            ∗
          
        
      
    
    {\displaystyle P_{*}}
  
 to avoid confusion with the transpose map, that is defined by

P
          
            ∗
          
        
        :=
        
          ∑
          
            α
          
        
        
          b
          
            α
          
        
        
          ∂
          
            α
          
        
        
        
           where 
        
        
        
          b
          
            α
          
        
        :=
        
          ∑
          
            β
            ≥
            α
          
        
        (
        −
        1
        
          )
          
            
              |
            
            β
            
              |
            
          
        
        
          
            
              (
            
            
              β
              α
            
            
              )
            
          
        
        
          ∂
          
            β
            −
            α
          
        
        
          c
          
            β
          
        
        .
      
    
    {\displaystyle P_{*}:=\sum _{\alpha }b_{\alpha }\partial ^{\alpha }\quad {\text{ where }}\quad b_{\alpha }:=\sum _{\beta \geq \alpha }(-1)^{|\beta |}{\binom {\beta }{\alpha }}\partial ^{\beta -\alpha }c_{\beta }.}

Lemma—Let 
 
 
 
 P
 
 
 {\displaystyle P}
 
 be a linear differential operator with smooth coefficients in 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 Then for all 
 
 
 
 ϕ
 ∈
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle \phi \in {\mathcal {D}}(U)}
 
 we have

⟨

t
              
            
            P
            (
            
              D
              
                f
              
            
            )
            ,
            ϕ
          
          ⟩
        
        =
        
          ⟨
          
            
              D
              
                
                  P
                  
                    ∗
                  
                
                (
                f
                )
              
            
            ,
            ϕ
          
          ⟩
        
        ,
      
    
    {\displaystyle \left\langle {}^{t}P(D_{f}),\phi \right\rangle =\left\langle D_{P_{*}(f)},\phi \right\rangle ,}

which is equivalent to:

t
          
        
        P
        (
        
          D
          
            f
          
        
        )
        =
        
          D
          
            
              P
              
                ∗
              
            
            (
            f
            )
          
        
        .
      
    
    {\displaystyle {}^{t}P(D_{f})=D_{P_{*}(f)}.}

<table><tbody><tr><th>Proof</th></tr><tr><td>As discussed above, for any ϕ ∈ D ( U ) , {\displaystyle \phi \in {\mathcal {D}}(U),} the transpose may be calculated by: ⟨ t P ( D f ) , ϕ ⟩ = ∫ U f ( x ) P ( ϕ ) ( x ) d x = ∫ U f ( x ) [ ∑ α c α ( x ) ( ∂ α ϕ ) ( x ) ] d x = ∑ α ∫ U f ( x ) c α ( x ) ( ∂ α ϕ ) ( x ) d x = ∑ α ( − 1 ) | α | ∫ U ϕ ( x ) ( ∂ α ( c α f ) ) ( x ) d x {\displaystyle {\begin{aligned}\left\langle {}^{t}P(D_{f}),\phi \right\rangle &=\int _{U}f(x)P(\phi )(x)\,dx\\&=\int _{U}f(x)\left[\sum \nolimits _{\alpha }c_{\alpha }(x)(\partial ^{\alpha }\phi )(x)\right]\,dx\\&=\sum \nolimits _{\alpha }\int _{U}f(x)c_{\alpha }(x)(\partial ^{\alpha }\phi )(x)\,dx\\&=\sum \nolimits _{\alpha }(-1)^{|\alpha |}\int _{U}\phi (x)(\partial ^{\alpha }(c_{\alpha }f))(x)\,dx\end{aligned}}} For the last line we used <a href="/facts/Integration_by_parts/aV6JgBNd">integration by parts</a> combined with the fact that ϕ {\displaystyle \phi } and therefore all the functions f ( x ) c α ( x ) ∂ α ϕ ( x ) {\displaystyle f(x)c_{\alpha }(x)\partial ^{\alpha }\phi (x)} have compact support.<a class="footnote-ref" id="fnref:44" href="#fn:44">44</a> Continuing the calculation above, for all ϕ ∈ D ( U ) : {\displaystyle \phi \in {\mathcal {D}}(U):} ⟨ t P ( D f ) , ϕ ⟩ = ∑ α ( − 1 ) | α | ∫ U ϕ ( x ) ( ∂ α ( c α f ) ) ( x ) d x As shown above = ∫ U ϕ ( x ) ∑ α ( − 1 ) | α | ( ∂ α ( c α f ) ) ( x ) d x = ∫ U ϕ ( x ) ∑ α [ ∑ γ ≤ α ( α γ ) ( ∂ γ c α ) ( x ) ( ∂ α − γ f ) ( x ) ] d x Leibniz rule = ∫ U ϕ ( x ) [ ∑ α ∑ γ ≤ α ( − 1 ) | α | ( α γ ) ( ∂ γ c α ) ( x ) ( ∂ α − γ f ) ( x ) ] d x = ∫ U ϕ ( x ) [ ∑ α [ ∑ β ≥ α ( − 1 ) | β | ( β α ) ( ∂ β − α c β ) ( x ) ] ( ∂ α f ) ( x ) ] d x Grouping terms by derivatives of  f = ∫ U ϕ ( x ) [ ∑ α b α ( x ) ( ∂ α f ) ( x ) ] d x b α := ∑ β ≥ α ( − 1 ) | β | ( β α ) ∂ β − α c β = ⟨ ( ∑ α b α ∂ α ) ( f ) , ϕ ⟩ {\displaystyle {\begin{aligned}\left\langle {}^{t}P(D_{f}),\phi \right\rangle &=\sum \nolimits _{\alpha }(-1)^{|\alpha |}\int _{U}\phi (x)(\partial ^{\alpha }(c_{\alpha }f))(x)\,dx&&{\text{As shown above}}\\[4pt]&=\int _{U}\phi (x)\sum \nolimits _{\alpha }(-1)^{|\alpha |}(\partial ^{\alpha }(c_{\alpha }f))(x)\,dx\\[4pt]&=\int _{U}\phi (x)\sum _{\alpha }\left[\sum _{\gamma \leq \alpha }{\binom {\alpha }{\gamma }}(\partial ^{\gamma }c_{\alpha })(x)(\partial ^{\alpha -\gamma }f)(x)\right]\,dx&&{\text{Leibniz rule}}\\&=\int _{U}\phi (x)\left[\sum _{\alpha }\sum _{\gamma \leq \alpha }(-1)^{|\alpha |}{\binom {\alpha }{\gamma }}(\partial ^{\gamma }c_{\alpha })(x)(\partial ^{\alpha -\gamma }f)(x)\right]\,dx\\&=\int _{U}\phi (x)\left[\sum _{\alpha }\left[\sum _{\beta \geq \alpha }(-1)^{|\beta |}{\binom {\beta }{\alpha }}\left(\partial ^{\beta -\alpha }c_{\beta }\right)(x)\right](\partial ^{\alpha }f)(x)\right]\,dx&&{\text{Grouping terms by derivatives of }}f\\&=\int _{U}\phi (x)\left[\sum \nolimits _{\alpha }b_{\alpha }(x)(\partial ^{\alpha }f)(x)\right]\,dx&&b_{\alpha }:=\sum _{\beta \geq \alpha }(-1)^{|\beta |}{\binom {\beta }{\alpha }}\partial ^{\beta -\alpha }c_{\beta }\\&=\left\langle \left(\sum \nolimits _{\alpha }b_{\alpha }\partial ^{\alpha }\right)(f),\phi \right\rangle \end{aligned}}} </td></tr></tbody></table>
The Lemma combined with the fact that the formal transpose of the formal transpose is the original differential operator, that is, 
 
 
 
 
 P
 
 ∗
 ∗
 
 
 =
 P
 ,
 
 
 {\displaystyle P_{**}=P,}
 
<a class="footnote-ref" id="fnref:45" href="#fn:45">45</a> enables us to arrive at the correct definition: the formal transpose induces the (continuous) canonical linear operator 
 
 
 
 
 P
 
 ∗
 
 
 :
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 →
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle P_{*}:C_{c}^{\infty }(U)\to C_{c}^{\infty }(U)}
 
 defined by 
 
 
 
 ϕ
 ↦
 
 P
 
 ∗
 
 
 (
 ϕ
 )
 .
 
 
 {\displaystyle \phi \mapsto P_{*}(\phi ).}
 
 We claim that the transpose of this map,

t
 
 
 
 P
 
 ∗
 
 
 :
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 ,
 
 
 {\displaystyle {}^{t}P_{*}:{\mathcal {D}}'(U)\to {\mathcal {D}}'(U),}
 
 can be taken as 
 
 
 
 
 D
 
 P
 
 
 .
 
 
 {\displaystyle D_{P}.}
 
 To see this, for every 
 
 
 
 ϕ
 ∈
 
 
 D
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle \phi \in {\mathcal {D}}(U),}
 
 compute its action on a distribution of the form 
 
 
 
 
 D
 
 f
 
 
 
 
 {\displaystyle D_{f}}
 
 with 
 
 
 
 f
 ∈
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{\infty }(U)}
 
:

 
 
 
 
 
 
 
 
 ⟨

t
                      
                    
                    
                      P
                      
                        ∗
                      
                    
                    
                      (
                      
                        D
                        
                          f
                        
                      
                      )
                    
                    ,
                    ϕ
                  
                  ⟩
                
              
              
                
                =
                
                  ⟨
                  
                    
                      D
                      
                        
                          P
                          
                            ∗
                            ∗
                          
                        
                        (
                        f
                        )
                      
                    
                    ,
                    ϕ
                  
                  ⟩
                
              
              
              
                
                  Using Lemma above with 
                
                
                  P
                  
                    ∗
                  
                
                
                   in place of 
                
                P
              
            
            
              
              
                
                =
                
                  ⟨
                  
                    
                      D
                      
                        P
                        (
                        f
                        )
                      
                    
                    ,
                    ϕ
                  
                  ⟩
                
              
              
              
                
                  P
                  
                    ∗
                    ∗
                  
                
                =
                P
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}\left\langle {}^{t}P_{*}\left(D_{f}\right),\phi \right\rangle &=\left\langle D_{P_{**}(f)},\phi \right\rangle &&{\text{Using Lemma above with }}P_{*}{\text{ in place of }}P\\&=\left\langle D_{P(f)},\phi \right\rangle &&P_{**}=P\end{aligned}}}

We call the continuous linear operator 
 
 
 
 
 D
 
 P
 
 
 :=

t
 
 
 
 P
 
 ∗
 
 
 :
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle D_{P}:={}^{t}P_{*}:{\mathcal {D}}'(U)\to {\mathcal {D}}'(U)}
 
 the differential operator on distributions extending 
 
 
 
 P
 
 
 {\displaystyle P}
 
.<a class="footnote-ref" id="fnref:46" href="#fn:46">46</a> Its action on an arbitrary distribution 
 
 
 
 S
 
 
 {\displaystyle S}
 
 is defined via:

D
          
            P
          
        
        (
        S
        )
        (
        ϕ
        )
        =
        S
        
          (
          
            
              P
              
                ∗
              
            
            (
            ϕ
            )
          
          )
        
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle D_{P}(S)(\phi )=S\left(P_{*}(\phi )\right)\quad {\text{ for all }}\phi \in {\mathcal {D}}(U).}

If 
 
 
 
 (
 
 T
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (T_{i})_{i=1}^{\infty }}
 
 converges to 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 then for every multi-index 
 
 
 
 α
 ,
 (
 
 ∂
 
 α
 
 
 
 T
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle \alpha ,(\partial ^{\alpha }T_{i})_{i=1}^{\infty }}
 
 converges to 
 
 
 
 
 ∂
 
 α
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle \partial ^{\alpha }T\in {\mathcal {D}}'(U).}

<h4>Multiplication of distributions by smooth functions</h4>
A differential operator of order 0 is just multiplication by a smooth function. And conversely, if 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a smooth function then 
 
 
 
 P
 :=
 f
 (
 x
 )
 
 
 {\displaystyle P:=f(x)}
 
 is a differential operator of order 0, whose formal transpose is itself (that is, 
 
 
 
 
 P
 
 ∗
 
 
 =
 P
 
 
 {\displaystyle P_{*}=P}
 
). The induced differential operator 
 
 
 
 
 D
 
 P
 
 
 :
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle D_{P}:{\mathcal {D}}'(U)\to {\mathcal {D}}'(U)}
 
 maps a distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 to a distribution denoted by 
 
 
 
 f
 T
 :=
 
 D
 
 P
 
 
 (
 T
 )
 .
 
 
 {\displaystyle fT:=D_{P}(T).}
 
 We have thus defined the multiplication of a distribution by a smooth function.
We now give an alternative presentation of the multiplication of a distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 by a smooth function 
 
 
 
 m
 :
 U
 →
 
 R
 
 .
 
 
 {\displaystyle m:U\to \mathbb {R} .}
 
 The product 
 
 
 
 m
 T
 
 
 {\displaystyle mT}
 
 is defined by

⟨
        m
        T
        ,
        ϕ
        ⟩
        =
        ⟨
        T
        ,
        m
        ϕ
        ⟩
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle \langle mT,\phi \rangle =\langle T,m\phi \rangle \qquad {\text{ for all }}\phi \in {\mathcal {D}}(U).}

This definition coincides with the transpose definition since if 
 
 
 
 M
 :
 
 
 D
 
 
 (
 U
 )
 →
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle M:{\mathcal {D}}(U)\to {\mathcal {D}}(U)}
 
 is the operator of multiplication by the function 
 
 
 
 m
 
 
 {\displaystyle m}
 
 (that is, 
 
 
 
 (
 M
 ϕ
 )
 (
 x
 )
 =
 m
 (
 x
 )
 ϕ
 (
 x
 )
 
 
 {\displaystyle (M\phi )(x)=m(x)\phi (x)}
 
), then

∫
          
            U
          
        
        (
        M
        ϕ
        )
        (
        x
        )
        ψ
        (
        x
        )
        
        d
        x
        =
        
          ∫
          
            U
          
        
        m
        (
        x
        )
        ϕ
        (
        x
        )
        ψ
        (
        x
        )
        
        d
        x
        =
        
          ∫
          
            U
          
        
        ϕ
        (
        x
        )
        m
        (
        x
        )
        ψ
        (
        x
        )
        
        d
        x
        =
        
          ∫
          
            U
          
        
        ϕ
        (
        x
        )
        (
        M
        ψ
        )
        (
        x
        )
        
        d
        x
        ,
      
    
    {\displaystyle \int _{U}(M\phi )(x)\psi (x)\,dx=\int _{U}m(x)\phi (x)\psi (x)\,dx=\int _{U}\phi (x)m(x)\psi (x)\,dx=\int _{U}\phi (x)(M\psi )(x)\,dx,}

so that

t
          
        
        M
        =
        M
        .
      
    
    {\displaystyle {}^{t}M=M.}

Under multiplication by smooth functions, 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 is a <a href="/facts/Module_(mathematics)/jP0LIhFL">module</a> over the <a href="/facts/Ring_(mathematics)/JnCUXz63">ring</a> 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{\infty }(U).}
 
 With this definition of multiplication by a smooth function, the ordinary <a href="/facts/Product_rule/MyKxsP5t">product rule</a> of calculus remains valid. However, some unusual identities also arise. For example, if 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 is the Dirac delta distribution on 
 
 
 
 
 R
 
 ,
 
 
 {\displaystyle \mathbb {R} ,}
 
 then 
 
 
 
 m
 δ
 =
 m
 (
 0
 )
 δ
 ,
 
 
 {\displaystyle m\delta =m(0)\delta ,}
 
 and if 
 
 
 
 
 δ
 
 
 
 ′
 
 
 
 
 
 {\displaystyle \delta ^{'}}
 
 is the derivative of the delta distribution, then

m
        
          δ
          ′
        
        =
        m
        (
        0
        )
        
          δ
          ′
        
        −
        
          m
          ′
        
        δ
        =
        m
        (
        0
        )
        
          δ
          ′
        
        −
        
          m
          ′
        
        (
        0
        )
        δ
        .
      
    
    {\displaystyle m\delta '=m(0)\delta '-m'\delta =m(0)\delta '-m'(0)\delta .}

The bilinear multiplication map 
 
 
 
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 ×
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 
 
 D
 
 
 ′
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 
 {\displaystyle C^{\infty }(\mathbb {R} ^{n})\times {\mathcal {D}}'(\mathbb {R} ^{n})\to {\mathcal {D}}'\left(\mathbb {R} ^{n}\right)}
 
 given by 
 
 
 
 (
 f
 ,
 T
 )
 ↦
 f
 T
 
 
 {\displaystyle (f,T)\mapsto fT}
 
 is not continuous; it is however, <a href="/facts/Hypocontinuous/Klr9K6Sy">hypocontinuous</a>.<a class="footnote-ref" id="fnref:47" href="#fn:47">47</a>
Example. The product of any distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 with the function that is identically 1 on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 is equal to 
 
 
 
 T
 .
 
 
 {\displaystyle T.}

Example. Suppose 
 
 
 
 (
 
 f
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (f_{i})_{i=1}^{\infty }}
 
 is a sequence of test functions on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 that converges to the constant function 
 
 
 
 1
 ∈
 
 C
 
 ∞
 
 
 (
 U
 )
 .
 
 
 {\displaystyle 1\in C^{\infty }(U).}
 
 For any distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 on 
 
 
 
 U
 ,
 
 
 {\displaystyle U,}
 
 the sequence 
 
 
 
 (
 
 f
 
 i
 
 
 T
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (f_{i}T)_{i=1}^{\infty }}
 
 converges to 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle T\in {\mathcal {D}}'(U).}
 
<a class="footnote-ref" id="fnref:48" href="#fn:48">48</a>
If 
 
 
 
 (
 
 T
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (T_{i})_{i=1}^{\infty }}
 
 converges to 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 and 
 
 
 
 (
 
 f
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (f_{i})_{i=1}^{\infty }}
 
 converges to 
 
 
 
 f
 ∈
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle f\in C^{\infty }(U)}
 
 then 
 
 
 
 (
 
 f
 
 i
 
 
 
 T
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 
 
 {\displaystyle (f_{i}T_{i})_{i=1}^{\infty }}
 
 converges to 
 
 
 
 f
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle fT\in {\mathcal {D}}'(U).}

<h5>Problem of multiplying distributions</h5>
It is easy to define the product of a distribution with a smooth function, or more generally the product of two distributions whose <a href="/facts/Singular_support/BTuMGbsb">singular supports</a> are disjoint.<a class="footnote-ref" id="fnref:49" href="#fn:49">49</a> With more effort, it is possible to define a well-behaved product of several distributions provided their <a href="/facts/Wave_front_set/As2j99Tn">wave front sets</a> at each point are compatible. A limitation of the theory of distributions (and hyperfunctions) is that there is no associative product of two distributions extending the product of a distribution by a smooth function, as has been proved by <a href="/facts/Laurent_Schwartz/Kxelk3ju">Laurent Schwartz</a> in the 1950s. For example, if 
 
 
 
 
 p
 .
 v
 .
 
 ⁡
 
 
 1
 x
 
 
 
 
 {\displaystyle \operatorname {p.v.} {\frac {1}{x}}}
 
 is the distribution obtained by the <a href="/facts/Cauchy_principal_value/Gm33Qevf">Cauchy principal value</a>

(
          
            
              p
              .
              v
              .
            
            ⁡
            
              
                1
                x
              
            
          
          )
        
        (
        ϕ
        )
        =
        
          lim
          
            ε
            →
            
              0
              
                +
              
            
          
        
        
          ∫
          
            
              |
            
            x
            
              |
            
            ≥
            ε
          
        
        
          
            
              ϕ
              (
              x
              )
            
            x
          
        
        
        d
        x
        
        
           for all 
        
        ϕ
        ∈
        
          
            S
          
        
        (
        
          R
        
        )
        .
      
    
    {\displaystyle \left(\operatorname {p.v.} {\frac {1}{x}}\right)(\phi )=\lim _{\varepsilon \to 0^{+}}\int _{|x|\geq \varepsilon }{\frac {\phi (x)}{x}}\,dx\quad {\text{ for all }}\phi \in {\mathcal {S}}(\mathbb {R} ).}

If 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 is the Dirac delta distribution then

(
        δ
        ×
        x
        )
        ×
        
          p
          .
          v
          .
        
        ⁡
        
          
            1
            x
          
        
        =
        0
      
    
    {\displaystyle (\delta \times x)\times \operatorname {p.v.} {\frac {1}{x}}=0}

but,

δ
        ×
        
          (
          
            x
            ×
            
              p
              .
              v
              .
            
            ⁡
            
              
                1
                x
              
            
          
          )
        
        =
        δ
      
    
    {\displaystyle \delta \times \left(x\times \operatorname {p.v.} {\frac {1}{x}}\right)=\delta }

so the product of a distribution by a smooth function (which is always well-defined) cannot be extended to an <a href="/facts/Associativity/EQX8lV6r">associative</a> product on the space of distributions.
Thus, nonlinear problems cannot be posed in general and thus are not solved within distribution theory alone. In the context of <a href="/facts/Quantum_field_theory/VoewsNJV">quantum field theory</a>, however, solutions can be found. In more than two spacetime dimensions the problem is related to the <a href="/facts/Regularization_(physics)/mzFLfUgl">regularization</a> of <a href="/facts/Ultraviolet_divergence/pfVuulfl">divergences</a>. Here Henri Epstein and <a href="/facts/Vladimir_Glaser/80Vt9a1c">Vladimir Glaser</a> developed the mathematically rigorous (but extremely technical) <a href="/facts/Causal_perturbation_theory/CVnHXhGT">causal perturbation theory</a>. This does not solve the problem in other situations. Many other interesting theories are non-linear, like for example the <a href="/facts/Navier%E2%80%93Stokes_equations/48pQugEa">Navier–Stokes equations</a> of <a href="/facts/Fluid_dynamics/y7uzSCfg">fluid dynamics</a>.
Several not entirely satisfactory theories of <a href="/facts/Algebra_(ring_theory)/8T8ulWJb">algebras</a> of <a href="/facts/Generalized_function/fCM4VsyT">generalized functions</a> have been developed, among which <a href="/facts/Colombeau_algebra/bY55eqfY">Colombeau's (simplified) algebra</a> is maybe the most popular in use today.
Inspired by Lyons' <a href="/facts/Rough_path/oL0RfX4W">rough path</a> theory,<a class="footnote-ref" id="fnref:50" href="#fn:50">50</a> <a href="/facts/Martin_Hairer/MYrGy4y5">Martin Hairer</a> proposed a consistent way of multiplying distributions with certain structures (<a href="/facts/Regularity_structures/NcWfwuqN">regularity structures</a><a class="footnote-ref" id="fnref:51" href="#fn:51">51</a>), available in many examples from stochastic analysis, notably stochastic partial differential equations. See also Gubinelli–Imkeller–Perkowski (2015) for a related development based on <a href="/facts/Jean-Michel_Bony/pbeHWtHF">Bony</a>'s <a href="/facts/Paraproduct/3GT1JfGx">paraproduct</a> from Fourier analysis.

<h3>Composition with a smooth function</h3>
Let 
 
 
 
 T
 
 
 {\displaystyle T}
 
 be a distribution on 
 
 
 
 U
 .
 
 
 {\displaystyle U.}
 
 Let 
 
 
 
 V
 
 
 {\displaystyle V}
 
 be an open set in 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 and 
 
 
 
 F
 :
 V
 →
 U
 .
 
 
 {\displaystyle F:V\to U.}
 
 If 
 
 
 
 F
 
 
 {\displaystyle F}
 
 is a <a href="/facts/Submersion_(mathematics)/ARWB4sfr">submersion</a> then it is possible to define

T
        ∘
        F
        ∈
        
          
            
              D
            
          
          ′
        
        (
        V
        )
        .
      
    
    {\displaystyle T\circ F\in {\mathcal {D}}'(V).}

This is the composition of the distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 with 
 
 
 
 F
 
 
 {\displaystyle F}
 
, and is also called the <a href="/facts/Pullback_(differential_geometry)/EzMDBYfK">pullback</a> of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 along 
 
 
 
 F
 
 
 {\displaystyle F}
 
, sometimes written

F
          
            ♯
          
        
        :
        T
        ↦
        
          F
          
            ♯
          
        
        T
        =
        T
        ∘
        F
        .
      
    
    {\displaystyle F^{\sharp }:T\mapsto F^{\sharp }T=T\circ F.}

The pullback is often denoted 
 
 
 
 
 F
 
 ∗
 
 
 ,
 
 
 {\displaystyle F^{*},}
 
 although this notation should not be confused with the use of '*' to denote the adjoint of a linear mapping.
The condition that 
 
 
 
 F
 
 
 {\displaystyle F}
 
 be a submersion is equivalent to the requirement that the <a href="/facts/Jacobian_matrix_and_determinant/0tNv6o8j">Jacobian</a> derivative 
 
 
 
 d
 F
 (
 x
 )
 
 
 {\displaystyle dF(x)}
 
 of 
 
 
 
 F
 
 
 {\displaystyle F}
 
 is a <a href="/facts/Surjective/KezhLpCb">surjective</a> linear map for every 
 
 
 
 x
 ∈
 V
 .
 
 
 {\displaystyle x\in V.}
 
 A necessary (but not sufficient) condition for extending 
 
 
 
 
 F
 
 #
 
 
 
 
 {\displaystyle F^{\#}}
 
 to distributions is that 
 
 
 
 F
 
 
 {\displaystyle F}
 
 be an <a href="/facts/Open_mapping/abHUKX7l">open mapping</a>.<a class="footnote-ref" id="fnref:52" href="#fn:52">52</a> The <a href="/facts/Inverse_function_theorem/pIwcyc6X">Inverse function theorem</a> ensures that a submersion satisfies this condition.
If 
 
 
 
 F
 
 
 {\displaystyle F}
 
 is a submersion, then 
 
 
 
 
 F
 
 #
 
 
 
 
 {\displaystyle F^{\#}}
 
 is defined on distributions by finding the transpose map. The uniqueness of this extension is guaranteed since 
 
 
 
 
 F
 
 #
 
 
 
 
 {\displaystyle F^{\#}}
 
 is a continuous linear operator on 
 
 
 
 
 
 D
 
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}(U).}
 
 Existence, however, requires using the <a href="/facts/Integration_by_substitution/NvXfTTaf">change of variables</a> formula, the inverse function theorem (locally), and a <a href="/facts/Partition_of_unity/4byX17aR">partition of unity</a> argument.<a class="footnote-ref" id="fnref:53" href="#fn:53">53</a>
In the special case when 
 
 
 
 F
 
 
 {\displaystyle F}
 
 is a <a href="/facts/Diffeomorphism/855N5YYj">diffeomorphism</a> from an open subset 
 
 
 
 V
 
 
 {\displaystyle V}
 
 of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 onto an open subset 
 
 
 
 U
 
 
 {\displaystyle U}
 
 of 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 change of variables under the integral gives:

∫
          
            V
          
        
        ϕ
        ∘
        F
        (
        x
        )
        ψ
        (
        x
        )
        
        d
        x
        =
        
          ∫
          
            U
          
        
        ϕ
        (
        x
        )
        ψ
        
          (
          
            
              F
              
                −
                1
              
            
            (
            x
            )
          
          )
        
        
          |
          
            det
            d
            
              F
              
                −
                1
              
            
            (
            x
            )
          
          |
        
        
        d
        x
        .
      
    
    {\displaystyle \int _{V}\phi \circ F(x)\psi (x)\,dx=\int _{U}\phi (x)\psi \left(F^{-1}(x)\right)\left|\det dF^{-1}(x)\right|\,dx.}

In this particular case, then, 
 
 
 
 
 F
 
 #
 
 
 
 
 {\displaystyle F^{\#}}
 
 is defined by the transpose formula:

⟨
          
            
              F
              
                ♯
              
            
            T
            ,
            ϕ
          
          ⟩
        
        =
        
          ⟨
          
            T
            ,
            
              |
              
                det
                d
                (
                
                  F
                  
                    −
                    1
                  
                
                )
              
              |
            
            ϕ
            ∘
            
              F
              
                −
                1
              
            
          
          ⟩
        
        .
      
    
    {\displaystyle \left\langle F^{\sharp }T,\phi \right\rangle =\left\langle T,\left|\det d(F^{-1})\right|\phi \circ F^{-1}\right\rangle .}

<h3>Convolution</h3>
Under some circumstances, it is possible to define the <a href="/facts/Convolution/PVPrdz9J">convolution</a> of a function with a distribution, or even the convolution of two distributions.
Recall that if 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 g
 
 
 {\displaystyle g}
 
 are functions on 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 then we denote by 
 
 
 
 f
 ∗
 g
 
 
 {\displaystyle f\ast g}
 
 the convolution of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 g
 ,
 
 
 {\displaystyle g,}
 
 defined at 
 
 
 
 x
 ∈
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle x\in \mathbb {R} ^{n}}
 
 to be the integral

(
        f
        ∗
        g
        )
        (
        x
        )
        :=
        
          ∫
          
            
              
                R
              
              
                n
              
            
          
        
        f
        (
        x
        −
        y
        )
        g
        (
        y
        )
        
        d
        y
        =
        
          ∫
          
            
              
                R
              
              
                n
              
            
          
        
        f
        (
        y
        )
        g
        (
        x
        −
        y
        )
        
        d
        y
      
    
    {\displaystyle (f\ast g)(x):=\int _{\mathbb {R} ^{n}}f(x-y)g(y)\,dy=\int _{\mathbb {R} ^{n}}f(y)g(x-y)\,dy}

provided that the integral exists. If 
 
 
 
 1
 ≤
 p
 ,
 q
 ,
 r
 ≤
 ∞
 
 
 {\displaystyle 1\leq p,q,r\leq \infty }
 
 are such that 
 
 
 
 
 
 1
 r
 
 
 =
 
 
 1
 p
 
 
 +
 
 
 1
 q
 
 
 −
 1
 
 
 {\textstyle {\frac {1}{r}}={\frac {1}{p}}+{\frac {1}{q}}-1}
 
 then for any functions 
 
 
 
 f
 ∈
 
 L
 
 p
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle f\in L^{p}(\mathbb {R} ^{n})}
 
 and 
 
 
 
 g
 ∈
 
 L
 
 q
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle g\in L^{q}(\mathbb {R} ^{n})}
 
 we have 
 
 
 
 f
 ∗
 g
 ∈
 
 L
 
 r
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle f\ast g\in L^{r}(\mathbb {R} ^{n})}
 
 and 
 
 
 
 ‖
 f
 ∗
 g
 
 ‖
 
 
 L
 
 r
 
 
 
 
 ≤
 ‖
 f
 
 ‖
 
 
 L
 
 p
 
 
 
 
 ‖
 g
 
 ‖
 
 
 L
 
 q
 
 
 
 
 .
 
 
 {\displaystyle \|f\ast g\|_{L^{r}}\leq \|f\|_{L^{p}}\|g\|_{L^{q}}.}
 
<a class="footnote-ref" id="fnref:54" href="#fn:54">54</a> If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 g
 
 
 {\displaystyle g}
 
 are continuous functions on 
 
 
 
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle \mathbb {R} ^{n},}
 
 at least one of which has compact support, then 
 
 
 
 supp
 ⁡
 (
 f
 ∗
 g
 )
 ⊆
 supp
 ⁡
 (
 f
 )
 +
 supp
 ⁡
 (
 g
 )
 
 
 {\displaystyle \operatorname {supp} (f\ast g)\subseteq \operatorname {supp} (f)+\operatorname {supp} (g)}
 
 and if 
 
 
 
 A
 ⊆
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle A\subseteq \mathbb {R} ^{n}}
 
 then the value of 
 
 
 
 f
 ∗
 g
 
 
 {\displaystyle f\ast g}
 
 on 
 
 
 
 A
 
 
 {\displaystyle A}
 
 do not depend on the values of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 outside of the <a href="/facts/Minkowski_sum/dEQfoJ1A">Minkowski sum</a> 
 
 
 
 A
 −
 supp
 ⁡
 (
 g
 )
 =
 {
 a
 −
 s
 :
 a
 ∈
 A
 ,
 s
 ∈
 supp
 ⁡
 (
 g
 )
 }
 .
 
 
 {\displaystyle A-\operatorname {supp} (g)=\{a-s:a\in A,s\in \operatorname {supp} (g)\}.}
 
<a class="footnote-ref" id="fnref:55" href="#fn:55">55</a>
Importantly, if 
 
 
 
 g
 ∈
 
 L
 
 1
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle g\in L^{1}(\mathbb {R} ^{n})}
 
 has compact support then for any 
 
 
 
 0
 ≤
 k
 ≤
 ∞
 ,
 
 
 {\displaystyle 0\leq k\leq \infty ,}
 
 the convolution map 
 
 
 
 f
 ↦
 f
 ∗
 g
 
 
 {\displaystyle f\mapsto f\ast g}
 
 is continuous when considered as the map 
 
 
 
 
 C
 
 k
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 k
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle C^{k}(\mathbb {R} ^{n})\to C^{k}(\mathbb {R} ^{n})}
 
 or as the map 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 c
 
 
 k
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle C_{c}^{k}(\mathbb {R} ^{n})\to C_{c}^{k}(\mathbb {R} ^{n}).}
 
<a class="footnote-ref" id="fnref:56" href="#fn:56">56</a>

<h4>Translation and symmetry</h4>
Given 
 
 
 
 a
 ∈
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle a\in \mathbb {R} ^{n},}
 
 the translation operator 
 
 
 
 
 τ
 
 a
 
 
 
 
 {\displaystyle \tau _{a}}
 
 sends 
 
 
 
 f
 :
 
 
 R
 
 
 n
 
 
 →
 
 C
 
 
 
 {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {C} }
 
 to 
 
 
 
 
 τ
 
 a
 
 
 f
 :
 
 
 R
 
 
 n
 
 
 →
 
 C
 
 ,
 
 
 {\displaystyle \tau _{a}f:\mathbb {R} ^{n}\to \mathbb {C} ,}
 
 defined by 
 
 
 
 
 τ
 
 a
 
 
 f
 (
 y
 )
 =
 f
 (
 y
 −
 a
 )
 .
 
 
 {\displaystyle \tau _{a}f(y)=f(y-a).}
 
 This can be extended by the transpose to distributions in the following way: given a distribution 
 
 
 
 T
 ,
 
 
 {\displaystyle T,}
 
 the translation of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 by 
 
 
 
 a
 
 
 {\displaystyle a}
 
 is the distribution 
 
 
 
 
 τ
 
 a
 
 
 T
 :
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 
 
 {\displaystyle \tau _{a}T:{\mathcal {D}}(\mathbb {R} ^{n})\to \mathbb {C} }
 
 defined by 
 
 
 
 
 τ
 
 a
 
 
 T
 (
 ϕ
 )
 :=
 
 ⟨
 
 T
 ,
 
 τ
 
 −
 a
 
 
 ϕ
 
 ⟩
 
 .
 
 
 {\displaystyle \tau _{a}T(\phi ):=\left\langle T,\tau _{-a}\phi \right\rangle .}
 
<a class="footnote-ref" id="fnref:57" href="#fn:57">57</a><a class="footnote-ref" id="fnref:58" href="#fn:58">58</a>
Given 
 
 
 
 f
 :
 
 
 R
 
 
 n
 
 
 →
 
 C
 
 ,
 
 
 {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {C} ,}
 
 define the function 
 
 
 
 
 
 
 f
 ~
 
 
 
 :
 
 
 R
 
 
 n
 
 
 →
 
 C
 
 
 
 {\displaystyle {\tilde {f}}:\mathbb {R} ^{n}\to \mathbb {C} }
 
 by 
 
 
 
 
 
 
 f
 ~
 
 
 
 (
 x
 )
 :=
 f
 (
 −
 x
 )
 .
 
 
 {\displaystyle {\tilde {f}}(x):=f(-x).}
 
 Given a distribution 
 
 
 
 T
 ,
 
 
 {\displaystyle T,}
 
 let 
 
 
 
 
 
 
 T
 ~
 
 
 
 :
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 
 
 {\displaystyle {\tilde {T}}:{\mathcal {D}}(\mathbb {R} ^{n})\to \mathbb {C} }
 
 be the distribution defined by 
 
 
 
 
 
 
 T
 ~
 
 
 
 (
 ϕ
 )
 :=
 T
 
 (
 
 
 
 ϕ
 ~
 
 
 
 )
 
 .
 
 
 {\displaystyle {\tilde {T}}(\phi ):=T\left({\tilde {\phi }}\right).}
 
 The operator 
 
 
 
 T
 ↦
 
 
 
 T
 ~
 
 
 
 
 
 {\displaystyle T\mapsto {\tilde {T}}}
 
 is called the symmetry with respect to the origin.<a class="footnote-ref" id="fnref:59" href="#fn:59">59</a>

<h4>Convolution of a test function with a distribution</h4>
Convolution with 
 
 
 
 f
 ∈
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle f\in {\mathcal {D}}(\mathbb {R} ^{n})}
 
 defines a linear map:

C
                  
                    f
                  
                
                :
                
              
              
                
                  
                    D
                  
                
                (
                
                  
                    R
                  
                  
                    n
                  
                
                )
              
              
              
                
                →
                
              
              
              
                
                  
                    D
                  
                
                (
                
                  
                    R
                  
                  
                    n
                  
                
                )
              
            
            
              
              
                g
              
              
              
                
                ↦
                
              
              
              
                f
                ∗
                g
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{4}C_{f}:\,&{\mathcal {D}}(\mathbb {R} ^{n})&&\to \,&&{\mathcal {D}}(\mathbb {R} ^{n})\\&g&&\mapsto \,&&f\ast g\\\end{alignedat}}}

which is <a href="/facts/Continuous_function/sKbl02pB">continuous</a> with respect to the canonical <a href="/facts/LF_space/voQHEeGI">LF space</a> topology on 
 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n}).}

Convolution of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 with a distribution 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(\mathbb {R} ^{n})}
 
 can be defined by taking the transpose of 
 
 
 
 
 C
 
 f
 
 
 
 
 {\displaystyle C_{f}}
 
 relative to the duality pairing of 
 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n})}
 
 with the space 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {D}}'(\mathbb {R} ^{n})}
 
 of distributions.<a class="footnote-ref" id="fnref:60" href="#fn:60">60</a> If 
 
 
 
 f
 ,
 g
 ,
 ϕ
 ∈
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 ,
 
 
 {\displaystyle f,g,\phi \in {\mathcal {D}}(\mathbb {R} ^{n}),}
 
 then by <a href="/facts/Fubini%27s_theorem/q4lhtS3s">Fubini's theorem</a>

⟨
        
          C
          
            f
          
        
        g
        ,
        ϕ
        ⟩
        =
        
          ∫
          
            
              
                R
              
              
                n
              
            
          
        
        ϕ
        (
        x
        )
        
          ∫
          
            
              
                R
              
              
                n
              
            
          
        
        f
        (
        x
        −
        y
        )
        g
        (
        y
        )
        
        d
        y
        
        d
        x
        =
        
          ⟨
          
            g
            ,
            
              C
              
                
                  
                    f
                    ~
                  
                
              
            
            ϕ
          
          ⟩
        
        .
      
    
    {\displaystyle \langle C_{f}g,\phi \rangle =\int _{\mathbb {R} ^{n}}\phi (x)\int _{\mathbb {R} ^{n}}f(x-y)g(y)\,dy\,dx=\left\langle g,C_{\tilde {f}}\phi \right\rangle .}

Extending by continuity, the convolution of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 with a distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is defined by

⟨
        f
        ∗
        T
        ,
        ϕ
        ⟩
        =
        
          ⟨
          
            T
            ,
            
              
                
                  f
                  ~
                
              
            
            ∗
            ϕ
          
          ⟩
        
        ,
        
        
           for all 
        
        ϕ
        ∈
        
          
            D
          
        
        (
        
          
            R
          
          
            n
          
        
        )
        .
      
    
    {\displaystyle \langle f\ast T,\phi \rangle =\left\langle T,{\tilde {f}}\ast \phi \right\rangle ,\quad {\text{ for all }}\phi \in {\mathcal {D}}(\mathbb {R} ^{n}).}

An alternative way to define the convolution of a test function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and a distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is to use the translation operator 
 
 
 
 
 τ
 
 a
 
 
 .
 
 
 {\displaystyle \tau _{a}.}
 
 The convolution of the compactly supported function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and the distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is then the function defined for each 
 
 
 
 x
 ∈
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle x\in \mathbb {R} ^{n}}
 
 by

(
        f
        ∗
        T
        )
        (
        x
        )
        =
        
          ⟨
          
            T
            ,
            
              τ
              
                x
              
            
            
              
                
                  f
                  ~
                
              
            
          
          ⟩
        
        .
      
    
    {\displaystyle (f\ast T)(x)=\left\langle T,\tau _{x}{\tilde {f}}\right\rangle .}

It can be shown that the convolution of a smooth, compactly supported function and a distribution is a smooth function. If the distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 has compact support, and if 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a polynomial (resp. an exponential function, an analytic function, the restriction of an entire analytic function on 
 
 
 
 
 
 C
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {C} ^{n}}
 
 to 
 
 
 
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle \mathbb {R} ^{n},}
 
 the restriction of an entire function of exponential type in 
 
 
 
 
 
 C
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {C} ^{n}}
 
 to 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
), then the same is true of 
 
 
 
 T
 ∗
 f
 .
 
 
 {\displaystyle T\ast f.}
 
<a class="footnote-ref" id="fnref:61" href="#fn:61">61</a> If the distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 has compact support as well, then 
 
 
 
 f
 ∗
 T
 
 
 {\displaystyle f\ast T}
 
 is a compactly supported function, and the <a href="/facts/Titchmarsh_convolution_theorem/8kk35e18">Titchmarsh convolution theorem</a> Hörmander (1983, Theorem 4.3.3) implies that:

ch
        ⁡
        (
        supp
        ⁡
        (
        f
        ∗
        T
        )
        )
        =
        ch
        ⁡
        (
        supp
        ⁡
        (
        f
        )
        )
        +
        ch
        ⁡
        (
        supp
        ⁡
        (
        T
        )
        )
      
    
    {\displaystyle \operatorname {ch} (\operatorname {supp} (f\ast T))=\operatorname {ch} (\operatorname {supp} (f))+\operatorname {ch} (\operatorname {supp} (T))}

where 
 
 
 
 ch
 
 
 {\displaystyle \operatorname {ch} }
 
 denotes the <a href="/facts/Convex_hull/D4Id3JDS">convex hull</a> and 
 
 
 
 supp
 
 
 {\displaystyle \operatorname {supp} }
 
 denotes the support.

<h4>Convolution of a smooth function with a distribution</h4>
Let 
 
 
 
 f
 ∈
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle f\in C^{\infty }(\mathbb {R} ^{n})}
 
 and 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(\mathbb {R} ^{n})}
 
 and assume that at least one of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 T
 
 
 {\displaystyle T}
 
 has compact support. The convolution of 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 T
 ,
 
 
 {\displaystyle T,}
 
 denoted by 
 
 
 
 f
 ∗
 T
 
 
 {\displaystyle f\ast T}
 
 or by 
 
 
 
 T
 ∗
 f
 ,
 
 
 {\displaystyle T\ast f,}
 
 is the smooth function:<a class="footnote-ref" id="fnref:62" href="#fn:62">62</a>

f
                ∗
                T
                :
                
              
              
                
                  
                    R
                  
                  
                    n
                  
                
              
              
              
                
                →
                
              
              
              
                
                  C
                
              
            
            
              
              
                x
              
              
              
                
                ↦
                
              
              
              
                
                  ⟨
                  
                    T
                    ,
                    
                      τ
                      
                        x
                      
                    
                    
                      
                        
                          f
                          ~
                        
                      
                    
                  
                  ⟩
                
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{4}f\ast T:\,&\mathbb {R} ^{n}&&\to \,&&\mathbb {C} \\&x&&\mapsto \,&&\left\langle T,\tau _{x}{\tilde {f}}\right\rangle \\\end{alignedat}}}

satisfying for all 
  
    
      
        p
        ∈
        
          
            N
          
          
            n
          
        
      
    
    {\displaystyle p\in \mathbb {N} ^{n}}
  
:

supp
                ⁡
                (
                f
                ∗
                T
                )
                ⊆
                supp
                ⁡
                (
                f
                )
                +
                supp
                ⁡
                (
                T
                )
              
            
            
              
              
                
                   for all 
                
                p
                ∈
                
                  
                    N
                  
                  
                    n
                  
                
                :
                
                
                  
                    {
                    
                      
                        
                          
                            ∂
                            
                              p
                            
                          
                          
                            ⟨
                            
                              T
                              ,
                              
                                τ
                                
                                  x
                                
                              
                              
                                
                                  
                                    f
                                    ~
                                  
                                
                              
                            
                            ⟩
                          
                          =
                          
                            ⟨
                            
                              T
                              ,
                              
                                ∂
                                
                                  p
                                
                              
                              
                                τ
                                
                                  x
                                
                              
                              
                                
                                  
                                    f
                                    ~
                                  
                                
                              
                            
                            ⟩
                          
                        
                      
                      
                        
                          
                            ∂
                            
                              p
                            
                          
                          (
                          T
                          ∗
                          f
                          )
                          =
                          (
                          
                            ∂
                            
                              p
                            
                          
                          T
                          )
                          ∗
                          f
                          =
                          T
                          ∗
                          (
                          
                            ∂
                            
                              p
                            
                          
                          f
                          )
                          .
                        
                      
                    
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}&\operatorname {supp} (f\ast T)\subseteq \operatorname {supp} (f)+\operatorname {supp} (T)\\[6pt]&{\text{ for all }}p\in \mathbb {N} ^{n}:\quad {\begin{cases}\partial ^{p}\left\langle T,\tau _{x}{\tilde {f}}\right\rangle =\left\langle T,\partial ^{p}\tau _{x}{\tilde {f}}\right\rangle \\\partial ^{p}(T\ast f)=(\partial ^{p}T)\ast f=T\ast (\partial ^{p}f).\end{cases}}\end{aligned}}}

Let 
 
 
 
 M
 
 
 {\displaystyle M}
 
 be the map 
 
 
 
 f
 ↦
 T
 ∗
 f
 
 
 {\displaystyle f\mapsto T\ast f}
 
. If 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is a distribution, then 
 
 
 
 M
 
 
 {\displaystyle M}
 
 is continuous as a map 
 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n})\to C^{\infty }(\mathbb {R} ^{n})}
 
. If 
 
 
 
 T
 
 
 {\displaystyle T}
 
 also has compact support, then 
 
 
 
 M
 
 
 {\displaystyle M}
 
 is also continuous as the map 
 
 
 
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle C^{\infty }(\mathbb {R} ^{n})\to C^{\infty }(\mathbb {R} ^{n})}
 
 and continuous as the map 
 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n})\to {\mathcal {D}}(\mathbb {R} ^{n}).}
 
<a class="footnote-ref" id="fnref:63" href="#fn:63">63</a>
If 
 
 
 
 L
 :
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle L:{\mathcal {D}}(\mathbb {R} ^{n})\to C^{\infty }(\mathbb {R} ^{n})}
 
 is a continuous linear map such that 
 
 
 
 L
 
 ∂
 
 α
 
 
 ϕ
 =
 
 ∂
 
 α
 
 
 L
 ϕ
 
 
 {\displaystyle L\partial ^{\alpha }\phi =\partial ^{\alpha }L\phi }
 
 for all 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 and all 
 
 
 
 ϕ
 ∈
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle \phi \in {\mathcal {D}}(\mathbb {R} ^{n})}
 
 then there exists a distribution 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(\mathbb {R} ^{n})}
 
 such that 
 
 
 
 L
 ϕ
 =
 T
 ∘
 ϕ
 
 
 {\displaystyle L\phi =T\circ \phi }
 
 for all 
 
 
 
 ϕ
 ∈
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle \phi \in {\mathcal {D}}(\mathbb {R} ^{n}).}
 
<a class="footnote-ref" id="fnref:64" href="#fn:64">64</a>
Example.<a class="footnote-ref" id="fnref:65" href="#fn:65">65</a> Let 
 
 
 
 H
 
 
 {\displaystyle H}
 
 be the <a href="/facts/Heaviside_step_function/bgsUtxgP">Heaviside function</a> on 
 
 
 
 
 R
 
 .
 
 
 {\displaystyle \mathbb {R} .}
 
 For any 
 
 
 
 ϕ
 ∈
 
 
 D
 
 
 (
 
 R
 
 )
 ,
 
 
 {\displaystyle \phi \in {\mathcal {D}}(\mathbb {R} ),}

(
        H
        ∗
        ϕ
        )
        (
        x
        )
        =
        
          ∫
          
            −
            ∞
          
          
            x
          
        
        ϕ
        (
        t
        )
        
        d
        t
        .
      
    
    {\displaystyle (H\ast \phi )(x)=\int _{-\infty }^{x}\phi (t)\,dt.}

Let 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 be the Dirac measure at 0 and let 
 
 
 
 
 δ
 ′
 
 
 
 {\displaystyle \delta '}
 
 be its derivative as a distribution. Then 
 
 
 
 
 δ
 ′
 
 ∗
 H
 =
 δ
 
 
 {\displaystyle \delta '\ast H=\delta }
 
 and 
 
 
 
 1
 ∗
 
 δ
 ′
 
 =
 0.
 
 
 {\displaystyle 1\ast \delta '=0.}
 
 Importantly, the associative law fails to hold:

1
        =
        1
        ∗
        δ
        =
        1
        ∗
        (
        
          δ
          ′
        
        ∗
        H
        )
        ≠
        (
        1
        ∗
        
          δ
          ′
        
        )
        ∗
        H
        =
        0
        ∗
        H
        =
        0.
      
    
    {\displaystyle 1=1\ast \delta =1\ast (\delta '\ast H)\neq (1\ast \delta ')\ast H=0\ast H=0.}

<h4>Convolution of distributions</h4>
It is also possible to define the convolution of two distributions 
 
 
 
 S
 
 
 {\displaystyle S}
 
 and 
 
 
 
 T
 
 
 {\displaystyle T}
 
 on 
 
 
 
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle \mathbb {R} ^{n},}
 
 provided one of them has compact support. Informally, to define 
 
 
 
 S
 ∗
 T
 
 
 {\displaystyle S\ast T}
 
 where 
 
 
 
 T
 
 
 {\displaystyle T}
 
 has compact support, the idea is to extend the definition of the convolution 
 
 
 
 
 ∗
 
 
 
 {\displaystyle \,\ast \,}
 
 to a linear operation on distributions so that the associativity formula

S
        ∗
        (
        T
        ∗
        ϕ
        )
        =
        (
        S
        ∗
        T
        )
        ∗
        ϕ
      
    
    {\displaystyle S\ast (T\ast \phi )=(S\ast T)\ast \phi }

continues to hold for all test functions 
 
 
 
 ϕ
 .
 
 
 {\displaystyle \phi .}
 
<a class="footnote-ref" id="fnref:66" href="#fn:66">66</a>
It is also possible to provide a more explicit characterization of the convolution of distributions.<a class="footnote-ref" id="fnref:67" href="#fn:67">67</a> Suppose that 
 
 
 
 S
 
 
 {\displaystyle S}
 
 and 
 
 
 
 T
 
 
 {\displaystyle T}
 
 are distributions and that 
 
 
 
 S
 
 
 {\displaystyle S}
 
 has compact support. Then the linear maps

∙
                ∗
                
                  
                    
                      S
                      ~
                    
                  
                
                :
                
              
              
                
                  
                    D
                  
                
                (
                
                  
                    R
                  
                  
                    n
                  
                
                )
              
              
              
                
                →
                
              
              
              
                
                  
                    D
                  
                
                (
                
                  
                    R
                  
                  
                    n
                  
                
                )
              
              
              
                
                
                   and 
                
                
              
              
              
                
                ∙
                ∗
                
                  
                    
                      T
                      ~
                    
                  
                
                :
                
              
              
              
                
                  
                    D
                  
                
                (
                
                  
                    R
                  
                  
                    n
                  
                
                )
              
              
              
                
                →
                
              
              
              
                
                  
                    D
                  
                
                (
                
                  
                    R
                  
                  
                    n
                  
                
                )
              
            
            
              
              
                f
              
              
              
                
                ↦
                
              
              
              
                f
                ∗
                
                  
                    
                      S
                      ~
                    
                  
                
              
              
              
              
              
              
              
                f
              
              
              
                
                ↦
                
              
              
              
                f
                ∗
                
                  
                    
                      T
                      ~
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{9}\bullet \ast {\tilde {S}}:\,&{\mathcal {D}}(\mathbb {R} ^{n})&&\to \,&&{\mathcal {D}}(\mathbb {R} ^{n})&&\quad {\text{ and }}\quad &&\bullet \ast {\tilde {T}}:\,&&{\mathcal {D}}(\mathbb {R} ^{n})&&\to \,&&{\mathcal {D}}(\mathbb {R} ^{n})\\&f&&\mapsto \,&&f\ast {\tilde {S}}&&&&&&f&&\mapsto \,&&f\ast {\tilde {T}}\\\end{alignedat}}}

are continuous. The transposes of these maps:

t
          
        
        
          (
          
            ∙
            ∗
            
              
                
                  S
                  ~
                
              
            
          
          )
        
        :
        
          
            
              D
            
          
          ′
        
        (
        
          
            R
          
          
            n
          
        
        )
        →
        
          
            
              D
            
          
          ′
        
        (
        
          
            R
          
          
            n
          
        
        )

t
          
        
        
          (
          
            ∙
            ∗
            
              
                
                  T
                  ~
                
              
            
          
          )
        
        :
        
          
            
              E
            
          
          ′
        
        (
        
          
            R
          
          
            n
          
        
        )
        →
        
          
            
              D
            
          
          ′
        
        (
        
          
            R
          
          
            n
          
        
        )
      
    
    {\displaystyle {}^{t}\left(\bullet \ast {\tilde {S}}\right):{\mathcal {D}}'(\mathbb {R} ^{n})\to {\mathcal {D}}'(\mathbb {R} ^{n})\qquad {}^{t}\left(\bullet \ast {\tilde {T}}\right):{\mathcal {E}}'(\mathbb {R} ^{n})\to {\mathcal {D}}'(\mathbb {R} ^{n})}

are consequently continuous and it can also be shown that<a class="footnote-ref" id="fnref:68" href="#fn:68">68</a>

t
          
        
        
          (
          
            ∙
            ∗
            
              
                
                  S
                  ~
                
              
            
          
          )
        
        (
        T
        )
        =

t
          
        
        
          (
          
            ∙
            ∗
            
              
                
                  T
                  ~
                
              
            
          
          )
        
        (
        S
        )
        .
      
    
    {\displaystyle {}^{t}\left(\bullet \ast {\tilde {S}}\right)(T)={}^{t}\left(\bullet \ast {\tilde {T}}\right)(S).}

This common value is called the convolution of 
 
 
 
 S
 
 
 {\displaystyle S}
 
 and 
 
 
 
 T
 
 
 {\displaystyle T}
 
 and it is a distribution that is denoted by 
 
 
 
 S
 ∗
 T
 
 
 {\displaystyle S\ast T}
 
 or 
 
 
 
 T
 ∗
 S
 .
 
 
 {\displaystyle T\ast S.}
 
 It satisfies 
 
 
 
 supp
 ⁡
 (
 S
 ∗
 T
 )
 ⊆
 supp
 ⁡
 (
 S
 )
 +
 supp
 ⁡
 (
 T
 )
 .
 
 
 {\displaystyle \operatorname {supp} (S\ast T)\subseteq \operatorname {supp} (S)+\operatorname {supp} (T).}
 
<a class="footnote-ref" id="fnref:69" href="#fn:69">69</a> If 
 
 
 
 S
 
 
 {\displaystyle S}
 
 and 
 
 
 
 T
 
 
 {\displaystyle T}
 
 are two distributions, at least one of which has compact support, then for any 
 
 
 
 a
 ∈
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle a\in \mathbb {R} ^{n},}
 
 
 
 
 
 
 τ
 
 a
 
 
 (
 S
 ∗
 T
 )
 =
 
 (
 
 
 τ
 
 a
 
 
 S
 
 )
 
 ∗
 T
 =
 S
 ∗
 
 (
 
 
 τ
 
 a
 
 
 T
 
 )
 
 .
 
 
 {\displaystyle \tau _{a}(S\ast T)=\left(\tau _{a}S\right)\ast T=S\ast \left(\tau _{a}T\right).}
 
<a class="footnote-ref" id="fnref:70" href="#fn:70">70</a> If 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is a distribution in 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 and if 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 is a <a href="/facts/Dirac_measure/mj8Qfhr2">Dirac measure</a> then 
 
 
 
 T
 ∗
 δ
 =
 T
 =
 δ
 ∗
 T
 
 
 {\displaystyle T\ast \delta =T=\delta \ast T}
 
;<a class="footnote-ref" id="fnref:71" href="#fn:71">71</a> thus 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 is the <a href="/facts/Identity_element/9nss3xHY">identity element</a> of the convolution operation. Moreover, if 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a function then 
 
 
 
 f
 ∗
 
 δ
 
 ′
 
 
 =
 
 f
 
 ′
 
 
 =
 
 δ
 
 ′
 
 
 ∗
 f
 
 
 {\displaystyle f\ast \delta ^{\prime }=f^{\prime }=\delta ^{\prime }\ast f}
 
 where now the associativity of convolution implies that 
 
 
 
 
 f
 
 ′
 
 
 ∗
 g
 =
 
 g
 
 ′
 
 
 ∗
 f
 
 
 {\displaystyle f^{\prime }\ast g=g^{\prime }\ast f}
 
 for all functions 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 g
 .
 
 
 {\displaystyle g.}

Suppose that it is 
 
 
 
 T
 
 
 {\displaystyle T}
 
 that has compact support. For 
 
 
 
 ϕ
 ∈
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle \phi \in {\mathcal {D}}(\mathbb {R} ^{n})}
 
 consider the function

ψ
        (
        x
        )
        =
        ⟨
        T
        ,
        
          τ
          
            −
            x
          
        
        ϕ
        ⟩
        .
      
    
    {\displaystyle \psi (x)=\langle T,\tau _{-x}\phi \rangle .}

It can be readily shown that this defines a smooth function of 
 
 
 
 x
 ,
 
 
 {\displaystyle x,}
 
 which moreover has compact support. The convolution of 
 
 
 
 S
 
 
 {\displaystyle S}
 
 and 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is defined by

⟨
        S
        ∗
        T
        ,
        ϕ
        ⟩
        =
        ⟨
        S
        ,
        ψ
        ⟩
        .
      
    
    {\displaystyle \langle S\ast T,\phi \rangle =\langle S,\psi \rangle .}

This generalizes the classical notion of <a href="/facts/Convolution/PVPrdz9J">convolution</a> of functions and is compatible with differentiation in the following sense: for every multi-index 
 
 
 
 α
 .
 
 
 {\displaystyle \alpha .}

∂
          
            α
          
        
        (
        S
        ∗
        T
        )
        =
        (
        
          ∂
          
            α
          
        
        S
        )
        ∗
        T
        =
        S
        ∗
        (
        
          ∂
          
            α
          
        
        T
        )
        .
      
    
    {\displaystyle \partial ^{\alpha }(S\ast T)=(\partial ^{\alpha }S)\ast T=S\ast (\partial ^{\alpha }T).}

The convolution of a finite number of distributions, all of which (except possibly one) have compact support, is <a href="/facts/Associative/EQX8lV6r">associative</a>.<a class="footnote-ref" id="fnref:72" href="#fn:72">72</a>
This definition of convolution remains valid under less restrictive assumptions about 
 
 
 
 S
 
 
 {\displaystyle S}
 
 and 
 
 
 
 T
 .
 
 
 {\displaystyle T.}
 
<a class="footnote-ref" id="fnref:73" href="#fn:73">73</a>
The convolution of distributions with compact support induces a continuous bilinear map 
 
 
 
 
 
 
 E
 
 
 ′
 
 ×
 
 
 
 E
 
 
 ′
 
 →
 
 
 
 E
 
 
 ′
 
 
 
 {\displaystyle {\mathcal {E}}'\times {\mathcal {E}}'\to {\mathcal {E}}'}
 
 defined by 
 
 
 
 (
 S
 ,
 T
 )
 ↦
 S
 ∗
 T
 ,
 
 
 {\displaystyle (S,T)\mapsto S*T,}
 
 where 
 
 
 
 
 
 
 E
 
 
 ′
 
 
 
 {\displaystyle {\mathcal {E}}'}
 
 denotes the space of distributions with compact support.<a class="footnote-ref" id="fnref:74" href="#fn:74">74</a> However, the convolution map as a function 
 
 
 
 
 
 
 E
 
 
 ′
 
 ×
 
 
 
 D
 
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 
 
 {\displaystyle {\mathcal {E}}'\times {\mathcal {D}}'\to {\mathcal {D}}'}
 
 is not continuous<a class="footnote-ref" id="fnref:75" href="#fn:75">75</a> although it is separately continuous.<a class="footnote-ref" id="fnref:76" href="#fn:76">76</a> The convolution maps 
 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 ×
 
 
 
 D
 
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n})\times {\mathcal {D}}'\to {\mathcal {D}}'}
 
 and 
 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 ×
 
 
 
 D
 
 
 ′
 
 →
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n})\times {\mathcal {D}}'\to {\mathcal {D}}(\mathbb {R} ^{n})}
 
 given by 
 
 
 
 (
 f
 ,
 T
 )
 ↦
 f
 ∗
 T
 
 
 {\displaystyle (f,T)\mapsto f*T}
 
 both fail to be continuous.<a class="footnote-ref" id="fnref:77" href="#fn:77">77</a> Each of these non-continuous maps is, however, <a href="/facts/Separately_continuous/LH1lHVeP">separately continuous</a> and <a href="/facts/Hypocontinuous/Klr9K6Sy">hypocontinuous</a>.<a class="footnote-ref" id="fnref:78" href="#fn:78">78</a>

<h4>Convolution versus multiplication</h4>
In general, <a href="/facts/Regularization_(physics)/mzFLfUgl">regularity</a> is required for multiplication products, and <a href="/facts/Principle_of_locality/umaVy92L">locality</a> is required for convolution products. It is expressed in the following extension of the <a href="/facts/Convolution_theorem/E7zhjIx2">Convolution Theorem</a> which guarantees the existence of both convolution and multiplication products. Let 
 
 
 
 F
 (
 α
 )
 =
 f
 ∈
 
 
 
 O
 
 
 
 C
 
 ′
 
 
 
 {\displaystyle F(\alpha )=f\in {\mathcal {O}}'_{C}}
 
 be a rapidly decreasing tempered distribution or, equivalently, 
 
 
 
 F
 (
 f
 )
 =
 α
 ∈
 
 
 
 O
 
 
 
 M
 
 
 
 
 {\displaystyle F(f)=\alpha \in {\mathcal {O}}_{M}}
 
 be an ordinary (slowly growing, smooth) function within the space of tempered distributions and let 
 
 
 
 F
 
 
 {\displaystyle F}
 
 be the normalized (unitary, ordinary frequency) <a href="/facts/Fourier_transform/XXhKJtc8">Fourier transform</a>.<a class="footnote-ref" id="fnref:79" href="#fn:79">79</a> Then, according to Schwartz (1951),

F
        (
        f
        ∗
        g
        )
        =
        F
        (
        f
        )
        ⋅
        F
        (
        g
        )
        
        
           and 
        
        
        F
        (
        α
        ⋅
        g
        )
        =
        F
        (
        α
        )
        ∗
        F
        (
        g
        )
      
    
    {\displaystyle F(f*g)=F(f)\cdot F(g)\qquad {\text{ and }}\qquad F(\alpha \cdot g)=F(\alpha )*F(g)}

hold within the space of tempered distributions.<a class="footnote-ref" id="fnref:80" href="#fn:80">80</a><a class="footnote-ref" id="fnref:81" href="#fn:81">81</a><a class="footnote-ref" id="fnref:82" href="#fn:82">82</a> In particular, these equations become the <a href="/facts/Poisson_summation_formula/CDM4uRPs">Poisson Summation Formula</a> if 
 
 
 
 g
 ≡
 
 Ш
 
 
 
 {\displaystyle g\equiv \operatorname {\text{Ш}} }
 
 is the <a href="/facts/Dirac_comb/0tx3xslS">Dirac Comb</a>.<a class="footnote-ref" id="fnref:83" href="#fn:83">83</a> The space of all rapidly decreasing tempered distributions is also called the space of convolution operators 
 
 
 
 
 
 
 O
 
 
 
 C
 
 ′
 
 
 
 {\displaystyle {\mathcal {O}}'_{C}}
 
 and the space of all ordinary functions within the space of tempered distributions is also called the space of multiplication operators 
 
 
 
 
 
 
 O
 
 
 
 M
 
 
 .
 
 
 {\displaystyle {\mathcal {O}}_{M}.}
 
 More generally, 
 
 
 
 F
 (
 
 
 
 O
 
 
 
 C
 
 ′
 
 )
 =
 
 
 
 O
 
 
 
 M
 
 
 
 
 {\displaystyle F({\mathcal {O}}'_{C})={\mathcal {O}}_{M}}
 
 and 
 
 
 
 F
 (
 
 
 
 O
 
 
 
 M
 
 
 )
 =
 
 
 
 O
 
 
 
 C
 
 ′
 
 .
 
 
 {\displaystyle F({\mathcal {O}}_{M})={\mathcal {O}}'_{C}.}
 
<a class="footnote-ref" id="fnref:84" href="#fn:84">84</a><a class="footnote-ref" id="fnref:85" href="#fn:85">85</a> A particular case is the <a href="/facts/Paley%E2%80%93Wiener_theorem/02pKjt9F">Paley-Wiener-Schwartz Theorem</a> which states that 
 
 
 
 F
 (
 
 
 
 E
 
 
 ′
 
 )
 =
 PW
 
 
 {\displaystyle F({\mathcal {E}}')=\operatorname {PW} }
 
 and 
 
 
 
 F
 (
 PW
 )
 =
 
 
 
 E
 
 
 ′
 
 .
 
 
 {\displaystyle F(\operatorname {PW} )={\mathcal {E}}'.}
 
 This is because 
 
 
 
 
 
 
 E
 
 
 ′
 
 ⊆
 
 
 
 O
 
 
 
 C
 
 ′
 
 
 
 {\displaystyle {\mathcal {E}}'\subseteq {\mathcal {O}}'_{C}}
 
 and 
 
 
 
 PW
 ⊆
 
 
 
 O
 
 
 
 M
 
 
 .
 
 
 {\displaystyle \operatorname {PW} \subseteq {\mathcal {O}}_{M}.}
 
 In other words, compactly supported tempered distributions 
 
 
 
 
 
 
 E
 
 
 ′
 
 
 
 {\displaystyle {\mathcal {E}}'}
 
 belong to the space of convolution operators 
 
 
 
 
 
 
 O
 
 
 
 C
 
 ′
 
 
 
 {\displaystyle {\mathcal {O}}'_{C}}
 
 and
Paley-Wiener functions 
 
 
 
 PW
 ,
 
 
 {\displaystyle \operatorname {PW} ,}
 
 better known as <a href="/facts/Bandlimiting/LrYmxzlA">bandlimited functions</a>, belong to the space of multiplication operators 
 
 
 
 
 
 
 O
 
 
 
 M
 
 
 .
 
 
 {\displaystyle {\mathcal {O}}_{M}.}
 
<a class="footnote-ref" id="fnref:86" href="#fn:86">86</a>
For example, let 
 
 
 
 g
 ≡
 
 Ш
 
 ∈
 
 
 
 S
 
 
 ′
 
 
 
 {\displaystyle g\equiv \operatorname {\text{Ш}} \in {\mathcal {S}}'}
 
 be the Dirac comb and 
 
 
 
 f
 ≡
 δ
 ∈
 
 
 
 E
 
 
 ′
 
 
 
 {\displaystyle f\equiv \delta \in {\mathcal {E}}'}
 
 be the <a href="/facts/Dirac_delta_function/V8PjRP8T">Dirac delta</a>;then 
 
 
 
 α
 ≡
 1
 ∈
 PW
 
 
 {\displaystyle \alpha \equiv 1\in \operatorname {PW} }
 
 is the function that is constantly one and both equations yield the <a href="/facts/Dirac_comb/0tx3xslS">Dirac-comb identity</a>. Another example is to let 
 
 
 
 g
 
 
 {\displaystyle g}
 
 be the Dirac comb and 
 
 
 
 f
 ≡
 rect
 ∈
 
 
 
 E
 
 
 ′
 
 
 
 {\displaystyle f\equiv \operatorname {rect} \in {\mathcal {E}}'}
 
 be the <a href="/facts/Rectangular_function/cVm8QG4F">rectangular function</a>; then 
 
 
 
 α
 ≡
 sinc
 ∈
 PW
 
 
 {\displaystyle \alpha \equiv \operatorname {sinc} \in \operatorname {PW} }
 
 is the <a href="/facts/Sinc_function/lSvDtHy0">sinc function</a> and both equations yield the <a href="/facts/Nyquist%E2%80%93Shannon_sampling_theorem/JYlVrvc5">Classical Sampling Theorem</a> for suitable 
 
 
 
 rect
 
 
 {\displaystyle \operatorname {rect} }
 
 functions. More generally, if 
 
 
 
 g
 
 
 {\displaystyle g}
 
 is the Dirac comb and 
 
 
 
 f
 ∈
 
 
 S
 
 
 ⊆
 
 
 
 O
 
 
 
 C
 
 ′
 
 ∩
 
 
 
 O
 
 
 
 M
 
 
 
 
 {\displaystyle f\in {\mathcal {S}}\subseteq {\mathcal {O}}'_{C}\cap {\mathcal {O}}_{M}}
 
 is a <a href="/facts/Smoothness/mffL4ch2">smooth</a> <a href="/facts/Window_function/5Xj7h2ah">window function</a> (<a href="/facts/Schwartz_space/B035faw7">Schwartz function</a>), for example, the <a href="/facts/Gaussian_function/5bG8Kpp9">Gaussian</a>, then 
 
 
 
 α
 ∈
 
 
 S
 
 
 
 
 {\displaystyle \alpha \in {\mathcal {S}}}
 
 is another smooth window function (Schwartz function). They are known as <a href="/facts/Mollifier/aQx68Ksc">mollifiers</a>, especially in <a href="/facts/Partial_differential_equation/DyPsBlv7">partial differential equations</a> theory, or as <a href="/facts/Regularization_(mathematics)/K601A3y2">regularizers</a> in <a href="/facts/Regularization_(physics)/mzFLfUgl">physics</a> because they allow turning <a href="/facts/Generalized_function/fCM4VsyT">generalized functions</a> into <a href="/facts/Function_(mathematics)/CdReEKCh">regular functions</a>.

<h3>Tensor products of distributions</h3>
Let 
 
 
 
 U
 ⊆
 
 
 R
 
 
 m
 
 
 
 
 {\displaystyle U\subseteq \mathbb {R} ^{m}}
 
 and 
 
 
 
 V
 ⊆
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle V\subseteq \mathbb {R} ^{n}}
 
 be open sets. Assume all vector spaces to be over the field 
 
 
 
 
 F
 
 ,
 
 
 {\displaystyle \mathbb {F} ,}
 
 where 
 
 
 
 
 F
 
 =
 
 R
 
 
 
 {\displaystyle \mathbb {F} =\mathbb {R} }
 
 or 
 
 
 
 
 C
 
 .
 
 
 {\displaystyle \mathbb {C} .}
 
 For 
 
 
 
 f
 ∈
 
 
 D
 
 
 (
 U
 ×
 V
 )
 
 
 {\displaystyle f\in {\mathcal {D}}(U\times V)}
 
 define for every 
 
 
 
 u
 ∈
 U
 
 
 {\displaystyle u\in U}
 
 and every 
 
 
 
 v
 ∈
 V
 
 
 {\displaystyle v\in V}
 
 the following functions:

f
                  
                    u
                  
                
                :
                
              
              
                V
              
              
              
                
                →
                
              
              
              
                
                  F
                
              
              
              
                
                
                   and 
                
                
              
              
              
                
                  f
                  
                    v
                  
                
                :
                
              
              
              
                U
              
              
              
                
                →
                
              
              
              
                
                  F
                
              
            
            
              
              
                y
              
              
              
                
                ↦
                
              
              
              
                f
                (
                u
                ,
                y
                )
              
              
              
              
              
              
              
                x
              
              
              
                
                ↦
                
              
              
              
                f
                (
                x
                ,
                v
                )
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{9}f_{u}:\,&V&&\to \,&&\mathbb {F} &&\quad {\text{ and }}\quad &&f^{v}:\,&&U&&\to \,&&\mathbb {F} \\&y&&\mapsto \,&&f(u,y)&&&&&&x&&\mapsto \,&&f(x,v)\\\end{alignedat}}}

Given 
 
 
 
 S
 ∈
 
 
 
 D
 
 
 
 ′
 
 
 (
 U
 )
 
 
 {\displaystyle S\in {\mathcal {D}}^{\prime }(U)}
 
 and 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 
 ′
 
 
 (
 V
 )
 ,
 
 
 {\displaystyle T\in {\mathcal {D}}^{\prime }(V),}
 
 define the following functions:

⟨
                S
                ,
                
                  f
                  
                    ∙
                  
                
                ⟩
                :
                
              
              
                V
              
              
              
                
                →
                
              
              
              
                
                  F
                
              
              
              
                
                
                   and 
                
                
              
              
              
                
                ⟨
                T
                ,
                
                  f
                  
                    ∙
                  
                
                ⟩
                :
                
              
              
              
                U
              
              
              
                
                →
                
              
              
              
                
                  F
                
              
            
            
              
              
                v
              
              
              
                
                ↦
                
              
              
              
                
                ⟨
                S
                ,
                
                  f
                  
                    v
                  
                
                ⟩
              
              
              
              
              
              
              
                u
              
              
              
                
                ↦
                
              
              
              
                
                ⟨
                T
                ,
                
                  f
                  
                    u
                  
                
                ⟩
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{9}\langle S,f^{\bullet }\rangle :\,&V&&\to \,&&\mathbb {F} &&\quad {\text{ and }}\quad &&\langle T,f_{\bullet }\rangle :\,&&U&&\to \,&&\mathbb {F} \\&v&&\mapsto \,&&\langle S,f^{v}\rangle &&&&&&u&&\mapsto \,&&\langle T,f_{u}\rangle \\\end{alignedat}}}

where 
  
    
      
        ⟨
        T
        ,
        
          f
          
            ∙
          
        
        ⟩
        ∈
        
          
            D
          
        
        (
        U
        )
      
    
    {\displaystyle \langle T,f_{\bullet }\rangle \in {\mathcal {D}}(U)}
  
 and 
  
    
      
        ⟨
        S
        ,
        
          f
          
            ∙
          
        
        ⟩
        ∈
        
          
            D
          
        
        (
        V
        )
        .
      
    
    {\displaystyle \langle S,f^{\bullet }\rangle \in {\mathcal {D}}(V).}
  
 
These definitions associate every 
  
    
      
        S
        ∈
        
          
            
              D
            
          
          ′
        
        (
        U
        )
      
    
    {\displaystyle S\in {\mathcal {D}}'(U)}
  
 and 
  
    
      
        T
        ∈
        
          
            
              D
            
          
          ′
        
        (
        V
        )
      
    
    {\displaystyle T\in {\mathcal {D}}'(V)}
  
 with the (respective) continuous linear map:

D
                  
                
                (
                U
                ×
                V
                )
              
              
                
                →
                
              
              
              
                
                  
                    D
                  
                
                (
                V
                )
              
              
              
                
                
                   and 
                
                
              
              
              
                
              
              
                
                  
                    D
                  
                
                (
                U
                ×
                V
                )
              
              
              
                →
                
              
              
              
                
                  
                    D
                  
                
                (
                U
                )
              
            
            
              
              
              
                f
                 
              
              
                
                ↦
                
              
              
              
                
                ⟨
                S
                ,
                
                  f
                  
                    ∙
                  
                
                ⟩
              
              
              
              
              
              
                f
                 
              
              
              
                ↦
                
              
              
              
                ⟨
                T
                ,
                
                  f
                  
                    ∙
                  
                
                ⟩
              
            
          
        
      
    
    {\displaystyle {\begin{alignedat}{9}\,&&{\mathcal {D}}(U\times V)&\to \,&&{\mathcal {D}}(V)&&\quad {\text{ and }}\quad &&\,&{\mathcal {D}}(U\times V)&&\to \,&&{\mathcal {D}}(U)\\&&f\ &\mapsto \,&&\langle S,f^{\bullet }\rangle &&&&&f\ &&\mapsto \,&&\langle T,f_{\bullet }\rangle \\\end{alignedat}}}

Moreover, if either 
 
 
 
 S
 
 
 {\displaystyle S}
 
 (resp. 
 
 
 
 T
 
 
 {\displaystyle T}
 
) has compact support then it also induces a continuous linear map of 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 ×
 V
 )
 →
 
 C
 
 ∞
 
 
 (
 V
 )
 
 
 {\displaystyle C^{\infty }(U\times V)\to C^{\infty }(V)}
 
 (resp. 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 ×
 V
 )
 →
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U\times V)\to C^{\infty }(U)}
 
).<a class="footnote-ref" id="fnref:87" href="#fn:87">87</a>

<a href="/facts/Fubini%27s_theorem/q4lhtS3s">Fubini's theorem</a> for distributions<a class="footnote-ref" id="fnref:88" href="#fn:88">88</a>—Let 
 
 
 
 S
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle S\in {\mathcal {D}}'(U)}
 
 and 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 V
 )
 .
 
 
 {\displaystyle T\in {\mathcal {D}}'(V).}
 
 If 
 
 
 
 f
 ∈
 
 
 D
 
 
 (
 U
 ×
 V
 )
 
 
 {\displaystyle f\in {\mathcal {D}}(U\times V)}
 
 then

⟨
        S
        ,
        ⟨
        T
        ,
        
          f
          
            ∙
          
        
        ⟩
        ⟩
        =
        ⟨
        T
        ,
        ⟨
        S
        ,
        
          f
          
            ∙
          
        
        ⟩
        ⟩
        .
      
    
    {\displaystyle \langle S,\langle T,f_{\bullet }\rangle \rangle =\langle T,\langle S,f^{\bullet }\rangle \rangle .}

The <a href="/facts/Tensor_product/7K3pR1ap">tensor product</a> of 
 
 
 
 S
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle S\in {\mathcal {D}}'(U)}
 
 and 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 V
 )
 ,
 
 
 {\displaystyle T\in {\mathcal {D}}'(V),}
 
 denoted by 
 
 
 
 S
 ⊗
 T
 
 
 {\displaystyle S\otimes T}
 
 or 
 
 
 
 T
 ⊗
 S
 ,
 
 
 {\displaystyle T\otimes S,}
 
 is the distribution in 
 
 
 
 U
 ×
 V
 
 
 {\displaystyle U\times V}
 
 defined by:<a class="footnote-ref" id="fnref:89" href="#fn:89">89</a>

(
        S
        ⊗
        T
        )
        (
        f
        )
        :=
        ⟨
        S
        ,
        ⟨
        T
        ,
        
          f
          
            ∙
          
        
        ⟩
        ⟩
        =
        ⟨
        T
        ,
        ⟨
        S
        ,
        
          f
          
            ∙
          
        
        ⟩
        ⟩
        .
      
    
    {\displaystyle (S\otimes T)(f):=\langle S,\langle T,f_{\bullet }\rangle \rangle =\langle T,\langle S,f^{\bullet }\rangle \rangle .}

<h2 id="spaces-of-distributions">Spaces of distributions</h2>
See also: <a href="/facts/Spaces_of_test_functions_and_distributions/DKvhBcdc">Spaces of test functions and distributions</a>
For all 
 
 
 
 0
 <
 k
 <
 ∞
 
 
 {\displaystyle 0<k<\infty }
 
 and all 
 
 
 
 1
 image (also called the range)</a> that is a <a href="/facts/Dense_set/nPT9Yxao">dense subset</a> of its codomain:

C
                  
                    c
                  
                  
                    ∞
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  C
                  
                    c
                  
                  
                    k
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  C
                  
                    c
                  
                  
                    0
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  L
                  
                    c
                  
                  
                    ∞
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  L
                  
                    c
                  
                  
                    p
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  L
                  
                    c
                  
                  
                    1
                  
                
                (
                U
                )
              
            
            
              
                ↓
              
              
              
                ↓
              
              
              
                ↓
              
            
            
              
                
                  C
                  
                    ∞
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  C
                  
                    k
                  
                
                (
                U
                )
              
              
                →
              
              
                
                  C
                  
                    0
                  
                
                (
                U
                )

{\displaystyle {\begin{matrix}C_{c}^{\infty }(U)&\to &C_{c}^{k}(U)&\to &C_{c}^{0}(U)&\to &L_{c}^{\infty }(U)&\to &L_{c}^{p}(U)&\to &L_{c}^{1}(U)\\\downarrow &&\downarrow &&\downarrow \\C^{\infty }(U)&\to &C^{k}(U)&\to &C^{0}(U)\\{}\end{matrix}}}

where the topologies on 
 
 
 
 
 L
 
 c
 
 
 q
 
 
 (
 U
 )
 
 
 {\displaystyle L_{c}^{q}(U)}
 
 (
 
 
 
 1
 ≤
 q
 ≤
 ∞
 
 
 {\displaystyle 1\leq q\leq \infty }
 
) are defined as direct limits of the spaces 
 
 
 
 
 L
 
 c
 
 
 q
 
 
 (
 K
 )
 
 
 {\displaystyle L_{c}^{q}(K)}
 
 in a manner analogous to how the topologies on 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 were defined (so in particular, they are not the usual norm topologies). The range of each of the maps above (and of any composition of the maps above) is dense in its codomain.<a class="footnote-ref" id="fnref:90" href="#fn:90">90</a>
Suppose that 
 
 
 
 X
 
 
 {\displaystyle X}
 
 is one of the spaces 
 
 
 
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{k}(U)}
 
 (for 
 
 
 
 k
 ∈
 {
 0
 ,
 1
 ,
 …
 ,
 ∞
 }
 
 
 {\displaystyle k\in \{0,1,\ldots ,\infty \}}
 
) or 
 
 
 
 
 L
 
 c
 
 
 p
 
 
 (
 U
 )
 
 
 {\displaystyle L_{c}^{p}(U)}
 
 (for 
 
 
 
 1
 ≤
 p
 ≤
 ∞
 
 
 {\displaystyle 1\leq p\leq \infty }
 
) or 
 
 
 
 
 L
 
 p
 
 
 (
 U
 )
 
 
 {\displaystyle L^{p}(U)}
 
 (for 
 
 
 
 1
 ≤
 p
 <
 ∞
 
 
 {\displaystyle 1\leq p<\infty }
 
). Because the canonical injection 
 
 
 
 
 In
 
 X
 
 
 :
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 →
 X
 
 
 {\displaystyle \operatorname {In} _{X}:C_{c}^{\infty }(U)\to X}
 
 is a continuous injection whose image is dense in the codomain, this map's <a href="/facts/Transpose_of_a_linear_map/uv0JWTHq">transpose</a>

t
 
 
 
 In
 
 X
 
 
 :
 
 X
 
 b
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 =
 
 
 (
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 )
 
 
 b
 
 ′
 
 
 
 {\displaystyle {}^{t}\operatorname {In} _{X}:X'_{b}\to {\mathcal {D}}'(U)=\left(C_{c}^{\infty }(U)\right)'_{b}}
 
 is a continuous injection. This injective transpose map thus allows the <a href="/facts/Continuous_dual_space/4Uw4Knz1">continuous dual space</a> 
 
 
 
 
 X
 ′
 
 
 
 {\displaystyle X'}
 
 of 
 
 
 
 X
 
 
 {\displaystyle X}
 
 to be identified with a certain vector subspace of the space 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 of all distributions (specifically, it is identified with the image of this transpose map). This transpose map is continuous but it is not necessarily a <a href="/facts/Topological_embedding/HKeVKc42">topological embedding</a>.
A linear subspace of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 carrying a <a href="/facts/Locally_convex_topological_vector_space/AGrPrayC">locally convex</a> topology that is finer than the <a href="/facts/Subspace_topology/NjU6z4Ca">subspace topology</a> induced on it by 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 =
 
 
 (
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 )
 
 
 b
 
 ′
 
 
 
 {\displaystyle {\mathcal {D}}'(U)=\left(C_{c}^{\infty }(U)\right)'_{b}}
 
 is called a space of distributions.<a class="footnote-ref" id="fnref:91" href="#fn:91">91</a>
Almost all of the spaces of distributions mentioned in this article arise in this way (for example, tempered distribution, restrictions, distributions of order 
 
 
 
 ≤
 
 
 {\displaystyle \leq }
 
 some integer, distributions induced by a positive Radon measure, distributions induced by an 
 
 
 
 
 L
 
 p
 
 
 
 
 {\displaystyle L^{p}}
 
-function, etc.) and any representation theorem about the continuous dual space of 
 
 
 
 X
 
 
 {\displaystyle X}
 
 may, through the transpose

t
          
        
        
          In
          
            X
          
        
        :
        
          X
          
            b
          
          ′
        
        →
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        ,
      
    
    {\displaystyle {}^{t}\operatorname {In} _{X}:X'_{b}\to {\mathcal {D}}'(U),}
  
 be transferred directly to elements of the space 
  
    
      
        Im
        ⁡
        
          (

t
              
            
            
              In
              
                X
              
            
          
          )
        
        .
      
    
    {\displaystyle \operatorname {Im} \left({}^{t}\operatorname {In} _{X}\right).}

<h3>Radon measures</h3>
The inclusion map 
 
 
 
 In
 :
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 →
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 
 {\displaystyle \operatorname {In} :C_{c}^{\infty }(U)\to C_{c}^{0}(U)}
 
 is a continuous injection whose image is dense in its codomain, so the <a href="/facts/Transpose/8wmsagGS">transpose</a>

t
 
 
 In
 :
 (
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 =
 (
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 
 
 {\displaystyle {}^{t}\operatorname {In} :(C_{c}^{0}(U))'_{b}\to {\mathcal {D}}'(U)=(C_{c}^{\infty }(U))'_{b}}
 
 is also a continuous injection.
Note that the continuous dual space 
 
 
 
 (
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 
 
 {\displaystyle (C_{c}^{0}(U))'_{b}}
 
 can be identified as the space of <a href="/facts/Radon_measure/21adq3XN">Radon measures</a>, where there is a one-to-one correspondence between the continuous linear functionals 
 
 
 
 T
 ∈
 (
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 
 
 {\displaystyle T\in (C_{c}^{0}(U))'_{b}}
 
 and integral with respect to a Radon measure; that is,

<ul><li>if 
 
 
 
 T
 ∈
 (
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 
 
 {\displaystyle T\in (C_{c}^{0}(U))'_{b}}
 
 then there exists a Radon measure 
 
 
 
 μ
 
 
 {\displaystyle \mu }
 
 on U such that for all 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 ,
 T
 (
 f
 )
 =
 
 ∫
 
 U
 
 
 f
 
 d
 μ
 ,
 
 
 {\textstyle f\in C_{c}^{0}(U),T(f)=\int _{U}f\,d\mu ,}
 
 and</li>
<li>if 
 
 
 
 μ
 
 
 {\displaystyle \mu }
 
 is a Radon measure on U then the linear functional on 
 
 
 
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{0}(U)}
 
 defined by sending 
 
 
 
 f
 ∈
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 
 {\textstyle f\in C_{c}^{0}(U)}
 
 to 
 
 
 
 
 ∫
 
 U
 
 
 f
 
 d
 μ
 
 
 {\textstyle \int _{U}f\,d\mu }
 
 is continuous.</li></ul>
Through the injection

t
 
 
 In
 :
 (
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 ,
 
 
 {\displaystyle {}^{t}\operatorname {In} :(C_{c}^{0}(U))'_{b}\to {\mathcal {D}}'(U),}
 
 every Radon measure becomes a distribution on U. If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is a <a href="/facts/Locally_integrable/HgcUMNG6">locally integrable</a> function on U then the distribution 
 
 
 
 ϕ
 ↦
 
 ∫
 
 U
 
 
 f
 (
 x
 )
 ϕ
 (
 x
 )
 
 d
 x
 
 
 {\textstyle \phi \mapsto \int _{U}f(x)\phi (x)\,dx}
 
 is a Radon measure; so Radon measures form a large and important space of distributions.
The following is the theorem of the structure of distributions of <a href="/facts/Radon_measure/21adq3XN">Radon measures</a>, which shows that every Radon measure can be written as a sum of derivatives of locally 
 
 
 
 
 L
 
 ∞
 
 
 
 
 {\displaystyle L^{\infty }}
 
 functions on U:

Theorem.<a class="footnote-ref" id="fnref:92" href="#fn:92">92</a>—Suppose 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 is a Radon measure, where 
 
 
 
 U
 ⊆
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle U\subseteq \mathbb {R} ^{n},}
 
 let 
 
 
 
 V
 ⊆
 U
 
 
 {\displaystyle V\subseteq U}
 
 be a neighborhood of the support of 
 
 
 
 T
 ,
 
 
 {\displaystyle T,}
 
 and let 
 
 
 
 I
 =
 {
 p
 ∈
 
 
 N
 
 
 n
 
 
 :
 
 |
 
 p
 
 |
 
 ≤
 n
 }
 .
 
 
 {\displaystyle I=\{p\in \mathbb {N} ^{n}:|p|\leq n\}.}
 
 There exists a family 
 
 
 
 f
 =
 (
 
 f
 
 p
 
 
 
 )
 
 p
 ∈
 I
 
 
 
 
 {\displaystyle f=(f_{p})_{p\in I}}
 
 of locally 
 
 
 
 
 L
 
 ∞
 
 
 
 
 {\displaystyle L^{\infty }}
 
 functions on U such that 
 
 
 
 supp
 ⁡
 
 f
 
 p
 
 
 ⊆
 V
 
 
 {\displaystyle \operatorname {supp} f_{p}\subseteq V}
 
 for every 
 
 
 
 p
 ∈
 I
 ,
 
 
 {\displaystyle p\in I,}
 
 and

T
        =
        
          ∑
          
            p
            ∈
            I
          
        
        
          ∂
          
            p
          
        
        
          f
          
            p
          
        
        .
      
    
    {\displaystyle T=\sum _{p\in I}\partial ^{p}f_{p}.}

Furthermore, 
  
    
      
        T
      
    
    {\displaystyle T}
  
 is also equal to a finite sum of derivatives of continuous functions on 
  
    
      
        U
        ,
      
    
    {\displaystyle U,}
  
 where each derivative has order 
  
    
      
        ≤
        2
        n
        .
      
    
    {\displaystyle \leq 2n.}

<h4>Positive Radon measures</h4>
A linear function 
 
 
 
 T
 
 
 {\displaystyle T}
 
 on a space of functions is called positive if whenever a function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 that belongs to the domain of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is non-negative (that is, 
 
 
 
 f
 
 
 {\displaystyle f}
 
 is real-valued and 
 
 
 
 f
 ≥
 0
 
 
 {\displaystyle f\geq 0}
 
) then 
 
 
 
 T
 (
 f
 )
 ≥
 0.
 
 
 {\displaystyle T(f)\geq 0.}
 
 One may show that every positive linear functional on 
 
 
 
 
 C
 
 c
 
 
 0
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{0}(U)}
 
 is necessarily continuous (that is, necessarily a Radon measure).<a class="footnote-ref" id="fnref:93" href="#fn:93">93</a> 
<a href="/facts/Lebesgue_measure/8us9cGoW">Lebesgue measure</a> is an example of a positive Radon measure.

<h4>Locally integrable functions as distributions</h4>
One particularly important class of Radon measures are those that are induced locally integrable functions. The function 
 
 
 
 f
 :
 U
 →
 
 R
 
 
 
 {\displaystyle f:U\to \mathbb {R} }
 
 is called <a href="/facts/Locally_integrable/HgcUMNG6">locally integrable</a> if it is <a href="/facts/Lebesgue_integration/f4AgvC6x">Lebesgue integrable</a> over every compact subset K of U. This is a large class of functions that includes all continuous functions and all <a href="/facts/Lp_space/gbad0Rv1">Lp space</a> 
 
 
 
 
 L
 
 p
 
 
 
 
 {\displaystyle L^{p}}
 
 functions. The topology on 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 is defined in such a fashion that any locally integrable function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 yields a continuous linear functional on 
 
 
 
 
 
 D
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}(U)}
 
 – that is, an element of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 – denoted here by 
 
 
 
 
 T
 
 f
 
 
 ,
 
 
 {\displaystyle T_{f},}
 
 whose value on the test function 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 is given by the Lebesgue integral:

⟨
        
          T
          
            f
          
        
        ,
        ϕ
        ⟩
        =
        
          ∫
          
            U
          
        
        f
        ϕ
        
        d
        x
        .
      
    
    {\displaystyle \langle T_{f},\phi \rangle =\int _{U}f\phi \,dx.}

Conventionally, one <a href="/facts/Abuse_of_notation/D4W6n85F">abuses notation</a> by identifying 
 
 
 
 
 T
 
 f
 
 
 
 
 {\displaystyle T_{f}}
 
 with 
 
 
 
 f
 ,
 
 
 {\displaystyle f,}
 
 provided no confusion can arise, and thus the pairing between 
 
 
 
 
 T
 
 f
 
 
 
 
 {\displaystyle T_{f}}
 
 and 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 is often written

⟨
        f
        ,
        ϕ
        ⟩
        =
        ⟨
        
          T
          
            f
          
        
        ,
        ϕ
        ⟩
        .
      
    
    {\displaystyle \langle f,\phi \rangle =\langle T_{f},\phi \rangle .}

If 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 g
 
 
 {\displaystyle g}
 
 are two locally integrable functions, then the associated distributions 
 
 
 
 
 T
 
 f
 
 
 
 
 {\displaystyle T_{f}}
 
 and 
 
 
 
 
 T
 
 g
 
 
 
 
 {\displaystyle T_{g}}
 
 are equal to the same element of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 if and only if 
 
 
 
 f
 
 
 {\displaystyle f}
 
 and 
 
 
 
 g
 
 
 {\displaystyle g}
 
 are equal <a href="/facts/Almost_everywhere/1quRFtJE">almost everywhere</a> (see, for instance, Hörmander (1983, Theorem 1.2.5)). Similarly, every <a href="/facts/Radon_measure/21adq3XN">Radon measure</a> 
 
 
 
 μ
 
 
 {\displaystyle \mu }
 
 on 
 
 
 
 U
 
 
 {\displaystyle U}
 
 defines an element of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 whose value on the test function 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 is 
 
 
 
 ∫
 ϕ
 
 d
 μ
 .
 
 
 {\textstyle \int \phi \,d\mu .}
 
 As above, it is conventional to abuse notation and write the pairing between a Radon measure 
 
 
 
 μ
 
 
 {\displaystyle \mu }
 
 and a test function 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 as 
 
 
 
 ⟨
 μ
 ,
 ϕ
 ⟩
 .
 
 
 {\displaystyle \langle \mu ,\phi \rangle .}
 
 Conversely, as shown in a theorem by Schwartz (similar to the <a href="/facts/Riesz_representation_theorem/9CjKDUII">Riesz representation theorem</a>), every distribution which is non-negative on non-negative functions is of this form for some (positive) Radon measure.

<h4>Test functions as distributions</h4>
The test functions are themselves locally integrable, and so define distributions. The space of test functions 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is sequentially <a href="/facts/Dense_(topology)/nPT9Yxao">dense</a> in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 with respect to the strong topology on 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'(U).}
 
<a class="footnote-ref" id="fnref:94" href="#fn:94">94</a> This means that for any 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 ,
 
 
 {\displaystyle T\in {\mathcal {D}}'(U),}
 
 there is a sequence of test functions, 
 
 
 
 (
 
 ϕ
 
 i
 
 
 
 )
 
 i
 =
 1
 
 
 ∞
 
 
 ,
 
 
 {\displaystyle (\phi _{i})_{i=1}^{\infty },}
 
 that converges to 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 (in its strong dual topology) when considered as a sequence of distributions. Or equivalently,

⟨
        
          ϕ
          
            i
          
        
        ,
        ψ
        ⟩
        →
        ⟨
        T
        ,
        ψ
        ⟩
        
        
           for all 
        
        ψ
        ∈
        
          
            D
          
        
        (
        U
        )
        .
      
    
    {\displaystyle \langle \phi _{i},\psi \rangle \to \langle T,\psi \rangle \qquad {\text{ for all }}\psi \in {\mathcal {D}}(U).}

<h3>Distributions with compact support</h3>
The inclusion map 
 
 
 
 In
 :
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 →
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle \operatorname {In} :C_{c}^{\infty }(U)\to C^{\infty }(U)}
 
 is a continuous injection whose image is dense in its codomain, so the <a href="/facts/Transpose_of_a_linear_map/uv0JWTHq">transpose map</a>

t
 
 
 In
 :
 (
 
 C
 
 ∞
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 =
 (
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 
 
 {\displaystyle {}^{t}\operatorname {In} :(C^{\infty }(U))'_{b}\to {\mathcal {D}}'(U)=(C_{c}^{\infty }(U))'_{b}}
 
 is also a continuous injection. Thus the image of the transpose, denoted by 
 
 
 
 
 
 
 E
 
 
 ′
 
 (
 U
 )
 ,
 
 
 {\displaystyle {\mathcal {E}}'(U),}
 
 forms a space of distributions.<a class="footnote-ref" id="fnref:95" href="#fn:95">95</a>
The elements of 
 
 
 
 
 
 
 E
 
 
 ′
 
 (
 U
 )
 =
 (
 
 C
 
 ∞
 
 
 (
 U
 )
 
 )
 
 b
 
 ′
 
 
 
 {\displaystyle {\mathcal {E}}'(U)=(C^{\infty }(U))'_{b}}
 
 can be identified as the space of distributions with compact support.<a class="footnote-ref" id="fnref:96" href="#fn:96">96</a> Explicitly, if 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is a distribution on U then the following are equivalent,

<ul><li>
 
 
 
 T
 ∈
 
 
 
 E
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle T\in {\mathcal {E}}'(U).}
 
</li>
<li>The support of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is compact.</li>
<li>The restriction of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 to 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle C_{c}^{\infty }(U),}
 
 when that space is equipped with the subspace topology inherited from 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 (a coarser topology than the canonical LF topology), is continuous.<a class="footnote-ref" id="fnref:97" href="#fn:97">97</a></li>
<li>There is a compact subset K of U such that for every test function 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 whose support is completely outside of K, we have 
 
 
 
 T
 (
 ϕ
 )
 =
 0.
 
 
 {\displaystyle T(\phi )=0.}
 
</li></ul>
Compactly supported distributions define continuous linear functionals on the space 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
; recall that the topology on 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C^{\infty }(U)}
 
 is defined such that a sequence of test functions 
 
 
 
 
 ϕ
 
 k
 
 
 
 
 {\displaystyle \phi _{k}}
 
 converges to 0 if and only if all derivatives of 
 
 
 
 
 ϕ
 
 k
 
 
 
 
 {\displaystyle \phi _{k}}
 
 converge uniformly to 0 on every compact subset of U. Conversely, it can be shown that every continuous linear functional on this space defines a distribution of compact support. Thus compactly supported distributions can be identified with those distributions that can be extended from 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 to 
 
 
 
 
 C
 
 ∞
 
 
 (
 U
 )
 .
 
 
 {\displaystyle C^{\infty }(U).}

<h3>Distributions of finite order</h3>
Let 
 
 
 
 k
 ∈
 
 N
 
 .
 
 
 {\displaystyle k\in \mathbb {N} .}
 
 The inclusion map 
 
 
 
 In
 :
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 →
 
 C
 
 c
 
 
 k
 
 
 (
 U
 )
 
 
 {\displaystyle \operatorname {In} :C_{c}^{\infty }(U)\to C_{c}^{k}(U)}
 
 is a continuous injection whose image is dense in its codomain, so the <a href="/facts/Transpose/8wmsagGS">transpose</a>

t
          
        
        In
        :
        (
        
          C
          
            c
          
          
            k
          
        
        (
        U
        )
        
          )
          
            b
          
          ′
        
        →
        
          
            
              D
            
          
          ′
        
        (
        U
        )
        =
        (
        
          C
          
            c
          
          
            ∞
          
        
        (
        U
        )
        
          )
          
            b
          
          ′
        
      
    
    {\displaystyle {}^{t}\operatorname {In} :(C_{c}^{k}(U))'_{b}\to {\mathcal {D}}'(U)=(C_{c}^{\infty }(U))'_{b}}
  
 is also a continuous injection. Consequently, the image of

t
 
 
 In
 ,
 
 
 {\displaystyle {}^{t}\operatorname {In} ,}
 
 denoted by 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 k
 
 
 
 (
 U
 )
 ,
 
 
 {\displaystyle {\mathcal {D}}'^{k}(U),}
 
 forms a space of distributions. The elements of 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 k
 
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'^{k}(U)}
 
 are the distributions of order 
 
 
 
 
 ≤
 k
 .
 
 
 {\displaystyle \,\leq k.}
 
<a class="footnote-ref" id="fnref:98" href="#fn:98">98</a> The distributions of order 
 
 
 
 
 ≤
 0
 ,
 
 
 {\displaystyle \,\leq 0,}
 
 which are also called distributions of order 0 are exactly the distributions that are Radon measures (described above).
For 
 
 
 
 0
 ≠
 k
 ∈
 
 N
 
 ,
 
 
 {\displaystyle 0\neq k\in \mathbb {N} ,}
 
 a distribution of order k is a distribution of order 
 
 
 
 
 ≤
 k
 
 
 {\displaystyle \,\leq k}
 
 that is not a distribution of order 
 
 
 
 
 ≤
 k
 −
 1
 
 
 {\displaystyle \,\leq k-1}
 
.<a class="footnote-ref" id="fnref:99" href="#fn:99">99</a>
A distribution is said to be of finite order if there is some integer 
 
 
 
 k
 
 
 {\displaystyle k}
 
 such that it is a distribution of order 
 
 
 
 
 ≤
 k
 ,
 
 
 {\displaystyle \,\leq k,}
 
 and the set of distributions of finite order is denoted by 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 F
 
 
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'^{F}(U).}
 
 Note that if 
 
 
 
 k
 ≤
 l
 
 
 {\displaystyle k\leq l}
 
 then 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 k
 
 
 
 (
 U
 )
 ⊆
 
 
 
 D
 
 
 
 ′
 
 l
 
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'^{k}(U)\subseteq {\mathcal {D}}'^{l}(U)}
 
 so that 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 F
 
 
 
 (
 U
 )
 :=
 
 ⋃
 
 n
 =
 0
 
 
 ∞
 
 
 
 
 
 D
 
 
 
 ′
 
 n
 
 
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'^{F}(U):=\bigcup _{n=0}^{\infty }{\mathcal {D}}'^{n}(U)}
 
 is a vector subspace of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
, and furthermore, if and only if 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 F
 
 
 
 (
 U
 )
 =
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'^{F}(U)={\mathcal {D}}'(U).}
 
<a class="footnote-ref" id="fnref:100" href="#fn:100">100</a>

<h4>Structure of distributions of finite order</h4>
Every distribution with compact support in U is a distribution of finite order.<a class="footnote-ref" id="fnref:101" href="#fn:101">101</a> Indeed, every distribution in U is locally a distribution of finite order, in the following sense:<a class="footnote-ref" id="fnref:102" href="#fn:102">102</a> If V is an open and relatively compact subset of U and if 
 
 
 
 
 ρ
 
 V
 U
 
 
 
 
 {\displaystyle \rho _{VU}}
 
 is the restriction mapping from U to V, then the image of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle {\mathcal {D}}'(U)}
 
 under 
 
 
 
 
 ρ
 
 V
 U
 
 
 
 
 {\displaystyle \rho _{VU}}
 
 is contained in 
 
 
 
 
 
 
 D
 
 
 
 ′
 
 F
 
 
 
 (
 V
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'^{F}(V).}

The following is the theorem of the structure of distributions of finite order, which shows that every distribution of finite order can be written as a sum of derivatives of <a href="/facts/Radon_measure/21adq3XN">Radon measures</a>:

Theorem<a class="footnote-ref" id="fnref:103" href="#fn:103">103</a>—Suppose 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 U
 )
 
 
 {\displaystyle T\in {\mathcal {D}}'(U)}
 
 has finite order and 
 
 
 
 I
 =
 {
 p
 ∈
 
 
 N
 
 
 n
 
 
 :
 
 |
 
 p
 
 |
 
 ≤
 k
 }
 .
 
 
 {\displaystyle I=\{p\in \mathbb {N} ^{n}:|p|\leq k\}.}
 
 Given any open subset V of U containing the support of 
 
 
 
 T
 ,
 
 
 {\displaystyle T,}
 
 there is a family of Radon measures in U, 
 
 
 
 (
 
 μ
 
 p
 
 
 
 )
 
 p
 ∈
 I
 
 
 ,
 
 
 {\displaystyle (\mu _{p})_{p\in I},}
 
 such that for very 
 
 
 
 p
 ∈
 I
 ,
 supp
 ⁡
 (
 
 μ
 
 p
 
 
 )
 ⊆
 V
 
 
 {\displaystyle p\in I,\operatorname {supp} (\mu _{p})\subseteq V}
 
 and

T
        =
        
          ∑
          
            
              |
            
            p
            
              |
            
            ≤
            k
          
        
        
          ∂
          
            p
          
        
        
          μ
          
            p
          
        
        .
      
    
    {\displaystyle T=\sum _{|p|\leq k}\partial ^{p}\mu _{p}.}

Example. (Distributions of infinite order) Let 
 
 
 
 U
 :=
 (
 0
 ,
 ∞
 )
 
 
 {\displaystyle U:=(0,\infty )}
 
 and for every test function 
 
 
 
 f
 ,
 
 
 {\displaystyle f,}
 
 let 
 
 
 
 S
 f
 :=
 
 ∑
 
 m
 =
 1
 
 
 ∞
 
 
 (
 
 ∂
 
 m
 
 
 f
 )
 
 (
 
 
 1
 m
 
 
 )
 
 .
 
 
 {\displaystyle Sf:=\sum _{m=1}^{\infty }(\partial ^{m}f)\left({\frac {1}{m}}\right).}

Then 
 
 
 
 S
 
 
 {\displaystyle S}
 
 is a distribution of infinite order on U. Moreover, 
 
 
 
 S
 
 
 {\displaystyle S}
 
 can not be extended to a distribution on 
 
 
 
 
 R
 
 
 
 {\displaystyle \mathbb {R} }
 
; that is, there exists no distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 on 
 
 
 
 
 R
 
 
 
 {\displaystyle \mathbb {R} }
 
 such that the restriction of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 to U is equal to 
 
 
 
 S
 .
 
 
 {\displaystyle S.}
 
<a class="footnote-ref" id="fnref:104" href="#fn:104">104</a>

<h3>Tempered distributions and Fourier transform </h3>
"Tempered distribution" redirects here. For tempered distributions on semisimple groups, see <a href="/facts/Tempered_representation/CdqryEtf">Tempered representation</a>.
Defined below are the tempered distributions, which form a subspace of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 ,
 
 
 {\displaystyle {\mathcal {D}}'(\mathbb {R} ^{n}),}
 
 the space of distributions on 
 
 
 
 
 
 R
 
 
 n
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{n}.}
 
 This is a proper subspace: while every tempered distribution is a distribution and an element of 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 ,
 
 
 {\displaystyle {\mathcal {D}}'(\mathbb {R} ^{n}),}
 
 the converse is not true. Tempered distributions are useful if one studies the <a href="/facts/Fourier_transform/XXhKJtc8">Fourier transform</a> since all tempered distributions have a Fourier transform, which is not true for an arbitrary distribution in 
 
 
 
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle {\mathcal {D}}'(\mathbb {R} ^{n}).}

<h4>Schwartz space</h4>
The <a href="/facts/Schwartz_space/B035faw7">Schwartz space</a> 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n})}
 
 is the space of all smooth functions that are <a href="/facts/Rapidly_decreasing/nCAl6pYS">rapidly decreasing</a> at infinity along with all partial derivatives. Thus 
 
 
 
 ϕ
 :
 
 
 R
 
 
 n
 
 
 →
 
 R
 
 
 
 {\displaystyle \phi :\mathbb {R} ^{n}\to \mathbb {R} }
 
 is in the Schwartz space provided that any derivative of 
 
 
 
 ϕ
 ,
 
 
 {\displaystyle \phi ,}
 
 multiplied with any power of 
 
 
 
 
 |
 
 x
 
 |
 
 ,
 
 
 {\displaystyle |x|,}
 
 converges to 0 as 
 
 
 
 
 |
 
 x
 
 |
 
 →
 ∞
 .
 
 
 {\displaystyle |x|\to \infty .}
 
 These functions form a complete TVS with a suitably defined family of <a href="/facts/Seminorm/vMuescKp">seminorms</a>. More precisely, for any <a href="/facts/Multi-indices/2wjdPgzS">multi-indices</a> 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 and 
 
 
 
 β
 
 
 {\displaystyle \beta }
 
 define

p
          
            α
            ,
            β
          
        
        (
        ϕ
        )
        =
        
          sup
          
            x
            ∈
            
              
                R
              
              
                n
              
            
          
        
        
          |
          
            
              x
              
                α
              
            
            
              ∂
              
                β
              
            
            ϕ
            (
            x
            )
          
          |
        
        .
      
    
    {\displaystyle p_{\alpha ,\beta }(\phi )=\sup _{x\in \mathbb {R} ^{n}}\left|x^{\alpha }\partial ^{\beta }\phi (x)\right|.}

Then 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 is in the Schwartz space if all the values satisfy

p
 
 α
 ,
 β
 
 
 (
 ϕ
 )
 <
 ∞
 .
 
 
 {\displaystyle p_{\alpha ,\beta }(\phi )<\infty .}

The family of seminorms 
 
 
 
 
 p
 
 α
 ,
 β
 
 
 
 
 {\displaystyle p_{\alpha ,\beta }}
 
 defines a <a href="/facts/Locally_convex/AGrPrayC">locally convex</a> topology on the Schwartz space. For 
 
 
 
 n
 =
 1
 ,
 
 
 {\displaystyle n=1,}
 
 the seminorms are, in fact, <a href="/facts/Norm_(mathematics)/xIbR4uE1">norms</a> on the Schwartz space. One can also use the following family of seminorms to define the topology:<a class="footnote-ref" id="fnref:105" href="#fn:105">105</a>

|
        
        f
        
          
            |
          
          
            m
            ,
            k
          
        
        =
        
          sup
          
            
              |
            
            p
            
              |
            
            ≤
            m
          
        
        
          (
          
            
              sup
              
                x
                ∈
                
                  
                    R
                  
                  
                    n
                  
                
              
            
            
              {
              
                (
                1
                +
                
                  |
                
                x
                
                  |
                
                
                  )
                  
                    k
                  
                
                
                  |
                  
                    (
                    
                      ∂
                      
                        α
                      
                    
                    f
                    )
                    (
                    x
                    )
                  
                  |
                
              
              }
            
          
          )
        
        ,
        
        k
        ,
        m
        ∈
        
          N
        
        .
      
    
    {\displaystyle |f|_{m,k}=\sup _{|p|\leq m}\left(\sup _{x\in \mathbb {R} ^{n}}\left\{(1+|x|)^{k}\left|(\partial ^{\alpha }f)(x)\right|\right\}\right),\qquad k,m\in \mathbb {N} .}

Otherwise, one can define a norm on 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n})}
 
 via

‖
        ϕ
        
          ‖
          
            k
          
        
        =
        
          max
          
            
              |
            
            α
            
              |
            
            +
            
              |
            
            β
            
              |
            
            ≤
            k
          
        
        
          sup
          
            x
            ∈
            
              
                R
              
              
                n
              
            
          
        
        
          |
          
            
              x
              
                α
              
            
            
              ∂
              
                β
              
            
            ϕ
            (
            x
            )
          
          |
        
        ,
        
        k
        ≥
        1.
      
    
    {\displaystyle \|\phi \|_{k}=\max _{|\alpha |+|\beta |\leq k}\sup _{x\in \mathbb {R} ^{n}}\left|x^{\alpha }\partial ^{\beta }\phi (x)\right|,\qquad k\geq 1.}

The Schwartz space is a <a href="/facts/Fr%C3%A9chet_space/9gXkQu2u">Fréchet space</a> (that is, a <a href="/facts/Complete_topological_vector_space/e6qtS76j">complete</a> <a href="/facts/Metrizable_topological_vector_space/6FUHfx6W">metrizable</a> locally convex space). Because the <a href="/facts/Fourier_transform/XXhKJtc8">Fourier transform</a> changes 
 
 
 
 
 ∂
 
 α
 
 
 
 
 {\displaystyle \partial ^{\alpha }}
 
 into multiplication by 
 
 
 
 
 x
 
 α
 
 
 
 
 {\displaystyle x^{\alpha }}
 
 and vice versa, this symmetry implies that the Fourier transform of a Schwartz function is also a Schwartz function.
A sequence 
 
 
 
 {
 
 f
 
 i
 
 
 }
 
 
 {\displaystyle \{f_{i}\}}
 
 in 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n})}
 
 converges to 0 in 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n})}
 
 if and only if the functions 
 
 
 
 (
 1
 +
 
 |
 
 x
 
 |
 
 
 )
 
 k
 
 
 (
 
 ∂
 
 p
 
 
 
 f
 
 i
 
 
 )
 (
 x
 )
 
 
 {\displaystyle (1+|x|)^{k}(\partial ^{p}f_{i})(x)}
 
 converge to 0 uniformly in the whole of 
 
 
 
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle \mathbb {R} ^{n},}
 
 which implies that such a sequence must converge to zero in 
 
 
 
 
 C
 
 ∞
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle C^{\infty }(\mathbb {R} ^{n}).}
 
<a class="footnote-ref" id="fnref:106" href="#fn:106">106</a>

 
 
 
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {D}}(\mathbb {R} ^{n})}
 
 is dense in 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 .
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n}).}
 
 The subset of all analytic Schwartz functions is dense in 
 
 
 
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}(\mathbb {R} ^{n})}
 
 as well.<a class="footnote-ref" id="fnref:107" href="#fn:107">107</a>
The Schwartz space is <a href="/facts/Nuclear_space/4FLPWdfp">nuclear</a>, and the tensor product of two maps induces a canonical surjective TVS-isomorphisms

S
          
        
        (
        
          
            R
          
          
            m
          
        
        )
         
        
          
            
              ⊗
              ^
            
          
        
         
        
          
            S
          
        
        (
        
          
            R
          
          
            n
          
        
        )
        →
        
          
            S
          
        
        (
        
          
            R
          
          
            m
            +
            n
          
        
        )
        ,
      
    
    {\displaystyle {\mathcal {S}}(\mathbb {R} ^{m})\ {\widehat {\otimes }}\ {\mathcal {S}}(\mathbb {R} ^{n})\to {\mathcal {S}}(\mathbb {R} ^{m+n}),}

where 
 
 
 
 
 
 
 ⊗
 ^
 
 
 
 
 
 {\displaystyle {\widehat {\otimes }}}
 
 represents the completion of the <a href="/facts/Injective_tensor_product/53zV1QtL">injective tensor product</a> (which in this case is identical to the completion of the <a href="/facts/Projective_tensor_product/lv5X7Ps7">projective tensor product</a>).<a class="footnote-ref" id="fnref:108" href="#fn:108">108</a>

<h4>Tempered distributions</h4>
The inclusion map 
 
 
 
 In
 :
 
 
 D
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle \operatorname {In} :{\mathcal {D}}(\mathbb {R} ^{n})\to {\mathcal {S}}(\mathbb {R} ^{n})}
 
 is a continuous injection whose image is dense in its codomain, so the <a href="/facts/Transpose/8wmsagGS">transpose</a>

t
 
 
 In
 :
 (
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 )
 
 b
 
 ′
 
 →
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {}^{t}\operatorname {In} :({\mathcal {S}}(\mathbb {R} ^{n}))'_{b}\to {\mathcal {D}}'(\mathbb {R} ^{n})}
 
 is also a continuous injection. Thus, the image of the transpose map, denoted by 
 
 
 
 
 
 
 S
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 ,
 
 
 {\displaystyle {\mathcal {S}}'(\mathbb {R} ^{n}),}
 
 forms a space of distributions.
The space 
 
 
 
 
 
 
 S
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle {\mathcal {S}}'(\mathbb {R} ^{n})}
 
 is called the space of tempered distributions. It is the <a href="/facts/Continuous_dual_space/4Uw4Knz1">continuous dual space</a> of the Schwartz space. Equivalently, a distribution 
 
 
 
 T
 
 
 {\displaystyle T}
 
 is a tempered distribution if and only if

(
          
            
               for all 
            
            α
            ,
            β
            ∈
            
              
                N
              
              
                n
              
            
            :
            
              lim
              
                m
                →
                ∞
              
            
            
              p
              
                α
                ,
                β
              
            
            (
            
              ϕ
              
                m
              
            
            )
            =
            0
          
          )
        
        ⟹
        
          lim
          
            m
            →
            ∞
          
        
        T
        (
        
          ϕ
          
            m
          
        
        )
        =
        0.
      
    
    {\displaystyle \left({\text{ for all }}\alpha ,\beta \in \mathbb {N} ^{n}:\lim _{m\to \infty }p_{\alpha ,\beta }(\phi _{m})=0\right)\Longrightarrow \lim _{m\to \infty }T(\phi _{m})=0.}

The derivative of a tempered distribution is again a tempered distribution. Tempered distributions generalize the bounded (or slow-growing) locally integrable functions; all distributions with compact support and all <a href="/facts/Square-integrable/IASblcJJ">square-integrable</a> functions are tempered distributions. More generally, all functions that are products of polynomials with elements of <a href="/facts/Lp_space/gbad0Rv1">Lp space</a> 
 
 
 
 
 L
 
 p
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle L^{p}(\mathbb {R} ^{n})}
 
 for 
 
 
 
 p
 ≥
 1
 
 
 {\displaystyle p\geq 1}
 
 are tempered distributions.
The tempered distributions can also be characterized as slowly growing, meaning that each derivative of 
 
 
 
 T
 
 
 {\displaystyle T}
 
 grows at most as fast as some <a href="/facts/Polynomial/Lzak8VVx">polynomial</a>. This characterization is dual to the rapidly falling behaviour of the derivatives of a function in the Schwartz space, where each derivative of 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 decays faster than every inverse power of 
 
 
 
 
 |
 
 x
 
 |
 
 .
 
 
 {\displaystyle |x|.}
 
 An example of a rapidly falling function is 
 
 
 
 
 |
 
 x
 
 
 |
 
 
 n
 
 
 exp
 ⁡
 (
 −
 λ
 
 |
 
 x
 
 
 |
 
 
 β
 
 
 )
 
 
 {\displaystyle |x|^{n}\exp(-\lambda |x|^{\beta })}
 
 for any positive 
 
 
 
 n
 ,
 λ
 ,
 β
 .
 
 
 {\displaystyle n,\lambda ,\beta .}

<h4>Fourier transform</h4>
To study the Fourier transform, it is best to consider complex-valued test functions and complex-linear distributions. The ordinary <a href="/facts/Continuous_Fourier_transform/XXhKJtc8">continuous Fourier transform</a> 
 
 
 
 F
 :
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 →
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle F:{\mathcal {S}}(\mathbb {R} ^{n})\to {\mathcal {S}}(\mathbb {R} ^{n})}
 
 is a TVS-<a href="/facts/Automorphism/WnyxNFkQ">automorphism</a> of the Schwartz space, and the Fourier transform is defined to be its <a href="/facts/Transpose/8wmsagGS">transpose</a>

t
          
        
        F
        :
        
          
            
              S
            
          
          ′
        
        (
        
          
            R
          
          
            n
          
        
        )
        →
        
          
            
              S
            
          
          ′
        
        (
        
          
            R
          
          
            n
          
        
        )
        ,
      
    
    {\displaystyle {}^{t}F:{\mathcal {S}}'(\mathbb {R} ^{n})\to {\mathcal {S}}'(\mathbb {R} ^{n}),}
  
 which (abusing notation) will again be denoted by 
  
    
      
        F
        .
      
    
    {\displaystyle F.}
  
 So the Fourier transform of the tempered distribution 
  
    
      
        T
      
    
    {\displaystyle T}
  
 is defined by 
  
    
      
        (
        F
        T
        )
        (
        ψ
        )
        =
        T
        (
        F
        ψ
        )
      
    
    {\displaystyle (FT)(\psi )=T(F\psi )}
  
 for every Schwartz function 
  
    
      
        ψ
        .
      
    
    {\displaystyle \psi .}
  
 
  
    
      
        F
        T
      
    
    {\displaystyle FT}
  
 is thus again a tempered distribution. The Fourier transform is a TVS isomorphism from the space of tempered distributions onto itself. This operation is compatible with differentiation in the sense that

F
        
          
            
              
                d
                T
              
              
                d
                x
              
            
          
        
        =
        i
        x
        F
        T
      
    
    {\displaystyle F{\dfrac {dT}{dx}}=ixFT}

and also with convolution: if 
  
    
      
        T
      
    
    {\displaystyle T}
  
 is a tempered distribution and 
  
    
      
        ψ
      
    
    {\displaystyle \psi }
  
 is a slowly increasing smooth function on 
  
    
      
        
          
            R
          
          
            n
          
        
        ,
      
    
    {\displaystyle \mathbb {R} ^{n},}
  
 
  
    
      
        ψ
        T
      
    
    {\displaystyle \psi T}
  
 is again a tempered distribution and

F
        (
        ψ
        T
        )
        =
        F
        ψ
        ∗
        F
        T
      
    
    {\displaystyle F(\psi T)=F\psi *FT}

is the convolution of 
 
 
 
 F
 T
 
 
 {\displaystyle FT}
 
 and 
 
 
 
 F
 ψ
 .
 
 
 {\displaystyle F\psi .}
 
 In particular, the Fourier transform of the constant function equal to 1 is the 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 distribution.

<h4>Expressing tempered distributions as sums of derivatives</h4>
If 
 
 
 
 T
 ∈
 
 
 
 S
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle T\in {\mathcal {S}}'(\mathbb {R} ^{n})}
 
 is a tempered distribution, then there exists a constant 
 
 
 
 C
 >
 0
 ,
 
 
 {\displaystyle C>0,}
 
 and positive integers 
 
 
 
 M
 
 
 {\displaystyle M}
 
 and 
 
 
 
 N
 
 
 {\displaystyle N}
 
 such that for all <a href="/facts/Schwartz_function/B035faw7">Schwartz functions</a> 
 
 
 
 ϕ
 ∈
 
 
 S
 
 
 (
 
 
 R
 
 
 n
 
 
 )
 
 
 {\displaystyle \phi \in {\mathcal {S}}(\mathbb {R} ^{n})}

⟨
        T
        ,
        ϕ
        ⟩
        ≤
        C
        
          ∑
          
            
              |
            
            α
            
              |
            
            ≤
            N
            ,
            
              |
            
            β
            
              |
            
            ≤
            M
          
        
        
          sup
          
            x
            ∈
            
              
                R
              
              
                n
              
            
          
        
        
          |
          
            
              x
              
                α
              
            
            
              ∂
              
                β
              
            
            ϕ
            (
            x
            )
          
          |
        
        =
        C
        
          ∑
          
            
              |
            
            α
            
              |
            
            ≤
            N
            ,
            
              |
            
            β
            
              |
            
            ≤
            M
          
        
        
          p
          
            α
            ,
            β
          
        
        (
        ϕ
        )
        .
      
    
    {\displaystyle \langle T,\phi \rangle \leq C\sum \nolimits _{|\alpha |\leq N,|\beta |\leq M}\sup _{x\in \mathbb {R} ^{n}}\left|x^{\alpha }\partial ^{\beta }\phi (x)\right|=C\sum \nolimits _{|\alpha |\leq N,|\beta |\leq M}p_{\alpha ,\beta }(\phi ).}

This estimate, along with some techniques from <a href="/facts/Functional_analysis/MIp233MT">functional analysis</a>, can be used to show that there is a continuous slowly increasing function 
 
 
 
 F
 
 
 {\displaystyle F}
 
 and a multi-index 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 such that

T
        =
        
          ∂
          
            α
          
        
        F
        .
      
    
    {\displaystyle T=\partial ^{\alpha }F.}

<h4>Restriction of distributions to compact sets</h4>
If 
 
 
 
 T
 ∈
 
 
 
 D
 
 
 ′
 
 (
 
 
 R
 
 
 n
 
 
 )
 ,
 
 
 {\displaystyle T\in {\mathcal {D}}'(\mathbb {R} ^{n}),}
 
 then for any compact set 
 
 
 
 K
 ⊆
 
 
 R
 
 
 n
 
 
 ,
 
 
 {\displaystyle K\subseteq \mathbb {R} ^{n},}
 
 there exists a continuous function 
 
 
 
 F
 
 
 {\displaystyle F}
 
compactly supported in 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
 (possibly on a larger set than K itself) and a multi-index 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 such that 
 
 
 
 T
 =
 
 ∂
 
 α
 
 
 F
 
 
 {\displaystyle T=\partial ^{\alpha }F}
 
 on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 K
 )
 .
 
 
 {\displaystyle C_{c}^{\infty }(K).}

<h2 id="using-holomorphic-functions-as-test-functions">Using holomorphic functions as test functions</h2>
The success of the theory led to an investigation of the idea of <a href="/facts/Hyperfunction/MMFNjLhK">hyperfunction</a>, in which spaces of <a href="/facts/Holomorphic_function/kVzthtEf">holomorphic functions</a> are used as test functions. A refined theory has been developed, in particular <a href="/facts/Mikio_Sato/LUkFh98o">Mikio Sato</a>'s <a href="/facts/Algebraic_analysis/yBSslC4H">algebraic analysis</a>, using <a href="/facts/Sheaf_theory/MM3hcRw4">sheaf theory</a> and <a href="/facts/Several_complex_variables/axwNpV4a">several complex variables</a>. This extends the range of symbolic methods that can be made into rigorous mathematics, for example, <a href="/facts/Path_integral_formulation/6lt2MHkW">Feynman integrals</a>.

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Cauchy_principal_value/Gm33Qevf">Cauchy principal value</a> – Method for assigning values to certain improper integrals which would otherwise be undefined</li>
<li><a href="/facts/Gelfand_triple/zQ4UTMMB">Gelfand triple</a> – Construction linking the study of "bound" and continuous eigenvalues in functional analysisPages displaying short descriptions of redirect targets</li>
<li><a href="/facts/Gelfand%E2%80%93Shilov_space/P61NUgU7">Gelfand–Shilov space</a></li>
<li><a href="/facts/Generalized_function/fCM4VsyT">Generalized function</a> – Objects extending the notion of functions</li>
<li><a href="/facts/Hilbert_transform/RoQaC8MS">Hilbert transform</a> – Integral transform and linear operator</li>
<li><a href="/facts/Homogeneous_distribution/UkRAXkKh">Homogeneous distribution</a> – Type of mathematical distribution</li>
<li><a href="/facts/Laplacian_of_the_indicator/B54v04PC">Laplacian of the indicator</a> – Limit of sequence of smooth functions</li>
<li><a href="/facts/Limit_of_distributions/ymAtChwt">Limit of distributions</a></li>
<li><a href="/facts/Mollifier/aQx68Ksc">Mollifier</a> – Integration kernels for smoothing out sharp features</li>
<li><a href="/facts/Vague_topology/jcHas6W8">Vague topology</a></li>
<li><a href="/facts/Ultradistribution/8Kp1Je4N">Ultradistribution</a> – An extension of a mathematical distribution</li></ul>
Differential equations related

<ul><li><a href="/facts/Fundamental_solution/hdu8vXJa">Fundamental solution</a> – Concept in the solution of linear partial differential equations</li>
<li><a href="/facts/Pseudo-differential_operator/wEPLVm5c">Pseudo-differential operator</a> – Type of differential operator</li>
<li><a href="/facts/Weak_solution/udTTFPIX">Weak solution</a> – Mathematical solution</li></ul>
Generalizations of distributions

<ul><li><a href="/facts/Colombeau_algebra/bY55eqfY">Colombeau algebra</a> – commutative associative differential algebra of generalized functions into which smooth functions (but not arbitrary continuous ones) embed as a subalgebra and distributions embed as a subspacePages displaying wikidata descriptions as a fallback</li>
<li><a href="/facts/Current_(mathematics)/gwhmhzqJ">Current (mathematics)</a> – Distributions on spaces of differential forms</li>
<li><a href="/facts/Distribution_(number_theory)/UNrPIzXV">Distribution (number theory)</a> – function on finite sets which is analogous to an integralPages displaying wikidata descriptions as a fallback</li>
<li><a href="/facts/Distribution_on_a_linear_algebraic_group/bGKdWwE6">Distribution on a linear algebraic group</a> – Linear function satisfying a support condition</li>
<li><a href="/facts/Green%27s_function/rKxKKPcp">Green's function</a> – Impulse response of an inhomogeneous linear differential operator</li>
<li><a href="/facts/Hyperfunction/MMFNjLhK">Hyperfunction</a> – Type of generalized function</li>
<li><a href="/facts/Malgrange%E2%80%93Ehrenpreis_theorem/gCphrW1F">Malgrange–Ehrenpreis theorem</a></li></ul>
<h2 id="notes">Notes</h2>

<h2 id="bibliography">Bibliography</h2>
<ul><li>Barros-Neto, José (1973). An Introduction to the Theory of Distributions. New York, NY: Dekker.</li>
<li><a href="/facts/John_Benedetto/gG9fDnHl">Benedetto, J.J.</a> (1997), Harmonic Analysis and Applications, CRC Press.</li>
<li>Lützen, J. (1982). The prehistory of the theory of distributions. New York, Berlin: Springer Verlag.</li>
<li><a href="/facts/Gerald_Folland/xw8PjEnc">Folland, G.B.</a> (1989). Harmonic Analysis in Phase Space. Princeton, NJ: Princeton University Press.</li>
<li>Friedlander, F.G.; Joshi, M.S. (1998). Introduction to the Theory of Distributions. Cambridge, UK: Cambridge University Press..</li>
<li><a href="/facts/Lars_G%C3%A5rding/y9WogbME">Gårding, L.</a> (1997), Some Points of Analysis and their History, American Mathematical Society.</li>
<li><a href="/facts/Israel_Gelfand/TJeJouKs">Gel'fand, I.M.</a>; Shilov, G.E. (1966–1968), Generalized functions, vol. 1–5, Academic Press.</li>
<li><a href="/facts/Gerd_Grubb/8b32A8jH">Grubb, G.</a> (2009), Distributions and Operators, Springer.</li>
<li><a href="/facts/Lars_H%C3%B6rmander/mxyNnmRA">Hörmander, L.</a> (1983), The analysis of linear partial differential operators I, Grundl. Math. Wissenschaft., vol. 256, Springer, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-3-642-96750-4">10.1007/978-3-642-96750-4</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-12104-8, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=0717035">0717035</a>.</li>
<li><a href="/facts/John_Horvath_(mathematician)/VcacePH8">Horváth, John</a> (1966). Topological Vector Spaces and Distributions. Addison-Wesley series in mathematics. Vol. 1. Reading, MA: Addison-Wesley Publishing Company. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0201029857.</li>
<li><a href="/facts/Andrey_Kolmogorov/bEKwtrs6">Kolmogorov, Andrey</a>; <a href="/facts/Sergei_Fomin/jKULt82t">Fomin, Sergei V.</a> (1957). Elements of the Theory of Functions and Functional Analysis. Dover Books on Mathematics. New York: Dover Books. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-61427-304-2. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/912495626">912495626</a>.</li>
<li>Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1584888666. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/144216834">144216834</a>.</li>
<li>Petersen, Bent E. (1983). Introduction to the Fourier Transform and Pseudo-Differential Operators. Boston, MA: Pitman Publishing..</li>
<li><a href="/facts/Walter_Rudin/9mxRAECY">Rudin, Walter</a> (1991). <a href="https://archive.org/details/functionalanalys00rudi">Functional Analysis</a>. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: <a href="/facts/McGraw-Hill_Science/Engineering/Math/srSyQSsY">McGraw-Hill Science/Engineering/Math</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-07-054236-5. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/21163277">21163277</a>.</li>
<li><a href="/facts/Helmut_H._Schaefer/xorHTDBE">Schaefer, Helmut H.</a>; Wolff, Manfred P. (1999). Topological Vector Spaces. <a href="/facts/Graduate_Texts_in_Mathematics/VTIfY29j">GTM</a>. Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4612-7155-0. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/840278135">840278135</a>.</li>
<li><a href="/facts/Laurent_Schwartz/Kxelk3ju">Schwartz, Laurent</a> (1954), "Sur l'impossibilité de la multiplications des distributions", C. R. Acad. Sci. Paris, 239: 847–848.</li>
<li><a href="/facts/Laurent_Schwartz/Kxelk3ju">Schwartz, Laurent</a> (1951), Théorie des distributions, vol. 1–2, Hermann.</li>
<li><a href="/facts/Sergei_Sobolev/YyBWWYzj">Sobolev, S.L.</a> (1936), <a href="https://mi.mathnet.ru/msb5358">"Méthode nouvelle à résoudre le problème de Cauchy pour les équations linéaires hyperboliques normales"</a>, Mat. Sbornik, 1: 39–72.</li>
<li><a href="/facts/Elias_Stein/9IRxdGWp">Stein, Elias</a>; Weiss, Guido (1971), <a href="https://archive.org/details/introductiontofo0000stei">Introduction to Fourier Analysis on Euclidean Spaces</a>, Princeton University Press, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-691-08078-X.</li>
<li>Strichartz, R. (1994), A Guide to Distribution Theory and Fourier Transforms, CRC Press, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-8493-8273-4.</li>
<li><a href="/facts/Fran%C3%A7ois_Tr%C3%A8ves/cpjQbAov">Trèves, François</a> (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-486-45352-1. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/853623322">853623322</a>.</li>
<li><a href="/facts/Philip_Woodward/rcV3q71J">Woodward, P.M.</a> (1953). Probability and Information Theory with Applications to Radar. Oxford, UK: Pergamon Press.</li></ul>
<h2 id="further-reading">Further reading</h2>
<ul><li>M. J. Lighthill (1959). Introduction to Fourier Analysis and Generalised Functions. Cambridge University Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-09128-4 (requires very little knowledge of analysis; defines distributions as limits of sequences of functions under integrals)</li>
<li><a href="/facts/Vasily_Vladimirov/NjVW9QlR">V.S. Vladimirov</a> (2002). Methods of the theory of generalized functions. Taylor & Francis. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-415-27356-0</li>
<li><a href="/facts/Vasilii_Sergeevich_Vladimirov/NjVW9QlR">Vladimirov, V.S.</a> (2001) [1994], <a href="https://www.encyclopediaofmath.org/index.php?title=Generalized_function">"Generalized function"</a>, <a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>.</li>
<li><a href="/facts/Vasilii_Sergeevich_Vladimirov/NjVW9QlR">Vladimirov, V.S.</a> (2001) [1994], <a href="https://www.encyclopediaofmath.org/index.php?title=Generalized_functions,_space_of">"Generalized functions, space of"</a>, <a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>.</li>
<li><a href="/facts/Vasilii_Sergeevich_Vladimirov/NjVW9QlR">Vladimirov, V.S.</a> (2001) [1994], <a href="https://www.encyclopediaofmath.org/index.php?title=Generalized_function,_derivative_of_a">"Generalized function, derivative of a"</a>, <a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>.</li>
<li><a href="/facts/Vasilii_Sergeevich_Vladimirov/NjVW9QlR">Vladimirov, V.S.</a> (2001) [1994], <a href="https://www.encyclopediaofmath.org/index.php?title=Generalized_functions,_product_of">"Generalized functions, product of"</a>, <a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>.</li>
<li>Oberguggenberger, Michael (2001) [1994], <a href="https://www.encyclopediaofmath.org/index.php?title=Generalized_function_algebras">"Generalized function algebras"</a>, <a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Trèves 2006, pp. 222–223. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Grubb 2009, p. 14 - Grubb, G. (2009), Distributions and Operators, Springer <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Note that 
 
 
 
 i
 
 
 {\displaystyle i}
 
 being an integer implies 
 
 
 
 i
 ≠
 ∞
 .
 
 
 {\displaystyle i\neq \infty .}
 
 This is sometimes expressed as 
 
 
 
 0
 ≤
 i
 <
 k
 +
 1.
 
 
 {\displaystyle 0\leq i<k+1.}
 
 Since 
 
 
 
 ∞
 +
 1
 =
 ∞
 ,
 
 
 {\displaystyle \infty +1=\infty ,}
 
 the inequality "
 
 
 
 0
 ≤
 i
 <
 k
 +
 1
 
 
 {\displaystyle 0\leq i<k+1}
 
" means: 
 
 
 
 0
 ≤
 i
 <
 ∞
 
 
 {\displaystyle 0\leq i<\infty }
 
 if 
 
 
 
 k
 =
 ∞
 ,
 
 
 {\displaystyle k=\infty ,}
 
 while if 
 
 
 
 k
 ≠
 ∞
 
 
 {\displaystyle k\neq \infty }
 
 then it means 
 
 
 
 0
 ≤
 i
 ≤
 k
 .
 
 
 {\displaystyle 0\leq i\leq k.}
 <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">The image of the compact set 
 
 
 
 K
 
 
 {\displaystyle K}
 
 under a continuous 
 
 
 
 
 R
 
 
 
 {\displaystyle \mathbb {R} }
 
-valued map (for example, 
 
 
 
 x
 ↦
 
 |
 
 
 ∂
 
 p
 
 
 f
 (
 x
 )
 
 |
 
 
 
 {\displaystyle x\mapsto \left|\partial ^{p}f(x)\right|}
 
 for 
 
 
 
 x
 ∈
 U
 
 
 {\displaystyle x\in U}
 
) is itself a compact, and thus bounded, subset of 
 
 
 
 
 R
 
 .
 
 
 {\displaystyle \mathbb {R} .}
 
 If 
 
 
 
 K
 ≠
 ∅
 
 
 {\displaystyle K\neq \varnothing }
 
 then this implies that each of the functions defined above is 
 
 
 
 
 R
 
 
 
 {\displaystyle \mathbb {R} }
 
-valued (that is, none of the supremums above are ever equal to 
 
 
 
 ∞
 
 
 {\displaystyle \infty }
 
). <a href="/wiki/Compact_set" target="_blank">/wiki/Compact_set</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Trèves 2006, pp. 85–89. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Trèves 2006, pp. 142–149. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Trèves 2006, pp. 142–149. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Trèves 2006, pp. 356–358. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Trèves 2006, pp. 131–134. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Exactly as with 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 U
 )
 ,
 
 
 {\displaystyle C^{k}(K;U),}
 
 the space 
 
 
 
 
 C
 
 k
 
 
 (
 K
 ;
 
 U
 ′
 
 )
 
 
 {\displaystyle C^{k}(K;U')}
 
 is defined to be the vector subspace of 
 
 
 
 
 C
 
 k
 
 
 (
 
 U
 ′
 
 )
 
 
 {\displaystyle C^{k}(U')}
 
 consisting of maps with support contained in 
 
 
 
 K
 
 
 {\displaystyle K}
 
 endowed with the subspace topology it inherits from 
 
 
 
 
 C
 
 k
 
 
 (
 
 U
 ′
 
 )
 
 
 {\displaystyle C^{k}(U')}
 
. <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Trèves 2006, pp. 526–534. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Trèves 2006, p. 357. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Even though the topology of 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is not metrizable, a linear functional on 
 
 
 
 
 C
 
 c
 
 
 ∞
 
 
 (
 U
 )
 
 
 {\displaystyle C_{c}^{\infty }(U)}
 
 is continuous if and only if it is sequentially continuous. <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">A null sequence is a sequence that converges to the origin. <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">If 
 
 
 
 
 
 P
 
 
 
 
 {\displaystyle {\mathcal {P}}}
 
 is also directed under the usual function comparison then we can take the finite collection to consist of a single element. <a href="/wiki/Directed_set" target="_blank">/wiki/Directed_set</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Trèves 2006, pp. 222–223. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">See for example Grubb 2009, p. 14. - Grubb, G. (2009), Distributions and Operators, Springer <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Trèves 2006, pp. 245–247. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">Trèves 2006, pp. 245–247. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Trèves 2006, pp. 245–247. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Trèves 2006, pp. 245–247. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">Trèves 2006, pp. 253–255. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
<li id="fn:32">Trèves 2006, pp. 255–257. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></li>
<li id="fn:33">Trèves 2006, pp. 255–257. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></li>
<li id="fn:34">Trèves 2006, pp. 264–266. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></li>
<li id="fn:35">Rudin 1991, p. 165. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></li>
<li id="fn:36">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></li>
<li id="fn:37">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></li>
<li id="fn:38">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></li>
<li id="fn:39">Rudin 1991, pp. 169–170. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></li>
<li id="fn:40">The extension theorem for mappings defined from a subspace S of a topological vector space E to the topological space E itself works for non-linear mappings as well, provided they are assumed to be uniformly continuous. But, unfortunately, this is not our case, we would desire to “extend” a linear continuous mapping A from a tvs E into another tvs F, in order to obtain a linear continuous mapping from the dual E’ to the dual F’ (note the order of spaces). In general, this is not even an extension problem, because (in general) E is not necessarily a subset of its own dual E’. Moreover, It is not a classic topological transpose problem, because the transpose of A goes from F’ to E’ and not from E’ to F’. Our case needs, indeed, a new order of ideas, involving the specific topological properties of the Laurent Schwartz spaces D(U) and D’(U), together with the fundamental concept of weak (or Schwartz) adjoint of the linear continuous operator A. <a href="/wiki/Uniformly_continuous" target="_blank">/wiki/Uniformly_continuous</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></li>
<li id="fn:41">Strichartz, Robert (1993). A Guide to Distribution Theory and Fourier Transforms. USA. p. 17.{{cite book}}: CS1 maint: location missing publisher (link) <a href="/wiki/Template:Cite_book" target="_blank">/wiki/Template:Cite_book</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></li>
<li id="fn:42">Strichartz 1994, §2.3; Trèves 2006. - Strichartz, R. (1994), A Guide to Distribution Theory and Fourier Transforms, CRC Press, ISBN 0-8493-8273-4 <a href="#fnref:42" class="footnote-back-ref">↩</a></li>
<li id="fn:43">Rudin 1991, p. 180. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></li>
<li id="fn:44">For example, let 
 
 
 
 U
 =
 
 R
 
 
 
 {\displaystyle U=\mathbb {R} }
 
 and take 
 
 
 
 P
 
 
 {\displaystyle P}
 
 to be the ordinary derivative for functions of one real variable and assume the support of 
 
 
 
 ϕ
 
 
 {\displaystyle \phi }
 
 to be contained in the finite interval 
 
 
 
 (
 a
 ,
 b
 )
 ,
 
 
 {\displaystyle (a,b),}
 
 then since 
 
 
 
 supp
 ⁡
 (
 ϕ
 )
 ⊆
 (
 a
 ,
 b
 )
 
 
 {\displaystyle \operatorname {supp} (\phi )\subseteq (a,b)}

∫
                  
                    
                      R
                    
                  
                
                
                  ϕ
                  ′
                
                (
                x
                )
                f
                (
                x
                )
                
                d
                x
              
              
                
                =
                
                  ∫
                  
                    a
                  
                  
                    b
                  
                
                
                  ϕ
                  ′
                
                (
                x
                )
                f
                (
                x
                )
                
                d
                x
              
            
            
              
              
                
                =
                ϕ
                (
                x
                )
                f
                (
                x
                )
                
                  
                    
                      |
                    
                  
                  
                    a
                  
                  
                    b
                  
                
                −
                
                  ∫
                  
                    a
                  
                  
                    b
                  
                
                
                  f
                  ′
                
                (
                x
                )
                ϕ
                (
                x
                )
                
                d
                x
              
            
            
              
              
                
                =
                ϕ
                (
                b
                )
                f
                (
                b
                )
                −
                ϕ
                (
                a
                )
                f
                (
                a
                )
                −
                
                  ∫
                  
                    a
                  
                  
                    b
                  
                
                
                  f
                  ′
                
                (
                x
                )
                ϕ
                (
                x
                )
                
                d
                x
              
            
            
              
              
                
                =
                −
                
                  ∫
                  
                    a
                  
                  
                    b
                  
                
                
                  f
                  ′
                
                (
                x
                )
                ϕ
                (
                x
                )
                
                d
                x
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}\int _{\mathbb {R} }\phi '(x)f(x)\,dx&=\int _{a}^{b}\phi '(x)f(x)\,dx\\&=\phi (x)f(x){\big \vert }_{a}^{b}-\int _{a}^{b}f'(x)\phi (x)\,dx\\&=\phi (b)f(b)-\phi (a)f(a)-\int _{a}^{b}f'(x)\phi (x)\,dx\\&=-\int _{a}^{b}f'(x)\phi (x)\,dx\end{aligned}}}

where the last equality is because 
 
 
 
 ϕ
 (
 a
 )
 =
 ϕ
 (
 b
 )
 =
 0.
 
 
 {\displaystyle \phi (a)=\phi (b)=0.}
 <a href="#fnref:44" class="footnote-back-ref">↩</a></li>
<li id="fn:45">Trèves 2006, pp. 247–252. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></li>
<li id="fn:46">Trèves 2006, pp. 247–252. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></li>
<li id="fn:47">Trèves 2006, p. 423. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></li>
<li id="fn:48">Trèves 2006, p. 261. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></li>
<li id="fn:49">Per Persson (username: md2perpe) (Jun 27, 2017). "Multiplication of two distributions whose singular supports are disjoint". Stack Exchange Network.{{cite web}}: CS1 maint: numeric names: authors list (link) <a href="https://math.stackexchange.com/q/2338283" target="_blank">https://math.stackexchange.com/q/2338283</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></li>
<li id="fn:50">Lyons, T. (1998). "Differential equations driven by rough signals". Revista Matemática Iberoamericana. 14 (2): 215–310. doi:10.4171/RMI/240. <a href="https://doi.org/10.4171%2FRMI%2F240" target="_blank">https://doi.org/10.4171%2FRMI%2F240</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></li>
<li id="fn:51">Hairer, Martin (2014). "A theory of regularity structures". Inventiones Mathematicae. 198 (2): 269–504. arXiv:1303.5113. Bibcode:2014InMat.198..269H. doi:10.1007/s00222-014-0505-4. S2CID 119138901. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></li>
<li id="fn:52">See for example Hörmander 1983, Theorem 6.1.1. - Hörmander, L. (1983), The analysis of linear partial differential operators I, Grundl. Math. Wissenschaft., vol. 256, Springer, doi:10.1007/978-3-642-96750-4, ISBN 3-540-12104-8, MR 0717035 <a href="https://doi.org/10.1007%2F978-3-642-96750-4" target="_blank">https://doi.org/10.1007%2F978-3-642-96750-4</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></li>
<li id="fn:53">See Hörmander 1983, Theorem 6.1.2. - Hörmander, L. (1983), The analysis of linear partial differential operators I, Grundl. Math. Wissenschaft., vol. 256, Springer, doi:10.1007/978-3-642-96750-4, ISBN 3-540-12104-8, MR 0717035 <a href="https://doi.org/10.1007%2F978-3-642-96750-4" target="_blank">https://doi.org/10.1007%2F978-3-642-96750-4</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></li>
<li id="fn:54">Trèves 2006, pp. 278–283. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></li>
<li id="fn:55">Trèves 2006, pp. 278–283. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></li>
<li id="fn:56">Trèves 2006, pp. 278–283. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></li>
<li id="fn:57">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></li>
<li id="fn:58">See for example Rudin 1991, §6.29. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></li>
<li id="fn:59">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></li>
<li id="fn:60">Trèves 2006, Chapter 27. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></li>
<li id="fn:61">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></li>
<li id="fn:62">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></li>
<li id="fn:63">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></li>
<li id="fn:64">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></li>
<li id="fn:65">Rudin 1991, pp. 149–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></li>
<li id="fn:66">Hörmander 1983, §IV.2 proves the uniqueness of such an extension. - Hörmander, L. (1983), The analysis of linear partial differential operators I, Grundl. Math. Wissenschaft., vol. 256, Springer, doi:10.1007/978-3-642-96750-4, ISBN 3-540-12104-8, MR 0717035 <a href="https://doi.org/10.1007%2F978-3-642-96750-4" target="_blank">https://doi.org/10.1007%2F978-3-642-96750-4</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></li>
<li id="fn:67">Trèves 2006, Chapter 27. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:67" class="footnote-back-ref">↩</a></li>
<li id="fn:68">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></li>
<li id="fn:69">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></li>
<li id="fn:70">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></li>
<li id="fn:71">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></li>
<li id="fn:72">Trèves 2006, pp. 284–297. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></li>
<li id="fn:73">See for instance Gel'fand & Shilov 1966–1968, v. 1, pp. 103–104 and Benedetto 1997, Definition 2.5.8. - Gel'fand, I.M.; Shilov, G.E. (1966–1968), Generalized functions, vol. 1–5, Academic Press <a href="#fnref:73" class="footnote-back-ref">↩</a></li>
<li id="fn:74">Trèves 2006, p. 423. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></li>
<li id="fn:75">Trèves 2006, p. 423. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></li>
<li id="fn:76">Trèves 2006, p. 294. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></li>
<li id="fn:77">Trèves 2006, p. 423. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:77" class="footnote-back-ref">↩</a></li>
<li id="fn:78">Trèves 2006, p. 423. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></li>
<li id="fn:79">Folland, G.B. (1989). Harmonic Analysis in Phase Space. Princeton, NJ: Princeton University Press. <a href="#fnref:79" class="footnote-back-ref">↩</a></li>
<li id="fn:80">Horváth, John (1966). Topological Vector Spaces and Distributions. Reading, MA: Addison-Wesley Publishing Company. <a href="/wiki/John_Horvath_(mathematician)" target="_blank">/wiki/John_Horvath_(mathematician)</a> <a href="#fnref:80" class="footnote-back-ref">↩</a></li>
<li id="fn:81">Barros-Neto, José (1973). An Introduction to the Theory of Distributions. New York, NY: Dekker. <a href="#fnref:81" class="footnote-back-ref">↩</a></li>
<li id="fn:82">Petersen, Bent E. (1983). Introduction to the Fourier Transform and Pseudo-Differential Operators. Boston, MA: Pitman Publishing. <a href="#fnref:82" class="footnote-back-ref">↩</a></li>
<li id="fn:83">Woodward, P.M. (1953). Probability and Information Theory with Applications to Radar. Oxford, UK: Pergamon Press. <a href="#fnref:83" class="footnote-back-ref">↩</a></li>
<li id="fn:84">Trèves 2006, pp. 318–319. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:84" class="footnote-back-ref">↩</a></li>
<li id="fn:85">Friedlander, F.G.; Joshi, M.S. (1998). Introduction to the Theory of Distributions. Cambridge, UK: Cambridge University Press. <a href="#fnref:85" class="footnote-back-ref">↩</a></li>
<li id="fn:86">Schwartz 1951. - Schwartz, Laurent (1951), Théorie des distributions, vol. 1–2, Hermann <a href="#fnref:86" class="footnote-back-ref">↩</a></li>
<li id="fn:87">Trèves 2006, pp. 416–419. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:87" class="footnote-back-ref">↩</a></li>
<li id="fn:88">Trèves 2006, pp. 416–419. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:88" class="footnote-back-ref">↩</a></li>
<li id="fn:89">Trèves 2006, pp. 416–419. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:89" class="footnote-back-ref">↩</a></li>
<li id="fn:90">Trèves 2006, pp. 150–160. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:90" class="footnote-back-ref">↩</a></li>
<li id="fn:91">Trèves 2006, pp. 240–252. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:91" class="footnote-back-ref">↩</a></li>
<li id="fn:92">Trèves 2006, pp. 262–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:92" class="footnote-back-ref">↩</a></li>
<li id="fn:93">Trèves 2006, p. 218. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:93" class="footnote-back-ref">↩</a></li>
<li id="fn:94">Trèves 2006, pp. 300–304. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:94" class="footnote-back-ref">↩</a></li>
<li id="fn:95">Trèves 2006, pp. 255–257. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:95" class="footnote-back-ref">↩</a></li>
<li id="fn:96">Trèves 2006, pp. 255–257. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:96" class="footnote-back-ref">↩</a></li>
<li id="fn:97">Trèves 2006, pp. 255–257. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:97" class="footnote-back-ref">↩</a></li>
<li id="fn:98">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:98" class="footnote-back-ref">↩</a></li>
<li id="fn:99">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:99" class="footnote-back-ref">↩</a></li>
<li id="fn:100">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:100" class="footnote-back-ref">↩</a></li>
<li id="fn:101">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:101" class="footnote-back-ref">↩</a></li>
<li id="fn:102">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:102" class="footnote-back-ref">↩</a></li>
<li id="fn:103">Trèves 2006, pp. 258–264. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:103" class="footnote-back-ref">↩</a></li>
<li id="fn:104">Rudin 1991, pp. 177–181. - Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277. <a href="https://archive.org/details/functionalanalys00rudi" target="_blank">https://archive.org/details/functionalanalys00rudi</a> <a href="#fnref:104" class="footnote-back-ref">↩</a></li>
<li id="fn:105">Trèves 2006, pp. 92–94. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:105" class="footnote-back-ref">↩</a></li>
<li id="fn:106">Trèves 2006, pp. 92–94. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:106" class="footnote-back-ref">↩</a></li>
<li id="fn:107">Trèves 2006, p. 160. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:107" class="footnote-back-ref">↩</a></li>
<li id="fn:108">Trèves 2006, p. 531. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:108" class="footnote-back-ref">↩</a></li>
</ol>

Distribution (mathematics) open-in-new

Distribution (mathematics)