Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.3, p. 14 — epi-convergence: limsup of infima, limits of minimizers, minimum attained in the closure of D

Proved
DupacovaWets.Consistency.epiConverges_inf_argmin

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

epi-convergencep2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1variational-analysis

Let gν,g:Rn→[−∞,∞]g^\nu, g:\mathbb R^n\to[-\infty,\infty]gν,g:Rn→[−∞,∞] with g=epi-lim⁡ν→∞gνg=\operatorname{epi-lim}_{\nu\to\infty}g^\nug=epi-limν→∞​gν. Then:

  1. the optimal values satisfy
lim sup⁡ν→∞ (inf⁡gν)≤inf⁡g;(3.9)\limsup_{\nu\to\infty}\,(\inf g^\nu)\le\inf g; \tag{3.9}ν→∞limsup​(infgν)≤infg;(3.9)
  1. if xk∈argmin⁡gνkx^k\in\operatorname{argmin} g^{\nu_k}xk∈argmingνk​ along a subsequence ν1<ν2<⋯\nu_1<\nu_2<\cdotsν1​<ν2​<⋯ and xk→xx^k\to xxk→x, then x∈argmin⁡gx\in\operatorname{argmin} gx∈argming and inf⁡gνk→inf⁡g\inf g^{\nu_k}\to\inf ginfgνk​→infg;
  2. in particular, if a bounded set D⊆RnD\subseteq\mathbb R^nD⊆Rn meets argmin⁡gνk\operatorname{argmin} g^{\nu_k}argmingνk​ for every kkk along some subsequence, then ggg attains its minimum at a point of the closure of DDD.

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 φ:N→N\varphi:\mathbb N\to\mathbb Nφ:N→N and the convergence of infima is in the order topology of [−∞,∞][-\infty,\infty][−∞,∞]. 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
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me