Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix (4) — the limit of U(p,x)U(p,x)U(p,x) as p→1p\to1p→1 is u(μx)+σx22lim⁡y→−∞u′′(y)u(\mu_x)+\tfrac{\sigma_x^2}{2}\lim_{y\to-\infty}u''(y)u(μx​)+2σx2​​limy→−∞​u′′(y)

Proved
RobustMeanCov.OnePoint.twoPointValue_tendsto_one

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

limitsp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1two-point-distribution

Let u:R→Ru:\mathbb R\to\mathbb Ru:R→R be concave and twice differentiable with convex derivative u′u'u′, let m∈Rm\in\mathbb Rm∈R and s>0s>0s>0, and let U(p)U(p)U(p) be the two-point objective (8) with mean mmm and standard deviation sss.

  1. If u′′(y)→L∈Ru''(y)\to L\in\mathbb Ru′′(y)→L∈R as y→−∞y\to-\inftyy→−∞, then
lim⁡p→1−U(p)=u(m)+s22 L.\lim_{p\to1^-}U(p)=u(m)+\frac{s^2}{2}\,L .p→1−lim​U(p)=u(m)+2s2​L.
  1. If u′′(y)→−∞u''(y)\to-\inftyu′′(y)→−∞ as y→−∞y\to-\inftyy→−∞, then U(p)→−∞U(p)\to-\inftyU(p)→−∞ as p→1−p\to1^-p→1−.

Since each U(p)U(p)U(p) is the expected utility of a law in M(m,s2)\mathbb M_{(m,s^2)}M(m,s2)​, this yields the upper bound (4) of the appendix, U(x)≤u(μx)+σx22lim⁡y→−∞u′′(y)U(x)\le u(\mu_x)+\frac{\sigma_x^2}{2}\lim_{y\to-\infty}u''(y)U(x)≤u(μx​)+2σx2​​limy→−∞​u′′(y), and in the second case shows U(x)=−∞U(x)=-\inftyU(x)=−∞.

Formalization Note Under these hypotheses u′′u''u′′ is nondecreasing and nonpositive, so its limit at −∞-\infty−∞ is either finite or −∞-\infty−∞; the two cases are stated separately with explicit limit hypotheses.

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

theorem twoPointValue_tendsto_one (u : ℝ → ℝ) (hconc : ConcaveOn ℝ Set.univ u)
    (hu : Differentiable ℝ u) (hu' : Differentiable ℝ (deriv u))
    (hconv : ConvexOn ℝ Set.univ (deriv u)) (m s : ℝ) (hs : 0 < s) :
    (∀ L : ℝ, Tendsto (deriv (deriv u)) atBot (𝓝 L) →
      Tendsto (twoPointValue u m s) (𝓝[<] 1) (𝓝 (u m + s ^ 2 / 2 * L))) ∧
    (Tendsto (deriv (deriv u)) atBot atBot →
      Tendsto (twoPointValue u m s) (𝓝[<] 1) atBot) := 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, (4) and the display preceding 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;
  • its derivative u′u'u′ is differentiable everywhere, with derivative u′′u''u′′;
  • u′u'u′ is convex on R\mathbb{R}R.

Let mmm be any real number and let s>0s>0s>0. Define V(p)=p u ⁣(m+(1−p)/p s)+(1−p) u ⁣(m−p/(1−p) s)V(p) = p\,u\!\left(m+\sqrt{(1-p)/p}\,s\right) + (1-p)\,u\!\left(m-\sqrt{p/(1-p)}\,s\right)V(p)=pu(m+(1−p)/p​s)+(1−p)u(m−p/(1−p)​s). The theorem asserts both of the following:

  1. For every real number LLL: if u′′(y)→Lu''(y)\to Lu′′(y)→L as y→−∞y\to-\inftyy→−∞, then
lim⁡p→1−V(p)=u(m)+s22 L.\lim_{p\to1^-} V(p) = u(m) + \frac{s^2}{2}\,L .p→1−lim​V(p)=u(m)+2s2​L.
  1. If u′′(y)→−∞u''(y)\to-\inftyu′′(y)→−∞ as y→−∞y\to-\inftyy→−∞, then V(p)→−∞V(p)\to-\inftyV(p)→−∞ as p→1−p\to1^-p→1−.

Both parts are conditional. If u′′u''u′′ has neither a finite limit nor the limit −∞-\infty−∞ as y→−∞y\to-\inftyy→−∞, the theorem asserts nothing about VVV. The limits are taken from the left only, over p<1p<1p<1; the value of VVV at p=1p=1p=1 itself is irrelevant. Nothing is said about p→0+p\to0^+p→0+ or about behaviour as y→+∞y\to+\inftyy→+∞. The requirement s>0s>0s>0 is strict, so s=0s=0s=0 and negative sss are not covered.

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