# Pigeonhole principle

Pigeons in holes. Here there are n = 10 pigeons in m = 9 holes. Since 10 is greater than 9, the pigeonhole principle says that at least one hole has more than one pigeon. (The top left hole has 2 pigeons.)

In mathematics, the pigeonhole principle states that if ${\displaystyle n}$ items are put into ${\displaystyle m}$ containers, with ${\displaystyle n>m}$, then at least one container must contain more than one item.[1] For example, if one has three gloves (and none is ambidextrous/reversible), then there must be at least two right-handed gloves, or at least two left-handed gloves, because there are three objects, but only two categories of handedness to put them into. This seemingly obvious statement, a type of counting argument, can be used to demonstrate possibly unexpected results. For example, given that the population of London is greater than the maximum number of hairs that can be present on a human's head, then the pigeonhole principle requires that there must be at least two people in London who have the same number of hairs on their heads.

Although the pigeonhole principle appears as early as 1624 in a book attributed to Jean Leurechon,[2] it is commonly called Dirichlet's box principle or Dirichlet's drawer principle after an 1834 treatment of the principle by Peter Gustav Lejeune Dirichlet under the name Schubfachprinzip ("drawer principle" or "shelf principle").[3]

The principle has several generalizations and can be stated in various ways. In a more quantified version: for natural numbers ${\displaystyle k}$ and ${\displaystyle m}$, if ${\displaystyle n=km+1}$ objects are distributed among ${\displaystyle m}$ sets, then the pigeonhole principle asserts that at least one of the sets will contain at least ${\displaystyle k+1}$ objects.[4] For arbitrary ${\displaystyle n}$ and ${\displaystyle m}$ this generalizes to ${\displaystyle k+1=\lfloor (n-1)/m\rfloor +1=\lceil n/m\rceil ,}$ where ${\displaystyle \lfloor \cdots \rfloor }$ and ${\displaystyle \lceil \cdots \rceil }$ denote the floor and ceiling functions, respectively.

Though the most straightforward application is to finite sets (such as pigeons and boxes), it is also used with infinite sets that cannot be put into one-to-one correspondence. To do so requires the formal statement of the pigeonhole principle, which is "there does not exist an injective function whose codomain is smaller than its domain". Advanced mathematical proofs like Siegel's lemma build upon this more general concept.

## Etymology

Pigeon-hole messageboxes at Stanford University

Dirichlet published his works in both French and German, using either the German Schubfach or the French tiroir. The strict original meaning of these terms corresponds to the English drawer, that is, an open-topped box that can be slid in and out of the cabinet that contains it. (Dirichlet wrote about distributing pearls among drawers.) These terms were morphed to the word pigeonhole in the sense of a small open space in a desk, cabinet, or wall for keeping letters or papers, metaphorically rooted in structures that house pigeons.

Because furniture with pigeonholes is commonly used for storing or sorting things into many categories (such as letters in a post office or room keys in a hotel), the translation pigeonhole may be a better rendering of Dirichlet's original drawer metaphor. That understanding of the term pigeonhole, referring to some furniture features, is fading—especially among those who do not speak English natively but as a lingua franca in the scientific world—in favour of the more pictorial interpretation, literally involving pigeons and holes. The suggestive (though not misleading) interpretation of "pigeonhole" as "dovecote" has lately found its way back to a German back-translation of the "pigeonhole principle" as the "Taubenschlagprinzip".[5]

Besides the original terms "Schubfachprinzip" in German[6] and "Principe des tiroirs" in French,[7] other literal translations are still in use in Bulgarian ("принцип на чекмеджетата"), Chinese ("抽屉原理"), Danish ("Skuffeprincippet"), Dutch ("ladenprincipe "), Hungarian ("skatulyaelv"), Italian ("principio dei cassetti"), Japanese ("引き出し論法"), Persian ("اصل لانه کبوتری"), Polish ("zasada szufladkowa"), Swedish ("Lådprincipen"), Turkish ("çekmece ilkesi"), and Vietnamese ("nguyên lý hộp").

