Corradi's intersection lemma#39936
Conversation
Welcome new contributor!Thank you for contributing to Mathlib! If you haven't done so already, please review our contribution guidelines, as well as the style guide and naming conventions. In particular, we kindly remind contributors that we have guidelines regarding the use of AI when making pull requests. We use a review queue to manage reviews. If your PR does not appear there, it is probably because it is not successfully building (i.e., it doesn't have a green checkmark), has the If you haven't already done so, please come to https://leanprover.zulipchat.com/, introduce yourself, and mention your new PR. Thank you again for joining our community. |
PR summary 84426b902aImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
Adds Corrádi's intersection lemma (1969): if
A₁, …, Aₘ ⊆ Aeach havesize
aand pairwise intersections of size at mostb, thenm · (a² − b·|A|) ≤ |A| · (a − b). The proof is the standarddouble-counting plus Cauchy–Schwarz on the cover-count function
x ↦ #{i | x ∈ Aᵢ}.Reference: Jukna, Extremal Combinatorics (Springer, 2011), Lemma 5.5.
Both an integer form (
corradi_card_le) and a real-valued form(
corradi_card_le_real) are provided; the latter avoidsNat-subtraction caveats and matches the form used in the classicalJohnson bound on list-decoding radius in MDS codes.
Co-authored-by: Ziyi Guan <TODO - replace with github no reply email>
Co-authored-by: Ignacio Manzur <TODO - replace with github no reply email>
AI disclosure. Portions of this file (Lean source and docstrings)
were drafted with Claude (Anthropic). The authors have reviewed the
proofs, verified they compile against current Mathlib master, and take
responsibility for the mathematical content.