Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A4 — a subdifferential chain rule for nondecreasing convex composition

Proved
BregmanPPA.IneqMult.lemmaA4

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

chain-ruleconvex-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1subdifferential

Let FiF_iFi​ be proper convex functions on Rn\mathbb R^nRn whose effective domains have a common relative-interior point. Let F0F_0F0​ be a proper convex function on Rm\mathbb R^mRm that is nondecreasing in every coordinate, and let G(x)=F0(F1(x),…,Fm(x))G(x)=F_0(F_1(x),\ldots,F_m(x))G(x)=F0​(F1​(x),…,Fm​(x)) when every inner value is finite, with G(x)=+∞G(x)=+\inftyG(x)=+∞ otherwise. Then GGG is convex. At any point x0x_0x0​ where every inner value is finite and F0F_0F0​ is finite near the vector of inner values and differentiable there, GGG is proper and

∂G(x0)=∑i=1m[∇F0(F(x0))]i ∂Fi(x0)+Ndom⁡G(x0).\partial G(x_0)=\sum_{i=1}^m[\nabla F_0(F(x_0))]_i\,\partial F_i(x_0)+N_{\operatorname{dom}G}(x_0).∂G(x0​)=i=1∑m​[∇F0​(F(x0​))]i​∂Fi​(x0​)+NdomG​(x0​).

The chain rule is used for the first-order condition of the primal subproblem in the proof of Theorem 7.

Formalization Note The paper prints “Lemma 5” when referring to monotonicity; Lemma 2 is intended. It also prints the first case of GGG as “f(x)∈Rnf(x)\in\mathbb R^nf(x)∈Rn”; Rm\mathbb R^mRm is intended. Convexity of GGG is stated unconditionally, as on the page. The paper's unconditional claim that GGG is proper is false without a point of dom⁡G\operatorname{dom}GdomG (take m=1m=1m=1, F1≡0F_1\equiv0F1​≡0 and F0F_0F0​ the indicator of (−∞,−1](-\infty,-1](−∞,−1], so G≡+∞G\equiv+\inftyG≡+∞); properness is therefore stated at the point x0x_0x0​ of the chain rule, which supplies that witness. Local finiteness makes differentiability of the extended-real outer function meaningful. A zero coefficient contributes zero even if the corresponding inner subdifferential is empty.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_IneqMult_Program

open Filter Topology InertialFB.IFB
Formal statement
namespace BregmanPPA.IneqMult

/-- Lemma A4, p. 224: the subdifferential chain rule. `G` is convex unconditionally;
properness needs a point of `dom G`, supplied by any `x₀` at which every inner value is
finite and `F₀` is finite near (hence differentiable at) the vector of inner values. -/
theorem lemmaA4 {n m : ℕ} (F : Fin m → E n → EReal) (F₀ : E m → EReal)
    (hF : ∀ i, IsProperFn (F i) ∧ IsConvexFn (F i))
    (hri : ∃ x : E n, ∀ i,
      x ∈ intrinsicInterior ℝ {y : E n | F i y ≠ ⊤})
    (hF₀ : IsProperFn F₀ ∧ IsConvexFn F₀)
    (hmono : ∀ u v : E m, (∀ i, u i ≤ v i) → F₀ u ≤ F₀ v) :
    IsConvexFn (compositeFn F F₀) ∧
    ∀ x₀ : E n, (∀ i, F i x₀ ≠ ⊤) →
      (∀ᶠ z in 𝓝 (gvec F x₀), F₀ z ≠ ⊤) →
      DifferentiableAt ℝ (fun z : E m => (F₀ z).toReal) (gvec F x₀) →
      IsProperFn (compositeFn F F₀) ∧
      BregmanPPA.Convergence.subdiffOp (compositeFn F F₀) x₀ =
        {v | ∃ ν : E n,
          ν ∈ normalCone {x | compositeFn F F₀ x ≠ ⊤} x₀ ∧
          ∃ ξ : Fin m → E n,
            (∀ i, (gradient (fun z : E m => (F₀ z).toReal) (gvec F x₀)) i ≠ 0 →
              IsSubgradient (F i) x₀ (ξ i)) ∧
            v = ν + ∑ i, (gradient (fun z : E m => (F₀ z).toReal) (gvec F x₀)) i • ξ i} := by sorry

end BregmanPPA.IneqMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 224, Lemma A4, https://doi.org/10.1287/moor.18.1.202
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