Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, p. 8 — the pointwise max or min of a compact family with continuous bounded ∇ₓf is semismooth on B

Proved
MifflinSemismooth.Extremal.theorem2

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

max-functionmin-maxnonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth

Let B⊆RnB\subseteq\mathbb R^nB⊆Rn be open, TTT a topological space, U⊆TU\subseteq TU⊆T sequentially compact, f:Rn×T→Rf:\mathbb R^n\times T\to\mathbb Rf:Rn×T→R and E:Rn→RE:\mathbb R^n\to\mathbb RE:Rn→R. Suppose that

  1. (a) fff is continuous on B×UB\times UB×U;
  2. either (d) E(x)=max⁡{f(x,u):u∈U}E(x)=\max\{f(x,u):u\in U\}E(x)=max{f(x,u):u∈U} for every x∈Bx\in Bx∈B, or (d′) E(x)=min⁡{f(x,u):u∈U}E(x)=\min\{f(x,u):u\in U\}E(x)=min{f(x,u):u∈U} for every x∈Bx\in Bx∈B;
  3. f(⋅,u)f(\cdot,u)f(⋅,u) is differentiable on BBB for each u∈Uu\in Uu∈U;
  4. the partial gradient ∇xf\nabla_x f∇x​f is continuous and bounded on B×UB\times UB×U.

Then

E is semismooth on B.E\ \text{is semismooth on}\ B.E is semismooth on B.

That is, at every x∈Bx\in Bx∈B, EEE is Lipschitz on a ball about xxx, and for each ddd and all sequences tk↓0t_k\downarrow 0tk​↓0, θk/tk→0\theta_k/t_k\to 0θk​/tk​→0, gk∈∂E(x+tkd+θk)g_k\in\partial E(x+t_kd+\theta_k)gk​∈∂E(x+tk​d+θk​), the sequence {⟨gk,d⟩}\{\langle g_k,d\rangle\}{⟨gk​,d⟩} has exactly one accumulation point. This is the paper's first main result: pointwise maxima and minima over a compact family of continuously differentiable functions, such as min–max objectives, are semismooth, and so fall within the scope of the paper's minimization algorithms.

Formalization Note. Hypotheses (b), (c), (e), (e′) of §3 are not assumed: the paper derives them from the smoothness assumptions. Openness of BBB is assumed, convexity is not. "Either (d) or (d′)" is read as one of the two forms holding on all of BBB, as in the paper's proof. Joint continuity of ∇xf\nabla_x f∇x​f on B×UB\times UB×U is continuity on the product subset, not separate continuity in xxx.

Preamble
import Mathlib
import Definitions.Def_ClarkeGradients_Shared_genDirDeriv
import Definitions.Def_MifflinSemismooth_Extremal_Basic
import Definitions.Def_MifflinSemismooth_Extremal_Setting

open Filter Topology
Formal statement
namespace MifflinSemismooth.Extremal

/-- Mifflin (1976), Theorem 2, p. 8: suppose (a) and (d) or (d') hold, `f(·, u)` is
differentiable on `B` for each `u ∈ U`, and `∇ₓf(·, ·)` is continuous and bounded on `B × U`.
Then `E` is semismooth on `B`. -/
theorem theorem2 {n : ℕ} {T : Type*} [TopologicalSpace T]
    (B : Set (EuclideanSpace ℝ (Fin n))) (U : Set T) (f : EuclideanSpace ℝ (Fin n) → T → ℝ)
    (E : EuclideanSpace ℝ (Fin n) → ℝ) (hB : IsOpen B) (hU : IsSeqCompact U)
    (ha : HypA B U f) (hdE : HypD B U f E ∨ HypD' B U f E)
    (hdiff : ∀ u ∈ U, ∀ x ∈ B, DifferentiableAt ℝ (fun y => f y u) x)
    (hcont : ContinuousOn
      (fun p : EuclideanSpace ℝ (Fin n) × T => gradient (fun y => f y p.2) p.1) (B ×ˢ U))
    (hbdd : ∃ M : ℝ, ∀ x ∈ B, ∀ u ∈ U, ‖gradient (fun y => f y u) x‖ ≤ M) :
    SemismoothOn E B := by sorry

end MifflinSemismooth.Extremal
Source
Mifflin, Semismooth and semiconvex functions in constrained optimization, IIASA Research Report RR-76-21 (December 1976), p. 8, §3, Theorem 2
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me