KnapsackAuction.fractionalSocialWelfare_update_one_of_zero
theoremverifiedformalizationimported Lean
KnapsackAuction.fractionalSocialWelfare_update_one_of_zero
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in omit [LinearOrder I] [Nonempty I] in lemma KnapsackAuction.fractionalSocialWelfare_update_one_of_zero (b : I → ℝ) {x : I → ℝ} {i : I} (hxi : x i = 0) : fractionalSocialWelfare b (Function.update x i 1) = b i + fractionalSocialWelfare b x
- Formalizes
- EconCSLib, `KnapsackAuction.fractionalSocialWelfare_update_one_of_zero`
- 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.fractionalSocialWelfare_update_one_of_zero← KnapsackAuction.fractionalSocialWelfare_update_one_of_zero (EconCSLib/MechanismDesign/Auction/Knapsack.lean:890): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- KnapsackAuction.fractionalSocialWelfareFractional social welfare for a
U-valued allocation vector.
- KnapsackAuction.fractionalSocialWelfareFractional social welfare for a
- 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] [LinearOrder I] [Nonempty I] inomit [LinearOrder I] [Nonempty I] inlemma KnapsackAuction.fractionalSocialWelfare_update_one_of_zero (b : I → ℝ) {x : I → ℝ} {i : I} (hxi : x i = 0) : fractionalSocialWelfare b (Function.update x i 1) = b i + fractionalSocialWelfare b x := by rw [fractionalSocialWelfare, fractionalSocialWelfare, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i), ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)] have hs : Finset.sum (Finset.univ.erase i) (fun j => b j * Function.update x i 1 j) = Finset.sum (Finset.univ.erase i) (fun j => b j * x j) := by refine Finset.sum_congr rfl ?_ intro j hj have hji : j ≠ i := by simpa using hj simp [Function.update, hji] rw [hs] simp [Function.update, hxi]