Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.2, p. 27 — B(D(λ), D_tr) ≤ λB(D, D_tr) + (1−λ)B(D_tr, D_tr) < r along D(λ) = λD + (1−λ)D_tr

Proved
BootRobust.Optimality.bootDist_segment_le

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

convexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relative-entropy

Let D,Dtr∈DnD,D_{\rm tr}\in\mathcal D_nD,Dtr​∈Dn​ with DtrD_{\rm tr}Dtr​ having all coordinates positive, let λ∈[0,1]\lambda\in[0,1]λ∈[0,1] and D(λ)=λD+(1−λ)DtrD(\lambda)=\lambda D+(1-\lambda)D_{\rm tr}D(λ)=λD+(1−λ)Dtr​. Then

  1. B(D(λ),Dtr)≤λ B(D,Dtr)+(1−λ) B(Dtr,Dtr)B(D(\lambda),D_{\rm tr})\le\lambda\,B(D,D_{\rm tr})+(1-\lambda)\,B(D_{\rm tr},D_{\rm tr})B(D(λ),Dtr​)≤λB(D,Dtr​)+(1−λ)B(Dtr​,Dtr​);
  2. B(Dtr,Dtr)=0B(D_{\rm tr},D_{\rm tr})=0B(Dtr​,Dtr​)=0;
  3. if moreover B(D,Dtr)=rB(D,D_{\rm tr})=rB(D,Dtr​)=r with r>0r>0r>0 and λ∈(0,1)\lambda\in(0,1)λ∈(0,1), then
B(D(λ),Dtr)<r.B(D(\lambda),D_{\rm tr})<r.B(D(λ),Dtr​)<r.

This is the convexity step of the proof of Proposition 1: moving from DDD towards DtrD_{\rm tr}Dtr​ strictly lowers the bootstrap distance below rrr.

Formalization Note BBB is extended-real valued; with Dtr>0D_{\rm tr}>0Dtr​>0 every value here is finite. The condition r>0r>0r>0 in item 3 is needed for the strict inequality and holds in Proposition 1.

Preamble
import Mathlib
import Definitions.Def_BootRobust_Optimality_Setting
Formal statement
namespace BootRobust.Optimality

/-- B.2, p. 27, the convexity step: along the segment `D(λ) = λ D + (1 - λ) D_tr`, `λ ∈ [0, 1]`,
`B(D(λ), D_tr) ≤ λ B(D, D_tr) + (1 - λ) B(D_tr, D_tr)`, and `B(D_tr, D_tr) = 0`; hence, if
`B(D, D_tr) = r` with `r > 0` and `λ ∈ (0, 1)`, then `B(D(λ), D_tr) < r`. -/
theorem bootDist_segment_le {ι : Type*} [Fintype ι] [DecidableEq ι]
    (D Dtr : ι → ℝ) (hD : D ∈ stdSimplex ℝ ι) (hDtr : Dtr ∈ stdSimplex ℝ ι)
    (hDtrpos : ∀ i, 0 < Dtr i) (lam : ℝ) (hlam : lam ∈ Set.Icc (0 : ℝ) 1) :
    BootRobust.Perf.bootDist (lam • D + (1 - lam) • Dtr) Dtr ≤
        (lam : EReal) * BootRobust.Perf.bootDist D Dtr + ((1 - lam : ℝ) : EReal) * BootRobust.Perf.bootDist Dtr Dtr ∧
      BootRobust.Perf.bootDist Dtr Dtr = 0 ∧
      ∀ r : ℝ, BootRobust.Perf.bootDist D Dtr = (r : EReal) → 0 < r → lam ∈ Set.Ioo (0 : ℝ) 1 →
        BootRobust.Perf.bootDist (lam • D + (1 - lam) • Dtr) Dtr < (r : EReal) := by sorry

end BootRobust.Optimality
Source
Bertsimas and Van Parys, Bootstrap robust prescriptive analytics, arXiv:1711.09974v2, B.2 (proof of Proposition 1), p. 27, "From convexity of B we have …"
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