Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.6) — for lsc proper convex f,gf, gf,g on a Banach space, ∂g⊃∂f\partial g \supset \partial f∂g⊃∂f implies g=f+constg = f + \mathrm{const}g=f+const

Proved
RockafellarMaxMono.Cyclic.subdiff_subset_eq_add_const

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysismonotone-operatorsp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a real Banach space with dual E∗E^*E∗, and let fff and ggg be lower semicontinuous proper convex functions on EEE such that

∂g(x)⊃∂f(x)for all x∈E.(3.6)\partial g(x) \supset \partial f(x) \qquad \text{for all } x \in E . \tag{3.6}∂g(x)⊃∂f(x)for all x∈E.(3.6)

Then there is a real constant ccc with

g(x)=f(x)+cfor all x∈E.g(x) = f(x) + c \qquad \text{for all } x \in E .g(x)=f(x)+cfor all x∈E.

Rockafellar notes that, given Theorem 1 of his 1966 paper and its Corollary 2, this statement is exactly what remains to prove Theorem B. It yields both the maximality of ∂f\partial f∂f among cyclically monotone operators and the uniqueness of fff up to an additive constant. The hypothesis is a one-sided inclusion.

Formalization Note "⊃\supset⊃" is non-strict inclusion. The constant ccc is a real number (not ±∞\pm\infty±∞); at points where f(x)=+∞f(x) = +\inftyf(x)=+∞ the equation reads g(x)=+∞g(x) = +\inftyg(x)=+∞.

Preamble
import Mathlib
import Definitions.Def_RockafellarMaxMono_Shared_ProperConvex
import Definitions.Def_RockafellarMaxMono_Shared_Subdiff
Formal statement
namespace RockafellarMaxMono.Cyclic

theorem subdiff_subset_eq_add_const {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [CompleteSpace E] (f g : E → EReal)
    (hf : Shared.ProperConvex f) (hflsc : LowerSemicontinuous f)
    (hg : Shared.ProperConvex g) (hglsc : LowerSemicontinuous g)
    (hsub : ∀ x : E, Shared.subdiff f x ⊆ Shared.subdiff g x) :
    ∃ c : ℝ, ∀ x : E, g x = f x + (c : EReal) := by sorry

end RockafellarMaxMono.Cyclic
Source
Rockafellar, On the maximal monotonicity of subdifferential mappings, Pacific J. Math. 33 (1970), pp. 214–216, §3, Proof of Theorem B, (3.6)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting.

  • EEE is a real Banach space. E∗E^*E∗ is its continuous dual.
  • f,g:E→[−∞,+∞]f, g : E \to [-\infty, +\infty]f,g:E→[−∞,+∞] each satisfy the bundle's "proper convex" predicate (code not supplied).
  • fff and ggg are each lower semicontinuous in the norm topology.
  • ∂\partial∂ is the bundle's subdifferential operation, with values that are subsets of E∗E^*E∗. Its code is not supplied.

Hypothesis. For every x∈Ex \in Ex∈E:

∂f(x)⊆∂g(x).\partial f(x) \subseteq \partial g(x).∂f(x)⊆∂g(x).

Conclusion. There is a real (finite) constant ccc such that, for every x∈Ex \in Ex∈E and as an equality of extended reals:

g(x)=f(x)+c.g(x) = f(x) + c .g(x)=f(x)+c.

Degenerate cases.

  • Adding a finite ccc leaves ±∞\pm\infty±∞ unchanged. So wherever f(x)=+∞f(x) = +\inftyf(x)=+∞ the conclusion forces g(x)=+∞g(x) = +\inftyg(x)=+∞, and wherever f(x)=−∞f(x) = -\inftyf(x)=−∞ it forces g(x)=−∞g(x) = -\inftyg(x)=−∞. In particular, fff and ggg are asserted to take infinite values at exactly the same points.
  • If E={0}E = \{0\}E={0}, the conclusion says that g(0)−f(0)g(0) - f(0)g(0)−f(0) is a finite real number when both values are finite, or that f(0)=g(0)f(0) = g(0)f(0)=g(0) when either is infinite.
  • Whether the inclusion hypothesis can hold vacuously depends on the unseen subdifferential definition. For example, it would if ∂f(x)\partial f(x)∂f(x) were empty everywhere.
Human review
  • Endorsed by Shuze Chen · Sep 28, 2026

    Confirmed by the moderator at approval.

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