Binomial coefficients #

This file defines binomial coefficients and proves simple lemmas (i.e. those not requiring more imports).

Main definition and results #

Nat.choose: binomial coefficients, defined inductively
Nat.choose_eq_factorial_div_factorial: a proof that choose n k = n! / (k! * (n - k)!)
Nat.choose_symm: symmetry of binomial coefficients
Nat.choose_le_succ_of_lt_half_left: choose n k is increasing for small values of k
Nat.choose_le_middle: choose n r is maximised when r is n/2
Nat.descFactorial_eq_factorial_mul_choose: Relates binomial coefficients to the descending factorial. This is used to prove Nat.choose_le_pow and variants. We provide similar statements for the ascending factorial.
Nat.multichoose: whereas choose counts combinations, multichoose counts multicombinations. The fact that this is indeed the correct counting function for multisets is proved in Sym.card_sym_eq_multichoose in Data.Sym.Card.
Nat.multichoose_eq : a proof that multichoose n k = (n + k - 1).choose k. This is central to the "stars and bars" technique in informal mathematics, where we switch between counting multisets of size k over an alphabet of size n to counting strings of k elements ("stars") separated by n-1 dividers ("bars"). See Data.Sym.Card for more detail.

Tags #

binomial coefficient, combination, multicombination, stars and bars

source

def Nat.choose :

ℕ → ℕ → ℕ

choose n k is the number of k-element subsets in an n-element set. Also known as binomial coefficients.

Equations

x.choose 0 = 1
Nat.choose 0 n.succ = 0
n.succ.choose k.succ = n.choose k + n.choose (k + 1)

Instances For

source

@[simp]

theorem Nat.choose_zero_right (n : ℕ) :

n.choose 0 = 1

source

@[simp]

theorem Nat.choose_zero_succ (k : ℕ) :

Nat.choose 0 k.succ = 0

source

theorem Nat.choose_succ_succ (n : ℕ) (k : ℕ) :

n.succ.choose k.succ = n.choose k + n.choose k.succ

source

theorem Nat.choose_succ_succ' (n : ℕ) (k : ℕ) :

(n + 1).choose (k + 1) = n.choose k + n.choose (k + 1)

source

theorem Nat.choose_eq_zero_of_lt {n : ℕ} {k : ℕ} :

n < k → n.choose k = 0

source

@[simp]

theorem Nat.choose_self (n : ℕ) :

n.choose n = 1

source

@[simp]

theorem Nat.choose_succ_self (n : ℕ) :

n.choose n.succ = 0

source

@[simp]

theorem Nat.choose_one_right (n : ℕ) :

n.choose 1 = n

source

theorem Nat.triangle_succ (n : ℕ) :

(n + 1) * (n + 1 - 1) / 2 = n * (n - 1) / 2 + n

source

theorem Nat.choose_two_right (n : ℕ) :

n.choose 2 = n * (n - 1) / 2

choose n 2 is the n-th triangle number.

source

theorem Nat.choose_pos {n : ℕ} {k : ℕ} :

k ≤ n → 0 < n.choose k

source

theorem Nat.choose_eq_zero_iff {n : ℕ} {k : ℕ} :

n.choose k = 0 ↔ n < k

source

theorem Nat.succ_mul_choose_eq (n : ℕ) (k : ℕ) :

n.succ * n.choose k = n.succ.choose k.succ * k.succ

source

theorem Nat.choose_mul_factorial_mul_factorial {n : ℕ} {k : ℕ} :

k ≤ n → n.choose k * k.factorial * (n - k).factorial = n.factorial

source

theorem Nat.choose_mul {n : ℕ} {k : ℕ} {s : ℕ} (hkn : k ≤ n) (hsk : s ≤ k) :

n.choose k * k.choose s = n.choose s * (n - s).choose (k - s)

source

theorem Nat.choose_eq_factorial_div_factorial {n : ℕ} {k : ℕ} (hk : k ≤ n) :

n.choose k = n.factorial / (k.factorial * (n - k).factorial)

source

theorem Nat.add_choose (i : ℕ) (j : ℕ) :

(i + j).choose j = (i + j).factorial / (i.factorial * j.factorial)

source

theorem Nat.add_choose_mul_factorial_mul_factorial (i : ℕ) (j : ℕ) :

(i + j).choose j * i.factorial * j.factorial = (i + j).factorial

source

theorem Nat.factorial_mul_factorial_dvd_factorial {n : ℕ} {k : ℕ} (hk : k ≤ n) :

k.factorial * (n - k).factorial ∣ n.factorial

source

theorem Nat.factorial_mul_factorial_dvd_factorial_add (i : ℕ) (j : ℕ) :

i.factorial * j.factorial ∣ (i + j).factorial

source

@[simp]

