Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma E.2 (proof), p. 105 — P(∃f ∈ F : |f(π)| > δ, E[f²] ≤ ϵ²) ≤ (ϵ²/δ²)·θ(F, Δ, ε; ρ) for ϵ ≥ ε, δ ≥ Δ

Proved
StatComplexityDM.Disagreement.prob_disagree_le_coeff

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

decouplingdisagreement-coefficientp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let F\mathcal{F}F be a class of functions Π→[−R,R]\Pi \to [-R, R]Π→[−R,R], let ρ\rhoρ be a finitely supported distribution on Π\PiΠ, and let Δ0>0\Delta_0 > 0Δ0​>0, ε0>0\varepsilon_0 > 0ε0​>0. Then for all δ≥Δ0\delta \ge \Delta_0δ≥Δ0​ and ϵ≥ε0\epsilon \ge \varepsilon_0ϵ≥ε0​,

Pπ∼ρ(∃f∈F:∣f(π)∣>δ, Eπ′∼ρ[f2(π′)]≤ϵ2)≤ϵ2δ2 θ(F,Δ0,ε0;ρ),\mathbb{P}_{\pi\sim\rho}\bigl( \exists f \in \mathcal{F} : |f(\pi)| > \delta,\ \mathbb{E}_{\pi'\sim\rho}[f^2(\pi')] \le \epsilon^2 \bigr) \le \frac{\epsilon^2}{\delta^2}\, \theta(\mathcal{F}, \Delta_0, \varepsilon_0; \rho),Pπ∼ρ​(∃f∈F:∣f(π)∣>δ, Eπ′∼ρ​[f2(π′)]≤ϵ2)≤δ2ϵ2​θ(F,Δ0​,ε0​;ρ),

where θ\thetaθ is the disagreement coefficient of Definition 6.3 and π′∼ρ\pi' \sim \rhoπ′∼ρ is independent of π\piπ.

This is the step of the proof of Lemma E.2 at which the disagreement coefficient enters: it converts the probability of disagreement at every pair of scales into θ\thetaθ.

Formalization Note The page states the step for the class with R=1R = 1R=1 and Δ,ε∈(0,1]\Delta, \varepsilon \in (0, 1]Δ,ε∈(0,1]; the statement here holds for any uniform bound RRR and any positive Δ0,ε0\Delta_0, \varepsilon_0Δ0​,ε0​, which contains the page's case. The bound RRR makes the supremum in θ\thetaθ finite. Distributions are finitely supported.

Preamble
import Mathlib
import Definitions.Def_StatComplexityDM_Disagreement_Coefficient
Formal statement
namespace StatComplexityDM.Disagreement

/-- Proof of Lemma E.2, p. 105 (arXiv:2112.13487v3): from the definition of the disagreement
coefficient, for a class `F` of functions bounded by `R` in absolute value, a finitely supported
`ρ`, `Δ₀ > 0`, `ε₀ > 0`, and all `ε ≥ ε₀`, `δ ≥ Δ₀`,
`P_{π∼ρ}(∃ f ∈ F : |f(π)| > δ ∧ E_{π′∼ρ}[f²(π′)] ≤ ε²) ≤ (ε²/δ²) · θ(F, Δ₀, ε₀; ρ)`. -/
theorem prob_disagree_le_coeff {κ Act : Type*} [Fintype κ] (F : Set (Act → ℝ)) (R : ℝ)
    (hF : ∀ f ∈ F, ∀ π, |f π| ≤ R) (ρw : κ → ℝ) (ρpt : κ → Act) (hρ : StatComplexityDM.LowerBound.IsDist ρw)
    (Δ₀ ε₀ : ℝ) (hΔ₀ : 0 < Δ₀) (hε₀ : 0 < ε₀) (δ ε : ℝ) (hδ : Δ₀ ≤ δ) (hε : ε₀ ≤ ε) :
    distProb ρw ρpt (disagreeEvent F δ ε ρw ρpt)
      ≤ ε ^ 2 / δ ^ 2 * disagreementCoeff F Δ₀ ε₀ ρw ρpt := by sorry

end StatComplexityDM.Disagreement
Source
arXiv:2112.13487v3, App. E.2.1, proof of Lemma E.2, p. 105 ("Now, from the definition of the disagreement coefficient")
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