Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The globalized robust counterpart of a conic constraint decomposes (Ben-Tal et al., Proposition 11.3.3)

Disproved
RobustOptimization.grc_conic_decomposition

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationoperations-researchoptimization

Retired 2026-09-21. This declaration belongs to the first draft of the Ben-Tal, El Ghaoui and Nemirovski, Robust Optimization (2009) mission series (mission "Robust Optimization X: Globalized Robust Counterparts of Uncertain Conic Problems"), which was withdrawn in full. The series is being redrafted from the source under the namespace RobustOpt; build on those declarations, not on this one. The original statement and prose are preserved in the Prove2OR repository, branch textbook-sequential, under papers/ben-tal-2009-robust-optimization/retired/.


Retired. Retired because the hypothesis on the cones L^s admitted the empty set, for which the globalized robust counterpart is vacuously true while the nominal condition fails (accepted disproof); replaced by RobustOptimization.grc_conic_decomposition_v2 with 0 ∈ L^s. (The whole mission was withdrawn on 2026-09-21 and redrafted under RobustOpt.)

Preamble
import Definitions.Def_RobustOptimization_GRCConic
import Mathlib

open Matrix Finset
Formal statement
namespace RobustOptimization

theorem grc_conic_decomposition {k n S : ℕ} (Ls : Fin S → ℕ)
    (P0 : Matrix (Fin k) (Fin n) ℝ)
    (P : (s : Fin S) → Fin (Ls s) → Matrix (Fin k) (Fin n) ℝ)
    (p0 : Fin k → ℝ) (p : (s : Fin S) → Fin (Ls s) → Fin k → ℝ)
    (Q : Set (Fin k → ℝ)) (NQ : (Fin k → ℝ) → ℝ)
    (Z : (s : Fin S) → Set (Fin (Ls s) → ℝ)) (L : (s : Fin S) → Set (Fin (Ls s) → ℝ))
    (Ns : (s : Fin S) → (Fin (Ls s) → ℝ) → ℝ) (α : Fin S → ℝ)
    (hQcl : IsClosed Q) (hQcv : Convex ℝ Q) (x : Fin k → ℝ) (hx : x ∈ Q)
    (hNQ : IsNormOn NQ) (hNs : ∀ s, IsNormOn (Ns s))
    (hZ : ∀ s, IsClosed (Z s) ∧ Convex ℝ (Z s) ∧ (Z s).Nonempty)
    (hL : ∀ s, IsClosed (L s) ∧ Convex ℝ (L s) ∧
      ∀ c : ℝ, 0 ≤ c → ∀ z ∈ L s, c • z ∈ L s)
    (hα : ∀ s, 0 ≤ α s) (y : Fin n → ℝ) :
    ConicGRCFeasible Ls P0 P p0 p Q NQ Z L Ns α y ↔
      ((∀ ζ : (s : Fin S) → Fin (Ls s) → ℝ, (∀ s, ζ s ∈ Z s) →
          (P0.mulVec y - p0) + ∑ s, ∑ l, ζ s l • ((P s l).mulVec y - p s l) ∈ Q) ∧
        ∀ s : Fin S, ∀ w : Fin (Ls s) → ℝ, w ∈ L s → Ns s w ≤ 1 →
          distN NQ (RecConeAt Q x) (∑ l, w l • ((P s l).mulVec y - p s l)) ≤ α s) := by sorry

end RobustOptimization
Source
Aharon Ben-Tal, Laurent El Ghaoui and Arkadi Nemirovski, Robust Optimization, Princeton Series in Applied Mathematics, Princeton University Press, 2009, https://doi.org/10.1515/9781400831050, p. 284, Proposition 11.3.3 with the system (11.3.1) of p. 285; the uncertain constraint (11.1.4) and the globalized robust counterpart (11.1.6) are Definitions 11.1.1 and 11.1.2 of p. 282, and the recessive cone is Definition 11.3.1 of p. 284. Source PDF sha256 b4aba60d1c863237fe4ee6ce4b62051d945cddbcb78523d03b06d6eff13a7c91.
Human review
  • Endorsed by Shuze Chen · Sep 19, 2026

  • Endorsed by naimengye · Sep 19, 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