Proposition 1(b), p. 3 — F⁰(x;d) = max [⟨g,d⟩ : g ∈ ∂F(x)]
ProvedMifflinSemismooth.Optimality.prop1_bgeneralized-gradientnonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be open and let be Lipschitz on with constant . Let . Then for every direction the generalized directional derivative is attained as a maximum over the generalized gradient:
The upper bound is the definition of ; the content is that the bound is attained. In §5 this is used to turn values of into inner products with generalized gradients, for instance in the proof of Theorem 8.
Formalization Note "max" is IsGreatest, which asserts attainment and in particular . The Lipschitz constant is (equivalent to the page's positive ). The same statement is drafted in mission I of this series.
Preamble
import Mathlib import Definitions.Def_MifflinSemismooth_Optimality_Setting
Formal statement
namespace MifflinSemismooth.Optimality
/-- Mifflin (1976), §2, Proposition 1(b), p. 3: for `F` Lipschitz on an open set `B` and `x ∈ B`,
`F⁰(x; d) = max [⟨g, d⟩ : g ∈ ∂F(x)]`. -/
theorem prop1_b {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → ℝ) (B : Set (EuclideanSpace ℝ (Fin n)))
(hB : IsOpen B) (K : NNReal) (hFB : LipschitzOnWith K F B) (x : EuclideanSpace ℝ (Fin n))
(hx : x ∈ B) :
∀ d, IsGreatest ((fun g => inner ℝ g d) '' MifflinSemismooth.Extremal.genGrad F x)
(ClarkeGradients.Shared.genDirDeriv F x d) := by sorry
end MifflinSemismooth.Optimality
Source
Mifflin, Semismooth and semiconvex functions in constrained optimization, IIASA Research Report RR-76-21 (December 1976), p. 3, Proposition 1(b)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.