AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.binaryLoad

defimported Lean

The weighted load induced by a binary allocation profile.

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] in
def KnapsackAuction.binaryLoad (A : KnapsackAuction I U) (x : BinaryAllocation I) : U
Defined in
EconCSLib, `KnapsackAuction.binaryLoad`
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
Used by 3

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
variable [Fintype I] [DecidableEq I] in
/-- The weighted load induced by a binary allocation profile. -/
def KnapsackAuction.binaryLoad (A : KnapsackAuction I U) (x : BinaryAllocation I) : U :=
  ∑ i, A.weight i * binaryToAllocation x i
See it in the graphDiscuss this resultChallenge it