KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
theoremverifiedformalizationimported Lean
KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open KnapsackAuction in open scoped BigOperators in variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable [Fintype I] [DecidableEq I] [LinearOrder I] in omit [LinearOrder I] in lemma KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations (A : KnapsackAuction I U) {x : BinaryAllocation I} (hx : x ∈ A.feasibleBinaryAllocations) : A.binaryRespectsCapacity x
- Formalizes
- EconCSLib, `KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations`
- 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.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations← KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations (EconCSLib/MechanismDesign/Auction/Knapsack.lean:373): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- KnapsackAuction.feasibleBinaryAllocationsThe finite list of binary allocations satisfying the knapsack constraint.
- KnapsackAuction.binaryRespectsCapacityCapacity feasibility for a binary allocation profile.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- Used by 1
- KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimalIf the ratio-sorted greedy fractional allocation is optimal for the fractional relaxation, then its welfare dominates the welfare of the…
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*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] invariable [Fintype I] [DecidableEq I] [LinearOrder I] inomit [LinearOrder I] inlemma KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations (A : KnapsackAuction I U) {x : BinaryAllocation I} (hx : x ∈ A.feasibleBinaryAllocations) : A.binaryRespectsCapacity x := by classical unfold feasibleBinaryAllocations at hx simp at hx exact hx