Truncated Conjugate Image Identification
ProvedFunctionalInequalities.Analysis.subgradientImage_truncatedConjugate_eq_readableThis gives the Danskin-type identification of a truncated-conjugate subgradient image.
Let be a finite-dimensional real inner-product space, let be continuous and strictly convex, and let . Let satisfy the interior-maximizer condition: for every and every ,
Then
This result converts a subgradient image of the truncated conjugate into an inverse subgradient image of .
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem subgradientImage_truncatedConjugate_eq {u : E → ℝ} (hu : Continuous u)
(hstrict : StrictConvexOn ℝ univ u) {M : ℝ} (hM : 0 ≤ M) {S : Set E}
(hS : ∀ p ∈ S, ∀ x ∈ closedBall (0 : E) M, truncatedConjugate u M p = ⟪p, x⟫ - u x → ‖x‖ < M) :
subgradientImage (truncatedConjugate u M) S = {x | ∃ p ∈ S, ∀ y, u x + ⟪p, y - x⟫ ≤ u y}
Module navigation
Module: Analysis/Convex/Caffarelli.
Definition modules: Analysis/Convex/Subgradient.
Supporting theorems: exists_truncatedConjugate_eq, n7_subgradient_eq_maximizer.
Previous: n7_subgradient_eq_maximizer · Next: eq_of_two_contacts_below.
Source excerpt, lines 1661–1664 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Caffarelli
open Set Metric
open scoped RealInnerProductSpace Topology
variable {E : Type*}
variable [NormedAddCommGroup E] [InnerProductSpace ℝ E]
variable [FiniteDimensional ℝ E]
theorem FunctionalInequalities.Analysis.subgradientImage_truncatedConjugate_eq_readable {u : E → ℝ} (hu : Continuous u)
(hstrict : StrictConvexOn ℝ univ u) {M : ℝ} (hM : 0 ≤ M) {S : Set E}
(hS : ∀ p ∈ S, ∀ x ∈ closedBall (0 : E) M, truncatedConjugate u M p = ⟪p, x⟫ - u x → ‖x‖ < M) :
subgradientImage (truncatedConjugate u M) S = {x | ∃ p ∈ S, ∀ y, u x + ⟪p, y - x⟫ ≤ u y} := by sorry