Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — when workers are alike in production, (DR) and (GS) are equivalent

Proved
KelsoCrawford.Returns.dr_iff_gs

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

gross-substitutesmatchingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1returns-to-scale

Let WWW be a finite set of mmm workers, and let a firm's technology treat the workers as alike in production: y(C)=yˉ(∣C∣)y(C) = \bar y(|C|)y(C)=yˉ​(∣C∣) for every C⊆WC \subseteq WC⊆W, for some yˉ:N→R\bar y : \mathbb{N} \to \mathbb{R}yˉ​:N→R. Then the following are equivalent:

  1. yˉ\bar yyˉ​ has nonincreasing returns to workers (DR):
yˉ(w+1)−yˉ(w)≤yˉ(w)−yˉ(w−1)for every integer w, 1≤w≤m−1;\bar y(w + 1) - \bar y(w) \le \bar y(w) - \bar y(w - 1) \qquad \text{for every integer } w,\ 1 \le w \le m - 1;yˉ​(w+1)−yˉ​(w)≤yˉ​(w)−yˉ​(w−1)for every integer w, 1≤w≤m−1;
  1. the technology C↦yˉ(∣C∣)C \mapsto \bar y(|C|)C↦yˉ​(∣C∣) satisfies the gross-substitutes condition (GS) for real salary vectors: whenever CCC maximizes the profit yˉ(∣C∣)−∑i∈Csi\bar y(|C|) - \sum_{i \in C} s_iyˉ​(∣C∣)−∑i∈C​si​ at the salary vector sss and s~≥s\tilde s \ge ss~≥s, some profit-maximizing set at s~\tilde ss~ contains {i∈C:s~i=si}\{ i \in C : \tilde s_i = s_i \}{i∈C:s~i​=si​}.

The theorem identifies (GS), the hypothesis behind every existence result of the paper, with the textbook concavity condition in the case of identical workers, so that (GS) can be read as a generalization of nonincreasing returns to heterogeneous workers.

Formalization Note Salaries range over all of RW\mathbb{R}^WRW (the continuous form of (GS)). Neither (MP) nor yˉ(0)=0\bar y(0) = 0yˉ​(0)=0 is assumed, and none is needed. For m≤1m \le 1m≤1 condition (DR) is vacuous and (GS) holds, so no lower bound on mmm is imposed. The range 1≤w≤m−11 \le w \le m - 11≤w≤m−1 is written 1≤w1 \le w1≤w, w+1≤mw + 1 \le mw+1≤m over the natural numbers.

Preamble
import Mathlib
import Definitions.Def_KelsoCrawford_Process_Model
import Definitions.Def_KelsoCrawford_Returns_Technology
Formal statement
namespace KelsoCrawford.Returns

theorem dr_iff_gs {W : Type} [Fintype W] [DecidableEq W] (ybar : ℕ → ℝ) :
    DR (Fintype.card W) ybar ↔
      KelsoCrawford.Process.GrossSubstitutesOn (fun C : Finset W => ybar C.card) Set.univ := by sorry

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