Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

PROPOSITION 1 — the risk-neutral flexibility premium is nonnegative, and zero at low reliability or perfect correlation

Proved
MixFlex.RiskNeutral.flexibility_premium_nonneg

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

flexibilitynewsvendorp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1unreliable-supply

Consider the SD and SF networks of the mission's model: NNN products with common margin p>0p>0p>0, dedicated resources with marginal total cost c>0c>0c>0, a flexible resource with marginal total cost cN+1c_{N+1}cN+1​, common reliability θ∈[0,1]\theta\in[0,1]θ∈[0,1] and committed cost fraction λ∈[0,1]\lambda\in[0,1]λ∈[0,1], Bernoulli yields independent of each other and of the nonnegative integrable demand vector X~\tilde XX~. For a risk-neutral firm and any such demand vector:

  1. the flexibility premium is nonnegative, ΔRN≥0\Delta_{RN}\ge 0ΔRN​≥0, for all 0≤θ≤10\le\theta\le 10≤θ≤1: SF is weakly preferred to SD whenever cN+1≤cc_{N+1}\le ccN+1​≤c;
  2. if
0≤θ≤λcp−(1−λ)c,0\le\theta\le\frac{\lambda c}{p-(1-\lambda)c},0≤θ≤p−(1−λ)cλc​,

then ΔRN=0\Delta_{RN}=0ΔRN​=0: at cN+1=cc_{N+1}=ccN+1​=c the firm is indifferent, VRNSF,∗=VRNSD,∗V^{SF,*}_{RN}=V^{SD,*}_{RN}VRNSF,∗​=VRNSD,∗​; 3. if ρX=1\rho_X=\mathbf 1ρX​=1, i.e. every pair of demands has correlation coefficient 111, then ΔRN=0\Delta_{RN}=0ΔRN​=0.

This is Proposition 1 of Tomlin and Wang (2005). It says that under risk neutrality, with equal reliabilities and costs, the demand-pooling benefit of a flexible resource always outweighs its resource-aggregation risk, and that even without a pooling benefit (perfectly correlated demand) the firm is still indifferent.

Formalization Note ΔRN\Delta_{RN}ΔRN​ is not defined as a number, because Definition 1's indifference cost need not exist or be unique (in regime 2 both optimal values are 000 for every cN+1c_{N+1}cN+1​ near ccc). "Δ≥0\Delta\ge 0Δ≥0" is encoded as "SF is weakly preferred for every cN+1≤cc_{N+1}\le ccN+1​≤c", following the page's "the firm prefers the SF network as long as cN+1≤(1+Δ)cc_{N+1}\le(1+\Delta)ccN+1​≤(1+Δ)c"; "Δ=0\Delta=0Δ=0" as "SF and SD are each weakly preferred to the other at cN+1=cc_{N+1}=ccN+1​=c". Weak preference VSF,∗≥VSD,∗V^{SF,*}\ge V^{SD,*}VSF,∗≥VSD,∗ is "every nonnegative SD investment is matched by a nonnegative SF investment", avoiding real suprema. No joint density is assumed: the proposition is for any demand vector, and a density would make part 3 vacuous for N≥2N\ge 2N≥2. Part 3 adds square integrability and positive variances, the conditions under which correlation coefficients exist. When p≤(1−λ)cp\le(1-\lambda)cp≤(1−λ)c, Lean's value of λc/(p−(1−λ)c)\lambda c/(p-(1-\lambda)c)λc/(p−(1−λ)c) is ≤0\le 0≤0 (it is 000 on division by zero), so part 2 then applies only at θ=0\theta=0θ=0, where it is true.

Preamble
import Mathlib
import Definitions.Def_MixFlex_RiskNeutral_Model
Formal statement
namespace MixFlex.RiskNeutral

open MeasureTheory ProbabilityTheory

/-- Proposition 1, p. 42. For any demand random vector: (i) the risk-neutral flexibility premium is
nonnegative for all `0 ≤ θ ≤ 1` (SF is preferred whenever `c_{N+1} ≤ c`); (ii)
`θ ≤ λc/(p − (1 − λ)c)` implies `Δ_RN = 0` (`c_{N+1} = c` is an indifference cost); (iii) if all
pairwise demand correlations equal `1`, then `Δ_RN = 0`. -/
theorem flexibility_premium_nonneg (P : Params) (hP : P.Standing) {N : ℕ} {Ω : Type*}
    [MeasurableSpace Ω] (μ : Measure Ω) (X : Ω → Fin N → ℝ) (Y : Ω → Fin (N + 1) → ℝ)
    (hS : Setting P μ X Y) :
    PremiumNonneg P μ X Y ∧
    (P.theta ≤ P.lam * P.c / (P.p - (1 - P.lam) * P.c) → PremiumZero P μ X Y) ∧
    ((∀ n, MemLp (fun ω => X ω n) 2 μ) → (∀ n, 0 < variance (fun ω => X ω n) μ) →
      (∀ m n, correlation μ (fun ω => X ω m) (fun ω => X ω n) = 1) → PremiumZero P μ X Y) := by sorry

end MixFlex.RiskNeutral
Source
Tomlin and Wang, On the value of mix flexibility and dual sourcing in unreliable newsvendor networks, Manufacturing Service Oper. Management 7(1), 2005, p. 42, §3.1, PROPOSITION 1; DEFINITIONS 1–2, p. 41
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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