KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimal
theoremverifiedformalizationimported Lean
If the ratio-sorted greedy fractional allocation is optimal for the fractional relaxation, then its welfare dominates the welfare of the optimal 0/1 knapsack allocation. This is the standard relaxation comparison: every feasible binary allocation is also a feasible fractional allocation.
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 theorem KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimal (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity) (hgreedyOptimal : ∀ x : I → U, A.fractionalFeasible x → fractionalSocialWelfare b x ≤ fractionalSocialWelfare b (A.fractionalGreedyAllocation b)) : A.maximalSocialWelfare b hW ≤ fractionalSocialWelfare b (A.fractionalGreedyAllocation b)
- Formalizes
- EconCSLib, `KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimal`
- 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.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimal← KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimal (EconCSLib/MechanismDesign/Auction/Knapsack.lean:396): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 14
- KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacityKnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity
- KnapsackAuction.fractionalGreedyAllocationThe greedy fractional knapsack allocation obtained by sorting agents by value-to-weight ratio and then filling capacity in that order.
- KnapsackAuction.welfareMaximizerKnapsackAuction.welfareMaximizer
- KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocationsKnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
- KnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocationsKnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocations
- KnapsackAuction.maximalSocialWelfareThe maximal social welfare over the feasible binary allocation space.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - KnapsackAuction.fractionalFeasibleFeasibility of a fractional knapsack allocation: pointwise fractions lie in
[0,1]and the weighted load respects capacity. - KnapsackAuction.fractionalSocialWelfareFractional social welfare for a
U-valued allocation vector. - KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- KnapsackAuction.binaryToAllocationThe
0/1allocation vector associated with a binary allocation profile. - KnapsackAuction.binarySocialWelfareSocial welfare of a binary allocation profile at valuation profile
b.
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] in/-- If the ratio-sorted greedy fractional allocation is optimal for the fractional relaxation, then its welfare dominates the welfare of the optimal `0/1` knapsack allocation. This is the standard relaxation comparison: every feasible binary allocation is also a feasible fractional allocation. -/theorem KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimal (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity) (hgreedyOptimal : ∀ x : I → U, A.fractionalFeasible x → fractionalSocialWelfare b x ≤ fractionalSocialWelfare b (A.fractionalGreedyAllocation b)) : A.maximalSocialWelfare b hW ≤ fractionalSocialWelfare b (A.fractionalGreedyAllocation b) := by let xStar := A.welfareMaximizer b hW have hxStarFeas : A.fractionalFeasible (binaryToAllocation xStar) := by exact A.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity (A.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations (A.welfareMaximizer_mem_feasibleBinaryAllocations b hW)) calc A.maximalSocialWelfare b hW = fractionalSocialWelfare b (binaryToAllocation xStar) := by simp [maximalSocialWelfare, fractionalSocialWelfare, xStar, binarySocialWelfare] _ ≤ fractionalSocialWelfare b (A.fractionalGreedyAllocation b) := by exact hgreedyOptimal _ hxStarFeas