Lemma 10 (second sentence) — an Arrovian SWF with strong-order range factors as a strict Arrovian SWF after a tie-breaking function
ProvedStrategyProofArrow.WeakArrow.lemma_10_iiarrow-theoremp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1social-choicetie-breaking
Let and , and let be a social welfare function on weak ballot sets whose range is contained in the strong orders . If satisfies IIA, CS and NNR, then there exist a tie-breaking function and a strict social welfare function satisfying IIA, CS and NNR such that
The tie-breaking function need not be regular: its value on individual may depend on the whole ballot set. This decomposition reduces Arrow's theorem with indifference to the strict case.
Formalization Note The standing hypothesis of Lemma 10, range contained in , applies to this sentence and is kept. CS is stated for distinct alternatives. Conventions are those of the definitions file.
Preamble
import Mathlib import Definitions.Def_StrategyProofArrow_WeakArrow_Basic
Formal statement
namespace StrategyProofArrow.WeakArrow
/-- **Lemma 10, second sentence**, Satterthwaite p. 44: let `u` be a social welfare function on weak
ballot sets with range contained in the strong orders. If `u` satisfies IIA, CS and NNR, then there
exist a tie-breaking function `α` and a strict social welfare function `μ` satisfying IIA, CS and
NNR such that `u(B) = μ(α(B))` for every weak ballot set `B`. -/
theorem lemma_10_ii {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι] [DecidableEq A]
(hn : 2 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
(u : WeakProfile ι A → WeakOrder A) (hrange : ∀ B, (u B).IsStrong)
(hIIA : IIA u) (hCS : CS u) (hNNR : NNR u) :
∃ α : WeakProfile ι A → StrongProfile ι A, IsTieBreaking α ∧
∃ μ : StrongProfile ι A → StrongOrder A,
StrictIIA μ ∧ StrictCS μ ∧ StrictNNR μ ∧ ∀ B, u B = (μ (α B)).1 := by sorry
end StrategyProofArrow.WeakArrow
Source
Satterthwaite, Strategy-proofness and Arrow's Conditions, Northwestern Discussion Paper No. 122 (rev. Dec. 12, 1974), Lemma 10, second sentence, p. 44
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.