Proposition 3.3, p. 14 — epi-convergence: limsup of infima, limits of minimizers, minimum attained in the closure of D
ProvedDupacovaWets.Consistency.epiConverges_inf_argminepi-convergencep2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1variational-analysis
Let with . Then:
- the optimal values satisfy
- if along a subsequence and , then and ;
- in particular, if a bounded set meets for every along some subsequence, then attains its minimum at a point of the closure of .
This deterministic proposition (attributed in the paper to Attouch and Wets 1981 and Salinetti and Wets 1986) is the bridge from epi-convergence of objectives to convergence of optimal values and solutions; Theorem 3.9 applies it pathwise.
Formalization Note Functions are EReal-valued on EuclideanSpace ℝ (Fin n); a subsequence is a strictly increasing and the convergence of infima is in the order topology of . The "Moreover" equivalence that follows on p. 14 is not part of this item.
Preamble
import Mathlib import Definitions.Def_DupacovaWets_Consistency_ExtendedFunctions open Filter Topology
Formal statement
namespace DupacovaWets.Consistency
/-- Dupačová–Wets (WP-86-41), p. 14, Proposition 3.3 (through "closure of D"): if
`g = epi-lim g^ν`, then (3.9) `limsup (inf g^ν) ≤ inf g`; if `x^k ∈ argmin g^{ν_k}` along a
subsequence and `x^k → x`, then `x ∈ argmin g` and `inf g^{ν_k} → inf g`; and if a bounded
`D` meets `argmin g^{ν_k}` for every `k` along a subsequence, then `g` attains its minimum at
a point of the closure of `D`. -/
theorem epiConverges_inf_argmin {n : ℕ} (g : ℕ → EuclideanSpace ℝ (Fin n) → EReal)
(g₀ : EuclideanSpace ℝ (Fin n) → EReal) (hg : EpiConverges g g₀) :
limsup (fun k => ⨅ x, g k x) atTop ≤ ⨅ x, g₀ x ∧
(∀ φ : ℕ → ℕ, StrictMono φ → ∀ (xs : ℕ → EuclideanSpace ℝ (Fin n))
(x : EuclideanSpace ℝ (Fin n)), (∀ k, xs k ∈ argminSet (g (φ k))) →
Tendsto xs atTop (𝓝 x) →
x ∈ argminSet g₀ ∧ Tendsto (fun k => ⨅ y, g (φ k) y) atTop (𝓝 (⨅ y, g₀ y))) ∧
(∀ D : Set (EuclideanSpace ℝ (Fin n)), Bornology.IsBounded D → ∀ φ : ℕ → ℕ, StrictMono φ →
(∀ k, (argminSet (g (φ k)) ∩ D).Nonempty) → ∃ x ∈ closure D, x ∈ argminSet g₀) := by sorry
end DupacovaWets.Consistency
Source
Dupačová & Wets, IIASA Working Paper WP-86-41 (Aug. 1986), p. 14, Proposition 3.3, (3.9) through 'closure of D'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.