The multiplicative and additive convolution of measures

In this file we define and prove properties about the convolutions of two measures.

Main definitions

• MeasureTheory.Measure.mconv: The multiplicative convolution of two measures: the map of * under the product measure.
• MeasureTheory.Measure.conv: The additive convolution of two measures: the map of + under the product measure.

noncomputable def MeasureTheory.Measure.mconv {M : Type u_1} [Monoid M] [MeasurableSpace M] (μ ν : Measure M) : Measure M

Multiplicative convolution of measures.

Equations

• μ.mconv ν = MeasureTheory.Measure.map (fun (x : M × M) => x.1 * x.2) (μ.prod ν)

noncomputable def MeasureTheory.Measure.conv {M : Type u_1} [AddMonoid M] [MeasurableSpace M] (μ ν : Measure M) : Measure M

Additive convolution of measures.

Equations

• μ.conv ν = MeasureTheory.Measure.map (fun (x : M × M) => x.1 + x.2) (μ.prod ν)

def MeasureTheory.«term_∗_» : Lean.TrailingParserDescr

Scoped notation for the multiplicative convolution of measures.

Equations

• MeasureTheory.«term_∗_» = Lean.ParserDescr.trailingNode `MeasureTheory.«term_∗_» 80 81 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∗ ") (Lean.ParserDescr.cat `term 81))

def MeasureTheory.«term_∗__1» : Lean.TrailingParserDescr

Scoped notation for the additive convolution of measures.

Equations

• MeasureTheory.«term_∗__1» = Lean.ParserDescr.trailingNode `MeasureTheory.«term_∗__1» 80 81 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∗ ") (Lean.ParserDescr.cat `term 81))

@[simp]

theorem MeasureTheory.Measure.dirac_one_mconv {M : Type u_1} [Monoid M] [MeasurableSpace M] [MeasurableMul₂ M] (μ : Measure M) [SFinite μ] : (dirac 1).mconv μ = μ

Convolution of the dirac measure at 1 with a measure μ returns μ.

@[simp]

theorem MeasureTheory.Measure.dirac_zero_mconv {M : Type u_1} [AddMonoid M] [MeasurableSpace M] [MeasurableAdd₂ M] (μ : Measure M) [SFinite μ] : (dirac 0).conv μ = μ

@[simp]

theorem MeasureTheory.Measure.mconv_dirac_one {M : Type u_1} [Monoid M] [MeasurableSpace M] [MeasurableMul₂ M] (μ : Measure M) [SFinite μ] : μ.mconv (dirac 1) = μ

Convolution of a measure μ with the dirac measure at 1 returns μ.

@[simp]

theorem MeasureTheory.Measure.mconv_dirac_zero {M : Type u_1} [AddMonoid M] [MeasurableSpace M] [MeasurableAdd₂ M] (μ : Measure M) [SFinite μ] : μ.conv (dirac 0) = μ

@[simp]

theorem MeasureTheory.Measure.mconv_zero {M : Type u_1} [Monoid M] [MeasurableSpace M] (μ : Measure M) : mconv 0 μ = 0

Convolution of the zero measure with a measure μ returns the zero measure.

@[simp]

theorem MeasureTheory.Measure.conv_zero {M : Type u_1} [AddMonoid M] [MeasurableSpace M] (μ : Measure M) : conv 0 μ = 0

@[simp]

theorem MeasureTheory.Measure.zero_mconv {M : Type u_1} [Monoid M] [MeasurableSpace M] (μ : Measure M) : μ.mconv 0 = 0

Convolution of a measure μ with the zero measure returns the zero measure.

@[simp]

theorem MeasureTheory.Measure.zero_conv {M : Type u_1} [AddMonoid M] [MeasurableSpace M] (μ : Measure M) : μ.conv 0 = 0

theorem MeasureTheory.Measure.mconv_add {M : Type u_1} [Monoid M] [MeasurableSpace M] [MeasurableMul₂ M] (μ ν ρ : Measure M) [SFinite μ] [SFinite ν] [SFinite ρ] : μ.mconv (ν + ρ) = μ.mconv ν + μ.mconv ρ

theorem MeasureTheory.Measure.conv_add {M : Type u_1} [AddMonoid M] [MeasurableSpace M] [MeasurableAdd₂ M] (μ ν ρ : Measure M) [SFinite μ] [SFinite ν] [SFinite ρ] : μ.conv (ν + ρ) = μ.conv ν + μ.conv ρ

theorem MeasureTheory.Measure.add_mconv {M : Type u_1} [Monoid M] [MeasurableSpace M] [MeasurableMul₂ M] (μ ν ρ : Measure M) [SFinite μ] [SFinite ν] [SFinite ρ] : (μ + ν).mconv ρ = μ.mconv ρ + ν.mconv ρ

theorem MeasureTheory.Measure.add_conv {M : Type u_1} [AddMonoid M] [MeasurableSpace M] [MeasurableAdd₂ M] (μ ν ρ : Measure M) [SFinite μ] [SFinite ν] [SFinite ρ] : (μ + ν).conv ρ = μ.conv ρ + ν.conv ρ

theorem MeasureTheory.Measure.mconv_comm {M : Type u_2} [CommMonoid M] [MeasurableSpace M] [MeasurableMul₂ M] (μ ν : Measure M) [SFinite μ] [SFinite ν] : μ.mconv ν = ν.mconv μ

To get commutativity, we need the underlying multiplication to be commutative.

theorem MeasureTheory.Measure.conv_comm {M : Type u_2} [AddCommMonoid M] [MeasurableSpace M] [MeasurableAdd₂ M] (μ ν : Measure M) [SFinite μ] [SFinite ν] : μ.conv ν = ν.conv μ

instance MeasureTheory.Measure.sfinite_mconv_of_sfinite {M : Type u_1} [Monoid M] [MeasurableSpace M] (μ ν : Measure M) [SFinite μ] [SFinite ν] : SFinite (μ.mconv ν)

Convolution of SFinite maps is SFinite.

instance MeasureTheory.Measure.sfinite_conv_of_sfinite {M : Type u_1} [AddMonoid M] [MeasurableSpace M] (μ ν : Measure M) [SFinite μ] [SFinite ν] : SFinite (μ.conv ν)

instance MeasureTheory.Measure.finite_of_finite_mconv {M : Type u_1} [Monoid M] [MeasurableSpace M] (μ ν : Measure M) [IsFiniteMeasure μ] [IsFiniteMeasure ν] : IsFiniteMeasure (μ.mconv ν)

instance MeasureTheory.Measure.finite_of_finite_conv {M : Type u_1} [AddMonoid M] [MeasurableSpace M] (μ ν : Measure M) [IsFiniteMeasure μ] [IsFiniteMeasure ν] : IsFiniteMeasure (μ.conv ν)

instance MeasureTheory.Measure.probabilitymeasure_of_probabilitymeasures_mconv {M : Type u_1} [Monoid M] [MeasurableSpace M] (μ ν : Measure M) [MeasurableMul₂ M] [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] : IsProbabilityMeasure (μ.mconv ν)

instance MeasureTheory.Measure.probabilitymeasure_of_probabilitymeasures_conv {M : Type u_1} [AddMonoid M] [MeasurableSpace M] (μ ν : Measure M) [MeasurableAdd₂ M] [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] : IsProbabilityMeasure (μ.conv ν)