Proposition 3.3 (second claim) — when , (3.3) implies exactness
ProvedRockafellianRelax.proposition_3_3_boptimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-optimizationvariational-analysis
Let be a Rockafellian for the problem of minimizing and . Suppose and that (3.3) holds:
Then is exact, supported by .
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_argmin import Definitions.Def_RockafellianRelax_tilt
Formal statement
namespace RockafellianRelax
/-- **Proposition 3.3, second claim: (3.3) gives exactness when argmin φ ≠ ∅.** Royset, Chen &
Eckstrand, arXiv:2204.04762v4, Proposition 3.3, p.7: "Suppose f : ℝᵐ×ℝⁿ → R̄ is a Rockafellian for
the problem (3.1) of minimizing φ : ℝⁿ → R̄. … When argmin_x φ(x) ≠ ∅, (3.3) conversely implies
exactness."
**Formalization Note.** (3.3) is `x⋆ ∈ argmin φ ⟹ (0, x⋆) ∈ argmin_{u,x} f(u, x) − ⟨ȳ, u⟩` for every
`x⋆`; every `argmin` carries the domain condition of p.6. -/
theorem proposition_3_3_b {m n : ℕ} (f : (Fin m → ℝ) × (Fin n → ℝ) → EReal)
(φ : (Fin n → ℝ) → EReal) (hf : IsRockafellian f φ) (ybar : Fin m → ℝ)
(hne : (argmin φ).Nonempty)
(h33 : ∀ xs : Fin n → ℝ, xs ∈ argmin φ → ((0 : Fin m → ℝ), xs) ∈ argmin (tilt f ybar)) :
IsExact f φ ybar := by sorry
end RockafellianRelax
Source
Royset, Chen & Eckstrand, Rockafellian Relaxation and Stochastic Optimization under Perturbations, arXiv:2204.04762v4, Proposition 3.3, p.7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.