Documentation

Mathlib.Analysis.Distribution.Support

Support of distributions #

We define the support of a distribution, dsupport u, as the intersection of all closed sets for which u vanishes on the complement. For this we also define a predicate IsVanishingOn that asserts that a map f : F → V vanishes on s : Set α if for all u : F with tsupport u āŠ† s it follows that f u = 0.

These definitions work independently of a specific class of distributions (classical, tempered, or compactly supported) and all basic properties are proved in an abstract setting using FunLike.

Main definitions #

Main statements #

Vanishing of distributions #

def Distribution.IsVanishingOn {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] (f : F → V) (s : Set α) :

A distribution f vanishes on a set s if it vanishes for all test functions u with tsupport u āŠ† s.

To make this definition work for all types of distributions, we define it for any function from a FunLike type to a type with zero.

Instances For
    theorem Distribution.IsVanishingOn.mono {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] {f : F → V} [Zero V] ⦃s₁ sā‚‚ : Set α⦄ (hs : sā‚‚ āŠ† s₁) (hf : IsVanishingOn f s₁) :
    IsVanishingOn f sā‚‚
    theorem Distribution.not_isVanishingOn_mono {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] {f : F → V} [Zero V] ⦃s₁ sā‚‚ : Set α⦄ (hs : s₁ āŠ† sā‚‚) (hf : ¬IsVanishingOn f s₁) :
    ¬IsVanishingOn f sā‚‚
    theorem Distribution.not_isVanishingOn_iff {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] {f : F → V} {s : Set α} [Zero V] :
    ¬IsVanishingOn f s ↔ ∃ (u : F), tsupport ⇑u āŠ† s ∧ f u ≠ 0

    Support #

    def Distribution.dsupport {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] (f : F → V) :
    Set α

    The distributional support of f is the intersection of all closed sets s such that f vanishes on the complement of s.

    To make this definition work for all types of distributions, we define it for any function from a FunLike type to a type with zero.

    Instances For
      theorem Distribution.mem_dsupport_iff {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} (x : α) :
      x ∈ dsupport f ↔ āˆ€ (s : Set α), IsVanishingOn f sᶜ → IsClosed s → x ∈ s
      theorem Distribution.dsupport_compl_eq {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} :

      The complement of the support is the largest open set on which f vanishes.

      @[simp]
      theorem Distribution.notMem_dsupport_iff {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} (x : α) :
      x āˆ‰ dsupport f ↔ ∃ (s : Set α), IsVanishingOn f s ∧ IsOpen s ∧ x ∈ s
      theorem Distribution.mem_dsupport_iff_not_isVanishingOn {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} (x : α) :
      x ∈ dsupport f ↔ āˆ€ (s : Set α), x ∈ s → IsOpen s → ¬IsVanishingOn f s
      theorem Distribution.mem_dsupport_iff_forall_exists_ne {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} (x : α) :
      x ∈ dsupport f ↔ āˆ€ (s : Set α), x ∈ s → IsOpen s → ∃ (u : F), tsupport ⇑u āŠ† s ∧ f u ≠ 0
      theorem Distribution.mem_dsupport_iff_frequently {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} {x : α} :
      x ∈ dsupport f ↔ ∃ᶠ (u : Set α) in (nhds x).smallSets, ¬IsVanishingOn f u
      theorem Filter.HasBasis.mem_dsupport {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} {ι : Sort u_11} {p : ι → Prop} {s : ι → Set α} {x : α} (hl : (nhds x).HasBasis p s) :
      x ∈ Distribution.dsupport f ↔ āˆ€ (i : ι), p i → ¬Distribution.IsVanishingOn f (s i)
      theorem Distribution.notMem_dsupport_iff_eventually {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} {x : α} :
      x āˆ‰ dsupport f ↔ āˆ€į¶  (u : Set α) in (nhds x).smallSets, IsVanishingOn f u
      theorem Filter.HasBasis.notMem_dsupport {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} {ι : Sort u_11} {p : ι → Prop} {s : ι → Set α} {x : α} (hl : (nhds x).HasBasis p s) :
      x āˆ‰ Distribution.dsupport f ↔ ∃ (i : ι), p i ∧ Distribution.IsVanishingOn f (s i)
      theorem Distribution.dsupport_subset_dsupport {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f g : F → V} (h : āˆ€ (s : Set α), IsOpen s → IsVanishingOn g s → IsVanishingOn f s) :
      dsupport f āŠ† dsupport g
      theorem Distribution.isClosed_dsupport {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} :
      theorem Distribution.IsVanishingOn.disjoint_dsupport {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [TopologicalSpace α] [Zero β] [Zero V] {f : F → V} {s : Set α} (h : IsVanishingOn f s) (s_open : IsOpen s) :
      theorem Distribution.compl_dsupport_eq_sUnion_isBounded {α : Type u_2} {β : Type u_3} {F : Type u_6} {V : Type u_10} [FunLike F α β] [PseudoMetricSpace α] [Zero β] [Zero V] {f : F → V} :

      The complement of the support is given by all bounded open sets on which f vanishes.

      Tempered distributions #