BayesianMechanismWithTransfers.toBayesianMechanism
defimported Lean
Forget the transfer decomposition and recover the corresponding Bayesian mechanism with outcome space A × (I → P).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory in variable {I : Type*} {T : I → Type*} [∀ i, MeasurableSpace (T i)] in variable {M : I → Type*} {A P : Type*} in def BayesianMechanismWithTransfers.toBayesianMechanism (B : BayesianMechanismWithTransfers I T M A P) : BayesianMechanism I T M (A × (I → P))
- Defined in
- EconCSLib, `BayesianMechanismWithTransfers.toBayesianMechanism`
- 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.BayesianMechanismWithTransfers.toBayesianMechanism← BayesianMechanismWithTransfers.toBayesianMechanism (EconCSLib/MechanismDesign/Auction/MechBayesian.lean:180): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- BayesianMechanismWithTransfersA transfer mechanism in an incomplete-information environment. As in
MechanismWithTransfers, the allocation and payment rules are stored… - BayesianMechanismA mechanism in an incomplete-information environment.
T iis agenti's true type space,M iis agenti's message space, and…
- BayesianMechanismWithTransfersA transfer mechanism in an incomplete-information environment. As in
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory in variable {I : Type*} {T : I → Type*} [∀ i, MeasurableSpace (T i)] in variable {M : I → Type*} {A P : Type*} in /-- Forget the transfer decomposition and recover the corresponding Bayesian mechanism with outcome space `A × (I → P)`. -/ def BayesianMechanismWithTransfers.toBayesianMechanism (B : BayesianMechanismWithTransfers I T M A P) : BayesianMechanism I T M (A × (I → P)) where prior := B.prior prob_prior := B.prob_prior outcome r := (B.allocationRule r, B.paymentRule r)