KnapsackAuction.binaryRespectsCapacity
defimported Lean
Capacity feasibility for a binary allocation profile.
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] in def KnapsackAuction.binaryRespectsCapacity (A : KnapsackAuction I U) (x : BinaryAllocation I) : Prop
- Defined in
- EconCSLib, `KnapsackAuction.binaryRespectsCapacity`
- 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← KnapsackAuction.binaryRespectsCapacity (EconCSLib/MechanismDesign/Auction/Knapsack.lean:140): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- KnapsackAuction.binaryLoadThe weighted load induced by 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.
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- Used by 5
- KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacityKnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity
- KnapsackAuction.feasibleBinaryAllocationsThe finite list of binary allocations satisfying the knapsack constraint.
- KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocationsKnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
- KnapsackAuction.feasibleBinaryAllocations_nonemptyKnapsackAuction.feasibleBinaryAllocations_nonempty
- KnapsackAuction.zeroBinaryRespectsCapacityKnapsackAuction.zeroBinaryRespectsCapacity
Lean source view module on GitHub
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] in /-- Capacity feasibility for a binary allocation profile. -/ def KnapsackAuction.binaryRespectsCapacity (A : KnapsackAuction I U) (x : BinaryAllocation I) : Prop := A.binaryLoad x ≤ A.totalCapacity