AFTD Auto-Formalizing Theoretical Domains

uniform_bivalued_obstruction_cost

def

The two-agent chore cost profile on 4t chores where agent 0 assigns cost 1 to every chore, while agent 1 assigns cost r to 2t - 1 high chores and cost 1 to 2t + 1 low chores.

Statement

def uniform_bivalued_obstruction_cost (t : ℕ) (r : ℝ) : Fin 2 → Fin (4 * t) → ℝ
Defined in
OP-1697
Verified
14 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

For a natural number t and a real number r, uniform_bivalued_obstruction_cost t r is the function of type Fin 2 → Fin (4 * t) → ℝ that maps indices i : Fin 2 and g : Fin (4 * t) to: - 1, if i = 0; - r, if i ≠ 0 and g.val < 2 * t - 1 (in ℕ); - 1, otherwise (i.e., if i ≠ 0 and g.val ≥ 2 * t - 1).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The 4t-chore obstruction instance where agent 0 assigns cost 1 to all chores and agent 1 assigns cost r to 2t-1 chores and cost 1 to 2t+1 chores. -/
def uniform_bivalued_obstruction_cost (t : ℕ) (r : ℝ) : Fin 2 → Fin (4 * t) → ℝ := fun i g => if i = 0 then 1 else if g.val < 2 * t - 1 then r else 1
See it in the graphDiscuss this resultChallenge it