Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

(10)–(11) — the optimal flexible investment is the critical fractile of total demand

Proved
MixFlex.RiskNeutral.sf_optimal_investment

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

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

In the SF network of the mission's model, suppose θ>0\theta>0θ>0, let S=X~1+⋯+X~NS=\tilde X_1+\dots+\tilde X_NS=X~1​+⋯+X~N​ be total demand with distribution function FSF_SFS​, and let K∗≥0K^*\ge 0K∗≥0 satisfy the critical-fractile condition

FS(K∗)=1−(λ+(1−λ)θ) cN+1θp.F_S(K^*)=1-\frac{(\lambda+(1-\lambda)\theta)\,c_{N+1}}{\theta p}.FS​(K∗)=1−θp(λ+(1−λ)θ)cN+1​​.

Then K∗K^*K∗ maximizes VRNSFV^{SF}_{RN}VRNSF​ over all K≥0K\ge 0K≥0, and the optimal SF value is

VRNSF,∗=VRNSF(K∗)=θp E[S 1{S≤K∗}].V^{SF,*}_{RN}=V^{SF}_{RN}(K^*)=\theta p\,\mathbb E\big[S\,\mathbf 1\{S\le K^*\}\big].VRNSF,∗​=VRNSF​(K∗)=θpE[S1{S≤K∗}].

These are equations (10)–(11): the optimal flexible investment is a quantile of total demand, and its value is a partial expectation of total demand.

Formalization Note Mathlib has no quantile function F−1F^{-1}F−1; (10) is stated as "any K∗≥0K^*\ge 0K∗≥0 with FS(K∗)F_S(K^*)FS​(K∗) equal to the fractile is optimal". For a demand whose distribution function skips the fractile no such K∗K^*K∗ exists and the statement is vacuous for that instance. θ>0\theta>0θ>0 is needed for the fractile to be defined. ∫0K∗xf(x) dx\int_0^{K^*}xf(x)\,dx∫0K∗​xf(x)dx is rendered as E[S1{S≤K∗}]\mathbb E[S\mathbf 1\{S\le K^*\}]E[S1{S≤K∗}].

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

open MeasureTheory ProbabilityTheory

/-- (10)–(11), p. 42: any `K* ≥ 0` at which the distribution function of total demand equals the
critical fractile `1 − (λ + (1 − λ)θ) c_{N+1} / (θ p)` is an optimal SF investment, and the optimal
SF value is `θ p E[S · 1{S ≤ K*}]`. -/
theorem sf_optimal_investment (P : Params) (hP : P.Standing) {N : ℕ} {Ω : Type*}
    [MeasurableSpace Ω] (μ : Measure Ω) (X : Ω → Fin N → ℝ) (Y : Ω → Fin (N + 1) → ℝ)
    (hS : Setting P μ X Y) (htheta : 0 < P.theta) (cF Kstar : ℝ) (hK : 0 ≤ Kstar)
    (hq : μ.real {ω | ∑ n, X ω n ≤ Kstar}
      = 1 - (P.lam + (1 - P.lam) * P.theta) * cF / (P.theta * P.p)) :
    (∀ K : ℝ, 0 ≤ K → vSF P μ X Y cF K ≤ vSF P μ X Y cF Kstar) ∧
    vSF P μ X Y cF Kstar
      = P.theta * P.p * ∫ ω, (∑ n, X ω n) * (if ∑ n, X ω n ≤ Kstar then 1 else 0) ∂μ := 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, (10)–(11)
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