Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 — exact coverage of the optimal value

Proved
GenEmpLik.Coverage.theorem_3

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

confidence-regionempirical-likelihoodp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-optimization

Let X⊂Rd\mathcal X\subset\mathbb R^dX⊂Rd be nonempty and compact, let the losses be measurable and satisfy Assumption B with EP0[M2]<∞\mathbb E_{P_0}[M^2]<\inftyEP0​​[M2]<∞, and suppose EP0[∣ℓ(x0;ξ)∣2]<∞\mathbb E_{P_0}[|\ell(x_0;\xi)|^2]<\inftyEP0​​[∣ℓ(x0​;ξ)∣2]<∞ for some x0∈Xx_0\in\mathcal Xx0​∈X. Let fff satisfy Assumption A, let the observations be i.i.d. with law P0P_0P0​, and suppose the population optimizer x⋆x^\starx⋆ is unique with Var⁡P0(ℓ(x⋆;ξ))>0\operatorname{Var}_{P_0}(\ell(x^\star;\xi))>0VarP0​​(ℓ(x⋆;ξ))>0. For ρ≥0\rho\ge0ρ≥0,

P∗ ⁣(Topt(P0)∈{Topt(p):Df(p∥P^n)≤ρ/n})⟶P(χ12≤ρ).P^*\!\left(T_{\rm opt}(P_0)\in\{T_{\rm opt}(p):D_f(p\|\widehat P_n)\le\rho/n\}\right)\longrightarrow P(\chi_1^2\le\rho).P∗(Topt​(P0​)∈{Topt​(p):Df​(p∥Pn​)≤ρ/n})⟶P(χ12​≤ρ).

The theorem calibrates the empirical likelihood confidence set for the optimal value with a one degree of freedom chi square law.

Formalization Note The variance condition is needed for the result to hold: a deterministic loss has coverage one but a nontrivial chi square target. The set uses weights on the sample, and P∗P^*P∗ is outer probability.

Preamble
import Mathlib
import Definitions.Def_GenEmpLik_Coverage_AssumptionA
import Definitions.Def_GenEmpLik_Coverage_AssumptionB
import Definitions.Def_GenEmpLik_Coverage_optimalValue
import Definitions.Def_GenEmpLik_Coverage_empiricalOptimalValue
import Definitions.Def_GenEmpLik_Coverage_divergenceBall
import Definitions.Def_GenEmpLik_Coverage_confidenceSet
import Definitions.Def_GenEmpLik_Coverage_influence
import Definitions.Def_GenEmpLik_Coverage_remainder
import Definitions.Def_GenEmpLik_Coverage_robustUpper
import Definitions.Def_GenEmpLik_Coverage_uniqueOptimizer
import Definitions.Def_VarianceRegularization_Expansion_empMean
import Definitions.Def_VarianceRegularization_Expansion_empVar

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace GenEmpLik.Coverage

/-- Theorem 3, p. 8: asymptotically exact coverage of the optimal value. -/
theorem theorem_3
    {Ω Ξ : Type*} [MeasurableSpace Ω] [MeasurableSpace Ξ]
    (μ : Measure Ω) [IsProbabilityMeasure μ]
    (ξ : ℕ → Ω → Ξ) (d : ℕ)
    (X : Set (EuclideanSpace ℝ (Fin d)))
    (ℓ : EuclideanSpace ℝ (Fin d) → Ξ → ℝ)
    (M : Ξ → ℝ) (f : ℝ → EReal) (ρ : ℝ)
    (hρ : 0 ≤ ρ) (hA : AssumptionA f)
    (hX : X.Nonempty) (hB : AssumptionB X ℓ M)
    (hℓmeas : ∀ x, Measurable (ℓ x))
    (hM2 : Integrable (fun z => M z ^ 2) (μ.map (ξ 0)))
    (hℓ2 : ∃ x0 ∈ X, Integrable (fun z => ℓ x0 z ^ 2) (μ.map (ξ 0)))
    (hξmeas : ∀ i, Measurable (ξ i))
    (hξindep : iIndepFun ξ μ)
    (hξident : ∀ i, IdentDistrib (ξ i) (ξ 0) μ μ)
    (hunique : HasUniqueOptimizer X ℓ (μ.map (ξ 0)))
    (hvar : 0 < variance (ℓ (uniqueOptimizer X ℓ (μ.map (ξ 0)) hunique))
      (μ.map (ξ 0))) :
    Tendsto (fun n : ℕ => μ {ω |
      optimalValue X ℓ (μ.map (ξ 0)) ∈
        confidenceSet X ℓ f ρ (fun i : Fin n => ξ i ω)})
      atTop (𝓝 (gaussianReal 0 1 {x : ℝ | x ^ 2 ≤ ρ})) := by sorry

end GenEmpLik.Coverage
Source
Duchi, Glynn & Namkoong, Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach, arXiv:1610.03425v3, p. 8, Theorem 3
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