is_scaled_bivalued_chores
def
Given ratio r : ℝ and a chore cost profile c : Fin n → Fin m → ℝ over n agents and m chores, c is scaled bivalued with ratio r if there exists a vector of positive scales a : Fin n → ℝ such that for every agent i : Fin n and chore g : Fin m, c i g = a i or c i g = r * a i.
Statement
def is_scaled_bivalued_chores {m n : ℕ} (r : ℝ) (c : Fin n → Fin m → ℝ) : Prop
- Defined in
- arXiv:2610.19099
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 5
- two_agent_common_bivalued_safe_partitionFor any ratio r with 1 ≤ r ≤ 2, any number of chores m, and any two-agent chore cost profile c satisfying is_scaled_bivalued_chores r c,…
- two_agent_bivalued_equal_marginal_sharp_mmsFor two agents (n = 2), ratio r with 1 ≤ r and r ≤ 2, and m chores with a cost profile c : Fin 2 → Fin m → ℝ satisfying…
- three_agent_seven_chores_equal_marginal_sharp_mmsFor three agents, seven chores, any ratio r in [1,2], and any scaled bivalued additive cost profile with common ratio r, there is a…
- 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…
- all_agent_bivalued_equal_marginal_divisible_choresFor every n at least two and k at least two, any common ratio r at least one, and any n-agent scaled bivalued additive cost profile on n*k…
Read back from the Lean
Given natural numbers m and n (implicit), a real number r, and a cost function c : Fin n → Fin m → ℝ, is_scaled_bivalued_chores r c is the proposition that there exists a function a : Fin n → ℝ such that:
1. for all i : Fin n, a i > 0; and
2. for all i : Fin n and all g : Fin m, c i g = a i or c i g = r * a i.
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 chore cost profile c : Fin n → Fin m → ℝ is scaled bivalued with ratio r if every cost c i g is a_i or r * a_i for some positive a_i. -/ def is_scaled_bivalued_chores {m n : ℕ} (r : ℝ) (c : Fin n → Fin m → ℝ) : Prop := ∃ a : Fin n → ℝ, (∀ i, 0 < a i) ∧ ∀ i g, c i g = a i ∨ c i g = r * a i