AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.fractionalFeasible

defimported Lean

Feasibility of a fractional knapsack allocation: pointwise fractions lie in [0,1] and the weighted load respects capacity.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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
def KnapsackAuction.fractionalFeasible (A : KnapsackAuction I U) (x : I → U) : Prop
Defined in
EconCSLib, `KnapsackAuction.fractionalFeasible`
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
none listed
Built on 3
  • KnapsackAuctionA knapsack auction with public weights w i and total capacity W. The underlying strategic object is a SingleParameterMechanism I U,…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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
/-- Feasibility of a fractional knapsack allocation: pointwise fractions lie in `[0,1]` and the weighted load respects capacity. -/
def KnapsackAuction.fractionalFeasible (A : KnapsackAuction I U) (x : I → U) : Prop :=
  (∀ i, 0 ≤ x i ∧ x i ≤ 1) ∧
    (∑ i, A.weight i * x i) ≤ A.totalCapacity
See it in the graphDiscuss this resultChallenge it