AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.nsmul_egalitarianWelfare_le_utilitarianWelfare

theoremverifiedformalizationimported Lean

Without division, egalitarian welfare is bounded above by utilitarian welfare multiplied by the number of agents.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BigOperators in
variable {N S : Type*} in
variable [Fintype N] in
lemma SocialChoice.FairDivision.nsmul_egalitarianWelfare_le_utilitarianWelfare
    [Nonempty N]
    (u : N → S → ℝ) (A : Allocation N S)
    (hle : ∀ i : N, egalitarianWelfare u A ≤ u i (A i)) :
    Fintype.card N • egalitarianWelfare u A ≤ utilitarianWelfare u A
Formalizes
EconCSLib, `SocialChoice.FairDivision.nsmul_egalitarianWelfare_le_utilitarianWelfare`
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 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen BigOperators invariable {N S : Type*} invariable [Fintype N] in/-- Without division, egalitarian welfare is bounded above by utilitarian welfare multiplied by the number of agents. -/lemma SocialChoice.FairDivision.nsmul_egalitarianWelfare_le_utilitarianWelfare    [Nonempty N]    (u : N → S → ℝ) (A : Allocation N S)    (hle : ∀ i : N, egalitarianWelfare u A ≤ u i (A i)) :    Fintype.card N • egalitarianWelfare u A ≤ utilitarianWelfare u A := by  calc Fintype.card N • egalitarianWelfare u A      = ∑ _i : N, egalitarianWelfare u A := by          simp [Finset.sum_const, Finset.card_univ]    _ ≤ ∑ i : N, u i (A i) := Finset.sum_le_sum (fun i _ => hle i)    _ = utilitarianWelfare u A := rfl
See it in the graphDiscuss this resultChallenge it