Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 12 (third claim), p. 45 — if p ≤ p_k ∧ (1 − (1−β)^{1−k*} p_k), R_k(Z) ≥ β^{1/k} c_k p^{1/k*} z₁ + (1 − β^{1/k} c_k p^{1/k*}) z₀

Proved
UniformDRO.LowerBound.lemma_12_c

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

cressie-readdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k>1k > 1k>1, ρ>0\rho > 0ρ>0, k∗=k/(k−1)k_* = k/(k-1)k∗​=k/(k−1), ck=(1+k(k−1)ρ)1/kc_k = (1 + k(k-1)\rho)^{1/k}ck​=(1+k(k−1)ρ)1/k and pk=ck−k/(k−1)p_k = c_k^{-k/(k-1)}pk​=ck−k/(k−1)​. Let z0≤z1z_0 \le z_1z0​≤z1​, p∈[0,1]p \in [0,1]p∈[0,1], and let Z=z0Z = z_0Z=z0​ with probability 1−p1-p1−p and Z=z1Z = z_1Z=z1​ with probability ppp. If, for some β∈(0,1)\beta \in (0,1)β∈(0,1),

p≤pk∧(1−(1−β)1−k∗pk),p \le p_k \wedge \bigl(1 - (1-\beta)^{1-k_*} p_k\bigr),p≤pk​∧(1−(1−β)1−k∗​pk​),

then

Rk(Z)≥β1/kck p1/k∗ z1+(1−β1/kck p1/k∗)z0.\mathcal R_k(Z) \ge \beta^{1/k} c_k\, p^{1/k_*}\, z_1 + \bigl(1 - \beta^{1/k} c_k\, p^{1/k_*}\bigr) z_0 .Rk​(Z)≥β1/kck​p1/k∗​z1​+(1−β1/kck​p1/k∗​)z0​.

Together with the second claim this pins the robust risk of a two-point law with small mass ppp at its larger value to within a constant factor of ckp1/k∗(z1−z0)c_k p^{1/k_*}(z_1 - z_0)ck​p1/k∗​(z1​−z0​) above z0z_0z0​. It gives the separation in the n−1/k∗n^{-1/k_*}n−1/k∗​ branch of Theorem 3.

Formalization Note. β\betaβ is arbitrary in (0,1)(0,1)(0,1), as on the page; Theorem 3 uses β=βk\beta = \beta_kβ=βk​. Real powers are Real.rpow; the base 1−β1 - \beta1−β of the negative power 1−k∗1 - k_*1−k∗​ is positive.

Preamble
import Mathlib
import Definitions.Def_UniformDRO_LowerBound_Setting
Formal statement
namespace UniformDRO.LowerBound

theorem lemma_12_c (k ρ : ℝ) (hk : 1 < k) (hρ : 0 < ρ) (z₀ z₁ p : ℝ) (hz : z₀ ≤ z₁)
    (hp : p ∈ Set.Icc (0 : ℝ) 1) (β : ℝ) (hβ : β ∈ Set.Ioo (0 : ℝ) 1) (hp1 : p ≤ pk k ρ)
    (hp2 : p ≤ 1 - (1 - β) ^ (1 - UniformDRO.Concentration.kstar k) * pk k ρ) :
    β ^ (1 / k) * UniformDRO.Concentration.ck k ρ * p ^ (1 / UniformDRO.Concentration.kstar k) * z₁ +
        (1 - β ^ (1 / k) * UniformDRO.Concentration.ck k ρ * p ^ (1 / UniformDRO.Concentration.kstar k)) * z₀ ≤
      UniformDRO.Concentration.robustRisk k ρ (twoPointLaw z₀ z₁ p) id := by sorry

end UniformDRO.LowerBound
Source
Duchi & Namkoong, arXiv:1810.08750v6, Lemma 12 (third claim), p. 45; proof App. D.1.1, p. 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