Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

G.3 Part 1, p. 52 (corrected: bracket in the intermediate bound) — D_σ = KL(η(σ) ‖ b) ≤ 256ε²/(1 − p★) ≤ 512ε²

Proved
OfflineCMC.Minimax.kl_perturbation_bound

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

kl-divergenceminimax-lower-boundp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let d≥2d\ge2d≥2 be even, 0<p⋆<1/(d+1)0<p_\star<1/(d+1)0<p⋆​<1/(d+1) and 0<ε<1/320<\varepsilon<1/320<ε<1/32. Let b=((1−p⋆)/d,…,(1−p⋆)/d,p⋆)b=((1-p_\star)/d,\dots,(1-p_\star)/d,p_\star)b=((1−p⋆​)/d,…,(1−p⋆​)/d,p⋆​) and let η(σ)\eta(\sigma)η(σ) be its perturbation by the sign vector σ∈{−1,1}d/2\sigma\in\{-1,1\}^{d/2}σ∈{−1,1}d/2 (the last row of MσM_\sigmaMσ​ in (G.19)). Then the Kullback–Leibler divergence Dσ=∑tη(σ)tlog⁡(η(σ)t/bt)D_\sigma=\sum_t\eta(\sigma)_t\log(\eta(\sigma)_t/b_t)Dσ​=∑t​η(σ)t​log(η(σ)t​/bt​) satisfies

Dσ≤256 ε21−p⋆≤512 ε2.D_\sigma\le\frac{256\,\varepsilon^2}{1-p_\star}\le512\,\varepsilon^2 .Dσ​≤1−p⋆​256ε2​≤512ε2.

This bounds the information one visit to the special state carries about σ\sigmaσ. Combined with the chain rule (G.22), it bounds the divergence between the path laws of the hard family.

Differences from the source:

  • correction: the intermediate display Dσ≤12(A+B)BA−(A−B)BA=B2AD_\sigma\le\frac12(A+B)\frac BA-(A-B)\frac BA=\frac{B^2}ADσ​≤21​(A+B)AB​−(A−B)AB​=AB2​ → not stated; only Dσ≤B2/A=256ε2/(1−p⋆)≤512ε2D_\sigma\le B^2/A=256\varepsilon^2/(1-p_\star)\le512\varepsilon^2Dσ​≤B2/A=256ε2/(1−p⋆​)≤512ε2 is asserted; reason: as printed the middle expression is not B2/AB^2/AB2/A (a lost bracket: 12((A+B)BA−(A−B)BA)=B2/A\frac12\big((A+B)\frac BA-(A-B)\frac BA\big)=B^2/A21​((A+B)AB​−(A−B)AB​)=B2/A), while the two endpoints are correct
  • generalization: d>2d>2d>2 even (Part 1's hypothesis) → d≥2d\ge2d≥2 even; reason: covers d=2d=2d=2 as well
Preamble
import Mathlib
import Definitions.Def_OfflineCMC_Minimax_CMC
import Definitions.Def_OfflineCMC_Minimax_HardFamily
Formal statement
namespace OfflineCMC.Minimax

theorem kl_perturbation_bound (d : ℕ) (hd : Even d) (hd0 : 0 < d) (p ε : ℝ) (hp : 0 < p)
    (hpd : p < 1 / ((d : ℝ) + 1)) (hε : 0 < ε) (hε' : ε < 1 / 32) (σ : Fin (d / 2) → ℤˣ) :
    klDivFin (etaRow d p ε σ) (baseRow d p) ≤ 256 * ε ^ 2 / (1 - p) ∧
      256 * ε ^ 2 / (1 - p) ≤ 512 * ε ^ 2 := by sorry

end OfflineCMC.Minimax
Source
Banerjee, Honnappa & Rao, Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity, arXiv:2211.07092v5, p. 52, App. G.3 Part 1 (D_σ)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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