AFTD Auto-Formalizing Theoretical Domains

SingleParameterMechanism.quasiLinearUtility_eq_transferQuasiLinearUtility

theoremverifiedformalizationimported Lean

The single-parameter quasi-linear utility is the specialization of the generic transfer-mechanism quasi-linear utility to val a θ i = θᵢ * aᵢ and identity payment embedding.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SingleParameterMechanism in
variable {I : Type*} [DecidableEq I] {R : Type*} in
variable (M : SingleParameterMechanism I R) in
omit [DecidableEq I] in
lemma SingleParameterMechanism.quasiLinearUtility_eq_transferQuasiLinearUtility [Mul R] [Sub R]
    (b θ : I → R) (i : I) :
    M.quasiLinearUtility b θ i =
      MechanismWithTransfers.quasiLinearUtility
        (I := I) (T := fun _ => R) (A := I → R) (P := R) (V := R) (U := R)
        ({ allocationRule := M.allocationRule
           paymentRule := M.paymentRule } :
          MechanismWithTransfers I (fun _ => R) (I → R) R)
        (fun a types j => types j * a j)
        id id b θ i
Formalizes
EconCSLib, `SingleParameterMechanism.quasiLinearUtility_eq_transferQuasiLinearUtility`
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 — Lean reports it depends on no axioms
Built on 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SingleParameterMechanism in
variable {I : Type*} [DecidableEq I] {R : Type*} in
variable (M : SingleParameterMechanism I R) in
omit [DecidableEq I] in
/-- The single-parameter quasi-linear utility is the specialization of the generic transfer-mechanism quasi-linear utility to `val a θ i = θᵢ * aᵢ` and identity payment embedding. -/
lemma SingleParameterMechanism.quasiLinearUtility_eq_transferQuasiLinearUtility [Mul R] [Sub R]
    (b θ : I → R) (i : I) :
    M.quasiLinearUtility b θ i =
      MechanismWithTransfers.quasiLinearUtility
        (I := I) (T := fun _ => R) (A := I → R) (P := R) (V := R) (U := R)
        ({ allocationRule := M.allocationRule
           paymentRule := M.paymentRule } :
          MechanismWithTransfers I (fun _ => R) (I → R) R)
        (fun a types j => types j * a j)
        id id b θ i := rfl
See it in the graphDiscuss this resultChallenge it