Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma OA2(i), oa5 (PDF 37) — with N ≤ M − 1 and at least N + 1 contractors tied at the lowest initial effort, some SPE has everyone exert q̲/N in every period

Proved
AssemblyCoord.Feedback.lemma_OA2_i

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

coordination-gameinformation-feedbackminimum-effort-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subgame-perfect-equilibrium

Consider the MMM-contractor, NNN-period coordination game with information feedback, under the standing assumptions, started from an arbitrary initial effort vector q^0=(q^1,0,…,q^M,0)\hat{\mathbf q}_0 = (\hat q_{1,0},\dots,\hat q_{M,0})q^​0​=(q^​1,0​,…,q^​M,0​). Suppose that

  1. N≤M−1N \le M - 1N≤M−1, and
  2. at least N+1N+1N+1 contractors share the lowest initial effort level: there is a set SSS of contractors with ∣S∣≥N+1|S| \ge N+1∣S∣≥N+1 and q^i,0≤q^j,0\hat q_{i,0} \le \hat q_{j,0}q^​i,0​≤q^​j,0​ for all i∈Si \in Si∈S and all jjj.

Then there is a subgame-perfect equilibrium σ\sigmaσ along whose path every contractor exerts the minimum per-period effort in every period:

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 existence half of Proposition 2(i): it supplies an SPE with the all-minimum outcome, which is then shown to be secure.

Formalization Note. The hypothesis is the lemma's prose ("at least N+1N+1N+1 contractors have equal lowest initial effort level"), not the display (26), which prints all MMM levels equal; the prose is the weaker hypothesis. "All contractors exert at the lower boundary in each period is an SPE strategy" is read as "some SPE has this path": the profile that plays q‾/N\underline q/Nq​/N after every history is not an SPE when γp>c\gamma p > cγp>c, since a contractor left strictly behind with one period to go gains by catching up. N≤M−1N \le M-1N≤M−1 is written P.N + 1 ≤ P.M.

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

theorem lemma_OA2_i (P : Params) (hP : P.Standing) (hN : P.N + 1 ≤ P.M)
    (q0 : Fin P.M → ℝ)
    (htie : ∃ S : Finset (Fin P.M), P.N + 1 ≤ S.card ∧ ∀ i ∈ S, ∀ j, q0 i ≤ q0 j) :
    ∃ σ : Profile P.M, P.IsSPE q0 σ ∧
      ∀ 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. oa5 (PDF 37), Lemma OA2(i), (26)
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