Rural hospitals theorem, Part 1
ProvedRuralHospitals.rural_hospitals_part1Consider a many-to-one matching market with a finite set of doctors and a finite set of hospitals, where hospital has positions and all preferences are strict. For a matching , write for the set of doctors assigned to . Let and be stable matchings. Then
- the set of assigned doctors is the same: for every , is matched under if and only if is matched under ;
- the number of filled positions at each hospital is the same:
This is Part 1 of the rural hospitals theorem (Roth 1984): changing the stable mechanism cannot change who is employed or how many positions each hospital fills.
Formalization Note Uses the model RuralHospitals.Market (definition RuralHospitals_Market): finite types D (doctors) and H (hospitals); strict preferences given by injective rank functions on Option H / Option D (smaller rank = preferred, none = unmatched / empty position); responsive hospital preferences; capacities capacity : H → ℕ. An assignment is a map μ : D → Option H, and assigned μ h is the finite set of doctors placed at h.
import Mathlib import Definitions.Def_RuralHospitals_Market
namespace RuralHospitals
theorem rural_hospitals_part1 {D H : Type*} [Fintype D] [Fintype H] [DecidableEq H]
(M : Market D H) (μ ν : Assignment D H) (hμ : M.IsStable μ) (hν : M.IsStable ν) :
(∀ d, (μ d).isSome = (ν d).isSome) ∧
∀ h, (assigned μ h).card = (assigned ν h).card := by sorry
end RuralHospitals
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.