theorem Nat.choose_symm {n : ℕ} {k : ℕ} (hk : k ≤ n) :

n.choose (n - k) = n.choose k

source

theorem Nat.choose_symm_of_eq_add {n : ℕ} {a : ℕ} {b : ℕ} (h : n = a + b) :

n.choose a = n.choose b

source

theorem Nat.choose_symm_add {a : ℕ} {b : ℕ} :

(a + b).choose a = (a + b).choose b

source

theorem Nat.choose_symm_half (m : ℕ) :

(2 * m + 1).choose (m + 1) = (2 * m + 1).choose m

source

theorem Nat.choose_succ_right_eq (n : ℕ) (k : ℕ) :

n.choose (k + 1) * (k + 1) = n.choose k * (n - k)

source

@[simp]

theorem Nat.choose_succ_self_right (n : ℕ) :

(n + 1).choose n = n + 1

source

theorem Nat.choose_mul_succ_eq (n : ℕ) (k : ℕ) :

n.choose k * (n + 1) = (n + 1).choose k * (n + 1 - k)

source

theorem Nat.ascFactorial_eq_factorial_mul_choose (n : ℕ) (k : ℕ) :

(n + 1).ascFactorial k = k.factorial * (n + k).choose k

source

theorem Nat.ascFactorial_eq_factorial_mul_choose' (n : ℕ) (k : ℕ) :

n.ascFactorial k = k.factorial * (n + k - 1).choose k

source

theorem Nat.factorial_dvd_ascFactorial (n : ℕ) (k : ℕ) :

k.factorial ∣ n.ascFactorial k

source

theorem Nat.choose_eq_asc_factorial_div_factorial (n : ℕ) (k : ℕ) :

(n + k).choose k = (n + 1).ascFactorial k / k.factorial

source

theorem Nat.choose_eq_asc_factorial_div_factorial' (n : ℕ) (k : ℕ) :

(n + k - 1).choose k = n.ascFactorial k / k.factorial

source

theorem Nat.descFactorial_eq_factorial_mul_choose (n : ℕ) (k : ℕ) :

n.descFactorial k = k.factorial * n.choose k

source

theorem Nat.factorial_dvd_descFactorial (n : ℕ) (k : ℕ) :

k.factorial ∣ n.descFactorial k

source

theorem Nat.choose_eq_descFactorial_div_factorial (n : ℕ) (k : ℕ) :

n.choose k = n.descFactorial k / k.factorial

source

def Nat.fast_choose (n : ℕ) (k : ℕ) :

ℕ

A faster implementation of choose, to be used during bytecode evaluation and in compiled code.

Equations

n.fast_choose k = n.descFactorial k / k.factorial

Instances For

source

@[csimp]

theorem Nat.choose_eq_fast_choose :

Nat.choose = Nat.fast_choose

Inequalities #

source

theorem Nat.choose_le_succ_of_lt_half_left {r : ℕ} {n : ℕ} (h : r < n / 2) :

n.choose r ≤ n.choose (r + 1)

Show that Nat.choose is increasing for small values of the right argument.

source

theorem Nat.choose_le_middle (r : ℕ) (n : ℕ) :

n.choose r ≤ n.choose (n / 2)

choose n r is maximised when r is n/2.

Inequalities about increasing the first argument #

source

theorem Nat.choose_le_succ (a : ℕ) (c : ℕ) :

a.choose c ≤ a.succ.choose c

source

theorem Nat.choose_le_add (a : ℕ) (b : ℕ) (c : ℕ) :

a.choose c ≤ (a + b).choose c

source

theorem Nat.choose_le_choose {a : ℕ} {b : ℕ} (c : ℕ) (h : a ≤ b) :

a.choose c ≤ b.choose c

source

theorem Nat.choose_mono (b : ℕ) :

Monotone fun (a : ℕ) => a.choose b

Multichoose #

Whereas choose n k is the number of subsets of cardinality k from a type of cardinality n, multichoose n k is the number of multisets of cardinality k from a type of cardinality n.

Alternatively, whereas choose n k counts the number of combinations, i.e. ways to select k items (up to permutation) from n items without replacement, multichoose n k counts the number of multicombinations, i.e. ways to select k items (up to permutation) from n items with replacement.

Note that multichoose is not the multinomial coefficient, although it can be computed in terms of multinomial coefficients. For details see https://mathworld.wolfram.com/Multichoose.html

TODO: Prove that choose (-n) k = (-1)^k * multichoose n k, where choose is the generalized binomial coefficient. https://github.com/leanprover-community/mathlib/pull/15072#issuecomment-1171415738

source

@[irreducible]

def Nat.multichoose :

ℕ → ℕ → ℕ

multichoose n k is the number of multisets of cardinality k from a type of cardinality n.

Equations