AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.not_paretoImproved_self

theoremverifiedformalizationimported Lean

The allocation itself is not a Pareto improvement over itself.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SocialChoice SocialChoice.FairDivision SocialChoice.FairDivision.Indivisible in
variable {N G : Type*} in
variable [Fintype N] [DecidableEq G] in
variable (v : Valuation N G) (allGoods : Finset G) in
lemma SocialChoice.FairDivision.Indivisible.not_paretoImproved_self (A : Allocation N G) :
    ¬ (IsAllocation allGoods A ∧ (∀ i, v.val i (A i) ≤ v.val i (A i)) ∧
       ∃ i, v.val i (A i) < v.val i (A i))
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.not_paretoImproved_self`
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
Classical.choiceQuot.soundpropext
Built on 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen SocialChoice SocialChoice.FairDivision SocialChoice.FairDivision.Indivisible invariable {N G : Type*} invariable [Fintype N] [DecidableEq G] invariable (v : Valuation N G) (allGoods : Finset G) in/-- The allocation itself is not a Pareto improvement over itself. -/lemma SocialChoice.FairDivision.Indivisible.not_paretoImproved_self (A : Allocation N G) :    ¬ (IsAllocation allGoods A ∧ (∀ i, v.val i (A i) ≤ v.val i (A i)) ∧       ∃ i, v.val i (A i) < v.val i (A i)) := by  rintro ⟨_, _, i, hi⟩  exact lt_irrefl _ hi
See it in the graphDiscuss this resultChallenge it