Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, (D), pp. 481–482 — d.c. duality: inf{g(x) − h(x)} = inf{h*(y) − g*(y)}

Proved
TaoAnDCA.GlobalOpt.dc_duality

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

conjugatedc-programmingdualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

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 adopt the convention +∞−(+∞)=+∞+\infty-(+\infty)=+\infty+∞−(+∞)=+∞. Then the d.c. program (P) and its dual (D) have the same optimal value:

α=inf⁡x∈X{g(x)−h(x)}=inf⁡y∈Y{h∗(y)−g∗(y)}.\alpha=\inf_{x\in X}\{g(x)-h(x)\}=\inf_{y\in Y}\{h^*(y)-g^*(y)\}.α=x∈Xinf​{g(x)−h(x)}=y∈Yinf​{h∗(y)−g∗(y)}.

This is the d.c. duality of §3 (Toland duality). The paper derives it by writing h=h∗∗h=h^{**}h=h∗∗, exchanging the two infima, and observing that inf⁡x{g(x)−⟨x,y⟩+h∗(y)}=h∗(y)−g∗(y)\inf_x\{g(x)-\langle x,y\rangle+h^*(y)\}=h^*(y)-g^*(y)infx​{g(x)−⟨x,y⟩+h∗(y)}=h∗(y)−g∗(y) for y∈dom⁡h∗y\in\operatorname{dom}h^*y∈domh∗ and +∞+\infty+∞ otherwise. It is the first step of the proof of the global optimality condition, Theorem 3.1(i).

Formalization Note Both sides are extended-real infima; the differences are the convention-respecting difference dcSub, so the dual objective is +∞+\infty+∞ off dom⁡h∗\operatorname{dom}h^*domh∗, as in the paper's rewriting of (D) over all of YYY. No finiteness of α\alphaα is assumed. The standing assumptions g,h∈Γ0g,h\in\Gamma_0g,h∈Γ0​ and (3) are hypotheses.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_GlobalOpt_Setting

open TaoAnDCA.GlobalOpt
Formal statement
namespace TaoAnDCA.GlobalOpt

theorem dc_duality {n : ℕ} (g h : EuclideanSpace ℝ (Fin n) → EReal) (hgh : DCStanding g h) :
    primalValue g h =
      ⨅ y, dcSub (CondatPD.FinDim.conj h) (CondatPD.FinDim.conj g) y := by sorry

end TaoAnDCA.GlobalOpt
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), pp. 481–482, §3, derivation of (P_y) and display (D)
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