AFTD Auto-Formalizing Theoretical Domains

multiset_packing_number

def

For natural numbers r, s, t, h, the multiset packing number multiset_packing_number r s t h is the supremum of the cardinalities of all feasible packings of s-subsets of Fin r with t-subset codegree at most h.

Statement

noncomputable def multiset_packing_number (r s t h : ℕ) : ℕ
Defined in
arXiv:2611.15376 Sec. 4
Verified
14 Nov 2026
Axioms
none listed
Built on 1
  • is_feasible_packingA 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…
Used by 1

Read back from the Lean

multiset_packing_number is a function taking four natural numbers r, s, t, and h, and returning a natural number defined as the supremum (sSup in ℕ) of the set of all n : ℕ such that there exists a multiset M of finite subsets of Fin r satisfying is_feasible_packing r s t h M whose multiset cardinality M.card equals n.

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

/-- The maximum size, counted with multiplicity, of a multiset of s-subsets of Fin r such that every t-subset belongs to at most h members. -/
noncomputable def multiset_packing_number (r s t h : ℕ) : ℕ :=
  sSup {n : ℕ | ∃ M : Multiset (Finset (Fin r)), is_feasible_packing r s t h M ∧ M.card = n}
See it in the graphDiscuss this resultChallenge it