SocialChoice.FairDivision.Indivisible.isProportional
defimported Lean
Noncomputable proportionality Boolean reflection helper for n agents. Returns true iff every agent's bundle value is ≥ 1/n of the total. The value codomain is fixed to ℝ, so this is noncomputable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N G : Type*} in noncomputable def SocialChoice.FairDivision.Indivisible.isProportional [Fintype N] (n : ℕ) (v : Valuation N G) (allGoods : Finset G) (A : Allocation N G) : Bool
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Indivisible.isProportional`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.FairDivision.Indivisible.isProportional← SocialChoice.FairDivision.Indivisible.isProportional (EconCSLib/SocialChoice/FairDivision/Indivisible/Checker.lean:97): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- SocialChoice.FairDivision.Indivisible.AllocationAn allocation assigns each agent
i : Na bundle (a finite subset of goodsG). This is a plain function type alias. The partition… - SocialChoice.FairDivision.Indivisible.ValuationAn abstract valuation assigns a real value to each agent-bundle pair.
val i Sis the value agentiassigns to bundleS. Lives in…
- SocialChoice.FairDivision.Indivisible.AllocationAn allocation assigns each agent
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N G : Type*} in /-- Noncomputable proportionality Boolean reflection helper for `n` agents. Returns `true` iff every agent's bundle value is ≥ 1/n of the total. The value codomain is fixed to `ℝ`, so this is noncomputable. -/ noncomputable def SocialChoice.FairDivision.Indivisible.isProportional [Fintype N] (n : ℕ) (v : Valuation N G) (allGoods : Finset G) (A : Allocation N G) : Bool := decide (∀ i : N, v.val i allGoods ≤ (n : ℝ) * v.val i (A i))