Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3.13 — ℙ(X^{N,2t}_{ε,(δ−β)} ⊆ X_α) ≥ 1 − ⌈1/β⌉⌈2LD/t⌉ⁿ exp{−2NM²} for bounded X and C Lipschitz in x

Proved
SmoothCCP.Feasibility.theorem_3_13

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

chance-constraintsfinite-sample-feasibilityhoeffdingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X⊆RnX\subseteq\mathbb R^nX⊆Rn be closed, α∈(0,1)\alpha\in(0,1)α∈(0,1), and let Γε\Gamma_\varepsilonΓε​ be built from an admissible γε\gamma_\varepsilonγε​. Let ξ1,…,ξN\xi_1,\dots,\xi_Nξ1​,…,ξN​ (N≥1N\ge1N≥1) be an i.i.d. sample with the law Pξ\mathbb P_\xiPξ​ of ξ\xiξ, and assume that C(x,ξ)C(x,\xi)C(x,ξ) has a continuous distribution for each x∈Xx\in Xx∈X (Assumption 3.1). Suppose:

  1. XXX is bounded with diameter D>0D>0D>0: ∥x−y∥∞≤D\|x-y\|_\infty\le D∥x−y∥∞​≤D for all x,y∈Xx,y\in Xx,y∈X;
  2. (Assumption 3.12) there is L>0L>0L>0 with ∣C(x,ξ)−C(y,ξ)∣≤L∥x−y∥∞|C(x,\xi)-C(y,\xi)|\le L\|x-y\|_\infty∣C(x,ξ)−C(y,ξ)∣≤L∥x−y∥∞​ for all x,y∈Xx,y\in Xx,y∈X, with probability one;
  3. (Assumption 3.7) t>0t>0t>0, δ∈(0,α]\delta\in(0,\alpha]δ∈(0,α], and M:=inf⁡x∈X(F(0;x)−Fε(−t;x)+(α−δ))>0M:=\inf_{x\in X}\bigl(F(0;x)-F_\varepsilon(-t;x)+(\alpha-\delta)\bigr)>0M:=infx∈X​(F(0;x)−Fε​(−t;x)+(α−δ))>0.

Then for every β∈(0,δ]\beta\in(0,\delta]β∈(0,δ],

P(Xε,(δ−β)N,2t⊆Xα)≥1−⌈1/β⌉ ⌈2LD/t⌉nexp⁡{−2NM2}.\mathbb P\bigl(X^{N,2t}_{\varepsilon,(\delta-\beta)}\subseteq X_\alpha\bigr)\ge 1-\lceil1/\beta\rceil\,\lceil 2LD/t\rceil^n\exp\{-2NM^2\}.P(Xε,(δ−β)N,2t​⊆Xα​)≥1−⌈1/β⌉⌈2LD/t⌉nexp{−2NM2}.

The theorem gives an explicit sample size under which every point accepted by the smoothed sample approximation, with shift 2t2t2t and risk level δ−β\delta-\betaδ−β, is feasible for the original chance-constrained problem with high probability, uniformly over a bounded, possibly infinite decision set.

Formalization Note The conclusion is stated in the complement form P(Xε,(δ−β)N,2t⊈Xα)≤⌈1/β⌉⌈2LD/t⌉ne−2NM2\mathbb P(X^{N,2t}_{\varepsilon,(\delta-\beta)}\not\subseteq X_\alpha)\le\lceil1/\beta\rceil\lceil2LD/t\rceil^n e^{-2NM^2}P(Xε,(δ−β)N,2t​⊆Xα​)≤⌈1/β⌉⌈2LD/t⌉ne−2NM2 with P\mathbb PP evaluated as an outer measure, because the event quantifies over uncountably many xxx and need not be measurable; this form implies the printed one. The norm is the sup norm of Fin n → ℝ. DDD is an upper bound on the sup-norm diameter and is required positive: at D=0D=0D=0 (one point) and n≥1n\ge1n≥1 the printed bound reads "≥1\ge1≥1", which fails when the point is infeasible; the bound increases in DDD, so for a set of positive diameter the two readings agree, and the sup-norm diameter never exceeds the Euclidean one. MMM is a positive lower bound of MxM_xMx​ on XXX, equivalent to the infimum since the bound decreases in MMM. Added relative to the page: C(x,⋅)C(x,\cdot)C(x,⋅) measurable for x∈Xx\in Xx∈X, and N≥1N\ge1N≥1. "With probability one" in Assumption 3.12 is over ξ∼Pξ\xi\sim\mathbb P_\xiξ∼Pξ​, with the quantifier over x,yx,yx,y inside.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

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

theorem theorem_3_13 {n N : ℕ} {Ξ Ω : Type} [MeasurableSpace Ξ] [MeasurableSpace Ω]
    (Pξ : Measure Ξ) [IsProbabilityMeasure Pξ] (P : Measure Ω) [IsProbabilityMeasure P]
    (ξ : Fin N → Ω → Ξ) (hξ : ∀ i, Measurable (ξ i)) (hind : ProbabilityTheory.iIndepFun ξ P)
    (hlaw : ∀ i, P.map (ξ i) = Pξ) (hN : 1 ≤ N)
    (C : (Fin n → ℝ) → Ξ → ℝ) (X : Set (Fin n → ℝ)) (hX : IsClosed X)
    (hC : ∀ x ∈ X, Measurable (C x)) (hcont : ∀ x ∈ X, ∀ y : ℝ, Pξ {s | C x s = y} = 0)
    (α ε : ℝ) (γ : ℝ → ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hγ : AdmissibleGamma ε γ)
    (D : ℝ) (hD : 0 < D) (hdiam : ∀ x ∈ X, ∀ y ∈ X, ‖x - y‖ ≤ D)
    (L : ℝ) (hL : 0 < L) (hLip : ∀ᵐ s ∂Pξ, ∀ x ∈ X, ∀ y ∈ X, |C x s - C y s| ≤ L * ‖x - y‖)
    (t δ M : ℝ) (ht : 0 < t) (hδ0 : 0 < δ) (hδα : δ ≤ α) (hM : 0 < M)
    (hMx : ∀ x ∈ X, M ≤ margin Pξ C ε γ t α δ x)
    (β : ℝ) (hβ0 : 0 < β) (hβδ : β ≤ δ) :
    P {ω | ¬ sampleFeasible C X ε γ (fun i => ξ i ω) (2 * t) (δ - β) ⊆ trueFeasible Pξ C X α}
      ≤ ENNReal.ofReal
          ((⌈1 / β⌉₊ : ℝ) * (⌈2 * L * D / t⌉₊ : ℝ) ^ n * Real.exp (-2 * (N : ℝ) * M ^ 2)) := 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, Theorem 3.13, p. 14 (Assumption 3.12, p. 14; Assumption 3.7, p. 11; Assumption 3.1, p. 9)
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me