AFTD Auto-Formalizing Theoretical Domains

is_feasible_packing

def

A multiset M of s-subsets of Fin r is a feasible packing for parameters (r, s, t, h) if every member of M has cardinality s and every t-subset of Fin r is contained in at most h members of M.

Statement

def is_feasible_packing (r s t h : ℕ) (M : Multiset (Finset (Fin r))) : Prop
Defined in
arXiv:2611.15376 Sec. 4
Verified
14 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

Given natural numbers $r$, $s$, $t$, and $h$, and a multiset $M$ of subsets of $\mathrm{Fin}(r)$ (i.e., of $\{0, \dots, r-1\}$), is_feasible_packing r s t h M asserts that: 1. Every subset $S \in M$ has cardinality $s$; and 2. For every subset $T \subseteq \mathrm{Fin}(r)$ of cardinality $t$, the number of elements $S \in M$ (counted with multiplicity) such that $T \subseteq S$ is at most $h$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A multiset M of s-subsets of Fin r is a feasible packing with respect to t-subsets and bound h if every t-subset is contained in at most h members of M. -/
def is_feasible_packing (r s t h : ℕ) (M : Multiset (Finset (Fin r))) : Prop :=
  (∀ S ∈ M, S.card = s) ∧
  ∀ T : Finset (Fin r), T.card = t → (M.filter (fun S => T ⊆ S)).card ≤ h
See it in the graphDiscuss this resultChallenge it