Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 — the process converges to an individually rational allocation

Proved
KelsoCrawford.Process.lemma3_individually_rational

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

ascending-processcoregross-substitutesmatchingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a job-matching market with at least one firm satisfy regularity of utilities, (MP), (NFL), and (GS) for the discrete market with salary unit δ>0\delta > 0δ>0. Let a run of the salary-adjustment process R1–R5 issue no rejections in round TTT, and let (ϕ;s1ϕ(1)(T),…,smϕ(m)(T))(\phi; s_{1\phi(1)}(T), \dots, s_{m\phi(m)}(T))(ϕ;s1ϕ(1)​(T),…,smϕ(m)​(T)) be the allocation at that round: each worker iii goes to the firm ϕ(i)\phi(i)ϕ(i) whose offer he or she holds, at the permitted salary siϕ(i)(T)s_{i\phi(i)}(T)siϕ(i)​(T). Then this allocation is individually rational:

siϕ(i)(T)≥σiϕ(i)  for every i,πj[Cϕj;sj(T)]≥0  for every j,s_{i\phi(i)}(T) \ge \sigma_{i\phi(i)} \ \text{ for every } i, \qquad \pi^j\big[C^j_\phi; s^j(T)\big] \ge 0 \ \text{ for every } j,siϕ(i)​(T)≥σiϕ(i)​  for every i,πj[Cϕj​;sj(T)]≥0  for every j,

where CϕjC^j_\phiCϕj​ is the set of workers assigned to jjj.

This is Lemma 3 of the paper, the first half of the core property in Lemma 4.

Formalization Note "The process converges to" is read as: at every round TTT at which no rejections are issued, the allocation read off by R5 has the property. The paper's t∗t^*t∗ is such a round.

Preamble
import Mathlib
import Definitions.Def_KelsoCrawford_Process_Model
import Definitions.Def_KelsoCrawford_Process_Process
Formal statement
namespace KelsoCrawford.Process

/-- Lemma 3, p. 1489: the allocation at any round where the process stops is individually rational. -/
theorem lemma3_individually_rational
    {W F : Type} [Fintype W] [DecidableEq W] [Fintype F] [DecidableEq F] [Nonempty F]
    (M : Market W F) (δ : ℝ) (hδ : 0 < δ) (hu : M.UtilityRegular) (hMP : M.MP) (hNFL : M.NFL)
    (hGS : ∀ j, GrossSubstitutesOn (M.y j) (M.gridVectors δ j)) :
    ∀ ρ : Run W F, M.IsRun δ ρ → ∀ T : ℕ, ρ.Stopped T → M.IsIR (ρ.outcome T) := by sorry

end KelsoCrawford.Process
Source
Kelso and Crawford, Job matching, coalition formation, and gross substitutes, Econometrica 50 (1982), p. 1489, Lemma 3
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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