AFTD Auto-Formalizing Theoretical Domains

is_uniform_bivalued_chores

def

A chore cost profile for two agents and m chores is uniform bivalued with ratio r if the first agent assigns cost 1 to every chore and the second agent assigns each chore cost either 1 or r.

Statement

def is_uniform_bivalued_chores {m : ℕ} (r : ℝ) (c : Fin 2 → Fin m → ℝ) : Prop
Defined in
OP-1697
Verified
14 Nov 2026
Axioms
none listed
Used by 2
  • is_uniform_bivalued_chores_onesFor any number of chores m and any ratio r, the instance where both agents assign cost 1 to every chore is uniform bivalued with ratio r.
  • uniform_bivalued_unit_ratio_exact_mmsFor any number of chores m and any two-agent chore cost profile c satisfying is_uniform_bivalued_chores 1 c, there exists a lottery p in…

Read back from the Lean

Given an implicit natural number $m$, a real number $r$, and a function $c : \text{Fin } 2 \to \text{Fin } m \to \mathbb{R}$, is_uniform_bivalued_chores r c asserts that: 1. For every $g : \text{Fin } m$, $c(0, g) = 1$; and 2. For every $g : \text{Fin } m$, either $c(1, g) = 1$ or $c(1, g) = r$.

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

/-- A two-agent chore cost profile is uniform bivalued with ratio r if agent 0 assigns cost 1 to every chore and agent 1 assigns cost 1 or r to each chore. -/
def is_uniform_bivalued_chores {m : ℕ} (r : ℝ) (c : Fin 2 → Fin m → ℝ) : Prop := (∀ g, c 0 g = 1) ∧ (∀ g, c 1 g = 1 ∨ c 1 g = r)
See it in the graphDiscuss this resultChallenge it