AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.isEnvyFree

defimported Lean

Noncomputable envy-free Boolean reflection helper. Returns true iff A is envy-free under valuation v.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N G : Type*} in
noncomputable def SocialChoice.FairDivision.Indivisible.isEnvyFree [Fintype N]
    (v : Valuation N G) (A : Allocation N G) : Bool
Defined in
EconCSLib, `SocialChoice.FairDivision.Indivisible.isEnvyFree`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N G : Type*} in
/-- Noncomputable envy-free Boolean reflection helper. Returns `true` iff `A` is envy-free under valuation `v`. -/
noncomputable def SocialChoice.FairDivision.Indivisible.isEnvyFree [Fintype N]
    (v : Valuation N G) (A : Allocation N G) : Bool :=
  decide (∀ i j : N, v.val i (A j) ≤ v.val i (A i))
See it in the graphDiscuss this resultChallenge it