AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.IsFeasible

defimported Lean

Feasibility for a knapsack auction: * each agent's allocation lies in [0,1] * the weighted allocation satisfies the total capacity bound

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
def KnapsackAuction.IsFeasible [Fintype I] (A : KnapsackAuction I U) : Prop
Defined in
EconCSLib, `KnapsackAuction.IsFeasible`
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 5

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
/-- Feasibility for a knapsack auction: * each agent's allocation lies in `[0,1]` * the weighted allocation satisfies the total capacity bound -/
def KnapsackAuction.IsFeasible [Fintype I] (A : KnapsackAuction I U) : Prop :=
  A.IsAllocFeasible ∧ A.RespectsCapacity
See it in the graphDiscuss this resultChallenge it