# Combinatorial proof

In mathematics, the term * combinatorial proof* is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters, have the same number of elements (for all values of the parameters), or gives a formula for the number of one such set of configurations in terms of the parameters:

- A bijective proof, which exhibits a bijection, i.e. a one-to-one correspondence, between the two sets, or (in the case of a formula) between the given set and a set obviously counted by the formula.

- A proof by double counting. Some combinatorial set
*S*, often different from the ones in question, is counted in two different ways, and from the equality of the numbers so found the desired identity is deduced. The two ways of counting*S*must each be by establishing a bijection of*S*with a set obviously counted by the number found.

The term "combinatorial proof" may also be used more broadly to refer to any kind of elementary proof in combinatorics. However, as Template:Harvtxt writes in his review of Template:Harvtxt (a book about combinatorial proofs), these two simple techniques are enough to prove many of the important theorems in combinatorics and number theory.

## Example

An archetypal double counting proof is for the well known formula for the number of *k*-combinations (i.e., subsets of size *k*) of an *n*-element set:

Here a direct bijective proof is not possible, because the right-hand side of the identity being a fraction, there is no set *obviously* counted by it (it even takes some thought to see that the denominator always evenly divides the numerator). However its numerator counts the Cartesian product of *k* finite sets of sizes *n*, *n* − 1, ..., *n* − *k* + 1, while its denominator counts the permutations of a *k*-element set (the set most obviously counted counted by the denominator would be another Cartesian product *k* finite sets; if desired one could map permutations to that set by an explicit bijection). Now take *S* to be the set of sequences without repetition of elements selected from our *n*-element set. On one hand there is an easy bijection of *S* with the Cartesian product corresponding to the numerator , and on the other hand there is a bijection from the set of pairs of a *k*-combination *C* and a permutation *σ* of *k* to *S*, by taking the elements of *C* in increasing order, and then permuting this sequence by *σ* to obtain an element of *S*. The two ways of counting give the equation

and after division by *k*! this leads to the stated formula for . In general, if the counting formula involves a division, a similar double counting argument (if it exists) gives the most straightforward combinatorial proof of the identity, but double counting arguments are not limited to situations where the formula is of this form.

## The benefit of a combinatorial proof

Template:Harvtxt gives an example of a combinatorial enumeration problem (counting the number of sequences of *k* subsets *S*_{1}, *S*_{2}, ... *S*_{k}, that can be formed from a set of *n* items such that the subsets have an empty common intersection) with two different proofs for its solution. The first proof, which is not combinatorial, uses mathematical induction and generating functions to find that the number of sequences of this type is (2^{k} −1)^{n}. The second proof is based on the observation that there are 2^{k} −1 proper subsets of the set {1, 2, ..., *k*}, and (2^{k} −1)^{n} functions from the set {1, 2, ..., *n*} to the family of proper subsets of {1, 2, ..., *k*}. The sequences to be counted can be placed in one-to-one correspondence with these functions, where the function formed from a given sequence of subsets maps each element *i* to the set {*j* | *i* ∈ *S*_{j}}.

Stanley writes, “Not only is the above combinatorial proof much shorter than our previous proof, but also it makes the reason for the simple answer completely transparent. It is often the case, as occurred here, that the first proof to come to mind turns out to be laborious and inelegant, but that the final answer suggests a simple combinatorial proof.” Due both to their frequent greater elegance than non-combinatorial proofs and the greater insight they provide into the structures they describe, Stanley formulates a general principle that combinatorial proofs are to be preferred over other proofs, and lists as exercises many problems of finding combinatorial proofs for mathematical facts known to be true through other means.

## The difference between bijective and double counting proofs

Stanley does not clearly distinguish between bijective and double counting proofs, and gives examples of both kinds, but the difference between the two types of combinatorial proof can be seen in an example provided by Template:Harvtxt, of proofs for Cayley's formula stating that there are *n*^{n − 2} different trees that can be formed from a given set of *n* nodes. Aigner and Ziegler list four proofs of this theorem, the first of which is bijective and the last of which is a double counting argument. They also mention but do not describe the details of a fifth bijective proof.

The most natural way to find a bijective proof of this formula would be to find a bijection between *n*-node trees and some collection of objects that has *n*^{n − 2} members, such as the sequences of *n* − 2 values each in the range from 1 to *n*. Such a bijection can be obtained using the Prüfer sequence of each tree. Any tree can be uniquely encoded into a Prüfer sequence, and any Prüfer sequence can be uniquely decoded into a tree; these two results together provide a bijective proof of Cayley's formula.

An alternative bijective proof, given by Aigner and Ziegler and credited by them to André Joyal, involves a bijection between, on the one hand, *n*-node trees with two designated nodes (that may be the same as each other), and on the other hand, *n*-node directed pseudoforests. If there are *T _{n}*

*n*-node trees, then there are

*n*

^{2}

*T*trees with two designated nodes. And a pseudoforest may be determined by specifying, for each of its nodes, the endpoint of the edge extending outwards from that node; there are

_{n}*n*possible choices for the endpoint of a single edge (allowing self-loops) and therefore

*n*possible pseudoforests. By finding a bijection between trees with two labeled nodes and pseudoforests, Joyal's proof shows that

^{n}*T*=

_{n}*n*

^{n − 2}.

Finally, the fourth proof of Cayley's formula presented by Aigner and Ziegler is a double counting proof due to Jim Pitman, presented in more detail in Double counting (proof technique)#Counting trees. In this proof, Pitman considers the sequences of directed edges that may be added to an *n*-node empty graph to form from it a single rooted tree, and counts the number of such sequences in two different ways. By showing how to derive a sequence of this type by choosing a tree, a root for the tree, and an ordering for the edges in the tree, he shows that there are *T _{n}n*! possible sequences of this type. And by counting the number of ways in which a partial sequence can be extended by a single edge, he shows that there are

*n*

^{n − 2}

*n*! possible sequences. Equating these two different formulas for the size of the same set of edge sequences and cancelling the common factor of

*n*! leads to Cayley's formula.

## Related concepts

- The principles of double counting and bijection used in combinatorial proofs can be seen as examples of a larger family of combinatorial principles, which include also other ideas such as the pigeonhole principle.
- Proving an identity combinatorially can be viewed as adding more structure to the identity by replacing numbers by sets; similarly, categorification is the replacement of sets by categories.

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.