Theorem 4 — Bregman proximal point sequences exist when im ∇h = ℝⁿ, or im ∇h is open and 0 ∈ im T
ProvedBregmanPPA.Existence.theorem4Let be a finite-dimensional real inner product space (the paper's ), let be a maximal monotone operator, and let be a Bregman function with zone . Suppose that either
- , or
- is open and ,
where . Then for every sequence of positive scalars and every there is an infinite sequence starting at and conforming to the recursion (3),
that is, and for every .
Theorem 1 of the paper describes the behaviour of such sequences; this theorem gives conditions under which they exist at all. Without them the method can halt: the next iterate need not exist.
Formalization Note The scalars are not fixed by the statement and are quantified over all positive sequences (Theorem 1's extra condition is not needed for existence). The hypothesis is without closures, as printed. Recursion (3) is encoded through the equivalent inclusion (4) (p. 207) with all iterates in , so the conclusion includes that every iterate stays in the zone. is the image of under , not the range of Mathlib's total gradient h.
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
/-- Theorem 4 (p. 209): let `T` be maximal monotone and `h` a Bregman function with zone
`S ⊇ dom T`. If `im ∇h = ℝⁿ`, or `im ∇h` is open and `0 ∈ im T`, then for every sequence of
positive scalars `c k` and every `x⁰ ∈ dom ∇h = S`, an infinite sequence conforming to the
recursion (3) and starting at `x⁰` exists. -/
theorem theorem4 {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 : ℕ → ℝ, (∀ k, 0 < c k) → ∀ x₀ ∈ S,
∃ x : ℕ → H, x 0 = x₀ ∧ IsBregmanPPARun S h T c x := by sorry
end BregmanPPA.Existence
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.