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.
Inequality KKT duality and optimality certificates — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hereditary and Productive Behaviour of the Separation Axioms
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inequality KKT duality and optimality certificates
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Jacobi Fields, Conjugate Points, and the Cut Locus
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Riemannian Metrics Length Distance and Volume
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Manifolds and Smooth Maps
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
A true minimizer with no KKT multipliers when MFCQ fails
Example
Minimize subject to . The origin is a global minimizer, but it has no KKT multiplier because the active constraint gradient vanishes there.
Facts & Assumptions
Given: The objective , the inequality , and the feasible candidate .
KKT stationarity for one inequality is with , and MFCQ requires a direction strictly decreasing every active inequality (Inequality constrained programs, tangent cones, constraint qualifications, and KKT).
Under MFCQ, every smooth local minimizer has KKT multipliers (MFCQ gives KKT multipliers at a smooth local minimizer).
Verification
If , then . Since , this forces , hence . The origin is feasible and has objective , so it is a global minimizer.
At the constraint is active, , and . Thus for every ; no KKT multiplier exists. MFCQ also fails because for every direction , so no direction strictly decreases the active constraint.
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.
A closed convex program with a positive duality gap when Slater fails
Example
Define the extended-real perspective
Minimize subject to . Both functions are proper closed convex, the primal minimum is , Slater fails, and the Lagrangian dual value is .
Facts & Assumptions
Given: The perspective , objective , and the single inequality constraint .
A proper closed convex function is specified by its closed convex epigraph; the Lagrangian dual uses (Finite-dimensional convex program, Lagrangian dual, and Slater condition).
Weak duality gives , 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
The epigraph of is exactly . For this is the inequality ; when it forces and ; for it is empty. Thus is closed, being defined by continuous non-strict inequalities. It is convex: if for , then for , by Cauchy–Schwarz. Therefore is closed convex. The objective is continuous and has second derivative in , so it is closed convex and proper as well.
On its domain . If , forces ; if , finiteness already forces . Hence the feasible set is and throughout it, so and the primal minimum is attained, for example at . No point has , so Slater fails.
For , every point in the Lagrangian domain has , so . At , taking gives . For , take ; then , so again . Therefore and the positive duality gap is . This does not contradict [F2], because its Slater hypothesis fails.
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.
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 .
An unconstrained KKT point that is a saddle
Example
With no constraints, let . The origin satisfies the KKT stationarity equation, but is a saddle point rather than a local minimum.
Facts & Assumptions
Given: The unconstrained objective and .
With no constraints, KKT is and the critical cone is all of (Inequality constrained programs, tangent cones, constraint qualifications, and KKT).
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
The gradient is , so and the origin is KKT. With no constraints, and . The Hessian is , whose quadratic form at is .
For every , , while . Both points approach the origin as , 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.
Thus stationarity alone is not an optimality certificate: this KKT point is a saddle.