## Examples

### Sock-picking

Assume a drawer contains a mixture of black socks and blue socks, each of which can be worn on either foot, and that you are pulling a number of socks from the drawer without looking. What is the minimum number of pulled socks required to guarantee a pair of the same color? Using the pigeonhole principle, to have at least one pair of the same color (m = 2 holes, one per color) using one pigeonhole per color, you need to pull only three socks from the drawer (n = 3 items). Either you have three of one color, or you have two of one color and one of the other.

### Hand-shaking

If there are n people who can shake hands with one another (where n > 1), the pigeonhole principle shows that there is always a pair of people who will shake hands with the same number of people. In this application of the principle, the 'hole' to which a person is assigned is the number of hands shaken by that person. Since each person shakes hands with some number of people from 0 to n − 1, there are n possible holes. On the other hand, either the '0' hole or the 'n − 1' hole or both must be empty, for it is impossible (if n > 1) for some person to shake hands with everybody else while some person shakes hands with nobody. This leaves n people to be placed into at most n − 1 non-empty holes, so that the principle applies.

This hand-shaking example is equivalent to the statement that in any graph with more than one vertex, there is at least one pair of vertices that share the same degree.[8] This can be seen by associating each person with a vertex and each edge with a handshake.

### Hair-counting

One can demonstrate there must be at least two people in London with the same number of hairs on their heads as follows.[9][10] Since a typical human head has an average of around 150,000 hairs, it is reasonable to assume (as an upper bound) that no one has more than 1,000,000 hairs on their head (m = 1 million holes). There are more than 1,000,000 people in London (n is bigger than 1 million items). Assigning a pigeonhole to each number of hairs on a person's head, and assigning people to pigeonholes according to the number of hairs on their head, there must be at least two people assigned to the same pigeonhole by the 1,000,001st assignment (because they have the same number of hairs on their heads) (or, n > m). Assuming London has 9.002 million people,[11] one can even state that at least ten Londoners have the same number of hairs, as having nine Londoners in each of the 1 million pigeonholes accounts for only 9 million people.

For the average case (m = 150,000) with the constraint: fewest overlaps, there will be at most one person assigned to every pigeonhole and the 150,001st person assigned to the same pigeonhole as someone else. In the absence of this constraint, there may be empty pigeonholes because the "collision" happens before the 150,001st person. The principle just proves the existence of an overlap; it says nothing of the number of overlaps (which falls under the subject of probability distribution).

There is a passing, satirical, allusion in English to this version of the principle in A History of the Athenian Society, prefixed to "A Supplement to the Athenian Oracle: Being a Collection of the Remaining Questions and Answers in the Old Athenian Mercuries", (Printed for Andrew Bell, London, 1710).[12] It seems that the question whether there were any two persons in the World that have an equal number of hairs on their head? had been raised in The Athenian Mercury before 1704.[13][14]

Perhaps the first written reference to the pigeonhole principle appears in 1622 in a short sentence of the Latin work Selectæ Propositiones, by the French Jesuit Jean Leurechon,[2] where he wrote "It is necessary that two men have the same number of hairs, écus, or other things, as each other."[15] The full principle was spelled out two years later, with additional examples, in another book that has often been attributed to Leurechon, but may have been written by one of his students.[2]

### The birthday problem

The birthday problem asks, for a set of n randomly chosen people, what is the probability that some pair of them will have the same birthday? The problem itself is mainly concerned with counterintuitive probabilities; however, we can also tell by the pigeonhole principle that, if there are 367 people in the room, there is at least one pair of people who share the same birthday with 100% probability, as there are only 366 possible birthdays to choose from (including February 29, if present).

### Team tournament

Imagine seven people who want to play in a tournament of teams (n = 7 items), with a limitation of only four teams (m = 4 holes) to choose from. The pigeonhole principle tells us that they cannot all play for different teams; there must be at least one team featuring at least two of the seven players:

