Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 33 — uniform positive bounds on E[ℓ′²]

Proved
OTDRO.StrongCvx.ell_deriv_sq_bounds

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

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

Let P0P_0P0​ be a probability law, B⊆RdB\subseteq\mathbb R^dB⊆Rd nonempty, convex and compact, and let the loss satisfy Assumptions 2–3. There are positive constants L‾\underline LL​ and L‾\overline LL such that, for every β∈B\beta\in Bβ∈B,

L‾≤EP0 ⁣[ℓ′(βTX)2]≤L‾.\underline L\le\mathbb E_{P_0}\!\left[\ell'(\beta^{\mathsf T}X)^2\right]\le\overline L.L​≤EP0​​[ℓ′(βTX)2]≤L.

The bounds provide the constants that define the optimizer region and the strong-convexity radius.

Formalization Note Integrability of the squared derivative is stated along with its bounds, and nonemptiness of BBB makes its radius and the uniform bound nonvacuous.

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

open MeasureTheory

/-- Lemma 6, p. 33: the squared derivative has positive uniform lower
and finite upper expectation bounds over B. -/
theorem ell_deriv_sq_bounds {d : ℕ}
    (P0 : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure P0]
    (ℓ : ℝ → ℝ) (h2 : OTDRO.Dual.Assumption2 P0 ℓ)
    (B : Set (EuclideanSpace ℝ (Fin d))) (hB4 : Assumption4 B)
    (hBne : B.Nonempty) (M : ℝ) (h3 : Assumption3 P0 ℓ B M) :
    ∃ Llow Lbar : ℝ, DerivSqBounds P0 ℓ B Llow Lbar := by sorry

end OTDRO.StrongCvx
Source
Blanchet, Murthy & Zhang, arXiv:1810.02403v3, Lemma 6, p. 33
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