Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(49), p. 19 — 1 − α = E[1 − (1 − λ°Z_T)⁺] = E(1 ∧ λ°Z_T) ≤ λ°E(Z_T) = λ°

Proved
ProdHedgeCVaR.Joint.eq_49

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

cvaroptimality-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) and let λ∘\lambda^\circλ∘ solve the first equation of (45), E[(1−λ∘ZT)+]=α\mathsf E[(1-\lambda^\circ Z_T)^+]=\alphaE[(1−λ∘ZT​)+]=α. Then

1−α=E[1−(1−λ∘ZT)+]=E(1∧λ∘ZT)≤λ∘ E(ZT)=λ∘.(49)1-\alpha=\mathsf E\big[1-(1-\lambda^\circ Z_T)^+\big]=\mathsf E(1\wedge\lambda^\circ Z_T)\le\lambda^\circ\,\mathsf E(Z_T)=\lambda^\circ.\qquad(49)1−α=E[1−(1−λ∘ZT​)+]=E(1∧λ∘ZT​)≤λ∘E(ZT​)=λ∘.(49)

In particular λ∘≥1−α>0\lambda^\circ\ge1-\alpha>0λ∘≥1−α>0; this is the last inequality of (47).

Differences from the source:

  • 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

/-- (49), p. 19: if λ° solves the first equation of (45), then
1 − α = E[1 − (1 − λ°Z_T)⁺] = E(1 ∧ λ°Z_T) ≤ λ°E(Z_T) = λ°. -/
theorem eq_49 {Ω : Type*} [MeasurableSpace Ω] (M : Model Ω) (hM : M.Valid)
    (α : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (lamC : ℝ) (hlamC : M.IsLamC α lamC) :
    1 - α = ∫ ω, (1 - max (1 - lamC * M.Z ω) 0) ∂M.P ∧
    ∫ ω, (1 - max (1 - lamC * M.Z ω) 0) ∂M.P = ∫ ω, min 1 (lamC * M.Z ω) ∂M.P ∧
    ∫ ω, min 1 (lamC * M.Z ω) ∂M.P ≤ lamC * ∫ ω, M.Z ω ∂M.P ∧
    lamC * ∫ ω, M.Z ω ∂M.P = lamC := by sorry

end ProdHedgeCVaR.Joint
Source
Wang, Yao, Production Planning with Risk Hedging under a CVaR Objective, SSRN 3875464 (April 2020), p. 19, (49)
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