Proof of Theorem 4 — in cases (i) and (ii), im ∇h ⊆ im(∇h + cT) for every c > 0
ProvedBregmanPPA.Existence.theorem4_imageLet be a finite-dimensional real inner product space, a maximal monotone operator, and a Bregman function with zone . Suppose that either
- is all of , or
- is open and .
Then for every ,
that is, for every there are and with . Equivalently, is defined throughout , and its values lie in .
This is the one-step existence statement that the induction in the proof of Theorem 4 iterates.
Formalization Note The page argues for ; the induction applies the argument to , which is maximal monotone with the same domain as , and iff . The statement is therefore made for with an arbitrary . is the image of the zone, not the range of Mathlib's total gradient h, which takes the junk value off the differentiability set. In case (i) the page concludes the stronger ; the stated inclusion is what both cases give and what the induction uses.
import Mathlib import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators import Definitions.Def_DouglasRachfordPPA_GenDR_Operators import Definitions.Def_BregmanPPA_Convergence_Model import Definitions.Def_BregmanPPA_Existence_Operators open ThreeOpSplitting.Convergence DouglasRachfordPPA.GenDR
namespace BregmanPPA.Existence
/-- Proof of Theorem 4 (p. 209), cases (i) and (ii): if `im ∇h = ℝⁿ`, or `im ∇h` is open and
`0 ∈ im T`, then for every `c > 0`, `im ∇h ⊆ im(∇h + cT)`; that is, `(∇h + cT)⁻¹ ∘ ∇h` is defined
throughout `dom ∇h = S`. -/
theorem theorem4_image {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
[FiniteDimensional ℝ H] (T : H → Set H) (S : Set H) (h : H → ℝ)
(hT : IsMaximalMonotone T) (hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hdom : dom T ⊆ S)
(hcase : gradient h '' S = Set.univ ∨
(IsOpen (gradient h '' S) ∧ (0 : H) ∈ imOp T))
(c : ℝ) (hc : 0 < c) :
gradient h '' S ⊆ imOp (opAdd (gradOp S h) (opSmul c T)) := by sorry
end BregmanPPA.Existence
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.