The recessive cone in the three cases that occur (Ben-Tal et al., Example 11.3.2(i)-(iii))
ProvedRobustOptimization.rec_cone_examplesconvex-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, 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/.
Preamble
import Definitions.Def_RobustOptimization_GRCConic import Mathlib open Matrix Finset
Formal statement
namespace RobustOptimization
theorem rec_cone_examples {k : ℕ} (Q : Set (Fin k → ℝ)) (hcl : IsClosed Q)
(hcv : Convex ℝ Q) (x : Fin k → ℝ) (hx : x ∈ Q) :
(Bornology.IsBounded Q → RecConeAt Q x = {0}) ∧
((∀ c : ℝ, 0 ≤ c → ∀ z ∈ Q, c • z ∈ Q) → RecConeAt Q x = Q) ∧
(∀ (m : ℕ) (A : Matrix (Fin m) (Fin k) ℝ) (b : Fin m → ℝ) (K : Set (Fin m → ℝ)),
IsClosed K → Convex ℝ K → (∀ c : ℝ, 0 ≤ c → ∀ z ∈ K, c • z ∈ K) →
Q = {u | A.mulVec u - b ∈ K} → RecConeAt Q x = {h | A.mulVec h ∈ K}) := by sorry
end RobustOptimizationSource
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, Example 11.3.2, items (i), (ii) and (iii). Source PDF sha256 b4aba60d1c863237fe4ee6ce4b62051d945cddbcb78523d03b06d6eff13a7c91.
Human review
Confirmed by the mission captain (proposal self-audit).