Proposition (1.4) — f°(x; ·) is the support function of ∂f(x)
ProvedClarkeGradients.FlowInvariance.genDirDeriv_isGreatestLet be locally Lipschitz (Lipschitz on every bounded set), and let . Then the generalized directional derivative (1.3) is the largest value of over the generalized gradient (1.1):
That is, is the support function of , and the maximum is attained.
In this mission the proposition is applied to the distance function : it identifies with a maximum over , which is how tangency of is read off from .
Formalization Note "max" is encoded as IsGreatest of the image of under , which asserts both that is an upper bound and that it is attained. The Lipschitz hypothesis is the §1 standing assumption and also guarantees that the real limsup in is not a junk value. The same statement is a milestone of mission I.
import Mathlib import Definitions.Def_ClarkeGradients_Shared_LipschitzOnBounded import Definitions.Def_ClarkeGradients_Shared_generalizedGradient import Definitions.Def_ClarkeGradients_Shared_genDirDeriv
namespace ClarkeGradients.FlowInvariance
/-- Clarke (1975), Proposition (1.4): for locally Lipschitz `f`,
`f°(x; v) = max {ζ · v : ζ ∈ ∂f(x)}`, i.e. `f°(x; ·)` is the support function of `∂f(x)`. -/
theorem genDirDeriv_isGreatest {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ)
(hf : Shared.LipschitzOnBounded f) (x v : EuclideanSpace ℝ (Fin n)) :
IsGreatest ((fun ζ => inner ℝ ζ v) '' Shared.generalizedGradient f x) (Shared.genDirDeriv f x v) := by sorry
end ClarkeGradients.FlowInvariance
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
The theorem takes:
- ;
- a function (Euclidean space) satisfying the imported hypothesis
LipschitzOnBounded f, whose content is not part of this declaration's text; - arbitrary points .
Let be the set produced by the imported operation generalizedGradient f x. Let be the real number produced by the imported operation genDirDeriv f x v. Neither definition is shown here. The theorem asserts that is the greatest element of the set of inner products:
In other words, the maximum is attained. In particular the theorem implies that is nonempty for every .
Degenerate cases:
- . The claim becomes , together with nonemptiness of .
- . is forced, so the same conclusion applies.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.