KnapsackAuction.eq_zero_of_fractionalSupportedOn_of_not_mem
theoremverifiedformalizationimported Lean
KnapsackAuction.eq_zero_of_fractionalSupportedOn_of_not_mem
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 [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in lemma KnapsackAuction.eq_zero_of_fractionalSupportedOn_of_not_mem {items : List I} {x : I → ℝ} (hsupp : fractionalSupportedOn items x) {i : I} (hi : i ∉ items) : x i = 0
- Formalizes
- EconCSLib, `KnapsackAuction.eq_zero_of_fractionalSupportedOn_of_not_mem`
- 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.eq_zero_of_fractionalSupportedOn_of_not_mem← KnapsackAuction.eq_zero_of_fractionalSupportedOn_of_not_mem (EconCSLib/MechanismDesign/Auction/Knapsack.lean:839): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- KnapsackAuction.fractionalSupportedOnA real-valued allocation is supported on a list if every nonzero coordinate appears in that list.
- 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 [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] inlemma KnapsackAuction.eq_zero_of_fractionalSupportedOn_of_not_mem {items : List I} {x : I → ℝ} (hsupp : fractionalSupportedOn items x) {i : I} (hi : i ∉ items) : x i = 0 := by by_contra hxi exact hi (hsupp i hxi)