AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.interimExpectedPayment_eq_of_hasInterimPaymentFormula_of_interimAllocProb_eq

theoremverifiedformalizationimported Lean

Same q_i and zero-type payment give the same interim payment.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BayesianSingleItemAuction in
open MeasureTheory in
variable {I : Type*} in
theorem BayesianSingleItemAuction.interimExpectedPayment_eq_of_hasInterimPaymentFormula_of_interimAllocProb_eq
    (A B : BayesianSingleItemAuction I)
    (hpayA : A.HasInterimPaymentFormula) (hpayB : B.HasInterimPaymentFormula)
    (i : I)
    (hQ : ∀ z : ℝ, A.interimAllocProb i z = B.interimAllocProb i z)
    (hM0 : A.interimExpectedPayment i 0 = B.interimExpectedPayment i 0)
    (v_i : ℝ) :
    A.interimExpectedPayment i v_i = B.interimExpectedPayment i v_i
Formalizes
EconCSLib, `BayesianSingleItemAuction.interimExpectedPayment_eq_of_hasInterimPaymentFormula_of_interimAllocProb_eq`
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
Classical.choiceQuot.soundpropext
Built on 17
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen BayesianSingleItemAuction inopen MeasureTheory invariable {I : Type*} in/-- Same `q_i` and zero-type payment give the same interim payment. -/theorem BayesianSingleItemAuction.interimExpectedPayment_eq_of_hasInterimPaymentFormula_of_interimAllocProb_eq    (A B : BayesianSingleItemAuction I)    (hpayA : A.HasInterimPaymentFormula) (hpayB : B.HasInterimPaymentFormula)    (i : I)    (hQ : ∀ z : ℝ, A.interimAllocProb i z = B.interimAllocProb i z)    (hM0 : A.interimExpectedPayment i 0 = B.interimExpectedPayment i 0)    (v_i : ℝ) :    A.interimExpectedPayment i v_i = B.interimExpectedPayment i v_i := by  have hQv : A.interimAllocProb i v_i = B.interimAllocProb i v_i := hQ v_i  have hQfun : (fun z => A.interimAllocProb i z) = fun z => B.interimAllocProb i z :=    funext hQ  calc    A.interimExpectedPayment i v_i        = A.interimExpectedPayment i 0 + A.interimAllocProb i v_i * v_i -          ∫ z in 0..v_i, A.interimAllocProb i z := hpayA i v_i    _ = B.interimExpectedPayment i 0 + B.interimAllocProb i v_i * v_i -          ∫ z in 0..v_i, B.interimAllocProb i z := by          rw [hM0, hQv, hQfun]    _ = B.interimExpectedPayment i v_i := (hpayB i v_i).symm
See it in the graphDiscuss this resultChallenge it