wpropx_gadget_of_dom
lemmaverified
Pareto domination for natural-number costs implies Pareto domination for the costs cast to the reals.
Statement
lemma wpropx_gadget_of_dom {m n : ℕ} (C : Fin n → Fin m → ℕ) (τ σ : Fin m → Fin n) (h : wpropx_gadget_dom C τ σ) : pareto_dominates_chores (fun i e => (C i e : ℝ)) τ σ
- Source
- step towards weighted_propx_po_chores_incompatible_two_fifths / _nine_twentieths / _three_sevenths (two-agent weighted PROPX + PO counterexamples, arXiv:2608.16130 v1 (its Thm 3.1 covers shares (3/10, 7/10) only))
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- pareto_dominates_choresAn allocation of chores Pareto-dominates another if it costs every agent at most as much and some agent strictly less.
- wpropx_gadget_avFor natural-number costs cast to the reals, the additive cost of a bundle is the cast of the natural-number cost.
- wpropx_gadget_domPareto domination between allocations for natural-number costs.
- Used by 1
- no_weighted_propx_po_of_nat_checkReduction for kernel checking: if, for natural-number costs C and shares num/den, every allocation that is weighted PROPX (multiplied…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
lemma wpropx_gadget_of_dom {m n : ℕ} (C : Fin n → Fin m → ℕ) (τ σ : Fin m → Fin n) (h : wpropx_gadget_dom C τ σ) : pareto_dominates_chores (fun i e => (C i e : ℝ)) τ σ := by obtain ⟨hle, j, hlt⟩ := h refine ⟨fun i => ?_, j, ?_⟩ · simp only [wpropx_gadget_av]; exact_mod_cast hle i · simp only [wpropx_gadget_av]; exact_mod_cast hlt