Theorem 3.13 — ℙ(X^{N,2t}_{ε,(δ−β)} ⊆ X_α) ≥ 1 − ⌈1/β⌉⌈2LD/t⌉ⁿ exp{−2NM²} for bounded X and C Lipschitz in x
ProvedSmoothCCP.Feasibility.theorem_3_13Let be closed, , and let be built from an admissible . Let () be an i.i.d. sample with the law of , and assume that has a continuous distribution for each (Assumption 3.1). Suppose:
- is bounded with diameter : for all ;
- (Assumption 3.12) there is with for all , with probability one;
- (Assumption 3.7) , , and .
Then for every ,
The theorem gives an explicit sample size under which every point accepted by the smoothed sample approximation, with shift and risk level , 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 with evaluated as an outer measure, because the event quantifies over uncountably many and need not be measurable; this form implies the printed one. The norm is the sup norm of Fin n → ℝ. is an upper bound on the sup-norm diameter and is required positive: at (one point) and the printed bound reads "", which fails when the point is infeasible; the bound increases in , so for a set of positive diameter the two readings agree, and the sup-norm diameter never exceeds the Euclidean one. is a positive lower bound of on , equivalent to the infimum since the bound decreases in . Added relative to the page: measurable for , and . "With probability one" in Assumption 3.12 is over , with the quantifier over 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.
import Mathlib import Definitions.Def_SmoothCCP_Feasibility_Setting open MeasureTheory
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.