Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

A constrained local margin minimum satisfies Clarke KKT under MFCQ

Statement

Let N,d≥1 and let q1,…,qN:Rd→R be locally Lipschitz, and let θ∗ be a local minimum of 12∥θ∥22 among points satisfying qi(θ)≥1. If θ∗ satisfies MFCQ in the margin convention, then θ∗ is a Clarke KKT point for these margin constraints.

Facts & Assumptions

Given: The locally Lipschitz margins, the feasible region, a constrained local minimizer θ∗, and margin-form MFCQ there.

[F1]

Clarke subdifferential and gradient-flow trajectory: the Clarke generalized directional derivative is the support function of the compact convex Clarke subdifferential.

[F2]

KKT conditions and MFCQ for margin constraints: at an active margin qi(θ∗)=1, MFCQ supplies one direction v with ⟨hi,v⟩>0 for every hi∈∂∘qi(θ∗); KKT requires nonnegative multipliers, stationarity, and complementary slackness.

[F4]

A point outside a nonempty closed convex set is strictly separated from it: a point outside a nonempty closed convex set is strictly separated from that set by a linear functional.

Proof

technique · derive Fritz-John multipliers by finite-dimensional separation, then use MFCQ to rule out the abnormal objective multiplier
1.1F1F2givenalgebra

Write f(θ)=12∥θ∥22 and gi(θ)=1−qi(θ). Then f is differentiable with ∂∘f(θ∗)={θ∗}, and ∂∘gi(θ∗)=−∂∘qi(θ∗) by the Clarke definition. Let I be the finite active set {i:qi(θ∗)=1}.

2.1F1F3step 1.1construct

Set S:=∂∘f(θ∗)∪⋃i∈I∂∘gi(θ∗). Each constituent is compact and convex, so S is bounded. In any finite convex combination of points of S, group together the points from each constituent; convexity then writes the combination using at most one point from each of the finitely many constituents. Therefore C:=conv⁡(S) is the continuous image of the product of those constituents and their finite coefficient simplex. That product is closed and bounded in a finite-dimensional Euclidean space, hence compact by [F3], so C is compact, nonempty, and convex.

3.1F1F4step 2.1givenassume-contradischarge-contradiction

If 0∉C, [F4] strictly separates 0 from C, giving a direction v with ⟨h,v⟩<0 for every h∈S. By [F1], this means f∘(θ∗;v)<0 and gi∘(θ∗;v)<0 for every active i. The definition of each limsup gives a positive step bound for which each corresponding difference quotient along θ∗+tv is negative; taking the minimum of these finitely many bounds makes f(θ∗+tv)<f(θ∗) and gi(θ∗+tv)<0 simultaneously for every active constraint. Continuity preserves the already strict inactive constraints. This is a feasible descent from a constrained local minimum, a contradiction. Hence 0∈C.

4.1F1step 3.1construct

Since 0∈conv⁡(S) and each Clarke subdifferential in S is convex, group the finite convex combination by its constituent set. There are coefficients α0≥0 and αi≥0 for active i, with α0+∑i∈Iαi=1, and vectors h0∈∂∘f(θ∗), hi∈∂∘gi(θ∗) such that 0=α0h0+∑i∈Iαihi.

5.1F2step 4.1algebra∎

If there are no active constraints, the coefficients in step 4.1 sum to one, so α0=1. Otherwise, if α0=0, some active coefficient is positive; dotting the equality in step 4.1 with the MFCQ direction from [F2] makes the right-hand sum strictly negative, a contradiction. In either case α0>0. Divide by α0, set λi=αi/α0 for active indices and λi=0 otherwise, and put h~i=−hi∈∂∘qi(θ∗). Then θ∗=∑iλih~i, all λi≥0, and λi(qi(θ∗)−1)=0 for every i. These are exactly the margin-form Clarke KKT conditions in [F2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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