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
- multiset_packing_numberFor 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…
- is_feasible_packing_zeroThe empty multiset of finite sets is a feasible packing for any parameters r, s, t, h.
- op_1627_maximum_local_packing_realizableThere exist natural numbers r, s, t, n, D satisfying 1 ≤ t ∧ t ≤ s ∧ s ≤ r ∧ 2 ≤ n such that D is even, D = multiset_packing_number r s t…
- op_1627_realizable_parameters_seven_five_three_twoThere exists an edge-coloring ϕ : (⊤ : SimpleGraph (Fin 5)).edgeSet → Finset (Fin 7) assigning a 5-element subset of Fin 7 to each edge of…
- op_1627_not_realizable_parameters_four_three_two_twoThere does not exist an edge-coloring ϕ : (⊤ : SimpleGraph (Fin 5)).edgeSet → Finset (Fin 4) assigning a 3-element subset of Fin 4 to each…
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