Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3(a), p. 32 — every g ∈ Γ* satisfies √δ|g|βᵀA(x)⁻¹β ≤ 1 + C₁ε⁻¹(1 + |βᵀx|) once λ ≥ (κ + ε)√δβᵀA(x)⁻¹β

Proved
OTDRO.WorstCase.maximizers_bounded

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

compactnessdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume Assumptions 1 and 2, δ>0\delta>0δ>0 and B⊆RdB\subseteq\mathbb R^dB⊆Rd convex, and let κ\kappaκ be the growth exponent of ℓ\ellℓ. For every ε>0\varepsilon>0ε>0, x∈Rdx\in\mathbb R^dx∈Rd, β∈B\beta\in Bβ∈B and λ≥(κ+ε)δ βTA(x)−1β\lambda\ge(\kappa+\varepsilon)\sqrt\delta\,\beta^{\mathsf T}A(x)^{-1}\betaλ≥(κ+ε)δ​βTA(x)−1β, there is a constant C1>0C_1>0C1​>0 such that every maximizer g∈Γ∗(β,λ;x)g\in\Gamma^*(\beta,\lambda;x)g∈Γ∗(β,λ;x) of γ↦F(γ,β,λ;x)\gamma\mapsto F(\gamma,\beta,\lambda;x)γ↦F(γ,β,λ;x) satisfies

δ ∣g∣ βTA(x)−1β ≤ 1+C1ε−1(1+∣βTx∣).\sqrt\delta\,|g|\,\beta^{\mathsf T}A(x)^{-1}\beta\ \le\ 1+C_1\varepsilon^{-1}\bigl(1+|\beta^{\mathsf T}x|\bigr).δ​∣g∣βTA(x)−1β ≤ 1+C1​ε−1(1+∣βTx∣).

The bound shows that the maximizer set is bounded, hence compact, as soon as λ\lambdaλ exceeds the threshold, and that the worst-case displacement grows at most linearly in ∣βTx∣|\beta^{\mathsf T}x|∣βTx∣. It is what makes the extreme points inf⁡\infinf and sup⁡\supsup of γ2\gamma^2γ2 over Γ∗\Gamma^*Γ∗ attained in the proof of Theorem 6(c), and what makes the moments E[G±2βTA(X)−1β]E[G_\pm^2\beta^{\mathsf T}A(X)^{-1}\beta]E[G±2​βTA(X)−1β] finite.

Formalization Note The constant C1C_1C1​ is quantified after ε\varepsilonε, xxx, β\betaβ and λ\lambdaλ, as in the printed lemma. Only part (a) of Lemma 3 is formalized here; part (b) is in the sibling mission on convexity of the dual objective.

Preamble
import Mathlib
import Definitions.Def_OTDRO_Dual_Setting

open MeasureTheory
Formal statement
namespace OTDRO.WorstCase

/-- **Lemma 3(a)** (arXiv:1810.02403v3, p. 32; proof p. 47), with the constant `C₁` chosen after
`ε`, `x`, `β` and `λ`, as the printed lemma states: if
`λ ≥ (κ + ε)√δ βᵀA(x)⁻¹β`, every `g ∈ Γ*(β, λ; x)` satisfies
`√δ |g| βᵀA(x)⁻¹β ≤ 1 + C₁ ε⁻¹ (1 + |βᵀx|)`. -/
theorem maximizers_bounded {d : ℕ} (P0 : Measure (EuclideanSpace ℝ (Fin d)))
    [IsProbabilityMeasure P0] (A : EuclideanSpace ℝ (Fin d) → Matrix (Fin d) (Fin d) ℝ)
    (ρmin ρmax : ℝ) (hA : OTDRO.Dual.Assumption1 P0 A ρmin ρmax) (ℓ : ℝ → ℝ) (h2 : OTDRO.Dual.Assumption2 P0 ℓ)
    (δ : ℝ) (hδ : 0 < δ) (B : Set (EuclideanSpace ℝ (Fin d))) (hB : Convex ℝ B) :
    ∀ ε : ℝ, 0 < ε → ∀ x : EuclideanSpace ℝ (Fin d), ∀ β ∈ B, ∀ lam : ℝ,
      (OTDRO.Dual.growthKappa ℓ + ε) * Real.sqrt δ * OTDRO.Dual.quadInv A β x ≤ lam →
      ∃ C1 : ℝ, 0 < C1 ∧
        ∀ g ∈ OTDRO.Dual.maximizers ℓ A δ β lam x,
          Real.sqrt δ * |g| * OTDRO.Dual.quadInv A β x ≤ 1 + C1 * ε⁻¹ * (1 + |inner ℝ β x|) := by sorry

end OTDRO.WorstCase
Source
arXiv:1810.02403v3, Lemma 3(a), p. 32; proof p. 47
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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