Let \(A\) be a set. If there are exactly \(n\) distinct elements in \(A\text{,}\) where \(n\) is a non-negative integer, we say \(A\) is a finite set and that \(n\) is the cardinality of \(A\text{,}\) denoted \(\size{A}\text{.}\)
We give a precise definition of cardinality in Definitionย 4.1.1.2. In Sectionย 4.1 we also discuss sets that are not finite and their cardinality The notion if infinity is subtle; there are different sizes of infinity.
Example2.1.3.3.Cardinality of a set in roster form.
Let \(E\) be the even integers between \(-5\) and \(5\text{,}\) not including \(-5\) and \(5\text{.}\) Then we can compute the size of \(E\) by writing \(E\) using the roster method and counting.
\begin{equation*}
E = \set{-4, -2, 0, 2, 4},
\end{equation*}
Let \(C\) be the set of consonants in the English alphabet. Instead of listing the elements of \(C\) in roster method, we note that there are \(26\) letters in the English alphabet. Of these, \(5\) are vowels and the rest are consonants. Thus