Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3 — ∅≠int⁡K⊂KP⊂K\emptyset\ne\operatorname{int}\mathcal K\subset\mathcal K_{\mathbb P}\subset\mathcal K∅=intK⊂KP​⊂K

Proved
PrimalDualLDR.FixedRecourse.proposition_3

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

convex-conesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Assume the standing assumptions of §2. Consider the two convex cones in Rk\mathbb R^kRk

K:={z∈Rk:(W−he1⊤)z≥0},\mathcal K := \big\{z \in \mathbb R^k : (W - h e_1^\top) z \ge 0\big\},K:={z∈Rk:(W−he1⊤​)z≥0}, KP:={z∈Rk:∃s∈Lk,12 with E(s(ξ)ξ)=z and s(ξ)≥0 P-a.s.}.\mathcal K_{\mathbb P} := \big\{z \in \mathbb R^k : \exists s \in \mathcal L^2_{k,1} \text{ with } \mathbb E(s(\xi)\xi) = z \text{ and } s(\xi) \ge 0\ \mathbb P\text{-a.s.}\big\}.KP​:={z∈Rk:∃s∈Lk,12​ with E(s(ξ)ξ)=z and s(ξ)≥0 P-a.s.}.

Then

∅≠int⁡K⊆KP⊆K.\emptyset \ne \operatorname{int}\mathcal K \subseteq \mathcal K_{\mathbb P} \subseteq \mathcal K .∅=intK⊆KP​⊆K.

This is the dual counterpart of Proposition 1. KP\mathcal K_{\mathbb P}KP​ is the set of first-order moment vectors of nonnegative square-integrable densities, a moment-feasibility condition that looks intractable; the proposition sandwiches it between the polyhedral cone K\mathcal KK and its interior, which lets the last constraint of (2.6) be replaced by the finitely many linear constraints of (2.8).

Formalization Note int⁡\operatorname{int}int is the topological interior in Rk\mathbb R^kRk (product topology on Fin k → ℝ). The inclusions "⊂\subset⊂" are non-strict, as in the paper. Lk,12\mathcal L^2_{k,1}Lk,12​ consists of Borel measurable square-integrable real-valued functions. Repaired statement: the formal statement adds the hypothesis W^≠0\widehat W \ne 0W=0 (some row i≥3i \ge 3i≥3 of WWW, 1-based, is nonzero), which the paper does not state. Without it the printed proposition is false: for k=1k = 1k=1, l=2l = 2l=2, W=(1,−1)⊤W = (1,-1)^\topW=(1,−1)⊤, h=(1,−1)⊤h = (1,-1)^\toph=(1,−1)⊤, P=δ1\mathbb P = \delta_1P=δ1​, all standing assumptions hold, W−he1⊤=0W - he_1^\top = 0W−he1⊤​=0, so K=R\mathcal K = \mathbb RK=R while KP=[0,∞)\mathcal K_{\mathbb P} = [0,\infty)KP​=[0,∞). (The proof drops the constraint e1⊤z≥0e_1^\top z \ge 0e1⊤​z≥0 as redundant, which fails exactly when W^=0\widehat W = 0W=0.) Under the standing assumptions W^≠0\widehat W \ne 0W=0 holds automatically when k≥2k \ge 2k≥2, since Ξ\XiΞ is bounded.

Preamble
import Mathlib
import Definitions.Def_PrimalDualLDR_FixedRecourse_Basic
import Definitions.Def_PrimalDualLDR_FixedRecourse_Setting
import Definitions.Def_PrimalDualLDR_FixedRecourse_Problems

open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.FixedRecourse

/-- Proposition 3 (p. 7): under the standing assumptions of §2, the cones
`𝒦 = {z : (W − h e_1ᵀ) z ≥ 0}` and `𝒦_P = {E(s(ξ)ξ) : s ∈ 𝓛²_{k,1}, s ≥ 0 P-a.s.}` satisfy
`∅ ≠ int 𝒦 ⊂ 𝒦_P ⊂ 𝒦`.

Repair (trap 30): the hypothesis `hW` says `Ŵ ≠ 0` (some row `i ≥ 2` of `W` is nonzero; rows
`0`, `1` are `±e_1ᵀ`). The page omits it, and the printed statement is false without it: for
`k = 1`, `l = 2`, `W = (1, −1)ᵀ`, `h = (1, −1)`, `P = δ_1`, the matrix `W − h e_1ᵀ` is `0`, so
`𝒦 = ℝ` while `𝒦_P = [0, ∞)`. Under the standing assumptions `Ŵ ≠ 0` is automatic when `k ≥ 2`. -/
theorem proposition_3 (σ : Setting) (hσ : σ.Standing)
    (hW : ∃ i : Fin σ.l, 2 ≤ i.val ∧ σ.W i ≠ 0) :
    (interior σ.coneK).Nonempty ∧ interior σ.coneK ⊆ σ.coneKP ∧ σ.coneKP ⊆ σ.coneK := by sorry

end PrimalDualLDR.FixedRecourse
Source
Kuhn, Wiesemann, Georghiou, Primal and dual linear decision rules in stochastic and robust optimization, Optimization Online 2009/02/2218, p. 7, Proposition 3
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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