Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A2, Claim (A-18) — finite backup-capacity witness

Disproved
WangWebsterFlexibility.Threshold.claim_A18

by Shuze Chen · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

operations-researchp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-optimizationsupply-chain

Let independent nonnegative demands and margins π1>π2\pi_1>\pi_2π1​>π2​ be fixed, with 0<ρ<10<\rho<10<ρ<1 and 0≤c≤v<π20\le c\le v<\pi_20≤c≤v<π2​. There exist finite real numbers Γ,γ\Gamma,\gammaΓ,γ such that γ≥0\gamma\ge0γ≥0, c<γ+v≤Γc<\gamma+v\le\Gammac<γ+v≤Γ, and finite feasible decisions so,q1,q2≥0s^o,q_1,q_2\ge0so,q1​,q2​≥0 satisfying

udf(so,q1,q2;c,γ,v)≥Uff(c,γ,v).u_{df}(s^o,q_1,q_2;c,\gamma,v)\ge U_{ff}(c,\gamma,v).udf​(so,q1​,q2​;c,γ,v)≥Uff​(c,γ,v).

The finite feasible df witness is part of the conclusion, even if the ff supremum is not attained. This is the claim attached to the displayed cumulative-benefit inequality (A-18), after cancelling the baseline terms. The source's infeasible zero-cost endpoint in its proof is recorded as insight I2; it is not an added hypothesis or a repaired target.

Differences from the source:

  • encoding: independent nonnegative real random demands and nonnegative real decisions → Borel probability laws on nonnegative reals, their product measure, and nonnegative-real decision types; reason: the law-based representation covers all the original distributions and decisions, including atoms and unbounded support
  • reading: the cost regime γ+v≤Γ immediately preceding the Claim (A-18) → an existential admissible reservation fee γ at fixed demand laws, margins, reliability, c and v; reason: makes the implicit cost regime and parameter dependence explicit while retaining the finite witnessing decisions
  • encoding: the three baseline profit differences in (A-18) → u_df(sᵒ,q₁,q₂)≥U_ff after cancellation and replacing optimal ff notation by its value; reason: the finite df witness is preserved and the comparison does not presume an ff maximizer
  • encoding: separately optimized network profits → extended-real suprema over all feasible finite reservations and orders; reason: no boundedness or attainment assumption is supplied by the source; positive infinity must not become a default real zero
Preamble
import Definitions.Def_WangWebsterFlexibility_Threshold_Profits

open scoped NNReal
Formal statement
/- Imported definition bodies for the blind statement audit.
These are quotations of the imported Lean modules, not new declarations.

import Mathlib.MeasureTheory.Measure.ProbabilityMeasure
import Mathlib.MeasureTheory.Measure.Prod
import Mathlib.MeasureTheory.Integral.Bochner.Basic

open MeasureTheory

open scoped NNReal

namespace WangWebsterFlexibility.Threshold

/-- Two independent nonnegative demand laws and the common economic primitives (§3, pp. 9–11).
The laws are unrestricted Borel probability measures; no moment or density is assumed. -/
structure Model where
  demand₁ : ProbabilityMeasure ℝ≥0
  demand₂ : ProbabilityMeasure ℝ≥0
  π₁ : ℝ
  π₂ : ℝ
  ρ : ℝ

/-- Independence is implemented with the standard product measure. -/
noncomputable def Model.law (M : Model) : Measure (ℝ≥0 × ℝ≥0) :=
  (M.demand₁ : Measure ℝ≥0).prod (M.demand₂ : Measure ℝ≥0)

/-- Expected value under the independent demand laws. The sales expressions used below are
measurable and bounded for each fixed finite decision, even when demand has infinite mean. -/
noncomputable def Model.expect (M : Model) (f : ℝ≥0 × ℝ≥0 → ℝ) : ℝ :=
  ∫ d, f d ∂M.law

/-- Real positive part, used in the printed allocation formulas. -/
noncomputable def pos (x : ℝ) : ℝ := max 0 x

/-- Revenue net of exercise charges with dedicated available primary quantities (4), p. 12. -/
noncomputable def revenueDF (M : Model) (v : ℝ) (d : ℝ≥0 × ℝ≥0)
    (a₁ a₂ s : ℝ) : ℝ :=
  M.π₁ * min (d.1 : ℝ) a₁ + M.π₂ * min (d.2 : ℝ) a₂ +
    (M.π₁ - v) * min (pos ((d.1 : ℝ) - a₁)) s +
    (M.π₂ - v) * min (pos ((d.2 : ℝ) - a₂)) (pos (s - pos ((d.1 : ℝ) - a₁)))

