Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, proof of Theorem 3.1, p. 484 — for x* ∈ dom h, (x* ∈ dom g and (7)) is equivalent to (8)

Proved
TaoAnDCA.GlobalOpt.eq7_iff_eq8

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

conjugatedc-programmingglobal-optimalityp2o-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 (3) and let x∗∈dom⁡hx^*\in\operatorname{dom}hx∗∈domh. Then the following are equivalent:

  1. x∗∈dom⁡gx^*\in\operatorname{dom}gx∗∈domg and
g(x∗)+g∗(y)≤h(x∗)+h∗(y)∀y∈dom⁡h∗;(7)g(x^*)+g^*(y)\le h(x^*)+h^*(y)\qquad\forall y\in\operatorname{dom}h^*;\tag{7}g(x∗)+g∗(y)≤h(x∗)+h∗(y)∀y∈domh∗;(7)
  1. for every ε>0\varepsilon>0ε>0 and every y∈Yy\in Yy∈Y,
⟨x∗,y⟩+ε≥h(x∗)+h∗(y) ⟹ ⟨x∗,y⟩+ε≥g(x∗)+g∗(y).(8)\langle x^*,y\rangle+\varepsilon\ge h(x^*)+h^*(y)\ \Longrightarrow\ \langle x^*,y\rangle+\varepsilon\ge g(x^*)+g^*(y).\tag{8}⟨x∗,y⟩+ε≥h(x∗)+h∗(y) ⟹ ⟨x∗,y⟩+ε≥g(x∗)+g∗(y).(8)

The paper calls this equivalence easy to see; combined with the two previous steps it proves Theorem 3.1(i).

Formalization Note Sums are extended reals. The clause x∗∈dom⁡gx^*\in\operatorname{dom}gx∗∈domg accompanies (7) as in the paper's "x∗∈Px^*\in\mathcal Px∗∈P if and only if x∗∈dom⁡gx^*\in\operatorname{dom}gx∗∈domg and (6)". When x∗∈dom⁡h∖dom⁡gx^*\in\operatorname{dom}h\setminus\operatorname{dom}gx∗∈domh∖domg both sides are false: the first by the domain clause, the second because ∂εh(x∗)\partial_\varepsilon h(x^*)∂ε​h(x∗) is nonempty for ε>0\varepsilon>0ε>0 while g(x∗)+g∗(y)=+∞g(x^*)+g^*(y)=+\inftyg(x∗)+g∗(y)=+∞.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_GlobalOpt_Setting

open TaoAnDCA.GlobalOpt
Formal statement
namespace TaoAnDCA.GlobalOpt

theorem eq7_iff_eq8 {n : ℕ} (g h : EuclideanSpace ℝ (Fin n) → EReal)
    (hgh : DCStanding g h) (x : EuclideanSpace ℝ (Fin n)) (hx : x ∈ effDom h) :
    (x ∈ effDom g ∧ ∀ y ∈ effDom (CondatPD.FinDim.conj h),
        g x + CondatPD.FinDim.conj g y ≤ h x + CondatPD.FinDim.conj h y) ↔
      ∀ ε : ℝ, 0 < ε → ∀ y : EuclideanSpace ℝ (Fin n),
        ((inner ℝ x y + ε : ℝ) : EReal) ≥ h x + CondatPD.FinDim.conj h y →
          ((inner ℝ x y + ε : ℝ) : EReal) ≥ g x + 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), p. 484, §3.1, proof of Theorem 3.1: "It is easy to see the equivalence between (7) and (8)"
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