Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — ∂f∗\partial f^*∂f∗ is recovered from ∂f\partial f∂f through bounded weak** nets

Proved
RockafellarMaxMono.Cyclic.conj_subdiff_iff_nets

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

convex-analysisconvex-conjugatemonotone-operatorsp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a real Banach space with dual E∗E^*E∗ and bidual E∗∗E^{**}E∗∗, and let fff be a lower semicontinuous proper convex function on EEE with conjugate f∗f^*f∗ on E∗E^*E∗. Let x∗∈E∗x^* \in E^*x∗∈E∗ and x∗∗∈E∗∗x^{**} \in E^{**}x∗∗∈E∗∗. Then

x∗∗∈∂f∗(x∗)x^{**} \in \partial f^*(x^*)x∗∗∈∂f∗(x∗)

if and only if there exist a net {xi∗∣i∈I}\{x_i^* \mid i \in I\}{xi∗​∣i∈I} in E∗E^*E∗ converging to x∗x^*x∗ in the strong (norm) topology and a bounded net {xi∣i∈I}\{x_i \mid i \in I\}{xi​∣i∈I} in EEE, with the same directed index set III, converging to x∗∗x^{**}x∗∗ in the weak** topology, such that xi∗∈∂f(xi)x_i^* \in \partial f(x_i)xi∗​∈∂f(xi​) for every i∈Ii \in Ii∈I.

Here EEE is regarded as a subspace of E∗∗E^{**}E∗∗ through the canonical embedding, and the weak** topology on E∗∗E^{**}E∗∗ is the weak topology induced by E∗E^*E∗. In the proof of Theorem B, Proposition 1 transfers the inclusion ∂(g+j)⊃∂(f+j)\partial(g+j) \supset \partial(f+j)∂(g+j)⊃∂(f+j) on EEE to ∂(g+j)∗⊃∂(f+j)∗\partial(g+j)^* \supset \partial(f+j)^*∂(g+j)∗⊃∂(f+j)∗ on E∗E^*E∗, without assuming EEE reflexive.

Formalization Note A net is encoded by a nonempty type III (in the universe of EEE) with a partial order that is directed, and convergence is along the atTop filter. Strong convergence is convergence in the operator norm of StrongDual ℝ E. Weak** convergence of xix_ixi​ to x∗∗x^{**}x∗∗ is pointwise convergence ⟨xi,y∗⟩→x∗∗(y∗)\langle x_i, y^* \rangle \to x^{**}(y^*)⟨xi​,y∗⟩→x∗∗(y∗) for every y∗∈E∗y^* \in E^*y∗∈E∗. Boundedness is sup⁡i∥xi∥<∞\sup_i \|x_i\| < \inftysupi​∥xi​∥<∞.

Preamble
import Mathlib
import Definitions.Def_RockafellarMaxMono_Shared_ProperConvex
import Definitions.Def_RockafellarMaxMono_Shared_Subdiff
import Definitions.Def_RockafellarMaxMono_Shared_Conj
open Filter Topology
universe u
Formal statement
namespace RockafellarMaxMono.Cyclic

theorem conj_subdiff_iff_nets {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [CompleteSpace E] (f : E → EReal) (hf : Shared.ProperConvex f) (hlsc : LowerSemicontinuous f)
    (x' : StrongDual ℝ E) (x'' : StrongDual ℝ (StrongDual ℝ E)) :
    x'' ∈ Shared.subdiff (Shared.conj f) x' ↔
      ∃ (I : Type u) (_ : PartialOrder I) (_ : IsDirected I (· ≤ ·)) (_ : Nonempty I)
        (xs' : I → StrongDual ℝ E) (xs : I → E),
        Tendsto xs' atTop (𝓝 x') ∧
        (∃ C : ℝ, ∀ i, ‖xs i‖ ≤ C) ∧
        (∀ y' : StrongDual ℝ E,
          Tendsto (fun i => NormedSpace.inclusionInDoubleDual ℝ E (xs i) y') atTop (𝓝 (x'' y'))) ∧
        ∀ i, xs' i ∈ Shared.subdiff f (xs i) := by sorry

end RockafellarMaxMono.Cyclic
Source
Rockafellar, On the maximal monotonicity of subdifferential mappings, Pacific J. Math. 33 (1970), p. 211, Proposition 1
Read-back

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

Spaces.

  • EEE is a real Banach space (in a fixed universe of types).
  • E∗E^*E∗ is its continuous dual, with the dual norm.
  • E∗∗E^{**}E∗∗ is the continuous dual of E∗E^*E∗.
  • ι:E→E∗∗\iota : E \to E^{**}ι:E→E∗∗ is the canonical embedding, ι(x)(y′)=y′(x)\iota(x)(y') = y'(x)ι(x)(y′)=y′(x).

Hypotheses on fff. f:E→[−∞,+∞]f : E \to [-\infty, +\infty]f:E→[−∞,+∞] satisfies two conditions:

  • the bundle's "proper convex" predicate, whose code is not supplied;
  • lower semicontinuity in the norm topology.

Unseen notation. Two bundle definitions are used whose code is not included:

  • f∗f^*f∗, the bundle's conjugate operation applied to fff. It is a function on E∗E^*E∗.
  • ∂\partial∂, the bundle's subdifferential operation. Applied to a function on EEE it gives subsets of E∗E^*E∗; applied to a function on E∗E^*E∗ it gives subsets of E∗∗E^{**}E∗∗.

Claim. Fix x′∈E∗x' \in E^*x′∈E∗ and x′′∈E∗∗x'' \in E^{**}x′′∈E∗∗. Then

x′′∈∂f∗(x′)x'' \in \partial f^*(x')x′′∈∂f∗(x′)

holds if and only if there exist the following objects:

  • A nonempty, partially ordered, upward-directed index set III, living in the same type universe as EEE. Upward-directed means any two indices have a common upper bound.
  • Nets (xi′)i∈I(x_i')_{i \in I}(xi′​)i∈I​ in E∗E^*E∗ and (xi)i∈I(x_i)_{i \in I}(xi​)i∈I​ in EEE.

These objects must satisfy all four of the following:

  1. xi′→x′x_i' \to x'xi′​→x′ in the norm topology of E∗E^*E∗, as iii increases along III.
  2. The net (xi)(x_i)(xi​) is norm-bounded: there is a real CCC with ∥xi∥≤C\|x_i\| \le C∥xi​∥≤C for all iii.
  3. For every y′∈E∗y' \in E^*y′∈E∗,   y′(xi)=ι(xi)(y′)→x′′(y′)\;y'(x_i) = \iota(x_i)(y') \to x''(y')y′(xi​)=ι(xi​)(y′)→x′′(y′). In other words, ι(xi)→x′′\iota(x_i) \to x''ι(xi​)→x′′ in the weak-* topology of E∗∗E^{**}E∗∗.
  4. For every iii,   xi′∈∂f(xi)\;x_i' \in \partial f(x_i)xi′​∈∂f(xi​).

Degenerate cases.

  • If E={0}E = \{0\}E={0}, then E∗=E∗∗={0}E^* = E^{**} = \{0\}E∗=E∗∗={0}. Conditions 1–3 hold automatically for any nets, so the equivalence reduces to: 0∈∂f∗(0)0 \in \partial f^*(0)0∈∂f∗(0) if and only if 0∈∂f(0)0 \in \partial f(0)0∈∂f(0).
  • The index set is required to be nonempty, so the right-hand side cannot be satisfied by an empty net.
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