KnapsackAuction.natBinarySocialWelfare_update_true_of_false
theoremverifiedformalizationimported Lean
KnapsackAuction.natBinarySocialWelfare_update_true_of_false
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] in lemma KnapsackAuction.natBinarySocialWelfare_update_true_of_false (b : I → Nat) {x : BinaryAllocation I} {i : I} (hxi : x i = false) : natBinarySocialWelfare b (Function.update x i true) = b i + natBinarySocialWelfare b x
- Formalizes
- EconCSLib, `KnapsackAuction.natBinarySocialWelfare_update_true_of_false`
- 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.KnapsackAuction.natBinarySocialWelfare_update_true_of_false← KnapsackAuction.natBinarySocialWelfare_update_true_of_false (EconCSLib/MechanismDesign/Auction/Knapsack.lean:522): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- KnapsackAuction.natBinarySocialWelfareInteger-valued welfare of a binary allocation profile.
- KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- Used by 1
- KnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators invariable {I : Type*} [Fintype I] [DecidableEq I] inlemma KnapsackAuction.natBinarySocialWelfare_update_true_of_false (b : I → Nat) {x : BinaryAllocation I} {i : I} (hxi : x i = false) : natBinarySocialWelfare b (Function.update x i true) = b i + natBinarySocialWelfare b x := by have htail : natBinarySocialWelfare b x = Finset.sum (Finset.univ.erase i) (fun j => if Function.update x i true j = true then b j else 0) := by rw [natBinarySocialWelfare, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)] have hs : Finset.sum (Finset.univ.erase i) (fun j => if x j = true then b j else 0) = Finset.sum (Finset.univ.erase i) (fun j => if Function.update x i true j = true then b j else 0) := by refine Finset.sum_congr rfl ?_ intro j hj have hji : j ≠ i := by simpa using hj simp [Function.update, hji] simpa [hxi] using hs rw [natBinarySocialWelfare, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)] rw [htail] simp [Function.update]