Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(45), p. 18 — β(λ) = α has a unique root λ° ≥ 0, and (p + c)E[(λ°Z_T) ∧ ∆(Q)] = p(1 − α) has a unique root Q°

Proved
ProdHedgeCVaR.Joint.eq_45_unique

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

cvarexistence-uniquenessoptimality-conditionsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Throughout, (Ω,F,P)(\Omega,\mathcal F,\mathbb P)(Ω,F,P) is a probability space carrying the terminal values of the model of §3: the asset-driven demand component AT≥0A_T\ge 0AT​≥0, the asset noise BT∼N(0,T)B_T\sim N(0,T)BT​∼N(0,T), both measurable with respect to the hedger's information G\mathcal GG (the paper's σ(AT,XT)\sigma(A_T,X_T)σ(AT​,XT​)), and ξ∼N(0,1)\xi\sim N(0,1)ξ∼N(0,1) independent of G\mathcal GG. The demand is DT=AT+σ~T ξD_T=A_T+\tilde\sigma\sqrt T\,\xiDT​=AT​+σ~T​ξ, the production payoff HT(Q)=pQ−(p+c)(Q−DT+)+H_T(Q)=pQ-(p+c)(Q-D_T^+)^+HT​(Q)=pQ−(p+c)(Q−DT+​)+, and ZT=e−ηBT−η2T/2Z_T=e^{-\eta B_T-\eta^2T/2}ZT​=e−ηBT​−η2T/2 is the density of the martingale measure, EM[Y]=E[ZTY]\mathsf E^M[Y]=\mathsf E[Z_TY]EM[Y]=E[ZT​Y]. The parameters satisfy p,c,σ~,T,C>0p,c,\tilde\sigma,T,C>0p,c,σ~,T,C>0 and η≠0\eta\ne0η=0. Let α∈(0,1)\alpha\in(0,1)α∈(0,1), β(λ)=E[(1−λZT)+]\beta(\lambda)=\mathsf E[(1-\lambda Z_T)^+]β(λ)=E[(1−λZT​)+] and Δ(Q)=Φ((Q−AT)/(σ~T))\Delta(Q)=\Phi\big((Q-A_T)/(\tilde\sigma\sqrt T)\big)Δ(Q)=Φ((Q−AT​)/(σ~T​)). Consider the optimality equations

β(λ)=α,(p+c) E[(λZT)∧Δ(Q)]=p(1−α).(45)\beta(\lambda)=\alpha,\qquad (p+c)\,\mathsf E[(\lambda Z_T)\wedge\Delta(Q)]=p(1-\alpha).\qquad(45)β(λ)=α,(p+c)E[(λZT​)∧Δ(Q)]=p(1−α).(45)
  1. The first equation has exactly one real solution λ∘\lambda^\circλ∘, and λ∘≥0\lambda^\circ\ge0λ∘≥0.
  2. β(0)=1\beta(0)=1β(0)=1, β\betaβ is strictly decreasing on [0,∞)[0,\infty)[0,∞), and β(λ)→0\beta(\lambda)\to0β(λ)→0 as λ→∞\lambda\to\inftyλ→∞.
  3. Δ(Q)→1\Delta(Q)\to1Δ(Q)→1 as Q→∞Q\to\inftyQ→∞, pointwise.
  4. For λ=λ∘\lambda=\lambda^\circλ=λ∘: the second equation has exactly one solution Q∘Q^\circQ∘; its left-hand side is strictly increasing in QQQ and tends to (p+c)(1−α)(p+c)(1-\alpha)(p+c)(1−α) as Q→∞Q\to\inftyQ→∞; and
E(1∧λ∘ZT)=E[1−(1−λ∘ZT)+]=1−α.\mathsf E(1\wedge\lambda^\circ Z_T)=\mathsf E[1-(1-\lambda^\circ Z_T)^+]=1-\alpha.E(1∧λ∘ZT​)=E[1−(1−λ∘ZT​)+]=1−α.

λ∘\lambda^\circλ∘ and Q∘Q^\circQ∘ are the candidate multiplier and production quantity of Theorem 2.