${\displaystyle \left\lfloor {\frac {n-1}{m}}\right\rfloor +1=\left\lfloor {\frac {7-1}{4}}\right\rfloor +1=\left\lfloor {\frac {6}{4}}\right\rfloor +1=1+1=2}$

### Subset sum

Any subset of size six from the set S = {1,2,3,...,9} must contain two elements whose sum is 10. The pigeonholes will be labelled by the two element subsets {1,9}, {2,8}, {3,7}, {4,6} and the singleton {5}, five pigeonholes in all. When the six "pigeons" (elements of the size six subset) are placed into these pigeonholes, each pigeon going into the pigeonhole that has it contained in its label, at least one of the pigeonholes labelled with a two-element subset will have two pigeons in it.[16]

## Uses and applications

The principle can be used to prove that any lossless compression algorithm, provided it makes some inputs smaller (as the name compression suggests), will also make some other inputs larger. Otherwise, the set of all input sequences up to a given length L could be mapped to the (much) smaller set of all sequences of length less than L without collisions (because the compression is lossless), a possibility which the pigeonhole principle excludes.

A notable problem in mathematical analysis is, for a fixed irrational number a, to show that the set {[na]: n is an integer} of fractional parts is dense in [0, 1]. One finds that it is not easy to explicitly find integers n, m such that |nam| < e, where e > 0 is a small positive number and a is some arbitrary irrational number. But if one takes M such that 1/M < e, by the pigeonhole principle there must be n1, n2 ∈ {1, 2, ..., M + 1} such that n1a and n2a are in the same integer subdivision of size 1/M (there are only M such subdivisions between consecutive integers). In particular, one can find n1n2 such that n1a is in (p + k/M, p + (k + 1)/M), and n2a is in (q + k/M, q + (k + 1)/M), for some pq integers and k in {0, 1, ..., M − 1}. One can then easily verify that (n2n1)a is in (qp − 1/M, qp + 1/M). This implies that [na] < 1/M < e, where n = n2n1 or n = n1n2. This shows that 0 is a limit point of {[na]}. One can then use this fact to prove the case for p in (0, 1]: find n such that [na] < 1/M < e; then if p ∈ (0, 1/M], the proof is complete. Otherwise p ∈ (j/M, (j + 1)/M], and by setting k = sup{rN : r[na] < j/M}, one obtains |[(k + 1)na] − p| < 1/M < e.

Variants occur in a number of proofs. In the proof of the pumping lemma for regular languages, a version that mixes finite and infinite sets is used: If infinitely many objects are placed into finitely many boxes, then there exist two objects that share a box.[17] In Fisk's solution of the Art gallery problem a sort of converse is used: If n objects are placed into k boxes, then there is a box containing at most n/k objects.[18]

## Alternative formulations

The following are alternative formulations of the pigeonhole principle.

1. If n objects are distributed over m places, and if n > m, then some place receives at least two objects.[1]
2. (equivalent formulation of 1) If n objects are distributed over n places in such a way that no place receives more than one object, then each place receives exactly one object.[1]
3. If n objects are distributed over m places, and if n < m, then some place receives no object.
4. (equivalent formulation of 3) If n objects are distributed over n places in such a way that no place receives no object, then each place receives exactly one object.[19]

## Strong form

Let q1, q2, ..., qn be positive integers. If

${\displaystyle q_{1}+q_{2}+\cdots +q_{n}-n+1}$

objects are distributed into n boxes, then either the first box contains at least q1 objects, or the second box contains at least q2 objects, ..., or the nth box contains at least qn objects.[20]

The simple form is obtained from this by taking q1 = q2 = ... = qn = 2, which gives n + 1 objects. Taking q1 = q2 = ... = qn = r gives the more quantified version of the principle, namely:

