Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.3), p. 4 — for a convex problem, a sharp unique minimum at x̄ iff g′(x̄, d) > 0 on T_Θ(x̄) \ {0}

Proved
SAARate.Sharp.sharp_iff_dirDeriv_pos

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

convex-analysisdirectional-derivativep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sharp-minimumtangent-cone

Let g:Rm→Rg:\mathbb R^m\to\mathbb Rg:Rm→R be convex, let Θ⊆Rm\Theta\subseteq\mathbb R^mΘ⊆Rm be convex and let xˉ∈Θ\bar x\in\Thetaxˉ∈Θ. Write g′(xˉ,d)g'(\bar x,d)g′(xˉ,d) for the directional derivative of ggg at xˉ\bar xxˉ in the direction ddd, and TΘ(xˉ)T_\Theta(\bar x)TΘ​(xˉ) for the tangent cone to Θ\ThetaΘ at xˉ\bar xxˉ. Then the following are equivalent:

  1. xˉ\bar xxˉ is the unique minimizer of ggg over Θ\ThetaΘ, and there is c>0c>0c>0 with g(x)≥g(xˉ)+c∥x−xˉ∥g(x)\ge g(\bar x)+c\|x-\bar x\|g(x)≥g(xˉ)+c∥x−xˉ∥ for all x∈Θx\in\Thetax∈Θ (a sharp minimum);
  2. the directional derivative is positive on all nonzero tangent directions:
g′(xˉ,d)>0∀ d∈TΘ(xˉ)∖{0}.g'(\bar x,d)>0\qquad\forall\, d\in T_\Theta(\bar x)\setminus\{0\}.g′(xˉ,d)>0∀d∈TΘ​(xˉ)∖{0}.

For g=fg=fg=f this is the paper's statement that Assumption (A) holds iff (2.3). It is used twice in the proof of Theorem 2.1: at the true problem, to turn (A) into a condition on f′(xˉ,⋅)f'(\bar x,\cdot)f′(xˉ,⋅), and at the approximating problem, to turn positivity of f^N′(xˉ,⋅)\hat f'_N(\bar x,\cdot)f^​N′​(xˉ,⋅) into a sharp, hence unique, minimum at xˉ\bar xxˉ.

Formalization Note. The statement is made for an arbitrary finite convex function ggg, not only for the expected value function fff; this is stronger than the page and covers both uses. The tangent cone is Mathlib's posTangentConeAt Θ x̄, the set of limits of cndnc_n d_ncn​dn​ with cn≥0c_n\ge 0cn​≥0, dn→0d_n\to0dn​→0 and xˉ+dn∈Θ\bar x+d_n\in\Thetaxˉ+dn​∈Θ; for convex Θ\ThetaΘ this is the closure of R+(Θ−xˉ)\mathbb R_+(\Theta-\bar x)R+​(Θ−xˉ), the tangent cone of convex analysis that the paper uses. (Mathlib's tangentConeAt ℝ, which allows negative cnc_ncn​, is a different, symmetric cone and is not used.) Closedness of Θ\ThetaΘ is not needed and not assumed.

Preamble
import Mathlib
import Definitions.Def_SAARate_Sharp_Setting
Formal statement
namespace SAARate.Sharp

open MeasureTheory ProbabilityTheory Filter Topology

theorem sharp_iff_dirDeriv_pos {m : ℕ} (g : E m → ℝ) (hg : ConvexOn ℝ Set.univ g)
    (Θ : Set (E m)) (hΘ : Convex ℝ Θ) (xbar : E m) (hx : xbar ∈ Θ) :
    (argminOn g Θ = {xbar} ∧ ∃ c > 0, ∀ x ∈ Θ, g x ≥ g xbar + c * ‖x - xbar‖) ↔
      ∀ d ∈ posTangentConeAt Θ xbar, d ≠ 0 → 0 < dirDeriv g xbar d := by sorry

end SAARate.Sharp
Source
Shapiro & Homem-de-Mello, On Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs, preprint (SPEPS copy, edoc.hu-berlin.de), p. 4, Assumption (A), (2.2), (2.3)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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