Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2, p. 36 — low direct quality: backward-induction subgame and (22)

Proved
QualityEncroach.FixedCost.subgame_low

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

backward-inductionencroachmentlow-qualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1supply-chain

Fix k>0k>0k>0, c≥0c\ge0c≥0, t≥1t\ge1t≥1, and an encroachment-feasible quality (8t−3)c<(6t−3)u(8t-3)c<(6t-3)u(8t−3)c<(6t−3)u. In the low-direct-quality branch, the manufacturer's final quantity response is optimal among nonnegative direct quantities. Whenever the displayed retailer reply is nonnegative and induces positive direct sales, it is optimal among nonnegative retailer orders. The displayed wholesale price maximizes the interior manufacturer profit among wholesale prices with these feasibility properties.

At that price,

w=(8t2−6t+1)u−c2(8t−5),qR=2c(8t−5)u+2(t−1)8t−5,qM=6t−32(8t−5)−(8t−3)c2(8t−5)u,ΠM=ΠLo(k,c,t,u).w=\frac{(8t^2-6t+1)u-c}{2(8t-5)},\quad q_R=\frac{2c}{(8t-5)u}+\frac{2(t-1)}{8t-5},\quad q_M=\frac{6t-3}{2(8t-5)}-\frac{(8t-3)c}{2(8t-5)u},\quad \Pi_M=\Pi_{\mathrm{Lo}}(k,c,t,u).w=2(8t−5)(8t2−6t+1)u−c​,qR​=(8t−5)u2c​+8t−52(t−1)​,qM​=2(8t−5)6t−3​−2(8t−5)u(8t−3)c​,ΠM​=ΠLo​(k,c,t,u).

This links equation (22) to the game's backward-induction actions.

Formalization Note The wholesale optimization is over the interior encroaching branch, not over no-encroachment outcomes.

Preamble
import Mathlib
import Definitions.Def_QualityEncroach_FixedCost_Reduced
Formal statement
namespace QualityEncroach.FixedCost

/-- Backward-induction formulas for the `1 ≤ t` encroaching branch,
including equation (22) (Ha, Long and Nasiry, p. 36). -/
theorem subgame_low (k c t u : ℝ) (hk : 0 < k) (hc : 0 ≤ c)
    (ht : 1 ≤ t) (hu : (8 * t - 3) * c < (6 * t - 3) * u) :
    (∀ w qR qM : ℝ, 0 ≤ qR → 0 ≤ qM →
      mfrPayoff k c ⟨w, u, t, qR, qM⟩ ≤
        mfrPayoff k c ⟨w, u, t, qR, qMReplyLo c u qR⟩) ∧
    (∀ w : ℝ, 0 ≤ qRLoAt c w t u →
      0 < qMReplyLo c u (qRLoAt c w t u) →
      ∀ qR : ℝ, 0 ≤ qR →
        QualityEncroach.Differ.retailerPayoff ⟨w, u, t, qR, qMReplyLo c u qR⟩ ≤
          QualityEncroach.Differ.retailerPayoff ⟨w, u, t, qRLoAt c w t u,
            qMReplyLo c u (qRLoAt c w t u)⟩) ∧
    (∀ w : ℝ, 0 ≤ qRLoAt c w t u →
      0 < qMReplyLo c u (qRLoAt c w t u) →
      mfrPayoff k c ⟨w, u, t, qRLoAt c w t u,
        qMReplyLo c u (qRLoAt c w t u)⟩ ≤
        mfrPayoff k c ⟨wLo c t u, u, t, qRLo c t u, qMLo c t u⟩) ∧
    qRLoAt c (wLo c t u) t u = qRLo c t u ∧
    qMReplyLo c u (qRLo c t u) = qMLo c t u ∧
    0 < qMLo c t u ∧
    mfrPayoff k c ⟨wLo c t u, u, t, qRLo c t u, qMLo c t u⟩ =
      PiLo k c t u := by sorry

end QualityEncroach.FixedCost
Source
Ha, Long & Nasiry, Quality in Supply Chain Encroachment, authors' manuscript, SSRN 3970373, p. 36, second block and equation (22)
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