Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Inequality KKT duality and optimality certificates — Examples

1 · Prerequisites

2 · Summary

These calculations separate what the certificates prove from what they do not prove: an active-set quadratic has a unique global minimizer, a constraint-qualification failure can remove all multipliers at a true minimizer, a KKT stationary point can be a saddle, and a closed convex problem without Slater can have a positive Lagrangian duality gap.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A true minimizer with no KKT multipliers when MFCQ fails

Example

Minimize f(x,y)=x subject to g(x,y)=y2−x3≤0. The origin is a global minimizer, but it has no KKT multiplier because the active constraint gradient vanishes there.

Facts & Assumptions

Given: The C2 objective f(x,y)=x, the C2 inequality g(x,y)=y2−x3≤0, and the feasible candidate (0,0).

[F1]

KKT stationarity for one inequality is ∇f+λ∇g=0 with λ≥0, and MFCQ requires a direction strictly decreasing every active inequality (Inequality constrained programs, tangent cones, constraint qualifications, and KKT).

[F2]

Under MFCQ, every smooth local minimizer has KKT multipliers (MFCQ gives KKT multipliers at a smooth local minimizer).

Verification

1.1givenalgebra

If g(x,y)≤0, then y2≤x3. Since y2≥0, this forces x3≥0, hence x≥0. The origin is feasible and has objective 0, so it is a global minimizer.

1.2givenF1algebra

At (0,0) the constraint is active, ∇f(0,0)=(1,0), and ∇g(0,0)=(−3x2,2y)∣(0,0)=(0,0). Thus ∇f+λ∇g=(1,0)≠0 for every λ≥0; no KKT multiplier exists. MFCQ also fails because Dg(0,0)w=0 for every direction w, so no direction strictly decreases the active constraint.

2.1step 1.1step 1.2F2∎

This does not contradict [F2]: the origin is a local and global minimizer, but the MFCQ hypothesis fails, and the direct stationarity calculation proves multiplier existence cannot be inferred here.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A closed convex program with a positive duality gap when Slater fails

Example

Define the extended-real perspective

