Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 12 (App. D.1.1), p. 47 — R_k(Z) = z₀ + (z₁ − z₀) sup{q ∈ [0,1] : (1−p)^{1−k}(1−q)^k + p^{1−k}q^k ≤ c_k^k}

Proved
UniformDRO.LowerBound.primal_two_point

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 and ck=(1+k(k−1)ρ)1/kc_k = (1 + k(k-1)\rho)^{1/k}ck​=(1+k(k−1)ρ)1/k. 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. Then

Rk(Z)=z0+(z1−z0) sup⁡{q∈[0,1]  :  (1−p)1−k(1−q)k+p1−kqk≤ckk}.\mathcal R_k(Z) = z_0 + (z_1 - z_0)\,\sup\Bigl\{ q \in [0,1] \;:\; (1-p)^{1-k}(1-q)^k + p^{1-k} q^k \le c_k^k \Bigr\}.Rk​(Z)=z0​+(z1​−z0​)sup{q∈[0,1]:(1−p)1−k(1−q)k+p1−kqk≤ckk​}.

The supremum runs over the mass qqq that an alternative distribution places on z1z_1z1​; the constraint is the Cressie–Read divergence condition Dfk(Q∥P)≤ρD_{f_k}(Q\|P) \le \rhoDfk​​(Q∥P)≤ρ for two-point laws, rewritten with ckk=1+k(k−1)ρc_k^k = 1 + k(k-1)\rhockk​=1+k(k−1)ρ. This primal formula is how the proof of Lemma 12 obtains the lower bound of the third claim.

Formalization Note. The page uses the formula for p∈(0,1)p \in (0,1)p∈(0,1), where the negative powers p1−kp^{1-k}p1−k and (1−p)1−k(1-p)^{1-k}(1−p)1−k are finite; the statement keeps that range (Lean's Real.rpow at base 000 would give a meaningless value). The set contains q=pq = pq=p and lies in [0,1][0,1][0,1], so the real supremum is genuine.

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

theorem primal_two_point (k ρ : ℝ) (hk : 1 < k) (hρ : 0 < ρ) (z₀ z₁ p : ℝ) (hz : z₀ ≤ z₁)
    (hp : p ∈ Set.Ioo (0 : ℝ) 1) :
    UniformDRO.Concentration.robustRisk k ρ (twoPointLaw z₀ z₁ p) id =
      z₀ + (z₁ - z₀) * sSup {q ∈ Set.Icc (0 : ℝ) 1 |
        (1 - p) ^ (1 - k) * (1 - q) ^ k + p ^ (1 - k) * q ^ k ≤ UniformDRO.Concentration.ck k ρ ^ k} := by sorry

end UniformDRO.LowerBound
Source
Duchi & Namkoong, arXiv:1810.08750v6, proof of Lemma 12 (App. D.1.1), p. 47, first display
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