Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 [5] (Brézis–Haraux) — int im(A + B) = int(im A + im B) and the same for closures

Proved
BregmanPPA.Existence.theorem3

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

convex-analysisfunctional-analysismonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a finite-dimensional real inner product space and let A,B:H→2HA,B:H\to2^HA,B:H→2H be monotone operators such that

  1. dom⁡A⊆dom⁡B\operatorname{dom}A\subseteq\operatorname{dom}BdomA⊆domB;
  2. A+BA+BA+B is maximal monotone, where (A+B)(x)={a+b:a∈Ax, b∈Bx}(A+B)(x)=\{a+b: a\in Ax,\ b\in Bx\}(A+B)(x)={a+b:a∈Ax, b∈Bx};
  3. BBB has the L-property.

Then

int⁡(im⁡(A+B))=int⁡(im⁡A+im⁡B)andim⁡(A+B)‾=im⁡A+im⁡B‾,\operatorname{int}\bigl(\operatorname{im}(A+B)\bigr)=\operatorname{int}(\operatorname{im}A+\operatorname{im}B) \quad\text{and}\quad \overline{\operatorname{im}(A+B)}=\overline{\operatorname{im}A+\operatorname{im}B},int(im(A+B))=int(imA+imB)andim(A+B)​=imA+imB​,

where im⁡A+im⁡B\operatorname{im}A+\operatorname{im}BimA+imB is the Minkowski sum of the two images.

The inclusion im⁡(A+B)⊆im⁡A+im⁡B\operatorname{im}(A+B)\subseteq\operatorname{im}A+\operatorname{im}Bim(A+B)⊆imA+imB is trivial; the theorem says the range of a sum is "almost" the sum of the ranges. The paper uses it with A=TA=TA=T and B=∇hB=\nabla hB=∇h to show that (∇h+ckT)−1∘∇h(\nabla h+c_kT)^{-1}\circ\nabla h(∇h+ck​T)−1∘∇h is defined on all of the zone of hhh.

Formalization Note "A+BA+BA+B is maximal" is read as maximal monotone (published IsMaximalMonotone); the sum is the published DouglasRachfordPPA.GenDR.opAdd, with domain dom⁡A∩dom⁡B\operatorname{dom}A\cap\operatorname{dom}BdomA∩domB, and images are imOp. The paper's conclusion (B) prints an overbar over each whole side, i.e. topological closures. Monotonicity of BBB is stated as its own hypothesis as on the page, although the L-property as encoded already includes it.

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators
import Definitions.Def_DouglasRachfordPPA_GenDR_Operators
import Definitions.Def_BregmanPPA_Existence_LProperty

open ThreeOpSplitting.Convergence DouglasRachfordPPA.GenDR
open scoped Pointwise
Formal statement
namespace BregmanPPA.Existence

/-- Theorem 3 [5] (Brézis–Haraux, p. 209): if `A`, `B` are monotone, `dom A ⊆ dom B`, `A + B` is
maximal monotone and `B` has the L-property, then `int im(A + B) = int(im A + im B)` and
`cl im(A + B) = cl(im A + im B)`. -/
theorem theorem3 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [FiniteDimensional ℝ H] (A B : H → Set H)
    (hA : IsMonotoneOp A) (hB : IsMonotoneOp B)
    (ha : dom A ⊆ dom B)
    (hb : IsMaximalMonotone (opAdd A B))
    (hc : HasLProperty B) :
    interior (imOp (opAdd A B)) = interior (imOp A + imOp B) ∧
    closure (imOp (opAdd A B)) = closure (imOp A + imOp B) := by sorry

end BregmanPPA.Existence
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 209, Theorem 3 (citing Brézis–Haraux [5])
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