Lemma A4 — a subdifferential chain rule for f₀ ∘ (f₁, …, f_m) with f₀ nondecreasing
ProvedBregmanPPA.ProxMult.lemmaA4Let be proper convex functions on with , and write . Let be a proper convex function on which is nondecreasing ( componentwise implies ). Define by when and when for some . Then is proper and convex, and if is differentiable at , with ,
The lemma computes for in the proof of (14).
Formalization Note The paper says "nondecreasing in the sense of Lemma 5" and, in the definition of , ""; the paper has no Lemma 5 and has components, so the intended readings are Lemma 2 and . " differentiable at " is encoded as: each finite, finite on a neighbourhood of , and the real function differentiable there. The sum is a Minkowski sum, and a term with is , following the proof's convention (p. 225, where the terms with are absorbed into the normal cones of ): RHS iff with and whenever . is Mathlib's intrinsicInterior.
import Mathlib import Definitions.Def_BregmanPPA_Convergence_Model import Definitions.Def_BregmanPPA_IneqMult_Program open Filter Topology InertialFB.IFB
namespace BregmanPPA.ProxMult
/-- Lemma A4 (a subdifferential chain rule), p. 224. `F i` are the paper's `fᵢ`, `F₀` is `f₀`
(nondecreasing in the sense of Lemma 2), `compositeFn F F₀` is `G`. "`f₀` differentiable at
`f(x⁰) ∈ ℝᵐ`" is: every `fᵢ(x⁰)` finite, `f₀` finite near `f(x⁰)`, and its real version
differentiable there. In the sum, a term with coefficient `0` is `{0}` (the paper's convention,
p. 225). -/
theorem lemmaA4 {n m : ℕ} (F : Fin m → BregmanPPA.IneqMult.E n → EReal) (F₀ : BregmanPPA.IneqMult.E m → EReal) (x₀ : BregmanPPA.IneqMult.E n)
(hF : ∀ i, IsProperFn (F i) ∧ IsConvexFn (F i))
(hri : ∃ x : BregmanPPA.IneqMult.E n, ∀ i, x ∈ intrinsicInterior ℝ {y : BregmanPPA.IneqMult.E n | F i y ≠ ⊤})
(hF₀ : IsProperFn F₀ ∧ IsConvexFn F₀)
(hmono : ∀ u v : BregmanPPA.IneqMult.E m, (∀ i, u i ≤ v i) → F₀ u ≤ F₀ v)
(hfinite : ∀ i, F i x₀ ≠ ⊤)
(hF₀near : ∀ᶠ z in 𝓝 (BregmanPPA.IneqMult.gvec F x₀), F₀ z ≠ ⊤)
(hdiff : DifferentiableAt ℝ (fun z : BregmanPPA.IneqMult.E m => (F₀ z).toReal) (BregmanPPA.IneqMult.gvec F x₀)) :
IsProperFn (BregmanPPA.IneqMult.compositeFn F F₀) ∧
IsConvexFn (BregmanPPA.IneqMult.compositeFn F F₀) ∧
BregmanPPA.Convergence.subdiffOp (BregmanPPA.IneqMult.compositeFn F F₀) x₀ =
{v | ∃ ν : BregmanPPA.IneqMult.E n, ν ∈ BregmanPPA.IneqMult.normalCone {x | BregmanPPA.IneqMult.compositeFn F F₀ x ≠ ⊤} x₀ ∧
∃ ξ : Fin m → BregmanPPA.IneqMult.E n,
(∀ i, (gradient (fun z : BregmanPPA.IneqMult.E m => (F₀ z).toReal) (BregmanPPA.IneqMult.gvec F x₀)) i ≠ 0 →
IsSubgradient (F i) x₀ (ξ i)) ∧
v = ν + ∑ i, (gradient (fun z : BregmanPPA.IneqMult.E m => (F₀ z).toReal) (BregmanPPA.IneqMult.gvec F x₀)) i • ξ i} := by sorry
end BregmanPPA.ProxMult
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.