Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix (5) — the quadratic 12u′′(−∞)(y−μx)2+u′(μx)(y−μx)+u(μx)\tfrac12u''(-\infty)(y-\mu_x)^2+u'(\mu_x)(y-\mu_x)+u(\mu_x)21​u′′(−∞)(y−μx​)2+u′(μx​)(y−μx​)+u(μx​) supports uuu

Proved
RobustMeanCov.OnePoint.quadratic_five_supports

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

limitsp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1supporting-quadratic

Let u:R→Ru:\mathbb R\to\mathbb Ru:R→R be concave and twice differentiable with convex derivative u′u'u′, and suppose u′′(y)→L∈Ru''(y)\to L\in\mathbb Ru′′(y)→L∈R as y→−∞y\to-\inftyy→−∞. Fix m∈Rm\in\mathbb Rm∈R and let d(y)=u(y)−u(m)(y−m)2−u′(m)y−md(y)=\frac{u(y)-u(m)}{(y-m)^2}-\frac{u'(m)}{y-m}d(y)=(y−m)2u(y)−u(m)​−y−mu′(m)​ for y≠my\neq my=m. Then

  1. the quadratic (5)
q(y)=12L (y−m)2+u′(m)(y−m)+u(m)q(y)=\tfrac12 L\,(y-m)^2+u'(m)(y-m)+u(m)q(y)=21​L(y−m)2+u′(m)(y−m)+u(m)

supports uuu: q(y)≤u(y)q(y)\le u(y)q(y)≤u(y) for every y∈Ry\in\mathbb Ry∈R; 2. inf⁡y≠md(y)=12L\inf_{y\neq m}d(y)=\tfrac12 Linfy=m​d(y)=21​L, i.e. 12L\tfrac12L21​L is the greatest lower bound of {d(y):y≠m}\{d(y):y\ne m\}{d(y):y=m}; 3. d(y)→12Ld(y)\to\tfrac12Ld(y)→21​L as y→−∞y\to-\inftyy→−∞.

For every law of mean mmm and variance s2s^2s2 one has E[q(r)]=u(m)+s22LE[q(r)]=u(m)+\frac{s^2}{2}LE[q(r)]=u(m)+2s2​L, so with Proposition 3 this gives the lower bound matching (4) in the proof of Proposition 7(a).

Formalization Note LLL is the paper's u′′(−∞)u''(-\infty)u′′(−∞), taken as an explicit finite limit hypothesis.

Preamble
import Mathlib
open Filter Topology
Formal statement
namespace RobustMeanCov.OnePoint

theorem quadratic_five_supports (u : ℝ → ℝ) (hconc : ConcaveOn ℝ Set.univ u)
    (hu : Differentiable ℝ u) (hu' : Differentiable ℝ (deriv u))
    (hconv : ConvexOn ℝ Set.univ (deriv u)) (L : ℝ)
    (hL : Tendsto (deriv (deriv u)) atBot (𝓝 L)) (m : ℝ) :
    (∀ y : ℝ, 1 / 2 * L * (y - m) ^ 2 + deriv u m * (y - m) + u m ≤ u y) ∧
    IsGLB ((fun y : ℝ => (u y - u m) / (y - m) ^ 2 - deriv u m / (y - m)) '' {y | y ≠ m})
      (1 / 2 * L) ∧
    Tendsto (fun y : ℝ => (u y - u m) / (y - m) ^ 2 - deriv u m / (y - m)) atBot
      (𝓝 (1 / 2 * L)) := by sorry

end RobustMeanCov.OnePoint
Source
Popescu, Robust Mean-Covariance Solutions for Stochastic Optimization, Oper. Res. 55(1), 2007, p. 110, Appendix, proof of Proposition 7, (5) and the paragraph following it
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

This is a theorem. Let u:R→Ru:\mathbb{R}\to\mathbb{R}u:R→R satisfy four hypotheses:

  • uuu is concave on R\mathbb{R}R;
  • uuu is differentiable everywhere;
  • u′u'u′ is differentiable everywhere, with derivative u′′u''u′′;
  • u′u'u′ is convex on R\mathbb{R}R.

Let LLL be a real number with u′′(y)→Lu''(y)\to Lu′′(y)→L as y→−∞y\to-\inftyy→−∞, and let mmm be any real number. Define, for y≠my \ne my=m,

g(y)=u(y)−u(m)(y−m)2−u′(m)y−m.g(y) = \frac{u(y)-u(m)}{(y-m)^2} - \frac{u'(m)}{y-m}.g(y)=(y−m)2u(y)−u(m)​−y−mu′(m)​.

The theorem asserts all three of the following:

  1. For every real yyy,
12L (y−m)2+u′(m) (y−m)+u(m)  ≤  u(y).\tfrac12 L\,(y-m)^2 + u'(m)\,(y-m) + u(m) \;\le\; u(y).21​L(y−m)2+u′(m)(y−m)+u(m)≤u(y).
  1. 12L\tfrac12 L21​L is the greatest lower bound of the set { g(y):y∈R, y≠m }\{\,g(y) : y\in\mathbb{R},\ y\neq m\,\}{g(y):y∈R, y=m}. That is, 12L≤g(y)\tfrac12 L \le g(y)21​L≤g(y) for every y≠my\ne my=m, and every lower bound of this set is ≤12L\le \tfrac12 L≤21​L.
  2. g(y)→12Lg(y)\to\tfrac12 Lg(y)→21​L as y→−∞y\to-\inftyy→−∞.

Degenerate cases:

  • Infimum, not minimum. Item 2 asserts an infimum. It does not say that 12L\tfrac12 L21​L is attained.
  • The point y=my=my=m is excluded from the set in item 2. Under the division-by-zero convention, g(m)g(m)g(m) would be 000.
  • The quadratic in item 1 equals u(m)u(m)u(m) at y=my=my=m.
  • Missing limit. If u′′u''u′′ has no finite limit at −∞-\infty−∞, the theorem does not apply.
  • No behaviour as y→+∞y\to+\inftyy→+∞ is asserted.
Human review
  • Endorsed by Shuze Chen · Sep 28, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 28, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me