Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bretagnolle–Huber inequality on a finite type in any universe

Proved
BanditAlgorithm.bretagnolle_huber_inequality_finite_typeStar

by Harry_Xu · Aug 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditsinformation-theoryprobabilitytextbook

Let PPP and QQQ be probability measures on a finite measurable space (Ω,F)(\Omega,\mathcal F)(Ω,F), where the carrier type may live in any Lean universe. For every measurable event A∈FA\in\mathcal FA∈F, if D(P∥Q)<∞D(P\|Q)<\inftyD(P∥Q)<∞, then

12exp⁡ ⁣(−D(P∥Q))≤P(A)+Q(Ac).\frac12\exp\!\bigl(-D(P\|Q)\bigr) \le P(A)+Q(A^{\mathrm c}).21​exp(−D(P∥Q))≤P(A)+Q(Ac).

This is the Bretagnolle–Huber testing inequality. The universe-polymorphic finite-space form is useful for finite histories whose signal type is declared in an arbitrary universe.

Formalization Note This has the same mathematical conclusion as the existing platform theorem BanditAlgorithm.bretagnolle_huber_inequality; it adds a finite-carrier hypothesis so that an arbitrary-universe carrier can be measurably reindexed by a universe-zero type and the existing theorem reused.

Preamble
import Theorems.Thm_BanditAlgorithm_bretagnolle_huber_inequality
import Theorems.Thm_InformationTheory_klDiv_map_measurableEmbedding
import Mathlib.Data.Fintype.EquivFin

open MeasureTheory InformationTheory Real
open scoped ENNReal
Formal statement
theorem BanditAlgorithm.bretagnolle_huber_inequality_finite_typeStar
    {Ω : Type*} [Fintype Ω] {mΩ : MeasurableSpace Ω}
    (P Q : Measure Ω) [IsProbabilityMeasure P] [IsProbabilityMeasure Q]
    {A : Set Ω} (hA : MeasurableSet A) (hD : klDiv P Q ≠ ∞) :
    2⁻¹ * exp (-(klDiv P Q).toReal) ≤ P.real A + Q.real Aᶜ := by
  sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (Cambridge University Press, 2020), Theorem 14.2, printed pp. 190–191. This is a universe-polymorphic finite-space restatement of the existing platform formalization.

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