Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.9, p. 20 — under Assumptions 1–3, f_k^primal ↘ f⋆ and f_k^dual ↘ f⋆, and limits of dual minimizers give global minimizers

Proved
RobustPMI.Hierarchy.theorem_4_9

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-optimizationrobust-optimizationsemidefinite-programmingsum-of-squares

This is the asymptotic convergence theorem for the moment-SOS hierarchy (4.4)–(4.5) of the robust polynomial matrix inequality problem

f⋆=inf⁡y∈Yf(y)s.t.P(y,x)⪰0  ∀x∈X.f^\star=\inf_{y\in\mathcal Y}f(y)\quad\text{s.t.}\quad P(y,x)\succeq0\ \ \forall x\in\mathcal X .f⋆=y∈Yinf​f(y)s.t.P(y,x)⪰0  ∀x∈X.

Suppose (RPMIO) has an optimal solution and Assumptions 1–3 hold: fff, −θ1,…,−θs-\theta_1,\dots,-\theta_s−θ1​,…,−θs​ are SOS-convex, −P(⋅,x)-P(\cdot,x)−P(⋅,x) is PSD-SOS-convex for every x∈Xx\in\mathcal Xx∈X, X\mathcal XX is compact, the quadratic module of GGG is Archimedean in the sense of Assumption 2, and Slater's condition holds. Then:

  1. fkprimal↘f⋆f^{\mathrm{primal}}_k\searrow f^\starfkprimal​↘f⋆ and fkdual↘f⋆f^{\mathrm{dual}}_k\searrow f^\starfkdual​↘f⋆ as k→∞k\to\inftyk→∞: both sequences are non-increasing for k≥⌈kx/2⌉k\ge\lceil k_x/2\rceilk≥⌈kx​/2⌉ and converge to f⋆f^\starf⋆.
  2. Let s(k,⋆)s^{(k,\star)}s(k,⋆) be a minimizer of (4.5) at order kkk. For any convergent subsequence (s(ki,⋆))i(s^{(k_i,\star)})_i(s(ki​,⋆))i​ with limit s⋆s^\stars⋆, the point se⋆=lim⁡ise(ki,⋆)s^\star_e=\lim_i s^{(k_i,\star)}_ese⋆​=limi​se(ki​,⋆)​ is a global minimizer of (RPMIO).
  3. Consequently, if (RPMIO) has a unique global minimizer y⋆y^\stary⋆, then lim⁡k→∞se(k,⋆)=y⋆\lim_{k\to\infty}s^{(k,\star)}_e=y^\starlimk→∞​se(k,⋆)​=y⋆.

The theorem says that the hierarchy solves the robust problem in the limit, both in value and in the minimizer, although (RPMIO) has infinitely many matrix constraints and is in general hard.

Formalization Note The values are extended reals and the limits are taken in the extended reals with f⋆f^\starf⋆ coerced. The paper presupposes that each s(k,⋆)s^{(k,\star)}s(k,⋆) exists; the Lean statement takes a sequence s(k)s^{(k)}s(k) that is a minimizer of (4.5) for all sufficiently large kkk. The moment vectors of (4.5) are indexed by N2⌈ky/2⌉ℓ\mathbb N^\ell_{2\lceil k_y/2\rceil}N2⌈ky​/2⌉ℓ​, so convergence of the subsequence is required on exactly those coordinates. The standing assumption of p. 2 (an optimizer exists) and the symmetry of PPP and GGG are hypotheses.

Preamble
import Mathlib
import Definitions.Def_RobustPMI_Hierarchy_Model
Formal statement
namespace RobustPMI.Hierarchy

open Filter Topology

/-- Theorem 4.9 (p. 20): under Assumptions 1–3 (and the standing assumption that (RPMIO) has an
optimizer),
(i) `f_k^primal ↘ f⋆` and `f_k^dual ↘ f⋆` as `k → ∞`;
(ii) if `s^{(k,⋆)}` is a minimizer of (4.5) for all large `k`, then for every convergent subsequence
`s^{(k_i,⋆)} → s⋆`, `s⋆_e` is a global minimizer of (RPMIO); consequently, if (RPMIO) has a unique
global minimizer `y⋆`, then `s_e^{(k,⋆)} → y⋆`. -/
theorem theorem_4_9 {ℓ n m q s : ℕ} (f : MvPolynomial (Fin ℓ) ℝ)
    (θ : Fin s → MvPolynomial (Fin ℓ) ℝ)
    (P : Matrix (Fin m) (Fin m) (MvPolynomial (Fin ℓ ⊕ Fin n) ℝ))
    (G : Matrix (Fin q) (Fin q) (MvPolynomial (Fin n) ℝ))
    (hP : P.IsSymm) (hG : G.IsSymm)
    (h1 : Assumption1 f θ P G) (h2 : Assumption2 G) (h3 : Assumption3 θ P G)
    (hmin : ∃ y, IsGlobalMin f θ P G y) :
    (AntitoneOn (fprimal f θ P G) (Set.Ici ((kx P G + 1) / 2)) ∧
      AntitoneOn (fdual f θ P G) (Set.Ici ((kx P G + 1) / 2)) ∧
      Tendsto (fprimal f θ P G) atTop (𝓝 (fstar f θ P G : EReal)) ∧
      Tendsto (fdual f θ P G) atTop (𝓝 (fstar f θ P G : EReal))) ∧
    (∀ sq : ℕ → (Fin ℓ →₀ ℕ) → ℝ, (∀ᶠ k in atTop, IsDualMinimizer f θ P G k (sq k)) →
      ∀ φ : ℕ → ℕ, StrictMono φ → ∀ sstar : (Fin ℓ →₀ ℕ) → ℝ,
        (∀ α ∈ monos (σ := Fin ℓ) (2 * ((ky f θ P + 1) / 2)),
          Tendsto (fun i => sq (φ i) α) atTop (𝓝 (sstar α))) →
        IsGlobalMin f θ P G (sE sstar)) ∧
    (∀ sq : ℕ → (Fin ℓ →₀ ℕ) → ℝ, (∀ᶠ k in atTop, IsDualMinimizer f θ P G k (sq k)) →
      ∀ ystar : Fin ℓ → ℝ, (∀ y, IsGlobalMin f θ P G y ↔ y = ystar) →
        Tendsto (fun k => sE (sq k)) atTop (𝓝 ystar)) := by sorry

end RobustPMI.Hierarchy
Source
Guo, Wang, A moment-SOS hierarchy for robust polynomial matrix inequality optimization with SOS-convexity, arXiv:2304.12628v5, p. 20, Theorem 4.9 (proof pp. 20–21)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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