AFTD Auto-Formalizing Theoretical Domains

MultipleParameterMechanism.exists_withoutAllocation

theoremverifiedformalizationimported Lean

There exists an allocation maximizing the reported welfare of agents other than i.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I A : Type*} [Fintype I] [Fintype A] [Nonempty A] in
variable [DecidableEq I] in
lemma MultipleParameterMechanism.exists_withoutAllocation (v : ∀ _ : I, Valuation A ℝ) (i : I) :
    ∃ a : A, ∀ b : A, welfareWithout v i b ≤ welfareWithout v i a
Formalizes
EconCSLib, `MultipleParameterMechanism.exists_withoutAllocation`
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 3
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators invariable {I A : Type*} [Fintype I] [Fintype A] [Nonempty A] invariable [DecidableEq I] in/-- There exists an allocation maximizing the reported welfare of agents other than `i`. -/lemma MultipleParameterMechanism.exists_withoutAllocation (v : ∀ _ : I, Valuation A ℝ) (i : I) :    ∃ a : A, ∀ b : A, welfareWithout v i b ≤ welfareWithout v i a := by  classical  obtain ⟨a, _ha_mem, ha⟩ :=    Finset.exists_mem_eq_sup' (s := (Finset.univ : Finset A))      (H := Finset.univ_nonempty) (f := welfareWithout v i)  refine ⟨a, ?_⟩  intro b  have hb : welfareWithout v i b ≤ maxWelfareWithout v i := by    exact Finset.le_sup' (welfareWithout v i) (Finset.mem_univ b)  simpa [maxWelfareWithout, ha] using hb
See it in the graphDiscuss this resultChallenge it