Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.6 — K2=⋂ζ∈ΣK2(ζ)K_2 = \bigcap_{\zeta \in \Sigma} K_2(\zeta)K2​=⋂ζ∈Σ​K2​(ζ) for every Σ\SigmaΣ with the same closed positive hull as Ξ~p,T\tilde\Xi_{p,T}Ξ~p,T​

Proved
Wets1974.Feasibility.K2_eq_iInter_of_closedPosHull_eq

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-conesfeasibilityp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1recoursestochastic-programming

Let WWW be a fixed mˉ×nˉ\bar m \times \bar nmˉ×nˉ matrix, μ\muμ the law of ξ=(c,q,p,T)\xi = (c, q, p, T)ξ=(c,q,p,T), Ξ~p,T\tilde\Xi_{p,T}Ξ~p,T​ the support of the marginal law of (p,T)(p, T)(p,T), and K2=⋂ζ∈Ξ~p,TK2(ζ)K_2 = \bigcap_{\zeta \in \tilde\Xi_{p,T}} K_2(\zeta)K2​=⋂ζ∈Ξ~p,T​​K2​(ζ) with K2(ζ)={x∣p−Tx∈pos⁡W}K_2(\zeta) = \{x \mid p - Tx \in \operatorname{pos} W\}K2​(ζ)={x∣p−Tx∈posW} for ζ=(p,T)\zeta = (p,T)ζ=(p,T). For a set SSS of (p,T)(p,T)(p,T)-space write pos⁡(S)\operatorname{pos}(S)pos(S) for its closed positive hull, the closure of the set of nonnegative linear combinations of points of SSS.

If Σ\SigmaΣ is any set of (p,T)(p,T)(p,T)-space with pos⁡(Σ)=pos⁡(Ξ~p,T)\operatorname{pos}(\Sigma) = \operatorname{pos}(\tilde\Xi_{p,T})pos(Σ)=pos(Ξ~p,T​), then

K2=⋂ζ∈ΣK2(ζ).K_2 = \bigcap_{\zeta \in \Sigma} K_2(\zeta).K2​=ζ∈Σ⋂​K2​(ζ).

The theorem allows the support in the definition of K2K_2K2​ to be replaced by any set generating the same closed cone: its closure, its convex hull, its positive hull, positive multiples of its points, a dense subset, a generating set, or the extreme points of a compact support. The paper uses it with Σ\SigmaΣ the closed convex hull of the support in the proof of Theorem 4.10.

Formalization Note. The paper states the theorem for "a set obtained from Ξ~p,T\tilde\Xi_{p,T}Ξ~p,T​ by applying the operations: topological closure, convex closure, positive closure, positive scalar multiplication or any of the (not necessarily unique) inverses of these operations", with the inverse of convex closure yielding the extreme points. Read literally this is false: if Ξ~p,T\tilde\Xi_{p,T}Ξ~p,T​ is a closed half-plane it has no extreme points, so Σ=∅\Sigma = \emptysetΣ=∅ and ⋂ζ∈∅K2(ζ)=Rn≠K2\bigcap_{\zeta \in \emptyset} K_2(\zeta) = \mathbb{R}^n \ne K_2⋂ζ∈∅​K2​(ζ)=Rn=K2​ in general. This statement is the reading the paper's proof supports ("pos WWW is closed … pos WWW is a convex cone"): every such operation, and every inverse that preserves the closed positive hull, is covered.

Preamble
import Mathlib
import Definitions.Def_Wets1974_Feasibility_Model
Formal statement
namespace Wets1974.Feasibility

open MeasureTheory

/-- Theorem 4.6, pp. 316-317, in the reading its proof supports: for every set `Σ` of
`(p, T)`-space whose closed positive hull equals that of `Ξ̃_{p,T}`,
`K₂ = ⋂_{ζ ∈ Σ} K₂(ζ)`. -/
theorem K2_eq_iInter_of_closedPosHull_eq {n nb mb : ℕ} (μ : Measure (DataSpace n nb mb))
    [IsProbabilityMeasure μ] (W : Matrix (Fin mb) (Fin nb) ℝ)
    (Sig : Set (PTSpace n mb)) (hSig : closedPosHull Sig = closedPosHull (suppPT μ)) :
    K2 μ W = ⋂ ζ ∈ Sig, K2of W ζ := by sorry

end Wets1974.Feasibility
Source
Wets, Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program, SIAM Review 16(3), 1974, pp. 316-317, Theorem 4.6 (corrected reading: same closed positive hull)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

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