Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 10 — the manufacturer's stage-3 best response q^U_M(q_R,w,u) = (1/2 − q_R/2 − c/(2u) − ku/2)⁺

Proved
QualityEncroach.Uniform.stage3_best_response

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

dual-channelencroachmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1supply-chain

Let k>0k>0k>0, c≥0c\ge0c≥0, and consider the last stage of the encroachment game with uniform quality, after the manufacturer has chosen (w,u)(w,u)(w,u) with u>0u>0u>0 and the retailer has ordered qR≥0q_R\ge0qR​≥0. The manufacturer chooses her direct quantity qM≥0q_M\ge0qM​≥0 to maximize

(w−ku2) qR+(u−uqM−uqR−c−ku2) qM.(w-ku^2)\,q_R+(u-uq_M-uq_R-c-ku^2)\,q_M .(w−ku2)qR​+(u−uqM​−uqR​−c−ku2)qM​.

The unique maximizer over qM≥0q_M\ge 0qM​≥0 is

qMU(qR,w,u)=(12−qR2−c2u−ku2)+.q^U_M(q_R,w,u)=\Big(\frac12-\frac{q_R}{2}-\frac{c}{2u}-\frac{ku}{2}\Big)^+ .qMU​(qR​,w,u)=(21​−2qR​​−2uc​−2ku​)+.

This is the first step of the backward induction of §4.1.

Preamble
import Mathlib
import Definitions.Def_QualityEncroach_Uniform_Game
Formal statement
namespace QualityEncroach.Uniform

/-- §4.1, p. 10: given `(w, u, q_R)` with `u > 0` and `q_R ≥ 0`, the manufacturer's unique best direct quantity
over `q_M ≥ 0` is `q^U_M(q_R, w, u) = (1/2 − q_R/2 − c/(2u) − ku/2)⁺`. -/
theorem stage3_best_response (k c : ℝ) (hk : 0 < k) (hc : 0 ≤ c) (w u qR : ℝ)
    (hu : 0 < u) (hqR : 0 ≤ qR) :
    0 ≤ qUM_br k c qR w u ∧
    ∀ qM : ℝ, 0 ≤ qM → qM ≠ qUM_br k c qR w u →
      mfrPayoff k c ⟨w, u, qR, qM⟩ < mfrPayoff k c ⟨w, u, qR, qUM_br k c qR w u⟩ := by sorry

end QualityEncroach.Uniform
Source
Ha, Long & Nasiry, Quality in Supply Chain Encroachment, authors' manuscript, SSRN 3970373, pp. 9–10, §4.1, display at the foot of p. 9 and the first line of p. 10
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