AFTD Auto-Formalizing Theoretical Domains

mms_bad_cover

def

A family of n partitions of the m goods into n (nonempty) blocks is a bad cover if no choice of one block per partition gives pairwise disjoint blocks; i.e. there is no allocation sigma with every agent's bundle containing a full block of her own partition.

Statement

def mms_bad_cover (n m : ℕ) (P : Fin n → Fin m → Fin n) : Prop
Source
step towards mms_threshold_monotone_upper_asymptotic
Verified
24 Oct 2026
Axioms
none listed
Built on 1
  • bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
Used by 1
  • mms_has_bad_coverThere exist n partitions of the m goods into n nonempty blocks with no covering allocation.

Lean source view module on GitHub

def mms_bad_cover (n m : ℕ) (P : Fin n → Fin m → Fin n) : Prop := (∀ i, Function.Surjective (P i)) ∧
    ¬ ∃ σ : Fin m → Fin n, ∀ i, ∃ k, bundle_of (P i) k ⊆ bundle_of σ i
See it in the graphDiscuss this resultChallenge it