Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 6, p. 1503 — (25) and (27) force s₂ₖ = 3½, and then (24′), (26′) contradict: j ← {1}, k ← {2, 3} is not part of a core allocation

Proved
KelsoCrawford.NoCore.first_efficient_assignment_not_core

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, no allocation that assigns {1}\{1\}{1} to firm jjj and {2,3}\{2, 3\}{2,3} to firm kkk is a core allocation (D3) with continuously variable salaries, whatever the salaries s1js_{1j}s1j​, s2ks_{2k}s2k​, s3ks_{3k}s3k​.

In the paper, (25) and (27) give s2k=312s_{2k} = 3\tfrac12s2k​=321​, after which (24) and (26) become s3k−s1j≥14s_{3k} - s_{1j} \ge \tfrac14s3k​−s1j​≥41​ and s3k−s1j≤−14s_{3k} - s_{1j} \le -\tfrac14s3k​−s1j​≤−41​, which are incompatible. By the symmetry of the example (workers 1↔31 \leftrightarrow 31↔3, firms j↔kj \leftrightarrow kj↔k), the other efficient assignment is excluded in the same way.

Formalization Note Workers 1,2,31, 2, 31,2,3 are 0, 1, 2 and firms j,kj, kj,k are 0, 1; the assignment is fixed through the sets of workers each firm hires.

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

theorem first_efficient_assignment_not_core (A : Allocation (Fin 3) (Fin 2))
    (hj : A.hired 0 = {0}) (hk : A.hired 1 = {1, 2}) :
    ¬ noCoreMarket.IsCore KelsoCrawford.ContinuousCore.anySalary A := by sorry

end KelsoCrawford.NoCore
Source
Kelso and Crawford, Job matching, coalition formation, and gross substitutes, Econometrica 50 (1982), pp. 1503–1504, Section 6, eqs. (24′), (26′)
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