KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity
theoremverifiedformalizationimported Lean
KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity
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 [DecidableEq I] [LinearOrder I] in lemma KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity (A : KnapsackAuction I U) {x : BinaryAllocation I} (hx : A.binaryRespectsCapacity x) : A.fractionalFeasible (binaryToAllocation x)
- Formalizes
- EconCSLib, `KnapsackAuction.binaryToAllocation_fractionalFeasible_of_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.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity← KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity (EconCSLib/MechanismDesign/Auction/Knapsack.lean:383): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- KnapsackAuction.binaryRespectsCapacityCapacity feasibility for a binary allocation profile.
- 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.
- KnapsackAuction.fractionalFeasibleFeasibility of a fractional knapsack allocation: pointwise fractions lie in
[0,1]and the weighted load respects capacity. - KnapsackAuction.binaryToAllocationThe
0/1allocation vector associated with a binary allocation profile. - 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 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 [DecidableEq I] [LinearOrder I] inlemma KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity (A : KnapsackAuction I U) {x : BinaryAllocation I} (hx : A.binaryRespectsCapacity x) : A.fractionalFeasible (binaryToAllocation x) := by constructor · intro i by_cases hxi : x i <;> simp [binaryToAllocation, hxi] · simpa [binaryRespectsCapacity, binaryLoad, binaryToAllocation] using hx