Definitions for pigeonhole principle
This page provides all possible meanings and translations of the word pigeonhole principle
A theorem which states that there does not exist an injective function on finite sets whose codomain is smaller than its domain.
In mathematics, the pigeonhole principle states that if n items are put into m pigeonholes with n > m, then at least one pigeonhole must contain more than one item. This theorem is exemplified in real-life by truisms like "there must be at least two left gloves or two right gloves in a group of three gloves". It is an example of a counting argument, and despite seeming intuitive it can be used to demonstrate possibly unexpected results; for example, that two people in London have the same number of hairs on their heads. The first formalization of the idea is believed to have been made by Peter Gustav Lejeune Dirichlet in 1834 under the name Schubfachprinzip. For this reason it is also commonly called Dirichlet's box principle, Dirichlet's drawer principle or simply "Dirichlet principle" — a name that could also refer to the minimum principle for harmonic functions. The original "drawer" name is still in use in French, Polish, Italian, German, and Chinese. Though the most straightforward application is to finite sets, 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 on finite sets whose codomain is smaller than its domain". Advanced mathematical proofs like Siegel's lemma build upon this more general concept.
Find a translation for the pigeonhole principle definition in other languages:
Select another language:
Discuss these pigeonhole principle definitions with the community:
Use the citation below to add this definition to your bibliography:
"pigeonhole principle." Definitions.net. STANDS4 LLC, 2014. Web. 30 Aug. 2014. <http://www.definitions.net/definition/pigeonhole principle>.