Β§3.1, proof of Theorem 3.1, (6)β(7), p. 483 β x* β π« iff x* β dom g and g(x*) + g*(y) β€ h(x*) + h*(y) for all y β dom h*
ProvedTaoAnDCA.GlobalOpt.mem_primalSol_iff_eq7Let satisfy the standing inclusions (3), with the convention , and let be the solution set of the d.c. program . For every the following are equivalent:
- ;
- and
- and
By d.c. duality, is optimal exactly when its value does not exceed any value of the dual objective; (7) is the same inequality with the terms rearranged. This is the first half of the proof of Theorem 3.1(i).
Formalization Note The statement is the conjunction of "1 iff 2" and "1 iff 3". In (6) the differences are the convention-respecting dcSub; in (7) the sums are taken in the extended reals. On the ranges involved all four terms are finite: and because and is proper, because , and because and is proper. The restriction is kept as on the page.
import Mathlib import Definitions.Def_TaoAnDCA_GlobalOpt_Setting open TaoAnDCA.GlobalOpt
namespace TaoAnDCA.GlobalOpt
theorem mem_primalSol_iff_eq7 {n : β} (g h : EuclideanSpace β (Fin n) β EReal)
(hgh : DCStanding g h) (x : EuclideanSpace β (Fin n)) :
(x β primalSol g h β x β effDom g β§
β y β effDom (CondatPD.FinDim.conj h),
dcSub g h x β€ dcSub (CondatPD.FinDim.conj h) (CondatPD.FinDim.conj g) y) β§
(x β primalSol g h β x β effDom g β§
β y β effDom (CondatPD.FinDim.conj h),
g x + CondatPD.FinDim.conj g y β€ h x + CondatPD.FinDim.conj h y) := by sorry
end TaoAnDCA.GlobalOpt
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.