Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display after (47) — E_{P̂n}[|L − 1|^p]^{1/p} ≤ n^{−1/p} √(ρ C_f)

Proved
GenEmpLik.Consistency.display_after_47

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

empirical-likelihoodf-divergencep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥1n\ge1n≥1, r≥2r\ge2r≥2 (the exponent max⁡{2,1+1/ϵ}\max\{2,1+1/\epsilon\}max{2,1+1/ϵ} of (47)), ρ∈R\rho\in\mathbb Rρ∈R, and let CfC_fCf​ be a constant as in Lemma 13: ∥nw−1∥2≤ρCf\|nw-\mathbb 1\|_2\le\sqrt{\rho C_f}∥nw−1∥2​≤ρCf​​ for every www in the ball {w≥0:∑iwi=1, ∑if(nwi)≤ρ}\{w\ge0:\sum_i w_i=1,\ \sum_i f(nw_i)\le\rho\}{w≥0:∑i​wi​=1, ∑i​f(nwi​)≤ρ}. Then for every www in that ball, with likelihood ratio L(ξi)=nwiL(\xi_i)=nw_iL(ξi​)=nwi​,

EP^n[∣L(ξ)−1∣r]1/r=n−1/r ∥nw−1∥r ≤ n−1/r ∥nw−1∥2 ≤ n−1/rρCf,E_{\widehat P_n}\big[|L(\xi)-1|^r\big]^{1/r} =n^{-1/r}\,\|nw-\mathbb 1\|_r \ \le\ n^{-1/r}\,\|nw-\mathbb 1\|_2 \ \le\ n^{-1/r}\sqrt{\rho C_f},EPn​​[∣L(ξ)−1∣r]1/r=n−1/r∥nw−1∥r​ ≤ n−1/r∥nw−1∥2​ ≤ n−1/rρCf​​,

where EP^n[∣L−1∣r]=1n∑i∣nwi−1∣rE_{\widehat P_n}[|L-1|^r]=\frac1n\sum_i|nw_i-1|^rEPn​​[∣L−1∣r]=n1​∑i​∣nwi​−1∣r. Since r<∞r<\inftyr<∞, the right side tends to 000 as n→∞n\to\inftyn→∞, which makes the reweighting term of (47) vanish.

Formalization Note The page writes ρ/γf\sqrt{\rho/\gamma_f}ρ/γf​​ with γf\gamma_fγf​ undefined ("where γf\gamma_fγf​ is as in the lemma"); Lemma 13's bound is ρCf\sqrt{\rho C_f}ρCf​​, so γf=1/Cf\gamma_f=1/C_fγf​=1/Cf​. Lemma 13 enters as the hypothesis on CfC_fCf​; the paper's exponent ppp is called rrr.

Preamble
import Mathlib
import Definitions.Def_PhiDivRobust_Counterpart_uncertaintySet
Formal statement
namespace GenEmpLik.Consistency

/-- The display after (47) (arXiv:1610.03425v3, App. E.1, proof of Theorem 7, p. 46). Let
`n ≥ 1`, `r ≥ 2` (the paper's `p = max{2, 1 + 1/ε}`), and let `C_f` be a constant as in
Lemma 13: `‖n w − 𝟙‖₂ ≤ √(ρ C_f)` for every `w` in the ball `{w ≥ 0 : ∑ wᵢ = 1,
∑ᵢ f(n wᵢ) ≤ ρ}`. Then for every `w` in the ball, with `L(ξᵢ) = n wᵢ`,
`E_{P̂n}[|L − 1|^r]^{1/r} = n^{−1/r} ‖n w − 𝟙‖_r ≤ n^{−1/r} ‖n w − 𝟙‖₂ ≤ n^{−1/r} √(ρ C_f)`.
(The page writes `√(ρ/γ_f)` with `γ_f` undefined; it is `√(ρ C_f)`.) -/
theorem display_after_47 (f : ℝ → EReal) (ρ : ℝ) (n : ℕ) (hn : 0 < n) (r : ℝ) (hr : 2 ≤ r)
    (Cf : ℝ)
    (hCf : ∀ w ∈ PhiDivRobust.Counterpart.probUncertaintySet f
        (fun _ : Fin n => (1 : ℝ) / n) (ρ / n),
      Real.sqrt (∑ i, ((n : ℝ) * w i - 1) ^ 2) ≤ Real.sqrt (ρ * Cf))
    (w : Fin n → ℝ) (hw : w ∈ PhiDivRobust.Counterpart.probUncertaintySet f
      (fun _ : Fin n => (1 : ℝ) / n) (ρ / n)) :
    ((1 / (n : ℝ)) * ∑ i, |(n : ℝ) * w i - 1| ^ r) ^ (1 / r) =
        (n : ℝ) ^ (-(1 / r)) * (∑ i, |(n : ℝ) * w i - 1| ^ r) ^ (1 / r) ∧
      (n : ℝ) ^ (-(1 / r)) * (∑ i, |(n : ℝ) * w i - 1| ^ r) ^ (1 / r) ≤
        (n : ℝ) ^ (-(1 / r)) * Real.sqrt (∑ i, ((n : ℝ) * w i - 1) ^ 2) ∧
      (n : ℝ) ^ (-(1 / r)) * Real.sqrt (∑ i, ((n : ℝ) * w i - 1) ^ 2) ≤
        (n : ℝ) ^ (-(1 / r)) * Real.sqrt (ρ * Cf) := by sorry

end GenEmpLik.Consistency
Source
Duchi, Glynn & Namkoong, Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach, arXiv:1610.03425v3, p. 46, App. E.1, proof of Theorem 7, display after (47)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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