Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.13, p. 14 — x ∈ X^{N,2t}_{ε,(δ−β)} and ‖x − z‖∞ ≤ t/L give F^N_ε(−t; z) ≥ 1 − δ + β

Proved
SmoothCCP.Feasibility.transfer_step

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

finite-sample-feasibilitylipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1smoothing

Let Γε\Gamma_\varepsilonΓε​ be built from an admissible γε\gamma_\varepsilonγε​ and fix sample values ξ1,…,ξN\xi_1,\dots,\xi_Nξ1​,…,ξN​. Let L>0L>0L>0, t>0t>0t>0, and suppose CCC is LLL-Lipschitz in the sup norm at every drawn scenario:

∣C(x,ξi)−C(y,ξi)∣≤L∥x−y∥∞for all i and all x,y∈X.|C(x,\xi_i)-C(y,\xi_i)|\le L\|x-y\|_\infty\qquad\text{for all }i\text{ and all }x,y\in X.∣C(x,ξi​)−C(y,ξi​)∣≤L∥x−y∥∞​for all i and all x,y∈X.

If x∈Xε,(δ−β)N,2tx\in X^{N,2t}_{\varepsilon,(\delta-\beta)}x∈Xε,(δ−β)N,2t​, i.e. x∈Xx\in Xx∈X and FεN(−2t;x)≥1−δ+βF^N_\varepsilon(-2t;x)\ge1-\delta+\betaFεN​(−2t;x)≥1−δ+β, and z∈Xz\in Xz∈X satisfies ∥x−z∥∞≤t/L\|x-z\|_\infty\le t/L∥x−z∥∞​≤t/L, then

FεN(−t;z)≥1−δ+β.F^N_\varepsilon(-t;z)\ge 1-\delta+\beta .FεN​(−t;z)≥1−δ+β.

This is the step that transfers sample feasibility from an arbitrary point xxx to its representative zzz in the net, at the cost of halving the shift from 2t2t2t to ttt.

Formalization Note The paper's argument holds "w.p.1": Assumption 3.12 holds for almost every ξ\xiξ, hence almost surely at all drawn scenarios at once. This item is the deterministic core on one realisation of the sample, with Assumption 3.12 stated at the drawn points; the passage from almost-sure Lipschitz continuity to the drawn points is part of the proof of Theorem 3.13. Monotonicity of Γε\Gamma_\varepsilonΓε​ is not assumed; it follows from admissibility.

Preamble
import Mathlib
import Definitions.Def_SmoothCCP_Feasibility_Setting
open MeasureTheory
Formal statement
namespace SmoothCCP.Feasibility

theorem transfer_step {n N : ℕ} {Ξ : Type} (C : (Fin n → ℝ) → Ξ → ℝ) (X : Set (Fin n → ℝ))
    (ε : ℝ) (γ : ℝ → ℝ) (hγ : AdmissibleGamma ε γ) (ξs : Fin N → Ξ)
    (L t δ β : ℝ) (hL : 0 < L) (ht : 0 < t)
    (hLip : ∀ i, ∀ x ∈ X, ∀ y ∈ X, |C x (ξs i) - C y (ξs i)| ≤ L * ‖x - y‖)
    (x z : Fin n → ℝ) (hx : x ∈ sampleFeasible C X ε γ ξs (2 * t) (δ - β)) (hz : z ∈ X)
    (hxz : ‖x - z‖ ≤ t / L) :
    1 - δ + β ≤ sampleCdf C ε γ ξs (-t) z := by sorry

end SmoothCCP.Feasibility
Source
Peña-Ordieres, Luedtke, Wächter, Solving chance-constrained problems via a smooth sample-based nonlinear approximation, arXiv:1905.07377v2, proof of Theorem 3.13, p. 14, "Consider now any x ∈ X^{N,2t}_{ε,(δ−β)} … F^N_ε(−t; z) ≥ F^N_ε(−2t; x) ≥ 1 − δ + β w.p.1"; Assumption 3.12, p. 14
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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