Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, p. 36 — strong concavity and unique maximizer

Proved
OTDRO.StrongCvx.F_strongly_concave

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

distributionally-robust-optimizationoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexity

Assume Assumptions 1–3 and δ>0\delta>0δ>0. For P0P_0P0​-almost every xxx (one null set for all parameters), every nonzero β∈B\beta\in Bβ∈B and every λ>λthr′(β)\lambda>\lambda'_{\rm thr}(\beta)λ>λthr′​(β), the function γ↦F(γ,β,λ;x)\gamma\mapsto F(\gamma,\beta,\lambda;x)γ↦F(γ,β,λ;x) is strongly concave and has a unique maximizer. Its parameter pair belongs to the positive-curvature section U(x)U(x)U(x):

Γ∗(β,λ;x)={g(β,λ;x)},(β,λ)∈U(x).\Gamma^*(\beta,\lambda;x)=\{g(\beta,\lambda;x)\},\qquad (\beta,\lambda)\in U(x).Γ∗(β,λ;x)={g(β,λ;x)},(β,λ)∈U(x).

The unique scalar is the one used to express the pointwise Hessian and the bounds in Proposition 9.

Formalization Note Strong concavity is the standard interpolation inequality with a positive modulus. The printed statement includes β=0\beta=0β=0, where FFF is constant in γ\gammaγ and the conclusion fails; the nonzero condition is explicit.

Preamble
import Mathlib
import Definitions.Def_OTDRO_StrongCvx_Kernel
Formal statement
namespace OTDRO.StrongCvx

open MeasureTheory

/-- Lemma 8, p. 36. Strong concavity is written as its interpolation inequality,
including attainment, uniqueness, and membership in U(x). The P₀-null set is
uniform in (β, λ), as in the printed inclusion {(β, λ) : …} ⊆ U(x) for P₀-a.e. x.
β=0 is excluded because then F is constant in γ. -/
theorem F_strongly_concave {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) (M : ℝ) (h3 : Assumption3 P0 ℓ B M) :
    ∀ᵐ x ∂P0, ∀ β ∈ B, β ≠ 0 → ∀ lam : ℝ, OTDRO.Dual.lamThr' P0 A M δ β < lam →
      ∃ m : ℝ, 0 < m ∧
        (∀ γ₁ γ₂ t : ℝ, 0 ≤ t → t ≤ 1 →
          t * OTDRO.Dual.Fobj ℓ A δ γ₁ β lam x + (1 - t) * OTDRO.Dual.Fobj ℓ A δ γ₂ β lam x +
              m / 2 * t * (1 - t) * (γ₁ - γ₂) ^ 2 ≤
            OTDRO.Dual.Fobj ℓ A δ (t * γ₁ + (1 - t) * γ₂) β lam x) ∧
        (∃ γ : ℝ, OTDRO.Dual.maximizers ℓ A δ β lam x = {γ}) ∧
        (β, lam) ∈ UAt B ℓ A δ x := by sorry

end OTDRO.StrongCvx
Source
Blanchet, Murthy & Zhang, arXiv:1810.02403v3, Lemma 8, p. 36; proof p. 55
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