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 and let be locally Lipschitz, and let be a local minimum of among points satisfying . If satisfies MFCQ in the margin convention, then is a Clarke KKT point for these margin constraints.
Statement references
Facts & Assumptions
Given: The locally Lipschitz margins, the feasible region, a constrained local minimizer , and margin-form MFCQ there.
Clarke subdifferential and gradient-flow trajectory: the Clarke generalized directional derivative is the support function of the compact convex Clarke subdifferential.
KKT conditions and MFCQ for margin constraints: at an active margin , MFCQ supplies one direction with for every ; KKT requires nonnegative multipliers, stationarity, and complementary slackness.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: a closed and bounded subset of a finite-dimensional Euclidean space is compact.
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
Write and . Then is differentiable with , and by the Clarke definition. Let be the finite active set .
Set . Each constituent is compact and convex, so is bounded. In any finite convex combination of points of , 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 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 is compact, nonempty, and convex.
If , [F4] strictly separates from , giving a direction with for every . By [F1], this means and for every active . The definition of each limsup gives a positive step bound for which each corresponding difference quotient along is negative; taking the minimum of these finitely many bounds makes and 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 .
Since and each Clarke subdifferential in is convex, group the finite convex combination by its constituent set. There are coefficients and for active , with , and vectors , such that .
If there are no active constraints, the coefficients in step 4.1 sum to one, so . Otherwise, if , 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 . Divide by , set for active indices and otherwise, and put . Then , all , and for every . These are exactly the margin-form Clarke KKT conditions in [F2].
Depends on
- Clarke subdifferential and gradient-flow trajectory
- KKT conditions and MFCQ for margin constraints
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- A point outside a nonempty closed convex set is strictly separated from it
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
- Kaifeng Lyu and Jian Li, Gradient Descent Maximizes the Margin of Homogeneous Neural Networks, Appendix C.1–C.2 (standard reference, not scraped)
- Matus Telgarsky, Deep Learning Theory lecture notes, §9.1 (standard reference, not scraped)