The globalized robust counterpart of a conic constraint decomposes (Ben-Tal et al., Proposition 11.3.3)
DisprovedRobustOptimization.grc_conic_decompositionRetired 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.)
import Definitions.Def_RobustOptimization_GRCConic import Mathlib open Matrix Finset
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
Confirmed by the mission captain (proposal self-audit).