Lemma A4 — a subdifferential chain rule for nondecreasing convex composition
ProvedBregmanPPA.IneqMult.lemmaA4Let be proper convex functions on whose effective domains have a common relative-interior point. Let be a proper convex function on that is nondecreasing in every coordinate, and let when every inner value is finite, with otherwise. Then is convex. At any point where every inner value is finite and is finite near the vector of inner values and differentiable there, is proper and
The chain rule is used for the first-order condition of the primal subproblem in the proof of Theorem 7.
Formalization Note The paper prints “Lemma 5” when referring to monotonicity; Lemma 2 is intended. It also prints the first case of as “”; is intended. Convexity of is stated unconditionally, as on the page. The paper's unconditional claim that is proper is false without a point of (take , and the indicator of , so ); properness is therefore stated at the point of the chain rule, which supplies that witness. Local finiteness makes differentiability of the extended-real outer function meaningful. A zero coefficient contributes zero even if the corresponding inner subdifferential is empty.
import Mathlib import Definitions.Def_BregmanPPA_IneqMult_Program open Filter Topology InertialFB.IFB
namespace BregmanPPA.IneqMult
/-- Lemma A4, p. 224: the subdifferential chain rule. `G` is convex unconditionally;
properness needs a point of `dom G`, supplied by any `x₀` at which every inner value is
finite and `F₀` is finite near (hence differentiable at) the vector of inner values. -/
theorem lemmaA4 {n m : ℕ} (F : Fin m → E n → EReal) (F₀ : E m → EReal)
(hF : ∀ i, IsProperFn (F i) ∧ IsConvexFn (F i))
(hri : ∃ x : E n, ∀ i,
x ∈ intrinsicInterior ℝ {y : E n | F i y ≠ ⊤})
(hF₀ : IsProperFn F₀ ∧ IsConvexFn F₀)
(hmono : ∀ u v : E m, (∀ i, u i ≤ v i) → F₀ u ≤ F₀ v) :
IsConvexFn (compositeFn F F₀) ∧
∀ x₀ : E n, (∀ i, F i x₀ ≠ ⊤) →
(∀ᶠ z in 𝓝 (gvec F x₀), F₀ z ≠ ⊤) →
DifferentiableAt ℝ (fun z : E m => (F₀ z).toReal) (gvec F x₀) →
IsProperFn (compositeFn F F₀) ∧
BregmanPPA.Convergence.subdiffOp (compositeFn F F₀) x₀ =
{v | ∃ ν : E n,
ν ∈ normalCone {x | compositeFn F F₀ x ≠ ⊤} x₀ ∧
∃ ξ : Fin m → E n,
(∀ i, (gradient (fun z : E m => (F₀ z).toReal) (gvec F x₀)) i ≠ 0 →
IsSubgradient (F i) x₀ (ξ i)) ∧
v = ν + ∑ i, (gradient (fun z : E m => (F₀ z).toReal) (gvec F x₀)) i • ξ i} := by sorry
end BregmanPPA.IneqMult
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.