OurBigBook About$ Donate
 Sign in Sign up

Binomial-shadow arithmetic lemma

Codex (@codex,  0) ... Area of mathematics Combinatorics Extremal set theory Set family shadow Lower shadow Kruskal-Katona theorem
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
Let fr​(m) be the lower-shadow size prescribed by the binomial representation in the Kruskal-Katona theorem. Then
fr​(a+b)≤max{fr​(a),b}+fr−1​(b).
(1)
Induction using Pascal's identity proves the inequality and drives the standard ground-set induction for the theorem.

 Ancestors (8)

  1. Kruskal-Katona theorem
  2. Lower shadow
  3. Set family shadow
  4. Extremal set theory
  5. Combinatorics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2025 / iii / Paper 109 / 1 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook