Penalized Maximum Second-Difference Estimate
ProvedFunctionalInequalities.Analysis.sd_penalized_estimate_readableThis is a technical estimate at a penalized maximum of a convex function's second difference.
Let be finite-dimensional, let be differentiable, let be convex, and let . Assume that is convex. Suppose there is such that
for every . For , , assume that the penalized second difference at dominates that at every , and that the corresponding comparison for is at most . Then
where . This auxiliary estimate is the algebraic maximum-principle step before letting .
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
set_option maxHeartbeats 800000 in
private lemma sd_penalized_estimate {u V : E → ℝ}
(hconv : ConvexOn ℝ univ u) (hu : Differentiable ℝ u)
(hV : Differentiable ℝ V) {κ : ℝ} (hκ : 0 < κ)
(hstrong : ConvexOn ℝ univ (fun y => V y - (κ / 2) * ‖y‖ ^ 2))
{C : ℝ} (hC : ∀ x, |fderiv ℝ V (gradient u x) (gradient u x)| ≤ C)
(n : ℕ) (h x₀ : E) {η : ℝ} (hη : 0 < η)
(hmaximum : ∀ y, u (y + h) + u (y - h) - 2 * u y - η * u y ≤
u (x₀ + h) + u (x₀ - h) - 2 * u x₀ - η * u x₀)
(hcomparison :
(V (gradient u (x₀ + h)) - u (x₀ + h)) +
(V (gradient u (x₀ - h)) - u (x₀ - h)) -
2 * (V (gradient u x₀) - u x₀) ≤ η * n) :
u (x₀ + h) + u (x₀ - h) - 2 * u x₀ ≤
4 * ‖h‖ ^ 2 / κ + 2 * ‖h‖ * Real.sqrt (η * (n + C) / κ)
Module navigation
Module: Analysis/Convex/SecondDifference.
Previous: lipschitzWith_gradient_of_second_difference_le · Next: secondDifference_le_of_penalized_maxima.
Source excerpt, lines 586–600 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_SecondDifference
open Set
variable {E : Type*}
variable [NormedAddCommGroup E] [InnerProductSpace ℝ E]
variable [FiniteDimensional ℝ E]
set_option maxHeartbeats 800000
lemma FunctionalInequalities.Analysis.sd_penalized_estimate_readable {u V : E → ℝ}
(hconv : ConvexOn ℝ univ u) (hu : Differentiable ℝ u)
(hV : Differentiable ℝ V) {κ : ℝ} (hκ : 0 < κ)
(hstrong : ConvexOn ℝ univ (fun y => V y - (κ / 2) * ‖y‖ ^ 2))
{C : ℝ} (hC : ∀ x, |fderiv ℝ V (gradient u x) (gradient u x)| ≤ C)
(n : ℕ) (h x₀ : E) {η : ℝ} (hη : 0 < η)
(hmaximum : ∀ y, u (y + h) + u (y - h) - 2 * u y - η * u y ≤
u (x₀ + h) + u (x₀ - h) - 2 * u x₀ - η * u x₀)
(hcomparison :
(V (gradient u (x₀ + h)) - u (x₀ + h)) +
(V (gradient u (x₀ - h)) - u (x₀ - h)) -
2 * (V (gradient u x₀) - u x₀) ≤ η * n) :
u (x₀ + h) + u (x₀ - h) - 2 * u x₀ ≤
4 * ‖h‖ ^ 2 / κ + 2 * ‖h‖ * Real.sqrt (η * (n + C) / κ) := by sorry