Let n and r be positive integers. If n(r - 1) + 1 objects are distributed into n boxes, then at least one of the boxes contains r or more of the objects.[21]

This can also be stated as, if k discrete objects are to be allocated to n containers, then at least one container must hold at least ${\displaystyle \lceil k/n\rceil }$ objects, where ${\displaystyle \lceil x\rceil }$ is the ceiling function, denoting the smallest integer larger than or equal to x. Similarly, at least one container must hold no more than ${\displaystyle \lfloor k/n\rfloor }$ objects, where ${\displaystyle \lfloor x\rfloor }$ is the floor function, denoting the largest integer smaller than or equal to x.

## Generalizations of the pigeonhole principle

A probabilistic generalization of the pigeonhole principle states that if n pigeons are randomly put into m pigeonholes with uniform probability 1/m, then at least one pigeonhole will hold more than one pigeon with probability

${\displaystyle 1-{\frac {(m)_{n}}{m^{n}}},}$

where (m)n is the falling factorial m(m − 1)(m − 2)...(mn + 1). For n = 0 and for n = 1 (and m > 0), that probability is zero; in other words, if there is just one pigeon, there cannot be a conflict. For n > m (more pigeons than pigeonholes) it is one, in which case it coincides with the ordinary pigeonhole principle. But even if the number of pigeons does not exceed the number of pigeonholes (nm), due to the random nature of the assignment of pigeons to pigeonholes there is often a substantial chance that clashes will occur. For example, if 2 pigeons are randomly assigned to 4 pigeonholes, there is a 25% chance that at least one pigeonhole will hold more than one pigeon; for 5 pigeons and 10 holes, that probability is 69.76%; and for 10 pigeons and 20 holes it is about 93.45%. If the number of holes stays fixed, there is always a greater probability of a pair when you add more pigeons. This problem is treated at much greater length in the birthday paradox.

A further probabilistic generalization is that when a real-valued random variable X has a finite mean E(X), then the probability is nonzero that X is greater than or equal to E(X), and similarly the probability is nonzero that X is less than or equal to E(X). To see that this implies the standard pigeonhole principle, take any fixed arrangement of n pigeons into m holes and let X be the number of pigeons in a hole chosen uniformly at random. The mean of X is n/m, so if there are more pigeons than holes the mean is greater than one. Therefore, X is sometimes at least 2.

## Infinite sets

The pigeonhole principle can be extended to infinite sets by phrasing it in terms of cardinal numbers: if the cardinality of set A is greater than the cardinality of set B, then there is no injection from A to B. However, in this form the principle is tautological, since the meaning of the statement that the cardinality of set A is greater than the cardinality of set B is exactly that there is no injective map from A to B. However, adding at least one element to a finite set is sufficient to ensure that the cardinality increases.

Another way to phrase the pigeonhole principle for finite sets is similar to the principle that finite sets are Dedekind finite: Let A and B be finite sets. If there is a surjection from A to B that is not injective, then no surjection from A to B is injective. In fact no function of any kind from A to B is injective. This is not true for infinite sets: Consider the function on the natural numbers that sends 1 and 2 to 1, 3 and 4 to 2, 5 and 6 to 3, and so on.

There is a similar principle for infinite sets: If uncountably many pigeons are stuffed into countably many pigeonholes, there will exist at least one pigeonhole having uncountably many pigeons stuffed into it.

This principle is not a generalization of the pigeonhole principle for finite sets however: It is in general false for finite sets. In technical terms it says that if A and B are finite sets such that any surjective function from A to B is not injective, then there exists an element b of B such that there exists a bijection between the preimage of b and A. This is a quite different statement, and is absurd for large finite cardinalities.

## Quantum mechanics