/-- Revenue net of exercise charges when the flexible primary succeeds (5), p. 13. -/
noncomputable def revenueFF (M : Model) (v : ℝ) (d : ℝ≥0 × ℝ≥0)
    (q s : ℝ) : ℝ :=
  M.π₁ * min (d.1 : ℝ) q + M.π₂ * min (d.2 : ℝ) (pos (q - (d.1 : ℝ))) +
    (M.π₁ - v) * min (pos ((d.1 : ℝ) - q)) s +
    (M.π₂ - v) * min (pos ((d.2 : ℝ) - pos (q - (d.1 : ℝ))))
      (pos (s - pos ((d.1 : ℝ) - q)))

end WangWebsterFlexibility.Threshold


import Definitions.Def_WangWebsterFlexibility_Threshold_Model
import Mathlib.Data.EReal.Basic

open scoped NNReal

namespace WangWebsterFlexibility.Threshold

/-- Equation (4): independent primary failures, reservation paid up front, primary paid
on delivery including unsold units. Decisions are all nonnegative finite real numbers. -/
noncomputable def profitDF (M : Model) (c γ v : ℝ) (s q₁ q₂ : ℝ≥0) : ℝ :=
  -γ * (s : ℝ) - c * (1 - M.ρ) * ((q₁ : ℝ) + (q₂ : ℝ)) +
    M.ρ ^ 2 * M.expect (fun d => revenueDF M v d 0 0 s) +
    (1 - M.ρ) ^ 2 * M.expect (fun d => revenueDF M v d q₁ q₂ s) +
    M.ρ * (1 - M.ρ) * M.expect (fun d => revenueDF M v d q₁ 0 s) +
    M.ρ * (1 - M.ρ) * M.expect (fun d => revenueDF M v d 0 q₂ s)

/-- Equation (5): one common failure of the consolidated primary supplier. -/
noncomputable def profitFF (M : Model) (c γ v : ℝ) (s q : ℝ≥0) : ℝ :=
  -γ * (s : ℝ) - c * (1 - M.ρ) * (q : ℝ) +
    M.ρ * M.expect (fun d => revenueDF M v d 0 0 s) +
    (1 - M.ρ) * M.expect (fun d => revenueFF M v d q s)

/-- Independently optimized df value over the full feasible decision set, including zero.
The complete extended real order retains an unbounded supremum as positive infinity. -/
noncomputable def valueDF (M : Model) (c γ v : ℝ) : EReal :=
  ⨆ (s : ℝ≥0) (q₁ : ℝ≥0) (q₂ : ℝ≥0), (profitDF M c γ v s q₁ q₂ : EReal)

/-- Independently optimized ff value, with no assumed maximizer. -/
noncomputable def valueFF (M : Model) (c γ v : ℝ) : EReal :=
  ⨆ (s : ℝ≥0) (q : ℝ≥0), (profitFF M c γ v s q : EReal)

/-- Admissible reservation fee at fixed primary and exercise costs (§3, pp. 10–11). -/
def AdmissibleFee (c v γ : ℝ) : Prop := 0 ≤ γ ∧ c < γ + v

end WangWebsterFlexibility.Threshold

-/

namespace WangWebsterFlexibility.Threshold

/-- Appendix A2, Claim associated with (A-18), A16 (PDF 53): a finite feasible df
decision reaches the optimized ff value at some admissible cheap reservation fee. -/
theorem claim_A18 (M : Model)
    (hπ : M.π₂ < M.π₁)
    (hρ₀ : 0 < M.ρ) (hρ₁ : M.ρ < 1)
    (c v : ℝ) (hc : 0 ≤ c) (hcv : c ≤ v) (hvπ : v < M.π₂) :
    ∃ Γ γ : ℝ, AdmissibleFee c v γ ∧ γ + v ≤ Γ ∧
      ∃ s q₁ q₂ : ℝ≥0, valueFF M c γ v ≤ (profitDF M c γ v s q₁ q₂ : EReal) := by sorry

end WangWebsterFlexibility.Threshold
Source
Wang and Webster (2021), Product Flexibility Strategy Under Supply and Demand Risk, Manufacturing & Service Operations Management, https://doi.org/10.1287/msom.2021.1037, Appendix A2, proof of Proposition 8, Claim associated with equation (A-18), printed A16 / PDF 53
Read-back

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

Setting. Let MMM be any model with:

  • demand laws μ1,μ2\mu_1,\mu_2μ1​,μ2​ on [0,∞)[0,\infty)[0,∞);
  • reals π1,π2,ρ\pi_1,\pi_2,\rhoπ1​,π2​,ρ;
  • real numbers c,vc,vc,v;

subject to

