(48), proof of Lemma 5.1, p. 15 — the monotonicity inequality of A at x_{k+1} and a zero of A + B + C
ProvedFRBSplitting.ThreeOp.eq_48Let be a real inner product space, monotone, and arbitrary maps. Let , let be the resolvent of , and let be generated by the three-operator scheme (47),
Let , i.e. . Then for every ,
This is the starting inequality of the analysis of the scheme: each of the six terms is then estimated separately, using the monotonicity and Lipschitz continuity of and the cocoercivity of , to obtain the energy inequality of Lemma 5.1.
Formalization Note. The resolvent is a hypothesis: J : ℝ → H → H with IsResolventFamily A J, i.e. for every and . Indices are shifted by one: Lean's x j is , so are x (k+2), x (k+1), x k. The inequality uses only the monotonicity of , so the statement assumes only that (no maximality, no Lipschitz or cocoercivity hypotheses on and ); it is therefore slightly more general than the paper's setting.
import Mathlib import Definitions.Def_ThreeOpSplitting_Accel_MonotoneOperators import Definitions.Def_FRBSplitting_ThreeOp_Setting open InnerProductSpace ThreeOpSplitting.Accel
namespace FRBSplitting.ThreeOp
theorem eq_48 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
(A : H → Set H) (B C : H → H) (J : ℝ → H → H) (lam : ℝ)
(hA : IsMonotoneOp A)
(hJ : IsResolventFamily A J)
(hlam0 : 0 < lam)
(x : ℕ → H) (hrun : IsThreeOpRun J B C lam x)
(xs : H) (hxs : xs ∈ FRBSplitting.Weak.zeroSet A (fun y => B y + C y)) :
∀ k : ℕ, 0 ≤ ⟪x (k + 2) - x (k + 1), xs - x (k + 2)⟫_ℝ
+ lam * ⟪B (x (k + 1)) - B xs, xs - x (k + 2)⟫_ℝ
+ lam * ⟪B (x (k + 1)) - B (x k), xs - x (k + 1)⟫_ℝ
+ lam * ⟪B (x (k + 1)) - B (x k), x (k + 1) - x (k + 2)⟫_ℝ
+ lam * ⟪C (x (k + 1)) - C xs, xs - x (k + 1)⟫_ℝ
+ lam * ⟪C (x (k + 1)) - C xs, x (k + 1) - x (k + 2)⟫_ℝ := by sorry
end FRBSplitting.ThreeOp
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.