AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.AdditiveValuation.toValuation_mono

theoremverifiedformalizationimported Lean

Additive valuations with nonnegative weights are monotone: sub-bundles have no greater value than their supersets.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BigOperators Finset in
variable {N G : Type*} in
lemma SocialChoice.FairDivision.Indivisible.AdditiveValuation.toValuation_mono [DecidableEq G]
    (w : AdditiveValuation N G)
    (hnn : ∀ (i : N) (g : G), 0 ≤ w.weight i g)
    (i : N) {S T : Finset G} (h : T ⊆ S) :
    w.toValuation.val i T ≤ w.toValuation.val i S
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.AdditiveValuation.toValuation_mono`
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 BigOperators Finset invariable {N G : Type*} in/-- Additive valuations with nonnegative weights are monotone: sub-bundles have no greater value than their supersets. -/lemma SocialChoice.FairDivision.Indivisible.AdditiveValuation.toValuation_mono [DecidableEq G]    (w : AdditiveValuation N G)    (hnn : ∀ (i : N) (g : G), 0 ≤ w.weight i g)    (i : N) {S T : Finset G} (h : T ⊆ S) :    w.toValuation.val i T ≤ w.toValuation.val i S := by  simp only [toValuation]  exact Finset.sum_le_sum_of_subset_of_nonneg h (fun x _ _ => hnn i x)
See it in the graphDiscuss this resultChallenge it