Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma A.1 — F0(q)=f0(q,−q)=−2Hv(−q)F_0(q)=f_0(q,-q)=-2H_v(-q)F0​(q)=f0​(q,−q)=−2Hv​(−q) is non-decreasing

Proved
DemandResponse.SecondBest.lemmaA1_F0

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

demand-responsep2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1principal-agentstochastic-control

Let f0(q,γ):=q∣σ^(γ)∣2+c^2(γ)f_0(q,\gamma):=q|\hat\sigma(\gamma)|^2+\hat c_2(\gamma)f0​(q,γ):=q∣σ^(γ)∣2+c^2​(γ) be the total cost of volatility borne by the producer when the unit cost of volatility is qqq and the payment rate for volatility reduction is γ\gammaγ ((A.10)), and let

F0(q):=inf⁡γ≤0f0(q,γ).F_0(q):=\inf_{\gamma\le0}f_0(q,\gamma).F0​(q):=γ≤0inf​f0​(q,γ).

Then for every real qqq,

F0(q)=f0(q,−q)=−2Hv(−q),F_0(q)=f_0(q,-q)=-2H_v(-q),F0​(q)=f0​(q,−q)=−2Hv​(−q),

and F0F_0F0​ is non-decreasing on R\mathbb RR.

The lemma eliminates the volatility payment γ\gammaγ from the producer's problem: the optimal γ\gammaγ equals minus the producer's unit cost of volatility, and what remains is a monotone function of that cost. This is what turns the producer's HJB equation (A.11) into a scalar minimisation over zzz.

Formalization Note. The statement is for every real qqq, without a sign hypothesis; for q<0q<0q<0 the point −q-q−q lies outside {γ≤0}\{\gamma\le0\}{γ≤0}, but b^(−q)=b^(0)\hat b(-q)=\hat b(0)b^(−q)=b^(0) so the identity still holds.

Preamble
import Mathlib
import Definitions.Def_DemandResponse_SecondBest_Hamiltonian
Formal statement
namespace DemandResponse.SecondBest

/-- Lemma A.1 (arXiv:1810.09063v3, p. 29): `F₀(q) = f₀(q, -q) = -2 H_v(-q)`, and `F₀` is
non-decreasing. Stated for every real `q`. -/
theorem lemmaA1_F0 {N d : ℕ} (P : Params N d) :
    (∀ q : ℝ, F0 P q = f0 P q (-q) ∧ f0 P q (-q) = -2 * Hv P (-q)) ∧ Monotone (F0 P) := by sorry

end DemandResponse.SecondBest
Source
arXiv:1810.09063v3, Appendix A.3, (A.10) and Lemma A.1 (p. 29)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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