The globalized robust counterpart of a conic constraint decomposes (Ben-Tal et al., Proposition 11.3.3), with the cones containing the origin
ProvedRobustOptimization.grc_conic_decomposition_v2Let be a closed convex set containing a point , equipped with a norm , and consider the uncertain conic constraint (11.1.4)
under a structured perturbation: the perturbation vector is split into blocks, block having a nonempty closed convex normal range , a closed convex cone (containing the origin), a norm and a global sensitivity . The globalized robust counterpart (11.1.6) of the constraint at requires, for every with for all ,
with of (11.1.5).
Proposition 11.3.3. satisfies the globalized robust counterpart if and only if (a) the nominal robust condition holds: for every with for all ; and (b) for every block and every with , , where is the recessive cone of (Definition 11.3.1).
Formalization Note. The retired version asked of each only closedness, convexity and closure under nonnegative scaling, which the empty set satisfies; with the premise of the counterpart is unsatisfiable, the counterpart holds vacuously and (a) can fail (accepted disproof). The new statement adds , so each is a closed convex cone in the book's sense (cones contain the origin); nothing else changed. Conventions kept from the retired version: norms are carried as functions with the norm axioms (IsNormOn); the distances are real infima, genuine because , and (under the counterpart's premise) the constraint set of are nonempty and the values are bounded below by ; is nonempty through the base point of its recessive cone. The mission this declaration belonged to was retired on 2026-09-21 and the series is being redrafted under the namespace RobustOpt; this corrected statement is supplied for completeness of the record.
import Definitions.Def_RobustOptimization_GRCConic import Mathlib open Matrix Finset
namespace RobustOptimization
/-- Ben-Tal, El Ghaoui & Nemirovski, *Robust Optimization* (2009), p. 284, Proposition 11.3.3:
the globalized robust counterpart (11.1.6) of the uncertain conic constraint (11.1.4), under the
structured perturbation `ζ ∈ Z + L` with blocks `(Zˢ, Lˢ, ‖·‖ₛ, αₛ)`, holds iff (a) the nominal
robust condition holds for every `ζ ∈ Z` and (b) for every block `s` and every `w ∈ Lˢ` with
`‖w‖ₛ ≤ 1`, the distance (in `‖·‖_Q`) from `∑_ℓ w_ℓ (P^{sℓ} y − p^{sℓ})` to the recessive cone
of `Q` is at most `αₛ`.
Corrected version: each `Lˢ` is a closed convex **cone**, which in the book's usage contains
the origin; the retired statement only asked for closedness, convexity and closure under
nonnegative scaling, which the empty set satisfies, making the counterpart vacuously true. -/
theorem grc_conic_decomposition_v2 {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) ∧ (0 : Fin (Ls s) → ℝ) ∈ 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