Bourbaki

Proposition 13

Tag 03RI, permanent. Cite it as [Bourbaki, Tag 03RI].

Theory of Sets, chapter III, § 5. Properties of integers

If nn and pp are integers, then

(n+1p+1)=(np+1)+(np).\binom{n+1}{p+1} = \binom{n}{p+1} + \binom{n}{p}.

Let E be a set with n+1n + 1 elements, let P be the set of all subsets of E containing p+1p + 1 elements, let aa be an element of E, and put

E′=E−{a}.\mathrm{E}' = \mathrm{E} - \{a\}.

Let P′ (resp. P″) denote the set of subsets of p+1p + 1 elements of E which contain aa (resp. do not contain aa). The set P″ is the set of subsets of p+1p + 1 elements of E′ and therefore has (np+1)\binom{n}{p+1} elements. The mapping X→X∩E′\mathrm{X} \to \mathrm{X} \cap \mathrm{E}' is a bijection of P′ onto the set of subsets of pp elements of E′, and P′ therefore has (np)\binom{n}{p} elements. The result now follows from the fact that P is the union of the disjoint sets P′ and P″.

Proposition 13 can also be proved by means of a simple calculation from the formula (np)=n!p!(n−p)!\binom{n}{p} = \dfrac{n!}{p!(n-p)!} for p⩽np \leqslant n.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Cites

Nothing.

Transcribed from the printed edition, 2004, Springer. Not translated.