feat(Combinatorics/SimpleGraph/Extremal): the Kővári–Sós–Turán bound - #43483
feat(Combinatorics/SimpleGraph/Extremal): the Kővári–Sós–Turán bound#43483chy4pro wants to merge 2 commits into
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 Zulip and join the Lean community. |
PR summary 0b27e8799cImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
| Current number | Change | Type (weak) |
|---|---|---|
| exposed public sections | 5049 | 1 |
Current commit 0b27e8799c
Reference commit 5aedf732b6
This script lives in the mathlib-ci repository. To run it locally, from your mathlib4 directory:
git clone https://github.com/leanprover-community/mathlib-ci.git ../mathlib-ci
../mathlib-ci/scripts/reporting/technical-debt-metrics.py pr_summary
- The
relativevalue is the weighted sum of the differences with weight given by the inverse of the current value of the statistic. - The
absolutevalue is therelativevalue divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).
A bipartite relation with parts of sizes m and n and no K_{s,t} has at most (s-1)n + (t-1)^{1/s} m n^{1-1/s} edges (double counting of stars and the power-mean inequality), in an exact ℕ form and the classical real form.
Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01BV7eJo5RCjfezZpByuCExN
d524bc7 to
45e9971
Compare
|
What's the reason for scooping an existing PR by a human contributor? |
This PR adds the Kővári–Sós–Turán bound (Kővári–Sós–Turán 1954) in a bipartite-relation form: if a relation
rbetween finite setsA(sizem) andB(sizen) contains noK_{s,t}(selements ofAall related totelements ofB), then its number of edgesesatisfies(e - (s-1) n)^s ≤ (t-1) m^s n^(s-1)(exact form inℕ, with truncated subtraction) and hencee ≤ (s-1) n + (t-1)^(1/s) m n^(1-1/s)(real form).New file
Mathlib/Combinatorics/SimpleGraph/Extremal/KovariSosTuran.lean:KovariSosTuran.sum_choose_le— the double counting of stars∑_{b ∈ B} C(deg b, s) ≤ (t-1) C(m, s);KovariSosTuran.kovari_sos_turan— theℕform of the bound (via(d+1-s)^s ≤ s! C(d,s)and the power-mean inequality);KovariSosTuran.kovari_sos_turan_real— the classical real-exponent form.Mathlib defines
SimpleGraph.zarankiewiczbut (as far as I could find) does not contain this bound. I kept the statement in the elementary bipartite-relation language; connecting it toSimpleGraph.zarankiewicz/extremalNumberwould be a natural follow-up if reviewers prefer that interface.Checks: the file compiles against the base commit of this branch,
#lintreports no issues,#print axiomson the main results shows onlypropext,Classical.choice,Quot.sound; the import line was added toMathlib.lean.AI disclosure (per the Mathlib AI policy): the Lean code was drafted by Claude (Anthropic, Opus/Fable models) in an agentic session directed by me; I re-ran the compiler and the linter myself, reviewed the statements and the proof structure, and I am responsible for the content. Please add the
LLM-generatedlabel if that is the right classification.