Documentation

LeanMachineLearning.ForMathlib.InformationTheory.KullbackLeibler.CompProd

Lemmas about the Kullback-Leibler divergence of the images of two measures by a measurable map #

theorem MeasureTheory.Measure.map_compProd_comap {α : Type u_1} {β : Type u_2} {γ : Type u_3} {mα : MeasurableSpace α} {mβ : MeasurableSpace β} {mγ : MeasurableSpace γ} (μ : Measure α) [SFinite μ] (η : ProbabilityTheory.Kernel β γ) [ProbabilityTheory.IsSFiniteKernel η] {f : α → β} (hf : Measurable f) :
map (fun (p : α × γ) => (f p.1, p.2)) (μ.compProd (η.comap f hf)) = (map f μ).compProd η

Transporting μ ⊗ₘ η.comap f along f in the first coordinate gives μ.map f ⊗ₘ η.

theorem MeasureTheory.Measure.map_withDensity_comp {α : Type u_1} {β : Type u_2} {mα : MeasurableSpace α} {mβ : MeasurableSpace β} {ν : Measure α} {f : β → ENNReal} (hf : Measurable f) {g : α → β} (hg : Measurable g) :
map g (ν.withDensity (f ∘ g)) = (map g ν).withDensity f
theorem InformationTheory.klDiv_map_of_eq_withDensity_comp {α : Type u_1} {β : Type u_2} {mα : MeasurableSpace α} {mβ : MeasurableSpace β} {μ ν : MeasureTheory.Measure α} [MeasureTheory.IsFiniteMeasure μ] [MeasureTheory.IsFiniteMeasure ν] {f : β → ENNReal} (hf : Measurable f) {g : α → β} (hg : Measurable g) (hμ : μ = ν.withDensity (f ∘ g)) :

If μ has density f ∘ g with respect to ν, then the divergence of the images by g is the divergence of μ and ν: g is a sufficient statistic.

The conditional divergence of two kernels which depend on the conditioning variable only through a statistic f is the conditional divergence given f.