ϕ(x,y)={x2/y,y>0,0,(x,y)=(0,0),+∞,otherwise.

Minimize f0(x,y)=e−x subject to ϕ(x,y)≤0. Both functions are proper closed convex, the primal minimum is 1, Slater fails, and the Lagrangian dual value is 0.

Facts & Assumptions

Given: The perspective ϕ, objective f0, and the single inequality constraint ϕ≤0.

[F1]

A proper closed convex function is specified by its closed convex epigraph; the Lagrangian dual uses q(λ)=inf⁡(x,y)∈dom⁡f0∩dom⁡ϕ(f0(x,y)+λϕ(x,y)) (Finite-dimensional convex program, Lagrangian dual, and Slater condition).

[F2]

Weak duality gives d∗≤p∗, while Slater plus finite attained primal value would give equality and an attained dual certificate (Every Lagrangian dual feasible pair is a lower-bound certificate, Slater gives zero duality gap and an attained dual certificate).

Verification

1.1givenF1algebra

The epigraph of ϕ is exactly E={(x,y,t):y≥0, t≥0, x2≤yt}. For y>0 this is the inequality t≥x2/y; when y=0 it forces x=0 and t≥0; for y<0 it is empty. Thus E is closed, being defined by continuous non-strict inequalities. It is convex: if ∣xj∣≤yjtj for j=1,2, then for 0≤θ≤1, ∣θx1+(1−θ)x2∣≤θy1t1+(1−θ)y2t2≤(θy1+(1−θ)y2)(θt1+(1−θ)t2) by Cauchy–Schwarz. Therefore ϕ is closed convex. The objective is continuous and has second derivative e−x>0 in x, so it is closed convex and proper as well.

2.1givenstep 1.1algebra

On its domain ϕ≥0. If y>0, ϕ(x,y)≤0 forces x=0; if y=0, finiteness already forces x=0. Hence the feasible set is {(0,y):y≥0} and f0=1 throughout it, so p∗=1 and the primal minimum is attained, for example at (0,0). No point has ϕ(x,y)<0, so Slater fails.

3.1F1F2step 2.1algebra

For λ≥0, every point in the Lagrangian domain has e−x+λϕ(x,y)≥0, so q(λ)≥0. At λ=0, taking x→+∞ gives q(0)=0. For λ>0, take (xk,yk)=(k,k3); then e−xk+λϕ(xk,yk)=e−k+λ/k→0, so again q(λ)=0. Therefore d∗=sup⁡λ≥0q(λ)=0 and the positive duality gap is p∗−d∗=1. This does not contradict [F2], because its Slater hypothesis fails.

4.1step 1.1step 2.1step 3.1∎

The calculation gives a closed convex primal problem with attained finite optimum and a strict gap; the missing strict-feasibility condition is exactly the boundary that blocks the Slater theorem's certificate.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Active-set quadratic with an exact KKT certificate

Example

Minimize f(x1,x2)=12((x1+1)2+(x2−2)2) subject to g(x1,x2)=−x1≤0. The point x∗=(0,2) has one active constraint and multiplier λ∗=1.

Facts & Assumptions

Given: The quadratic objective, the inequality g=−x1≤0, and the candidate x∗=(0,2).

[F1]

LICQ requires independence of the equality and active inequality gradient rows; LICQ implies MFCQ and makes any KKT multiplier unique (Inequality constrained programs, tangent cones, constraint qualifications, and KKT, LICQ implies MFCQ and makes KKT multipliers unique).

[F2]

For a differentiable convex program, a feasible KKT tuple is a global minimizer (Convex KKT conditions certify a global minimum and an outward normal).

Verification

1.1givenF1algebra

The constraint is feasible exactly when x1≥0. At x∗=(0,2) it is active, and ∇f(x∗)=(1,0) while ∇g(x∗)=(−1,0). Therefore ∇f(x∗)+λ∗∇g(x∗)=0 for λ∗=1≥0, and λ∗g(x∗)=0. The active gradient is nonzero, so the one-row LICQ holds.

2.1step 1.1F1F2algebra

The quadratic is convex and differentiable. Primal feasibility and the multiplier checks in step 1.1 satisfy the hypotheses of [F2], so x∗ is a global minimizer. Directly, for every feasible x, f(x)−f(x∗)=x1+12x12+12(x2−2)2≥0, with equality only when x1=0 and x2=2. Thus the minimizer is unique, and [F1] makes λ∗=1 the unique multiplier.

3.1step 1.1step 2.1∎

The active-set KKT certificate is exact: it proves the unique global minimizer x∗=(0,2) and its unique nonnegative multiplier λ∗=1.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

An unconstrained KKT point that is a saddle

Example

With no constraints, let f(x1,x2)=x12−x22. The origin satisfies the KKT stationarity equation, but is a saddle point rather than a local minimum.

Facts & Assumptions

Given: The unconstrained C2 objective f(x1,x2)=x12−x22 and x∗=(0,0).

[F1]

With no constraints, KKT is ∇f(x∗)=0 and the critical cone is all of R2 (Inequality constrained programs, tangent cones, constraint qualifications, and KKT).

[F2]

At a local minimizer satisfying LICQ, the Lagrangian Hessian is nonnegative on the critical cone; strict positivity on every nonzero critical direction is sufficient for a strict local minimum (Second-order necessity on the critical cone under LICQ, Strict second-order positivity on the critical cone gives a strict local minimum).

Verification

1.1givenF1algebra

The gradient is ∇f(x1,x2)=(2x1,−2x2), so ∇f(0,0)=0 and the origin is KKT. With no constraints, LC(0)=R2 and K(0)=R2. The Hessian is (200−2), whose quadratic form at d=(0,1) is −2.

2.1givenF2step 1.1algebra

For every t≠0, f(t,0)=t2>0=f(0,0), while f(0,t)=−t2<0=f(0,0). Both points approach the origin as t→0, so the origin is neither a local minimum nor a local maximum. The negative critical curvature also violates the necessary condition in [F2], and strict positivity required by its sufficient condition fails.

3.1step 1.1step 2.1∎

Thus stationarity alone is not an optimality certificate: this KKT point is a saddle.

Sources