Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 7, p. 37, (31)–(32) — ∂Π^HF_M/∂τ, ∂Π^LF_M/∂τ, their values at τ = 1, and q_M(1,q_R,u_R) > 0 ⇔ c + u_R(q_R + ku_R − 1) < 0

Proved
QualityEncroach.NoCommit.stage3_derivatives

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

calculusencroachmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-qualitysupply-chain

Let k>0k>0k>0, c≥0c\ge0c≥0, uR>0u_R>0uR​>0 and let qRq_RqR​, www be arbitrary. Viewed as functions of τ>0\tau>0τ>0, the reduced profits ΠMHF(τ,qR,uR,w)\Pi^{HF}_M(\tau,q_R,u_R,w)ΠMHF​(τ,qR​,uR​,w) and ΠMLF(τ,qR,uR,w)\Pi^{LF}_M(\tau,q_R,u_R,w)ΠMLF​(τ,qR​,uR​,w) of the proof of Proposition 7 have derivatives

∂ΠMHF∂τ=−(c+uR(qR−3kτ2uR+τ)) (c+uR(qR+τ(kτuR−1)))4τ2uR,\frac{\partial\Pi^{HF}_M}{\partial\tau} = -\frac{(c+u_R(q_R-3k\tau^2u_R+\tau))\,(c+u_R(q_R+\tau(k\tau u_R-1)))}{4\tau^2u_R},∂τ∂ΠMHF​​=−4τ2uR​(c+uR​(qR​−3kτ2uR​+τ))(c+uR​(qR​+τ(kτuR​−1)))​, ∂ΠMLF∂τ=−(c+τuR(qR+kτuR−1)) (c−τuR(qR+3kτuR−1))4τ2uR.\frac{\partial\Pi^{LF}_M}{\partial\tau} = -\frac{(c+\tau u_R(q_R+k\tau u_R-1))\,(c-\tau u_R(q_R+3k\tau u_R-1))}{4\tau^2u_R}.∂τ∂ΠMLF​​=−4τ2uR​(c+τuR​(qR​+kτuR​−1))(c−τuR​(qR​+3kτuR​−1))​.

In particular, at τ=1\tau=1τ=1,

∂ΠMHF∂τ∣τ=1=−(c+uR(qR−3kuR+1))(c+uR(qR+kuR−1))4uR,∂ΠMLF∂τ∣τ=1=−(c+uR(qR+kuR−1))(c−uR(qR+3kuR−1))4uR.\frac{\partial\Pi^{HF}_M}{\partial\tau}\Big|_{\tau=1} = -\frac{(c+u_R(q_R-3ku_R+1))(c+u_R(q_R+ku_R-1))}{4u_R},\qquad \frac{\partial\Pi^{LF}_M}{\partial\tau}\Big|_{\tau=1} = -\frac{(c+u_R(q_R+ku_R-1))(c-u_R(q_R+3ku_R-1))}{4u_R}.∂τ∂ΠMHF​​​τ=1​=−4uR​(c+uR​(qR​−3kuR​+1))(c+uR​(qR​+kuR​−1))​,∂τ∂ΠMLF​​​τ=1​=−4uR​(c+uR​(qR​+kuR​−1))(c−uR​(qR​+3kuR​−1))​.

Moreover, the optimal direct quantity at τ=1\tau=1τ=1 is positive exactly when c+uR(qR+kuR−1)<0c+u_R(q_R+ku_R-1)<0c+uR​(qR​+kuR​−1)<0:

qM(1,qR,uR)=(−c−qRuR−kuR2+uR2uR)+>0  ⟺  c+uR(qR+kuR−1)<0.q_M(1,q_R,u_R) = \Big(\frac{-c-q_Ru_R-ku_R^2+u_R}{2u_R}\Big)^{+} > 0 \iff c+u_R(q_R+ku_R-1)<0 .qM​(1,qR​,uR​)=(2uR​−c−qR​uR​−kuR2​+uR​​)+>0⟺c+uR​(qR​+kuR​−1)<0.

These are the expressions (31) and (32) and the encroachment condition from which the paper derives its contradiction.

Formalization Note. The page prints (31) as "<0<0<0" and (32) as ">0>0>0", as consequences of the optimality of τ=1\tau=1τ=1. This item states only the derivative values; the signs are not part of it, because optimality of τ=1\tau=1τ=1 yields only the weak inequalities ≤0\le0≤0 and ≥0\ge0≥0.

Preamble
import Mathlib
import Definitions.Def_QualityEncroach_NoCommit_Game
Formal statement
namespace QualityEncroach.NoCommit

/-- Proof of Proposition 7, p. 37: the derivatives of `Π^HF_M` and `Π^LF_M` in `τ` at every
`τ > 0`, their values (31)–(32) at `τ = 1`, and the encroachment condition
`q_M(1, q_R, u_R) > 0 ⇔ c + u_R(q_R + k u_R − 1) < 0`. -/
theorem stage3_derivatives (k c : ℝ) (hk : 0 < k) (hc : 0 ≤ c) (w uR qR : ℝ) (huR : 0 < uR) :
    (∀ τ : ℝ, 0 < τ →
      HasDerivAt (fun s => PiHF k c s qR uR w)
        (-(c + uR * (qR - 3 * k * τ ^ 2 * uR + τ)) * (c + uR * (qR + τ * (k * τ * uR - 1)))
          / (4 * τ ^ 2 * uR)) τ) ∧
    (∀ τ : ℝ, 0 < τ →
      HasDerivAt (fun s => PiLF k c s qR uR w)
        (-(c + τ * uR * (qR + k * τ * uR - 1)) * (c - τ * uR * (qR + 3 * k * τ * uR - 1))
          / (4 * τ ^ 2 * uR)) τ) ∧
    HasDerivAt (fun s => PiHF k c s qR uR w)
      (-(c + uR * (qR - 3 * k * uR + 1)) * (c + uR * (qR + k * uR - 1)) / (4 * uR)) 1 ∧
    HasDerivAt (fun s => PiLF k c s qR uR w)
      (-(c + uR * (qR + k * uR - 1)) * (c - uR * (qR + 3 * k * uR - 1)) / (4 * uR)) 1 ∧
    (0 < qMHF k c 1 qR uR ↔ c + uR * (qR + k * uR - 1) < 0) := by sorry

end QualityEncroach.NoCommit
Source
Ha, Long & Nasiry, Quality in Supply Chain Encroachment, authors' manuscript, SSRN 3970373, p. 37, proof of Proposition 7, ∂Π^HF_M/∂τ, ∂Π^LF_M/∂τ, (31), (32) and the encroachment condition
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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