is_two_type_allocation
def
An allocation of a goods of type A and b goods of type B among n agents is a pair of non-negative integer count vectors (x, y) summing to a and b respectively.
Statement
def is_two_type_allocation (n a b : ℕ) (x y : Fin n → ℕ) : Prop
- Defined in
- arXiv:2610.19099
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 3
- two_chore_types_exact_pmms_fpo_incompatibleExact pairwise maximin share fairness and fractional Pareto optimality are incompatible for two chore types: the property…
- two_type_chores_have_alpha_pmms_fpoThe property that for any number of agents n ≥ 2, non-negative chore totals a, b : ℕ, and agent-specific strictly positive chore cost…
- op886_two_type_chores_alpha_pmms_fpo_monoFor real numbers alpha ≤ beta, if the universal existence property two_type_chores_have_alpha_pmms_fpo alpha holds, then…
Read back from the Lean
Given natural numbers $n$, $a$, and $b$, and two functions $x, y : \mathrm{Fin}\ n \to \mathbb{N}$, is_two_type_allocation n a b x y asserts that the sum of $x(i)$ over all $i \in \mathrm{Fin}\ n$ equals $a$, and the sum of $y(i)$ over all $i \in \mathrm{Fin}\ n$ equals $b$.
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
/-- Complete count allocation of two types of goods with counts a and b among n agents. -/ def is_two_type_allocation (n a b : ℕ) (x y : Fin n → ℕ) : Prop := (∑ i, x i = a) ∧ (∑ i, y i = b)