AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.capacity

abbrevimported Lean

The total capacity bound.

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
abbrev KnapsackAuction.capacity (A : KnapsackAuction I U) : U
Defined in
EconCSLib, `KnapsackAuction.capacity`
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 1
  • KnapsackAuctionA knapsack auction with public weights w i and total capacity W. The underlying strategic object is a SingleParameterMechanism I U,…
Used by 9

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
/-- The total capacity bound. -/
abbrev KnapsackAuction.capacity (A : KnapsackAuction I U) : U :=
  A.totalCapacity
See it in the graphDiscuss this resultChallenge it