SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation
theoremverifiedformalizationimported Lean
SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N G : Type*} in lemma SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation [DecidableEq G] (allGoods S : Finset G) (hS : S ⊆ allGoods) : IsAllocation allGoods (mkAlloc allGoods S)
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation`
- 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.SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation← SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation (EconCSLib/SocialChoice/FairDivision/Indivisible/EFX.lean:153): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- SocialChoice.FairDivision.Indivisible.IsAllocationA complete allocation partitions all goods among agents. *
disjoint: distinct agents receive disjoint bundles. *complete: every good… - SocialChoice.FairDivision.Indivisible.mkAllocEFX existence for 2 agents (general m goods, additive nonneg valuations). For any set of goods and additive nonneg valuation, a…
- SocialChoice.FairDivision.Indivisible.IsAllocationA complete allocation partitions all goods among agents. *
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset invariable {N G : Type*} inlemma SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation [DecidableEq G] (allGoods S : Finset G) (hS : S ⊆ allGoods) : IsAllocation allGoods (mkAlloc allGoods S) := by constructor <;> simp_all +decide [ Finset.ext_iff ]; · exact ⟨ Finset.disjoint_sdiff, Finset.disjoint_sdiff.symm ⟩; · intro g; unfold mkAlloc; by_cases hg : g ∈ S <;> aesop;