Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2, Step 1, oa6 (PDF 38) — the all-minimum path attains the minimum profit (25) in every subgame along it

Proved
AssemblyCoord.Feedback.prop_2_step1_min_profit

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

minimum-effort-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1secure-equilibriumsubgame-perfect-equilibrium

In the MMM-contractor, NNN-period coordination game with information feedback started from zero effort, under the standing assumptions, let σ\sigmaσ be any strategy profile along whose path every contractor exerts q‾/N\underline q/Nq​/N in every period. Let hnh_nhn​ be the history of the first nnn periods of that path, 0≤n<N0 \le n < N0≤n<N. Then for every subgame-perfect equilibrium σ′\sigma'σ′ and every contractor iii,

πi(q^N(σ∣hn))≤πi(q^N(σ′∣hn)),\pi_i\big(\hat{\mathbf q}_N(\sigma \mid h_n)\big) \le \pi_i\big(\hat{\mathbf q}_N(\sigma' \mid h_n)\big),πi​(q^​N​(σ∣hn​))≤πi​(q^​N​(σ′∣hn​)),

where q^N(τ∣h)\hat{\mathbf q}_N(\tau \mid h)q^​N​(τ∣h) denotes the final effort levels when τ\tauτ is played from history hhh to the end of period NNN.

In words: continuing the all-minimum path gives every contractor the lowest profit among all SPE continuations of the subgame, which is condition (25) of the paper for this path. It is the step from "SPE" to "SPSE" in the existence half of Proposition 2(i).

Formalization Note. Neither N≤M−1N \le M - 1N≤M−1 nor that σ\sigmaσ is an SPE is needed, and neither is assumed. Periods are 0-based (pathHist σ n).

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

theorem prop_2_step1_min_profit (P : Params) (hP : P.Standing) (σ : Profile P.M)
    (hpath : ∀ n, n < P.N → ∀ i : Fin P.M, σ i (pathHist σ n) = P.qlo / P.N) :
    ∀ n, n < P.N → ∀ σ' : Profile P.M, P.IsSPE 0 σ' → ∀ i : Fin P.M,
      P.profit (P.final 0 σ (pathHist σ n)) i ≤ P.profit (P.final 0 σ' (pathHist σ n)) i := 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, (25)
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