infinite pigeonhole principle
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
infinite version of the pigeonhole principle
|
| gptkbp:field |
gptkb:mathematics
combinatorics |
| gptkbp:generalizes |
gptkb:pigeonhole_principle
|
| https://www.w3.org/2000/01/rdf-schema#label |
infinite pigeonhole principle
|
| gptkbp:implies |
there is no finite upper bound on the size of at least one subset in a finite partition of an infinite set
|
| gptkbp:relatedTo |
gptkb:pigeonhole_principle
|
| gptkbp:sentence |
If an infinite set is partitioned into finitely many subsets, then at least one subset is infinite.
|
| gptkbp:usedIn |
gptkb:Ramsey_theory
gptkb:set_theory infinite combinatorics |
| gptkbp:bfsParent |
gptkb:pigeonhole_principle
gptkb:Dirichlet_principle |
| gptkbp:bfsLayer |
6
|