We are now ready to define finite sets and explore a couple of their properties

Definition FinSets

A finite set is a set XX such that there is a bijection f:Fin(n)Xf:\text{Fin}(n) \to X for some nNn \in \mathbb{N}. We say that this finite set XX has nn elements or that the cardinality of XX is nn. Note that by Corollary SFnBSUFk, this nn is unique. This is because if there were another n~N\tilde{n} \in \mathbb{N} and a bijection f~:Fin(n~)X\tilde{f}:\text{Fin}(\tilde{n}) \to X, we would have a bijective left inverse f~1:XFin(n~)\tilde{f}^{-1}:X \to \text{Fin}(\tilde{n}). Now, composing this with the original bijection gives a bijection f~1f:Fin(n)Fin(n~)\tilde{f}^{-1} \circ f:\text{Fin}(n) \to \text{Fin}(\tilde{n}) and we can apply the aforementioned corollary to show that n=n~n = \tilde{n}.

results matching ""

    No results matching ""