Differences from the source:

  • reading: 'the left hand side of the equation increases to (p + c)(1 − α)' → the left-hand side is strictly increasing in Q (StrictMono) and tends to (p + c)(1 − α); reason: strict increase is what the uniqueness of Q° rests on; it is the stronger of the two readings of 'increases'
  • encoding: D̂_T of (30) with Φ⁻¹(0) = −∞, Φ⁻¹(1) = +∞; E^M, P^M under dP^M/dP = Z_T (26) → D̂_T(λ) in EReal: −∞ if λZ_T ≤ 0, +∞ if λZ_T ≥ 1, else A_T + σ̃√T Φ⁻¹(λZ_T) with Φ⁻¹(u) = sup{x : Φ(x) ≤ u}; E^M[Y] = E[Z_T Y], P^M(S) = E[Z_T 1_S]; reason: Φ is continuous and strictly increasing onto (0, 1), so the order inverse is Φ⁻¹ there; the endpoint values are the paper's conventions (p. 15); E^M and P^M are the expectations under the measure with density Z_T
  • generalization: the hedger's information is σ(A_T, X_T), with A_T adapted to the asset filtration F^X and B̃ a Brownian motion independent of B (§3, pp. 10–12) → any sub-σ-algebra G of the probability space such that A_T and B_T are G-measurable and ξ = B̃_T/√T is independent of G; reason: σ(A_T, X_T) = σ(A_T, B_T) (X_T is a strictly increasing function of B_T) satisfies these properties, so the paper's model is the instance G = σ(A_T, X_T); nothing else about G enters the statement
  • encoding: the dynamic model: GBM asset (17), demand dD_t = dA_t + σ̃dB̃_t (18)–(19), density process (26) on [0, T] → the terminal values only: A_T ≥ 0, W = B_T with law N(0, T), ξ with law N(0, 1); Z_T = exp(−ηW − η²T/2), D_T = A_T + σ̃√T ξ; reason: every object in the statement is a function of (A_T, B_T, B̃_T); B̃_T has the law of √T ξ
  • reading: p is the unit profit, c the net unit cost (p. 5), σ̃ > 0 (p. 10), T > 0 (p. 5), budget C > 0 (p. 12), η ≠ 0 (p. 13) → hypotheses p > 0, c > 0, σ̃ > 0, T > 0, C > 0, η ≠ 0 (Params.Valid); reason: the standing assumptions of §§2–3; c > 0 is needed: with c = 0 the second equation of (45) has no root, since its left-hand side stays below p(1 − α)
Preamble
import Mathlib
import Definitions.Def_BlackScholesModel_Core
import Definitions.Def_ProdHedgeCVaR_Joint_Model
Formal statement
namespace ProdHedgeCVaR.Joint

open MeasureTheory ProbabilityTheory Filter Topology

/-- (45), p. 18: the first equation β(λ) = α has a unique root λ°, which is non-negative,
because β decreases from 1 to 0 as λ increases from 0 to ∞; for it the second equation has a unique
root Q°, because ∆(Q) → 1 as Q → ∞ and the left-hand side increases to (p + c)(1 − α), since
E(1 ∧ λ°Z_T) = E[1 − (1 − λ°Z_T)⁺] = 1 − α. -/
theorem eq_45_unique {Ω : Type*} [MeasurableSpace Ω] (M : Model Ω) (hM : M.Valid)
    (α : ℝ) (hα0 : 0 < α) (hα1 : α < 1) :
    (∃! lam, M.IsLamC α lam) ∧
    (∀ lam, M.IsLamC α lam → 0 ≤ lam) ∧
    (M.beta 0 = 1 ∧ StrictAntiOn M.beta (Set.Ici 0) ∧ Tendsto M.beta atTop (𝓝 0)) ∧
    (∀ ω, Tendsto (fun Q => M.Delta Q ω) atTop (𝓝 1)) ∧
    ∀ lam, M.IsLamC α lam →
      (∃! Q, M.IsQC α lam Q) ∧
      StrictMono (fun Q => (M.θ.p + M.θ.c) * ∫ ω, min (lam * M.Z ω) (M.Delta Q ω) ∂M.P) ∧
      Tendsto (fun Q => (M.θ.p + M.θ.c) * ∫ ω, min (lam * M.Z ω) (M.Delta Q ω) ∂M.P) atTop
        (𝓝 ((M.θ.p + M.θ.c) * (1 - α))) ∧
      ∫ ω, min 1 (lam * M.Z ω) ∂M.P = ∫ ω, (1 - max (1 - lam * M.Z ω) 0) ∂M.P ∧
      ∫ ω, (1 - max (1 - lam * M.Z ω) 0) ∂M.P = 1 - α := by sorry

end ProdHedgeCVaR.Joint
Source
Wang, Yao, Production Planning with Risk Hedging under a CVaR Objective, SSRN 3875464 (April 2020), p. 18, (45) and the paragraph after it
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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