Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 p∗∈R is attained at x∗. Then there are λ∗≥0 and ν∗ such that q(λ∗,ν∗)=d∗=p∗. Moreover, every inequality multiplier satisfies λ∗,igi(x∗)=0. The Slater and attainment hypotheses do not assert that a primal minimizer is unique.

Facts & Assumptions

Given: Proper closed convex data f0,gi, independent affine equalities Ax=b, a Slater point, and an attained finite primal value.

[F1]

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.

[F2]

Every dual feasible pair satisfies q(λ,ν)≤p∗ (Every Lagrangian dual feasible pair is a lower-bound certificate).

[F3]

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).

[F4]

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

1.1givenF1construct

For perturbations u∈Rm and v∈Rp, define P(u,v)=inf⁡{f0(x):x∈D, gi(x)≤ui (1≤i≤m), Ax−b=v}. 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 D, its inequalities and equality residual are bounded by the same convex combination of perturbations, and convexity of f0 bounds its objective. Letting ϵ↓0 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.

1.2givenF1F4construct

Let S=aff⁡D and Y=A(S)−b. Since the Slater point xs lies in every relative-interior domain, xs has a relative neighborhood in S contained in D. Each gi is finite and convex on its domain and continuous near xs in its affine hull by [F4]; after intersecting finitely many neighborhoods, there are a relative neighborhood Us⊆D of xs and η>0 with gi(y)<−η on Us for every i (take any η>0 if m=0). The affine map y↦Ay−b from S onto Y has a linear right inverse on its direction space: choose preimages of a finite basis of Y. Consequently, its image of Us contains a relative neighborhood W of 0 in Y. For every v∈W, choose the corresponding y∈Us; for every u∈∏i(−η,∞), that y satisfies gi(y)<ui and Ay−b=v. Thus P(u,v)<+∞ on a relative neighborhood of 0 in Z=Rm×Y.

2.1F1F3step 1.1step 1.2algebra

The value P(0,0)=p∗ is finite. The convexity from step 1.1 and the neighborhood from step 1.2 imply that P never equals −∞: if P(z)=−∞ for some perturbation z, choose a small θ>0 so −θz/(1−θ) lies in that neighborhood. Convexity would give P(0)≤θP(z)+(1−θ)P(−θz/(1−θ))=−∞, contrary to finiteness. Hence P is proper and 0∈ri⁡(dom⁡P) relative to Z. By [F3] there is a linear functional ℓ(u,v)=aTu+c(v) on Z such that P(u,v)≥p∗+aTu+c(v).

3.1F1step 2.1algebraconstruct

Relaxing one inequality right-hand side cannot increase the infimum, so P(tei,0)≤P(0,0)=p∗ for small t>0. The support inequality in step 2.1 gives P(tei,0)≥p∗+tai, hence ai≤0. Define λ∗=−a≥0 and extend c from the finite-dimensional subspace Y to a linear functional on Rp by extending a basis; write the negative of this extension as ν∗T. For any x∈D, the perturbation (g(x),Ax−b) is feasible using x itself, so f0(x)≥P(g(x),Ax−b)≥p∗+aTg(x)+c(Ax−b). Thus L(x,λ∗,ν∗)≥p∗ for all x, and q(λ∗,ν∗)≥p∗.

4.1F1F2step 3.1givenalgebra∎

At the primal minimizer, weak duality [F2] and feasibility give p∗≤q(λ∗,ν∗)≤L(x∗,λ∗,ν∗)=p∗+∑iλ∗,igi(x∗)≤p∗. Every inequality is therefore equality. Since every summand λ∗,igi(x∗) is nonpositive, their sum being zero forces each one to be zero. Thus q(λ∗,ν∗)=p∗=d∗, 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