Pigeonhole Principle
Updated 2026-08-15
INTRODUCTION
English translation pending.
CORE DEFINITION
The pigeonhole principle states that placing n+1 objects into n containers guarantees that at least one container holds two or more. It appears in Dirichlet's work on diophantine approximation and is sometimes named after him. Its core claim is that a counting comparison alone can establish that some coincidence must occur, without constructing it. The qualification is that the conclusion is purely existential and usually gives no information about which container or which pair. Generalized forms compare objects against container capacity rather than merely container count.
SCAFFOLDING EFFECT
Reduce cognitive load
- Count both sides: compare the number of objects with the number of available containers. - Prove existence: when objects exceed containers, assert a collision instead of hunting for it. - Pick containers well: choose a partition coarse enough that the count comparison works.
Anchor fast decisions
Each object must occupy exactly one container, so the total number of objects is the sum of the container counts. If every container held at most one, that sum could not exceed the number of containers, which contradicts the premise that objects outnumber containers. The argument needs no construction because the contradiction is arithmetic rather than search-based. This is why the principle is cheap, and also why it is silent on which container overflows: it consumes all information about the objects except how many there are.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Pigeonhole_principleverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS