AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.natFractionalGreedyList_supportedOn

theoremverifiedformalizationimported Lean

KnapsackAuction.natFractionalGreedyList_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.natFractionalGreedyList_supportedOn (w : I → Nat) :
    ∀ items remaining,
      fractionalSupportedOn items (natFractionalGreedyList w items remaining)
Formalizes
EconCSLib, `KnapsackAuction.natFractionalGreedyList_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • KnapsackAuction.natFractionalGreedyListFractional greedy prefix algorithm on a natural-number remaining capacity: take each whole item if it fits, and otherwise take exactly the…
  • KnapsackAuction.fractionalSupportedOnA real-valued allocation is supported on a list if every nonzero coordinate appears in that list.
  • KnapsackAuctionA knapsack auction with public weights w i and total capacity W. The underlying strategic object is a SingleParameterMechanism I U,…
Used by 1

Lean source view module on GitHub

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.natFractionalGreedyList_supportedOn (w : I → Nat) :    ∀ items remaining,      fractionalSupportedOn items (natFractionalGreedyList w items remaining) := by  intro items  induction items with  | nil =>      intro remaining i hi      simp [natFractionalGreedyList] 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 : natFractionalGreedyList w items (remaining - w i) j ≠ 0 := by            simpa [natFractionalGreedyList, hfit, Function.update, hji] using hj          exact List.mem_cons_of_mem _ (ih _ _ hjtail)      · by_cases hji : j = i        · subst hji          simp        · exfalso          simp [natFractionalGreedyList, hfit, hji] at hj
See it in the graphDiscuss this resultChallenge it