Yakir Aharonov et al. have presented arguments that the pigeonhole principle may be violated in quantum mechanics, and proposed interferometric experiments to test the pigeonhole principle in quantum mechanics.[22] However, later research has called this conclusion into question.[23][24] In a January 2015 arXiv preprint, researchers Alastair Rae and Ted Forgan at the University of Birmingham performed a theoretical wave function analysis, employing the standard pigeonhole principle, on the flight of electrons at various energies through an interferometer. If the electrons had no interaction strength at all, they would each produce a single, perfectly circular peak. At high interaction strength, each electron produces four distinct peaks for a total of 12 peaks on the detector; these peaks are the result of the four possible interactions each electron could experience (alone, together with the first other particle only, together with the second other particle only, or all three together). If the interaction strength was fairly low, as would be the case in many real experiments, the deviation from a zero-interaction pattern would be nearly indiscernible, much smaller than the lattice spacing of atoms in solids, such as the detectors used for observing these patterns. This would make it very difficult or even impossible to distinguish a weak-but-nonzero interaction strength from no interaction whatsoever, and thus give an illusion of three electrons that did not interact despite all three passing through two paths.

## Notes

1. ^ a b c Herstein 1964, p. 90
2. ^ a b c Rittaud, Benoît; Heeffer, Albrecht (2014). "The pigeonhole principle, two centuries before Dirichlet". The Mathematical Intelligencer. 36 (2): 27–29. doi:10.1007/s00283-013-9389-1. hdl:1854/LU-4115264. MR 3207654. S2CID 44193229.
3. ^ Jeff Miller, Peter Flor, Gunnar Berg, and Julio González Cabillón. "Pigeonhole principle". In Jeff Miller (ed.) Earliest Known Uses of Some of the Words of Mathematics. Electronic document, retrieved November 11, 2006
4. ^ Fletcher & Patty 1987, p. 27
5. ^ Diskrete Mathematik - Page 367 https://books.google.at/books?isbn=3833455292
6. ^ The Induction Book - Page 13 https://books.google.at/books?isbn=0486811999
7. ^ Mathematics Dictionary - Page 490 https://books.google.at/books?isbn=0412990415
8. ^ Pandey, Avinash. "D3 Graph Theory - Interactive Graph Theory Tutorials". d3gt.com. Retrieved 2021-01-12.
9. ^ Rignano, Eugenio (1923). The Psychology of Reasoning. Translated by Holl, Winifred A. K. Paul, Trench, Trubner & Company, Limited. p. 72.
10. ^ To avoid a slightly messier presentation, this example only refers to people who are not bald.
11. ^ "London's Population / Greater London Authority (GLA)". http://data.london.gov.uk. External link in |website= (help)
12. ^
13. ^
14. ^
15. ^ Leurechon, Jean (1622), Selecæe Propositiones in Tota Sparsim Mathematica Pulcherrimæ, Gasparem Bernardum, p. 2
16. ^ Grimaldi 1994, p. 277
17. ^ Introduction to Formal Languages and Automata, Peter Linz, pp. 115–116, Jones and Bartlett Learning, 2006
18. ^ Computational Geometry in C, Cambridge Tracts in Theoretical Computer Science, 2nd Edition, Joseph O'Rourke, page 9.
19. ^ Brualdi 2010, p. 70
20. ^ Brualdi 2010, p. 74 Theorem 3.2.1
21. ^ In the lead section this was presented with the substitutions m = n and k = r − 1.
22. ^ Aharonov, Yakir; Colombo, Fabrizio; Popescu, Sandu; Sabadini, Irene; Struppa, Daniele C.; Tollaksen, Jeff (2016). "Quantum violation of the pigeonhole principle and the nature of quantum correlations". Proceedings of the National Academy of Sciences. 113 (3): 532–535. Bibcode:2016PNAS..113..532A. doi:10.1073/pnas.1522411112. PMC 4725468. PMID 26729862.
23. ^ "Quantum pigeonholes are not paradoxical after all, say physicists". 8 January 2015.
24. ^ Rae, Alastair; Forgan, Ted (2014-12-03). "On the implications of the Quantum-Pigeonhole Effect". arXiv:1412.1333 [quant-ph].