Proposition 3.2 — exactness from conjugacy: is exact iff
ProvedRockafellianRelax.proposition_3_2optimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-optimizationvariational-analysis
Let be a Rockafellian for the problem of minimizing , with min-value function , and let . Then is exact, supported by , if and only if
Exactness is therefore tightness of the Rockafellian relaxation (3.2).
Differences from the source:
- encoding: ℝᵐ × ℝⁿ, values in R̄ = [−∞, ∞], ⟨y, u⟩ → (Fin m → ℝ) × (Fin n → ℝ) with the product topology, EReal, y ⬝ᵥ u; reason: Lean convention; same instances (the product topology has the same convergent sequences as the Euclidean norm)
Preamble
import Mathlib import Definitions.Def_RockafellianRelax_IsExact import Definitions.Def_RockafellianRelax_conj
Formal statement
namespace RockafellianRelax
/-- **Proposition 3.2 (exactness from conjugacy).** Royset, Chen & Eckstrand, arXiv:2204.04762v4,
Proposition 3.2, p.7: "Let f : ℝᵐ × ℝⁿ → R̄ be a Rockafellian for (3.1). Then f is exact, supported
by ȳ ∈ ℝᵐ, if and only if 𝒱(0) = −𝒱*(ȳ)."
**Formalization Note.** `𝒱 = minValue f`, `𝒱* = conj 𝒱`, values in `EReal`. -/
theorem proposition_3_2 {m n : ℕ} (f : (Fin m → ℝ) × (Fin n → ℝ) → EReal)
(φ : (Fin n → ℝ) → EReal) (hf : IsRockafellian f φ) (ybar : Fin m → ℝ) :
IsExact f φ ybar ↔ minValue f 0 = -(conj (minValue f) ybar) := by sorry
end RockafellianRelax
Source
Royset, Chen & Eckstrand, Rockafellian Relaxation and Stochastic Optimization under Perturbations, arXiv:2204.04762v4, Proposition 3.2, p.7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.