KnapsackAuction.integralGreedyList_supportedOn
theoremverifiedformalizationimported Lean
KnapsackAuction.integralGreedyList_supportedOn
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open KnapsackAuction in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in omit [Fintype I] [LinearOrder I] [Nonempty I] in lemma KnapsackAuction.integralGreedyList_supportedOn (w : I → Nat) : ∀ items remaining, supportedOn items (integralGreedyList w items remaining)
- Formalizes
- EconCSLib, `KnapsackAuction.integralGreedyList_supportedOn`
- 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.integralGreedyList_supportedOn← KnapsackAuction.integralGreedyList_supportedOn (EconCSLib/MechanismDesign/Auction/Knapsack.lean:847): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- KnapsackAuction.integralGreedyListThe integral greedy prefix algorithm: process items in a fixed order, take each whole item if it fits, and halt when the first item fails…
- KnapsackAuction.supportedOnAn allocation is supported on a list of agents if every selected agent appears in that list.
- KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,…
- 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 KnapsackAuction inopen scoped BigOperators invariable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] inomit [Fintype I] [LinearOrder I] [Nonempty I] inlemma KnapsackAuction.integralGreedyList_supportedOn (w : I → Nat) : ∀ items remaining, supportedOn items (integralGreedyList w items remaining) := by intro items induction items with | nil => intro remaining i hi simp [integralGreedyList] at hi | cons i items ih => intro remaining j hj by_cases hfit : w i ≤ remaining · by_cases hji : j = i · subst hji simp · have hjtail : integralGreedyList w items (remaining - w i) j = true := by simpa [integralGreedyList, hfit, Function.update, hji] using hj exact List.mem_cons_of_mem _ (ih _ _ hjtail) · simp [integralGreedyList, hfit] at hj