is_t_intersecting_partition_family
def
Given natural numbers n and t, a finite set F of partitions of n (of type Finset (Nat.Partition n)) is t-intersecting if for every pair of partitions p, q in F, the size of the multiset intersection of their parts is at least t, that is, t ≤ (p.parts ∩ q.parts).card.
Statement
def is_t_intersecting_partition_family {n : ℕ} (t : ℕ) (F : Finset (Nat.Partition n)) : Prop
- Defined in
- arXiv:2610.01747, Section 1, p. 3
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Used by 2
- partition_A_is_one_intersectingFor every n, any two partitions in A_n share at least one common part, so A_n is 1-intersecting.
- unrestricted_partition_family_four_intersecting_and_cardFor every natural number n ≥ 1, the family partition_A n of partitions of n is 1-intersecting (is_t_intersecting_partition_family 1…
Read back from the Lean
For a given natural number t and a finite set F of integer partitions of n (Nat.Partition n), the property is_t_intersecting_partition_family t F asserts that for all partitions p ∈ F and q ∈ F, the size of the multiset intersection of their parts (p.parts ∩ q.parts) is at least t (that is, t ≤ (p.parts ∩ q.parts).card).
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 family of partitions of n is t-intersecting if any two members have at least t common parts, counted with multiplicity. -/ def is_t_intersecting_partition_family {n : ℕ} (t : ℕ) (F : Finset (Nat.Partition n)) : Prop := ∀ p ∈ F, ∀ q ∈ F, t ≤ (p.parts ∩ q.parts).card