Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 2.1 — consumer's best response a^(z)\hat a(z)a^(z), b^(γ)\hat b(\gamma)b^(γ) and the closed forms of HmH_mHm​, HvH_vHv​ (HmH_mHm​ corrected beyond Amax⁡A_{\max}Amax​)

Proved
DemandResponse.SecondBest.prop2_1_best_response

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

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

In the demand-response model with effort boxes A=∏i[0,μiAmax⁡]A=\prod_i[0,\mu_iA_{\max}]A=∏i​[0,μi​Amax​] and B=[ε,1]dB=[\varepsilon,1]^dB=[ε,1]d, costs c1,c2c_1,c_2c1​,c2​ and Hamiltonians Hm,HvH_m,H_vHm​,Hv​ defined by the infima (2.9), the consumer's best response to the payment rates (z,γ)(z,\gamma)(z,γ) is a^i(z)=μi(z−∧Amax⁡)\hat a_i(z)=\mu_i(z^-\wedge A_{\max})a^i​(z)=μi​(z−∧Amax​) and b^j(γ)=(1∧(λjγ−)−1/2)∨ε\hat b_j(\gamma)=(1\wedge(\lambda_j\gamma^-)^{-1/2})\vee\varepsilonb^j​(γ)=(1∧(λj​γ−)−1/2)∨ε. Precisely:

  1. for every z∈Rz\in\mathbb Rz∈R, a^(z)∈A\hat a(z)\in Aa^(z)∈A and a^(z)\hat a(z)a^(z) minimises a↦a⋅1 z+c1(a)a\mapsto a\cdot\mathbf 1\,z+c_1(a)a↦a⋅1z+c1​(a) over AAA;
  2. for every γ∈R\gamma\in\mathbb Rγ∈R, b^(γ)∈B\hat b(\gamma)\in Bb^(γ)∈B and b^(γ)\hat b(\gamma)b^(γ) minimises b↦c2(b)−γ∣σ(b)∣2b\mapsto c_2(b)-\gamma|\sigma(b)|^2b↦c2​(b)−γ∣σ(b)∣2 over BBB;
  3. for every zzz, with m:=z−∧Amax⁡m:=z^-\wedge A_{\max}m:=z−∧Amax​,
Hm(z)=μˉ(m z−−m22);H_m(z)=\bar\mu\Big(m\,z^--\frac{m^2}2\Big);Hm​(z)=μˉ​(mz−−2m2​);
  1. for every γ\gammaγ,
Hv(γ)=−12(c^2(γ)−γ∣σ^(γ)∣2).H_v(\gamma)=-\frac12\Big(\hat c_2(\gamma)-\gamma|\hat\sigma(\gamma)|^2\Big).Hv​(γ)=−21​(c^2​(γ)−γ∣σ^(γ)∣2).

The closed forms of the consumer's Hamiltonian are what makes the producer's problem a deterministic scalar optimisation in the payment rates.

Formalization Note. The paper prints Hm(z)=12μˉ(z−∧Amax⁡)2H_m(z)=\frac12\bar\mu(z^-\wedge A_{\max})^2Hm​(z)=21​μˉ​(z−∧Amax​)2, which is false when z−>Amax⁡z^->A_{\max}z−>Amax​ (for N=1N=1N=1, μ=1\mu=1μ=1, Amax⁡=1A_{\max}=1Amax​=1, z=−10z=-10z=−10 the minimum of −10a+a2/2-10a+a^2/2−10a+a2/2 over [0,1][0,1][0,1] is −9.5-9.5−9.5, so Hm=9.5H_m=9.5Hm​=9.5, not 0.50.50.5). Item 3 is the corrected formula; it equals the printed one exactly when z−≤Amax⁡z^-\le A_{\max}z−≤Amax​. The page's index range "j=1,…,Nj=1,\dots,Nj=1,…,N" for b^\hat bb^ is read as j=1,…,dj=1,\dots,dj=1,…,d. b^j(γ)\hat b_j(\gamma)b^j​(γ) is 111 when λjγ−≤1\lambda_j\gamma^-\le1λj​γ−≤1, the paper's reading of 0−1/2=+∞0^{-1/2}=+\infty0−1/2=+∞.

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

/-- Proposition 2.1 (arXiv:1810.09063v3, p. 9), with the closed form of `H_m` corrected beyond `A_max`
and the index range of `b̂` read as `j = 1, …, d`. -/
theorem prop2_1_best_response {N d : ℕ} (P : Params N d) :
    (∀ z : ℝ, ahat P z ∈ EffA P ∧
      ∀ a ∈ EffA P, (∑ i, ahat P z i) * z + c1 P (ahat P z) ≤ (∑ i, a i) * z + c1 P a) ∧
    (∀ γ : ℝ, bhat P γ ∈ EffB P ∧
      ∀ b ∈ EffB P, c2 P (bhat P γ) - γ * sigmaSq P (bhat P γ) ≤ c2 P b - γ * sigmaSq P b) ∧
    (∀ z : ℝ, Hm P z =
      muBar P * (min (negp z) P.Amax * negp z - min (negp z) P.Amax ^ 2 / 2)) ∧
    (∀ γ : ℝ, Hv P γ = -(1 / 2) * (c2hat P γ - γ * sigmaHatSq P γ)) := by sorry

end DemandResponse.SecondBest
Source
arXiv:1810.09063v3, Proposition 2.1 (p. 9)
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