Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2, Step 1 (uniqueness), oa6 (PDF 38) — in an SPE, one contractor at q̲/N in every period forces all to q̲/N

Proved
AssemblyCoord.Feedback.prop_2_step1_best_response

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

best-responseminimum-effort-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subgame-perfect-equilibrium

In the MMM-contractor, NNN-period coordination game with information feedback started from zero effort, under the standing assumptions, let σ\sigmaσ be a subgame-perfect equilibrium and suppose some contractor jjj exerts q‾/N\underline q/Nq​/N in every period along σ\sigmaσ's path. Then every contractor exerts q‾/N\underline q/Nq​/N in every period along that path:

qi,n=q‾N,i=1,…,M, n=1,…,N.q_{i,n} = \frac{\underline q}{N}, \qquad i = 1,\dots,M,\ n = 1,\dots,N.qi,n​=Nq​​,i=1,…,M, n=1,…,N.

This is the best-response step of the uniqueness argument in Proposition 2(i): once one contractor stays at the minimum, the project level is q‾\underline qq​ and any extra effort by another contractor is wasted cost.

Formalization Note. Periods are 0-based (pathHist σ n). No bound relating NNN and MMM is needed.

Preamble
import Mathlib
import Definitions.Def_AssemblyCoord_Feedback_Model
Formal statement
namespace AssemblyCoord.Feedback

theorem prop_2_step1_best_response (P : Params) (hP : P.Standing) (σ : Profile P.M)
    (hσ : P.IsSPE 0 σ) (j : Fin P.M)
    (hj : ∀ n, n < P.N → σ j (pathHist σ n) = P.qlo / P.N) :
    ∀ n, n < P.N → ∀ i : Fin P.M, σ i (pathHist σ n) = P.qlo / P.N := by sorry

end AssemblyCoord.Feedback
Source
Zhang, Shokoohyar, Qi & Katok, Coordination for assembly, author manuscript (10 July 2025) of MSOM doi:10.1287/msom.2023.0342, p. oa6 (PDF 38), proof of Proposition 2, Step 1, uniqueness paragraph
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

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