Proof of the pigeonhole principle
Builds on Injective functionBijective functionImage of a setBijection principleComplement principle
Proof
We argue by contradiction.
- Suppose that is injective, and let be the image of .
- Then is a bijection from onto : it is injective, and every element of is a value of .
- Composing a numbering of with numbers . So is finite and , as in the bijection principle.
- The set is a subset of . By the complement principle, .
- The left side is a natural number, but because . This is a contradiction.
- Hence is not injective. So there are in with .
Idea
An injective map copies onto a subset of of the same size. A subset of cannot be larger than , so this is impossible when has more elements than .
Reading path
To understand this page from the ground up, read these 40 pages in order. The foundations come first. The path takes the proofs Proof that a composition of injections is injective, Proof that a function is bijective iff it has a two-sided inverse, Proof of the complement principle, Proof that a composition of surjections is surjective, Proof of the rule of sum, Proof of the bijection principle.
Show the path as a graph
- no evidence level
- Cardinality of a finite set definition
- Element definition
- Proposition concept
- Set definition
- Conjunction definition
- Implication definition
- Predicate definition
- Empty set object
- Ordered pair definition
- Intersection definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Disjoint sets definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Function composition definition
- Identity function definition
- Injective function definition
- Image of a set definition
- Surjective function definition
- Left inverse definition
- Right inverse definition
- Proof that a composition of injections is injective proof
- Proof that a composition of surjections is surjective proof
- Bijective function definition
- Composition of injections is injective statement
- Composition of surjections is surjective statement
- Proof of the rule of sum proof
- Proof that a function is bijective iff it has a two-sided inverse proof
- Rule of sum statement
- Bijective iff it has a two-sided inverse statement
- Proof of the complement principle proof
- Proof of the bijection principle proof
- Complement principle statement
- Bijection principle statement
- Proof of the pigeonhole principle proof
Where this leads
39 pages build on this one.
- Fermat's theorem on sums of two squares
- Dirichlet's approximation theorem
- Sum of two squares theorem
- Generalized pigeonhole principle
- A finite integral domain is a field
- Existence of nontrivial solutions of Pell's equation
- Infinite pigeonhole principle
- Pigeonhole principle
- Solutions of Pell's equation are powers of the fundamental solution
- Fundamental solution of Pell's equation
- Reduction modulo p test for irreducibility
- Lagrange's four-square theorem
- Z/pZ is a field for p prime
- Theorem on friends and strangers
- The group of units of Z/pZ is cyclic
- Irreducibility of the cyclotomic polynomials over the rationals
- Erdős–Szekeres theorem
- A prime is a Gaussian prime if and only if it is 3 modulo 4
- Gauss–Wantzel theorem
- Proof of the Erdős–Szekeres theorem by the pigeonhole principle
- Proof of the sum of two squares theorem
- Proof of Fermat's theorem on sums of two squares by Thue's lemma
- Proof that a finite integral domain is a field
- Cyclotomic field
- Coxeter's integral octonions
- Proof that the solutions of Pell's equation are powers of the fundamental solution
- Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation
- Proof that a prime is a Gaussian prime if and only if it is 3 modulo 4
- Proof that the group of units of Z/pZ is cyclic by counting elements of each order
- Proof of Lagrange's four-square theorem by descent
- Proof of the irreducibility of the cyclotomic polynomials by reduction modulo primes
- Kronecker's approximation theorem
- Proof of Dirichlet's approximation theorem by the pigeonhole principle
- Hurwitz quaternions
- Proof of the theorem on friends and strangers
- 24-cell
- No-three-in-line problem
- Proof of the Gauss–Wantzel theorem
- Proof of the reduction modulo p test for irreducibility
Further reading
About this page
| Tag | E0R6P2FMCM |
|---|---|
| URI | m2://E0R6P2FMCM |
| Kind | proof |
| Writing | W0 stub |
| MSC | 05A05 |
| Proves | Pigeonhole principle |
| Uses | Injective function, Bijective function, Image of a set, Bijection principle, Complement principle |
| Methods | Proof by contradiction |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.