AFTD Auto-Formalizing Theoretical Domains

bivalued_sharp_lower_bound_cost

def

The lower-bound chore cost profile with n agents and n+1 chores, where agents 0 through n-2 assign cost 1 to chores 0 and 1, agent n-1 assigns cost 1 to chores 0 and 2, and all other costs are r.

Statement

def bivalued_sharp_lower_bound_cost (n : ℕ) (r : ℝ) : Fin n → Fin (n + 1) → ℝ
Defined in
knowledgebase (OP-1112)
Verified
05 Nov 2026
Axioms
none listed

Read back from the Lean

A definition of a function bivalued_sharp_lower_bound_cost taking a natural number n and a real number r, returning a function of type Fin n → Fin (n + 1) → ℝ. Given i : Fin n and g : Fin (n + 1), the value is: - 1 if either: 1. i.val < n - 1 and (g.val = 0 or g.val = 1), or 2. i.val = n - 1 and (g.val = 0 or g.val = 2); - r otherwise.

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 n-agent, (n+1)-chore lower bound profile with low costs on {0,1} for agents < n-1 and {0,2} for agent n-1. -/
def bivalued_sharp_lower_bound_cost (n : ℕ) (r : ℝ) : Fin n → Fin (n + 1) → ℝ := fun i g =>
    if (i.val < n - 1 ∧ (g.val = 0 ∨ g.val = 1)) ∨
       (i.val = n - 1 ∧ (g.val = 0 ∨ g.val = 2)) then
      1
    else
      r
See it in the graphDiscuss this resultChallenge it