0<ρ<1,0≤c≤v<π2<π1.0<\rho<1,\qquad 0\le c\le v<\pi_2<\pi_1.0<ρ<1,0≤c≤v<π2​<π1​.

Let ΠDF(c,γ,v;s,q1,q2)\Pi^{\mathrm{DF}}(c,\gamma,v;s,q_1,q_2)ΠDF(c,γ,v;s,q1​,q2​) be the dedicated profit and VFF(c,γ,v)V^{\mathrm{FF}}(c,\gamma,v)VFF(c,γ,v) the extended-real supremum of the flexible profit over all nonnegative decisions s,q≥0s,q\ge 0s,q≥0. Both are as defined in the Profits block:

ΠDF=−γs−c(1−ρ)(q1+q2)+ρ2E[RDF(d;0,0,s)]+(1−ρ)2E[RDF(d;q1,q2,s)]+ρ(1−ρ)(E[RDF(d;q1,0,s)]+E[RDF(d;0,q2,s)]),\Pi^{\mathrm{DF}}=-\gamma s-c(1-\rho)(q_1+q_2)+\rho^2\mathbb E[R^{\mathrm{DF}}(d;0,0,s)]+(1-\rho)^2\mathbb E[R^{\mathrm{DF}}(d;q_1,q_2,s)]+\rho(1-\rho)\big(\mathbb E[R^{\mathrm{DF}}(d;q_1,0,s)]+\mathbb E[R^{\mathrm{DF}}(d;0,q_2,s)]\big),ΠDF=−γs−c(1−ρ)(q1​+q2​)+ρ2E[RDF(d;0,0,s)]+(1−ρ)2E[RDF(d;q1​,q2​,s)]+ρ(1−ρ)(E[RDF(d;q1​,0,s)]+E[RDF(d;0,q2​,s)]), VFF=sup⁡s,q≥0(−γs−c(1−ρ)q+ρ E[RDF(d;0,0,s)]+(1−ρ) E[RFF(d;q,s)]).V^{\mathrm{FF}}=\sup_{s,q\ge0}\Big(-\gamma s-c(1-\rho)q+\rho\,\mathbb E[R^{\mathrm{DF}}(d;0,0,s)]+(1-\rho)\,\mathbb E[R^{\mathrm{FF}}(d;q,s)]\Big).VFF=s,q≥0sup​(−γs−c(1−ρ)q+ρE[RDF(d;0,0,s)]+(1−ρ)E[RFF(d;q,s)]).

Assertion. There exist reals Γ\GammaΓ and γ\gammaγ, and nonnegative reals s,q1,q2s,q_1,q_2s,q1​,q2​, such that all of the following hold:

  • γ\gammaγ is admissible, that is, γ≥0\gamma\ge 0γ≥0 and c<γ+vc<\gamma+vc<γ+v;
  • γ+v≤Γ\gamma+v\le\Gammaγ+v≤Γ;
  • VFF(c,γ,v)≤ΠDF(c,γ,v;s,q1,q2)V^{\mathrm{FF}}(c,\gamma,v)\le\Pi^{\mathrm{DF}}(c,\gamma,v;s,q_1,q_2)VFF(c,γ,v)≤ΠDF(c,γ,v;s,q1​,q2​), compared in the extended reals.

The number Γ\GammaΓ is constrained only by γ+v≤Γ\gamma+v\le\Gammaγ+v≤Γ, so it can always be taken to be γ+v\gamma+vγ+v. The statement is therefore logically equivalent to the existence of an admissible fee γ\gammaγ and a nonnegative decision (s,q1,q2)(s,q_1,q_2)(s,q1​,q2​) whose dedicated profit is at least the flexible supremum at that fee. In particular, VFFV^{\mathrm{FF}}VFF is finite at that fee. No further property of γ\gammaγ, such as being small, is asserted.

Degenerate cases.

  • c=vc=vc=v. Admissibility forces γ>0\gamma>0γ>0.
  • c<vc<vc<v. γ=0\gamma=0γ=0 is admissible.
  • Zero decision. The decision s=q1=q2=0s=q_1=q_2=0s=q1​=q2​=0 is allowed, giving ΠDF=0\Pi^{\mathrm{DF}}=0ΠDF=0.
  • Unrestricted demand laws. The laws are arbitrary, including point masses at 000 and laws with infinite mean. For example, if both are point masses at 000, every revenue is 000.
  • Infinite flexible value. The comparison fails at any fee where VFF=+∞V^{\mathrm{FF}}=+\inftyVFF=+∞, so the asserted fee must be one where the flexible supremum is finite.
Human review
  • Endorsed by Community (Bot) · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 29, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me