Abstract
We have proved that sets are finite, but we have not yet shown rigorously that a set is infinite. It is not as easy as you might think to do so, nor do we have an exact notion of what it means for a finite set “to have n elements.” Our proof of the former and the definition of the latter will depend on a principle known as the pigeonhole principle. The pigeonhole principle is something that is familiar to all of us. As a very simple example of this, recall a childhood birthday party in which you played musical chairs. In case you weren’t invited to any parties, we’ll remind you of the rules behind the game. Let’s say there were 10 children at the party. Someone, say the child’s father, would set up 9 chairs in a row. Someone else, say the child’s mother, would play a song on the piano stopping unexpectedly at some point. When the music ended, the 10 children would scramble for the 9 seats. If everyone sat down, two people would sit in the same chair. This game is our first example of the pigeonhole principle. Now we turn to a more elaborate one.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Daepp, U., Gorkin, P. (2011). Finite Sets and an Infinite Set. In: Reading, Writing, and Proving. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9479-0_22
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9479-0_22
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-9478-3
Online ISBN: 978-1-4419-9479-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)