How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Slater gives zero duality gap and an attained dual certificate
Statement
Consider the finite-dimensional convex program of Finite-dimensional convex program, Lagrangian dual, and Slater condition. Assume its equality matrix has independent rows, Slater's condition holds, and the finite primal value is attained at . Then there are and such that Moreover, every inequality multiplier satisfies . The Slater and attainment hypotheses do not assert that a primal minimizer is unique.
Facts & Assumptions
Given: Proper closed convex data , independent affine equalities , a Slater point, and an attained finite primal value.
The common domain, primal and dual values, relative-interior Slater condition, and Lagrangian are defined in Finite-dimensional convex program, Lagrangian dual, and Slater condition.
Every dual feasible pair satisfies (Every Lagrangian dual feasible pair is a lower-bound certificate).
A proper convex value function finite at a relative-interior domain point has a supporting affine lower bound there (A finite-dimensional convex value function has a support at relative-interior points).
A finite convex function on an open convex set in finite dimensions is continuous there (A convex function on an open convex set is locally Lipschitz).
Proof
For perturbations and , define This value function is convex. Indeed, for two perturbations with finite values, choose feasible points with objective within of their respective infima. A convex combination of those points lies in , its inequalities and equality residual are bounded by the same convex combination of perturbations, and convexity of bounds its objective. Letting proves the convex inequality. If one perturbation value is , arbitrarily low feasible objective values and the same convex-combination argument give value at each strict convex combination with another feasible perturbation.
Let and . Since the Slater point lies in every relative-interior domain, has a relative neighborhood in contained in . Each is finite and convex on its domain and continuous near in its affine hull by [F4]; after intersecting finitely many neighborhoods, there are a relative neighborhood of and with on for every (take any if ). The affine map from onto has a linear right inverse on its direction space: choose preimages of a finite basis of . Consequently, its image of contains a relative neighborhood of in . For every , choose the corresponding ; for every , that satisfies and . Thus on a relative neighborhood of in .
The value is finite. The convexity from step 1.1 and the neighborhood from step 1.2 imply that never equals : if for some perturbation , choose a small so lies in that neighborhood. Convexity would give , contrary to finiteness. Hence is proper and relative to . By [F3] there is a linear functional on such that .
Relaxing one inequality right-hand side cannot increase the infimum, so for small . The support inequality in step 2.1 gives , hence . Define and extend from the finite-dimensional subspace to a linear functional on by extending a basis; write the negative of this extension as . For any , the perturbation is feasible using itself, so Thus for all , and .
At the primal minimizer, weak duality [F2] and feasibility give Every inequality is therefore equality. Since every summand is nonpositive, their sum being zero forces each one to be zero. Thus , the dual supremum is attained, and complementarity holds.
Depends on
Used by
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Boyd and Vandenberghe, Convex Optimization (standard reference, not scraped)
- Zhiyuan Li, Convex Optimization, Lecture 5: Lagrange Multipliers and KKT (standard reference, not scraped)