Theorem 3 [5] (Brézis–Haraux) — int im(A + B) = int(im A + im B) and the same for closures
ProvedBregmanPPA.Existence.theorem3Let be a finite-dimensional real inner product space and let be monotone operators such that
- ;
- is maximal monotone, where ;
- has the L-property.
Then
where is the Minkowski sum of the two images.
The inclusion is trivial; the theorem says the range of a sum is "almost" the sum of the ranges. The paper uses it with and to show that is defined on all of the zone of .
Formalization Note " is maximal" is read as maximal monotone (published IsMaximalMonotone); the sum is the published DouglasRachfordPPA.GenDR.opAdd, with domain , and images are imOp. The paper's conclusion (B) prints an overbar over each whole side, i.e. topological closures. Monotonicity of is stated as its own hypothesis as on the page, although the L-property as encoded already includes it.
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
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.