Skip to content

Corradi's intersection lemma#39936

Draft
z-tech wants to merge 2 commits into
leanprover-community:masterfrom
z-tech:z-tech/corradi
Draft

Corradi's intersection lemma#39936
z-tech wants to merge 2 commits into
leanprover-community:masterfrom
z-tech:z-tech/corradi

Conversation

@z-tech
Copy link
Copy Markdown

@z-tech z-tech commented May 27, 2026

Adds Corrádi's intersection lemma (1969): if A₁, …, Aₘ ⊆ A each have
size a and pairwise intersections of size at most b, then
m · (a² − b·|A|) ≤ |A| · (a − b). The proof is the standard
double-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 avoids
Nat-subtraction caveats and matches the form used in the classical
Johnson 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.

Open in Gitpod

@github-actions github-actions Bot added the new-contributor This PR was made by a contributor with at most 5 merged PRs. Welcome to the community! label May 27, 2026
@github-actions
Copy link
Copy Markdown

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 awaiting-author tag, or another reason described in the Lifecycle of a PR. The review dashboard has a dedicated webpage which shows whether your PR is on the review queue, and (if not), why.

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.

@github-actions github-actions Bot added the t-combinatorics Combinatorics label May 27, 2026
@github-actions
Copy link
Copy Markdown

github-actions Bot commented May 27, 2026

PR summary 84426b902a

Import changes for modified files

No significant changes to the import graph

Import changes for all files
Files Import difference
Mathlib.Combinatorics.SetFamily.Corradi (new file) 1071

Declarations diff

+ corradi_card_le_real
+ corradi_mul_le
+ coverCount
+ sum_coverCount_eq_card_mul
+ sum_coverCount_eq_sum_card
+ sum_coverCount_sq_eq_sum_inter_card
+ sum_inter_card_le

You can run this locally as follows
## from your `mathlib4` directory:
git clone https://github.com/leanprover-community/mathlib-ci.git ../mathlib-ci

## summary with just the declaration names:
../mathlib-ci/scripts/pr_summary/declarations_diff.sh <optional_commit>

## more verbose report:
../mathlib-ci/scripts/pr_summary/declarations_diff.sh long <optional_commit>

The doc-module for scripts/pr_summary/declarations_diff.sh in the mathlib-ci repository contains some details about this script.


No changes to strong technical debt.
No changes to weak technical debt.

@b-mehta b-mehta added the LLM-generated PRs with substantial input from LLMs - review accordingly label May 27, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

LLM-generated PRs with substantial input from LLMs - review accordingly new-contributor This PR was made by a contributor with at most 5 merged PRs. Welcome to the community! t-combinatorics Combinatorics

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants