Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 6, p. 1503 — in the example the maximal total product is 11½, attained exactly at j ← {1}, k ← {2, 3} and j ← {1, 2}, k ← {3}

Proved
KelsoCrawford.NoCore.example_efficient_assignments

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

corecounterexamplematchingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

In the market of the example of Section 6, every assignment ggg of the three workers to the firms j,kj, kj,k has total product at most 111211\tfrac121121​:

yj(g−1(j))+yk(g−1(k))≤1112,y^j\big(g^{-1}(j)\big) + y^k\big(g^{-1}(k)\big) \le 11\tfrac12,yj(g−1(j))+yk(g−1(k))≤1121​,

and equality holds if and only if either {1}\{1\}{1} is assigned to firm jjj and {2,3}\{2, 3\}{2,3} to firm kkk, or {1,2}\{1, 2\}{1,2} is assigned to firm jjj and {3}\{3\}{3} to firm kkk.

Together with the efficiency of core allocations, this reduces the search for a core allocation of the example to these two assignments.

Formalization Note Workers 1,2,31, 2, 31,2,3 are 0, 1, 2 and firms j,kj, kj,k are 0, 1; an assignment is any function from workers to firms (every worker is employed).

Preamble
import Mathlib
import Definitions.Def_KelsoCrawford_NoCore_Model
import Definitions.Def_KelsoCrawford_NoCore_Notions
import Definitions.Def_KelsoCrawford_NoCore_Example
Formal statement
namespace KelsoCrawford.NoCore

theorem example_efficient_assignments :
    (∀ g : Fin 3 → Fin 2, noCoreMarket.totalProduct g ≤ 23 / 2) ∧
    (∀ g : Fin 3 → Fin 2, noCoreMarket.totalProduct g = 23 / 2 ↔
      (assignedTo g 0 = {0} ∧ assignedTo g 1 = {1, 2}) ∨
      (assignedTo g 0 = {0, 1} ∧ assignedTo g 1 = {2})) := by sorry

end KelsoCrawford.NoCore
Source
Kelso and Crawford, Job matching, coalition formation, and gross substitutes, Econometrica 50 (1982), p. 1503, Section 6
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