AFTD Auto-Formalizing Theoretical Domains

Auction.argmaxBid

defimported Lean

The bidder whose bid achieves the maximum. This is a mathematical argmax, not a declaration that any auction's winner is the highest bidder. Concrete auctions define their own allocation/winner rules.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [Fintype I] [Nontrivial I] {V : Type*} [LinearOrder V] in
variable (b : I → V) in
noncomputable def Auction.argmaxBid : I
Defined in
EconCSLib, `Auction.argmaxBid`
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 2
Used by 12

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [Fintype I] [Nontrivial I] {V : Type*} [LinearOrder V] in
variable (b : I → V) in
/-- The bidder whose bid achieves the maximum. This is a mathematical argmax, not a declaration that any auction's winner is the highest bidder. Concrete auctions define their own allocation/winner rules. -/
noncomputable def Auction.argmaxBid : I := Classical.choose (exists_maxBid b)
See it in the graphDiscuss this resultChallenge it