AFTD Auto-Formalizing Theoretical Domains

pmms3c_cost_nat

def

The cost to agent i of the set of chores {g : P g}, as a natural number.

Statement

def pmms3c_cost_nat (i : Fin 3) (P : Fin 9 → Bool) : ℕ
Source
step towards pmms_chores_three_agents_may_not_exist (three-agent chores PMMS, not posed in arXiv:2609.10493) (violation-certificate machinery and instance data)
Verified
26 Oct 2026
Axioms
none listed
Built on 1
  • 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 3
  • pmms3c_verify_soundIf the certificate check accepts w for allocation σ, then σ is not PMMS for agent w mod 3.
  • pmms3c_cost_nat_eqThe fold computing agent i's cost of the chores selected by P agrees with the additive cost of that set.
  • pmms3c_verifyChecks a violation certificate w = i + 3j + 9T for allocation σ: i ≠ j, the bitmask T lies inside X_i ∪ X_j, and both T and (X_i ∪ X_j) \…

Lean source view module on GitHub

/-- Agent `i`'s total cost of the chores selected by `P`, computed by a fold for the kernel. -/
def pmms3c_cost_nat (i : Fin 3) (P : Fin 9 → Bool) : ℕ :=
  (List.finRange 9).foldr (fun g acc => (if P g then pmms3c_cost i g else 0) + acc) 0
See it in the graphDiscuss this resultChallenge it