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 subject to . The point has one active constraint and multiplier .
Facts & Assumptions
Given: The quadratic objective, the inequality , and the candidate .
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).
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
The constraint is feasible exactly when . At it is active, and while . Therefore for , and . The active gradient is nonzero, so the one-row LICQ holds.
The quadratic is convex and differentiable. Primal feasibility and the multiplier checks in step 1.1 satisfy the hypotheses of [F2], so is a global minimizer. Directly, for every feasible , with equality only when and . Thus the minimizer is unique, and [F1] makes the unique multiplier.
The active-set KKT certificate is exact: it proves the unique global minimizer and its unique nonnegative multiplier .
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
- Nocedal and Wright, Numerical Optimization, second edition (standard reference, not scraped)
- Boyd and Vandenberghe, Convex Optimization (standard reference, not scraped)