AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.binarySocialWelfare_update

theoremverifiedformalizationimported Lean

KnapsackAuction.binarySocialWelfare_update

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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.binarySocialWelfare_update
    (b : I → U) (i : I) (θ : U) (x : BinaryAllocation I) :
    binarySocialWelfare (Function.update b i θ) x =
      θ * binaryToAllocation x i +
        Finset.sum (Finset.univ.erase i) (fun j => b j * binaryToAllocation x j)
Formalizes
EconCSLib, `KnapsackAuction.binarySocialWelfare_update`
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
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators invariable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] invariable [Fintype I] [DecidableEq I] inlemma KnapsackAuction.binarySocialWelfare_update    (b : I → U) (i : I) (θ : U) (x : BinaryAllocation I) :    binarySocialWelfare (Function.update b i θ) x =      θ * binaryToAllocation x i +        Finset.sum (Finset.univ.erase i) (fun j => b j * binaryToAllocation x j) := by  have hsum :      Finset.sum (Finset.univ.erase i) (fun j => Function.update b i θ j * binaryToAllocation x j) =        Finset.sum (Finset.univ.erase i) (fun j => b j * binaryToAllocation x j) := by    refine Finset.sum_congr rfl ?_    intro j hj    have hji : j ≠ i := by      simpa using hj    simp [Function.update, hji]  cases hxi : x i with  | false =>      rw [binarySocialWelfare, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)]      rw [hsum]      simp [Function.update, binaryToAllocation, hxi]  | true =>      rw [binarySocialWelfare, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)]      rw [hsum]      simp [Function.update, binaryToAllocation, hxi]
See it in the graphDiscuss this resultChallenge it