AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.welfareMaximizer_ge

theoremverifiedformalizationimported Lean

KnapsackAuction.welfareMaximizer_ge

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open KnapsackAuction in
open scoped BigOperators in
variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in
variable [Fintype I] [DecidableEq I] in
lemma KnapsackAuction.welfareMaximizer_ge
    (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity)
    {x : BinaryAllocation I}
    (hx : x ∈ A.feasibleBinaryAllocations) :
    binarySocialWelfare b x ≤ binarySocialWelfare b (A.welfareMaximizer b hW)
Formalizes
EconCSLib, `KnapsackAuction.welfareMaximizer_ge`
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 8
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen KnapsackAuction inopen scoped BigOperators invariable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] invariable [Fintype I] [DecidableEq I] inlemma KnapsackAuction.welfareMaximizer_ge    (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity)    {x : BinaryAllocation I}    (hx : x ∈ A.feasibleBinaryAllocations) :    binarySocialWelfare b x ≤ binarySocialWelfare b (A.welfareMaximizer b hW) := by  exact (Classical.choose_spec (A.exists_welfareMaximizer b hW)).2 x hx
See it in the graphDiscuss this resultChallenge it