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.

Strict second-order positivity on the critical cone gives a strict local minimum

Statement

For the C2 program of Inequality constrained programs, tangent cones, constraint qualifications, and KKT, suppose x∗ is feasible and has KKT multipliers (ν,λ). If

dT∇xx2L(x∗,ν,λ)d>0for every nonzero d∈K(x∗,ν,λ),

then x∗ is a strict local minimizer. The condition is vacuous when the critical cone is {0}; no constraint qualification is assumed.

Facts & Assumptions

Given: The C2 program, feasible KKT tuple (x∗,ν,λ), and the strict positivity condition in the Statement.

[F1]

A critical direction is in the linearized cone and satisfies Dgi(x∗)d=0 on every positively weighted active inequality (Critical directions are tangent to every positively weighted active inequality).

[F3]

A compact metric space has the finite-intersection property: nested nonempty closed subsets have nonempty intersection (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).

[F4]

Proof

1.1givenF1F2algebra

Write Q(d)=dT∇xx2L(x∗,ν,λ)d and S={d:∥d∥2=1}. The critical cone intersected with S is closed in S by its linear equalities and inequalities. If this intersection is nonempty, it is compact by [F2], and [F2] gives a minimum γ=min⁡Q(d)>0 there. The relatively open set N={u∈S:Q(u)>γ/2} contains that intersection. If the intersection is empty, put N=∅.

1.2F2F3construct

For k≥1, let Dk be the set of unit directions u=(x−x∗)/∥x−x∗∥2 for feasible x≠x∗ with ∥x−x∗∥2<1/k and f(x)≤f(x∗). If Dk is empty for some k, there is no such point in that neighborhood and strict local minimality holds. Otherwise, if bad points occur arbitrarily close with directions outside N, the nonempty nested closed sets Dk∖N‾ have the finite-intersection property in the compact sphere S. By [F3] choose d∈⋂kDk∖N‾; since N is relatively open, d∉N and ∥d∥2=1.

2.1F1F3F4step 1.2algebra

For each k, the closure property in step 1.2 supplies a direction u with ∥u−d∥2<1/k from a feasible bad point x=x∗+tu, where 0<t<1/k and f(x)≤f(x∗). Taylor expansion [F4] and equality feasibility imply Dh(x∗)u=O(t); active inequality feasibility gives Dgi(x∗)u≤O(t) for every active i. The objective inequality gives ∇f(x∗)Tu≤O(t). Letting k grow in these bounds, using ∥u−d∥2<1/k and t<1/k, shows Dh(x∗)d=0, Dgi(x∗)d≤0 on the active set, and ∇f(x∗)Td≤0. KKT stationarity and [F1] also give ∇f(x∗)Td≥0, so d is a unit critical direction. This contradicts d∉N: if the critical unit set is empty there is no such d, and otherwise every such d belongs to N. Hence for some k0, every feasible bad point with 0<∥x−x∗∥2<1/k0 has direction in N.

3.1F4step 1.1step 2.1algebra∎

If the critical unit set is empty, step 2.1 already excludes all bad points sufficiently near x∗, proving strict local minimality. Otherwise, let γ>0 be as in step 1.1. At a feasible x=x∗+tu, KKT gives L(x∗,ν,λ)=f(x∗), ∇xL(x∗,ν,λ)=0, and L(x,ν,λ)≤f(x). For bad points sufficiently close, step 2.1 gives u∈N, so Q(u)>γ/2. The Taylor expansion [F4] of the C2 Lagrangian has a remainder o(t2), uniformly as x→x∗; after shrinking the neighborhood it yields L(x,ν,λ)>f(x∗). This contradicts L(x,ν,λ)≤f(x)≤f(x∗). Therefore no distinct feasible point sufficiently near x∗ has objective at most f(x∗), proving that x∗ is a strict local minimizer.

Depends on

Used by

Dependency tree · two levels

50 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