The recessive cone is independent of its base point and is a closed convex cone (Ben-Tal et al., Definition 11.3.1)
ProvedRobustOptimization.rec_cone_welldefinedconvex-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_welldefined {k : ℕ} (Q : Set (Fin k → ℝ)) (hcl : IsClosed Q)
(hcv : Convex ℝ Q) (x : Fin k → ℝ) (hx : x ∈ Q) :
(∀ x' ∈ Q, RecConeAt Q x' = RecConeAt Q x) ∧ (RecConeAt Q x).Nonempty ∧
IsClosed (RecConeAt Q x) ∧ Convex ℝ (RecConeAt Q x) ∧
(∀ c : ℝ, 0 ≤ c → ∀ h ∈ RecConeAt Q x, c • h ∈ RecConeAt Q x) := 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, Definition 11.3.1 and the parenthetical assertion following it, that the defining set is independent of the choice of the base point and is a nonempty closed convex cone. Source PDF sha256 b4aba60d1c863237fe4ee6ce4b62051d945cddbcb78523d03b06d6eff13a7c91.
Human review
Confirmed by the mission captain (proposal self-audit).