Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2(i), p. 484 — a local minimizer x* of g − h satisfies ∂h(x*) ⊂ ∂g(x*)

Proved
TaoAnDCA.LocalOpt.theorem_3_2_i

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

dc-programminglocal-optimalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subdifferential

Let g,h∈Γ0(Rn)g, h \in \Gamma_0(\mathbb R^n)g,h∈Γ0​(Rn) satisfy the standing inclusions dom⁡g⊂dom⁡h\operatorname{dom} g \subset \operatorname{dom} hdomg⊂domh and dom⁡h∗⊂dom⁡g∗\operatorname{dom} h^* \subset \operatorname{dom} g^*domh∗⊂domg∗, and let the d.c. difference g−hg - hg−h be taken with the convention +∞−(+∞)=+∞+\infty - (+\infty) = +\infty+∞−(+∞)=+∞. If x∗x^*x∗ is a local minimizer of g−hg - hg−h (that is, g(x∗)−h(x∗)g(x^*) - h(x^*)g(x∗)−h(x∗) is finite and g(x∗)−h(x∗)≤g(x)−h(x)g(x^*) - h(x^*) \le g(x) - h(x)g(x∗)−h(x∗)≤g(x)−h(x) for all xxx in a neighbourhood of x∗x^*x∗), then x∗∈Plx^* \in \mathcal P_lx∗∈Pl​:

∂h(x∗)⊂∂g(x∗).\partial h(x^*) \subset \partial g(x^*).∂h(x∗)⊂∂g(x∗).

This is the classical necessary condition for local optimality in d.c. programming; it is the first step in transporting a local minimizer of the primal program to the dual one (Corollary 3.5).

Formalization Note. Local minimizer and Pl\mathcal P_lPl​ are the definitions of TaoAnDCA.LocalOpt.Setting; the standing assumptions are the structure DCStanding g h.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_LocalOpt_Setting

open Filter Topology
Formal statement
namespace TaoAnDCA.LocalOpt

/-- Theorem 3.2 (i), p. 484: a local minimizer `x*` of `g − h` lies in `𝒫_l`,
i.e. `∂h(x*) ⊂ ∂g(x*)`. -/
theorem theorem_3_2_i {n : ℕ} (g h : EuclideanSpace ℝ (Fin n) → EReal) (hgh : TaoAnDCA.GlobalOpt.DCStanding g h)
    (xs : EuclideanSpace ℝ (Fin n)) (hloc : IsDCLocalMin g h xs) :
    xs ∈ Pl g h := by sorry

end TaoAnDCA.LocalOpt
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), p. 484, Theorem 3.2(i)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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