Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6.2) — the proximal term does not change the generalized gradient at X*(s): ∂f̃_s(X*(s)) = ∂f_s(X*(s))

Proved
ProgHedging.Nonconvex.eq_6_2

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

generalized-gradientnonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let r∈Rr\in\mathbb Rr∈R, let X∗X^*X∗ be a policy and s∈Ss\in Ss∈S, and let f~s(x)=fs(x)+12r∣x−X∗(s)∣2\tilde f_s(x)=f_s(x)+\tfrac12 r|x-X^*(s)|^2f~​s​(x)=fs​(x)+21​r∣x−X∗(s)∣2. Writing ∂\partial∂ for Clarke's generalized gradient,

  1. for every x∈Rnx\in\mathbb R^nx∈Rn,
∂f~s(x)=∂fs(x)+r (x−X∗(s));\partial\tilde f_s(x)=\partial f_s(x)+r\,(x-X^*(s));∂f~​s​(x)=∂fs​(x)+r(x−X∗(s));
  1. consequently
∂f~s(X∗(s))=∂fs(X∗(s)).(6.2)\partial\tilde f_s(X^*(s))=\partial f_s(X^*(s)) .\tag{6.2}∂f~​s​(X∗(s))=∂fs​(X∗(s)).(6.2)

Because of (6.2), the optimality conditions of Theorem 4.1 for the modified problem (P~)(\tilde P)(P~) and for the original problem (P) coincide at X∗X^*X∗; this is how the paper turns the multiplier statement for (P~)(\tilde P)(P~) into stationarity for (P).

Formalization Note The first identity is the sum rule for the generalized gradient of a locally Lipschitz function plus a smooth function, which the paper cites from Clarke's book (Corollary 2.4.2 of [7] as printed). It is stated for every real rrr; the paper's rrr is positive. The paper prints ∂f^s\partial\hat f_s∂f^​s​ on the left of (6.2); it means ∂f~s\partial\tilde f_s∂f~​s​.

Preamble
import Mathlib
import Definitions.Def_ProgHedging_Convex_Problem
import Definitions.Def_ProgHedging_Nonconvex_Algorithm
import Definitions.Def_ClarkeGradients_Shared_generalizedGradient
import Definitions.Def_ClarkeGradients_FlowInvariance_normalCone

open scoped Pointwise
Formal statement
namespace ProgHedging.Nonconvex

/-- Proof of Theorem 6.1, pp. 30–31, and (6.2): `∂f̃_s(x) = ∂f_s(x) + r(x − X*(s))` for every `x`,
and consequently `∂f̃_s(X*(s)) = ∂f_s(X*(s))` (Clarke generalized gradients). -/
theorem eq_6_2 {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T) (r : ℝ)
    (Xs : ProgHedging.Convex.Policy S n) (s : S) :
    (∀ x : EuclideanSpace ℝ (Fin n),
      ClarkeGradients.Shared.generalizedGradient (pr.fTilde r Xs s) x =
        ClarkeGradients.Shared.generalizedGradient (pr.f s) x + {r • (x - Xs s)}) ∧
    ClarkeGradients.Shared.generalizedGradient (pr.fTilde r Xs s) (Xs s) =
      ClarkeGradients.Shared.generalizedGradient (pr.f s) (Xs s) := by sorry

end ProgHedging.Nonconvex
Source
Rockafellar and Wets, Scenarios and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119 (1987), pp. 30–31, proof of Theorem 6.1, display before (6.2) and (6.2)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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