AFTD Auto-Formalizing Theoretical Domains

pmms3c_cost_nat_eq

theoremverified

The fold computing agent i's cost of the chores selected by P agrees with the additive cost of that set.

Statement

theorem pmms3c_cost_nat_eq (i : Fin 3) (P : Fin 9 → Bool) : ((pmms3c_cost_nat i P : ℕ) : ℝ) = additive_valuation (fun g => (pmms3c_cost i g : ℝ)) (Finset.univ.filter fun g => P g = true)
Source
step towards pmms_chores_three_agents_may_not_exist (three-agent chores PMMS, not posed in arXiv:2609.10493): certificate checker and its soundness
Verified
26 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • pmms3c_cost_natThe cost to agent i of the set of chores {g : P g}, as a natural number.
  • additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.
  • pmms3c_costInteger costs of three agents for nine chores: agent 0 (21,38,28,24,20,35,29,41,18), agent 1 (15,41,27,25,23,26,28,35,21), agent 2…
Used by 1
  • pmms3c_verify_soundIf the certificate check accepts w for allocation σ, then σ is not PMMS for agent w mod 3.

Lean source view module on GitHub

theorem pmms3c_cost_nat_eq (i : Fin 3) (P : Fin 9 → Bool) : ((pmms3c_cost_nat i P : ℕ) : ℝ) = additive_valuation (fun g => (pmms3c_cost i g : ℝ)) (Finset.univ.filter fun g => P g = true) := by  unfold additive_valuation pmms3c_cost_nat  rw [Finset.sum_filter]  simp [Fin.sum_univ_succ, List.finRange_succ]
See it in the graphDiscuss this resultChallenge it