Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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