AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.highestBidValue

defimported Lean

Highest single-item value.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in
noncomputable def KnapsackAuction.highestBidValue (b : I → Nat) : Nat
Defined in
EconCSLib, `KnapsackAuction.highestBidValue`
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
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in
/-- Highest single-item value. -/
noncomputable def KnapsackAuction.highestBidValue (b : I → Nat) : Nat :=
  Finset.sup' Finset.univ Finset.univ_nonempty b
See it in the graphDiscuss this resultChallenge it