Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

KL divergence decreases under restriction to a sub-σ\sigmaσ-algebra

Proved
InformationTheory.klDiv_trim_le

by Harry_Xu · Jul 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

data-processinginformation-theorymeasure-theoryrelative-entropy

Let PPP and QQQ be probability measures on a measurable space (Ω,F)(\Omega,\mathcal F)(Ω,F), and let G⊆F\mathcal G\subseteq\mathcal FG⊆F be a sub-σ\sigmaσ-algebra. Restrict both measures to G\mathcal GG. Then

D ⁣(P∣G ∥ Q∣G)≤D(P∥Q).D\!\left(P|_{\mathcal G}\,\middle\Vert\,Q|_{\mathcal G}\right) \le D(P\Vert Q).D(P∣G​∥Q∣G​)≤D(P∥Q).

This is the data-processing inequality for forgetting information: observing only events in a smaller sigma-algebra cannot increase relative entropy. It is reusable for stopped experiments, sufficient statistics, coarse observations, and finite-horizon projections.

Formalization Note Restriction to a sub-sigma-algebra is represented by Measure.trim. Both divergences are extended nonnegative real numbers, so the statement includes singular and infinite-divergence cases.

Preamble
import Mathlib.InformationTheory.KullbackLeibler.Basic
import Mathlib.MeasureTheory.Function.ConditionalExpectation.RadonNikodym
import Mathlib.MeasureTheory.Function.ConditionalExpectation.CondJensen

open MeasureTheory InformationTheory Set
open scoped ENNReal
Formal statement
theorem InformationTheory.klDiv_trim_le {α : Type*} {m m₀ : MeasurableSpace α}
    (hm : m ≤ m₀) (μ ν : @Measure α m₀)
    [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] :
    @klDiv α m (μ.trim hm) (ν.trim hm) ≤ @klDiv α m₀ μ ν := by
  sorry
Source
Standard relative-entropy data-processing inequality; specialized to stopped bandit experiments in Lattimore and Szepesvári, Bandit Algorithms (CUP 2020), Exercise 15.7, printed p. 211. Formal ingredients: Mathlib `MeasureTheory.rnDeriv_trim` and conditional Jensen inequality `ConvexOn.map_condExp_le`.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me