Auction.BidProfile.StrategyMapsBoxToBox
defimported Lean
A scalar strategy maps the input bid interval $[\ell, u]$ into $[\ell', u']$. Captures Lipschitz/contraction conditions for best-response dynamics in bounded auctions.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I V : Type*} in def Auction.BidProfile.StrategyMapsBoxToBox [LE V] (σ : V → V) (ℓ u ℓ' u' : V) : Prop
- Defined in
- EconCSLib, `Auction.BidProfile.StrategyMapsBoxToBox`
- 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.Auction.BidProfile.StrategyMapsBoxToBox← Auction.BidProfile.StrategyMapsBoxToBox (EconCSLib/MechanismDesign/Auction/AuctionBasic.lean:170): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I V : Type*} in /-- A scalar strategy maps the input bid interval $[\ell, u]$ into $[\ell', u']$. Captures Lipschitz/contraction conditions for best-response dynamics in bounded auctions. -/ def Auction.BidProfile.StrategyMapsBoxToBox [LE V] (σ : V → V) (ℓ u ℓ' u' : V) : Prop := ∀ v, ℓ ≤ v ∧ v ≤ u → ℓ' ≤ σ v ∧ σ v ≤ u'