Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.9 — conditional squared Hellinger distance is at most four times joint distance

Proved
StatComplexityDM.PCIGW.hellinger_cond_le_four_joint

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

change-of-measurehellinger-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let PX,YP_{X,Y}PX,Y​ and QX,YQ_{X,Y}QX,Y​ be two joint probability laws on finite alphabets X×YX\times YX×Y, with XXX-marginals PX,QXP_X,Q_XPX​,QX​ and conditional kernels Kx=PY∣X=xK_x=P_{Y\mid X=x}Kx​=PY∣X=x​, Lx=QY∣X=xL_x=Q_{Y\mid X=x}Lx​=QY∣X=x​. Then

∑xPX(x)DH2(Kx,Lx)≤4DH2(PX,Y,QX,Y).\sum_x P_X(x)D_H^2(K_x,L_x)\le 4D_H^2(P_{X,Y},Q_{X,Y}).x∑​PX​(x)DH2​(Kx​,Lx​)≤4DH2​(PX,Y​,QX,Y​).

This compares the conditional discrepancies used layer by layer with the discrepancy of the joint observation.

Formalization Note All probability laws are vectors on finite alphabets. A conditional kernel is supplied even at an xxx to which its marginal assigns zero mass; those values do not affect the left side.

Preamble
import Mathlib
import Definitions.Def_StatComplexityDM_PCIGW_MDP
Formal statement
namespace StatComplexityDM.PCIGW

/-- Lemma A.9, p. 71, on finite alphabets. -/
theorem hellinger_cond_le_four_joint {X Y : Type*} [Fintype X] [Fintype Y]
    (PX QX : X → ℝ) (K L : X → Y → ℝ)
    (hPX : StatComplexityDM.LowerBound.IsDist PX) (hQX : StatComplexityDM.LowerBound.IsDist QX)
    (hK : ∀ x, StatComplexityDM.LowerBound.IsDist (K x)) (hL : ∀ x, StatComplexityDM.LowerBound.IsDist (L x)) :
    ∑ x, PX x * FoundationsRL.GeneralDM.hellingerSq (K x) (L x) ≤
      4 * FoundationsRL.GeneralDM.hellingerSq
        (fun xy : X × Y => PX xy.1 * K xy.1 xy.2)
        (fun xy : X × Y => QX xy.1 * L xy.1 xy.2) := by sorry

end StatComplexityDM.PCIGW
Source
arXiv:2112.13487v3, Lemma A.9, p. 71
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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