A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
A set is finite if it is empty or has a bijection with {1, 2, ..., n} for some natural number n; its cardinality is that n. This rigorous definition makes counting foundational in set theory and grounds natural numbers as the cardinal measures of finite sets.
Verify finiteness by constructing bijections: {a,b,c,d} ≅ {1,2,3,4}. Count elements by finding the n such that f: A → {1,...,n} is a bijection. Contrast with infinite sets by showing no such n exists.
You already know what it means for two sets to be equinumerous: there is a bijection between them — a function that pairs every element of one set with exactly one element of the other, with no leftovers on either side. This concept lets you compare sizes without counting. Now, finiteness is defined in terms of equinumerosity: a set A is finite if A is empty, or if A is equinumerous with {1, 2, ..., n} for some positive natural number n. The cardinality of A is then that n — the unique number such that the bijection exists.
This definition may seem roundabout — why not just say "a finite set is one you can finish counting"? The answer is that "counting" is itself a bijection: to count a set is to pair its elements with the numbers 1, 2, 3, ... in order, stopping when you run out of elements. The bijection-based definition makes this precise and avoids circularity. It also generalizes: once you have this definition, you can ask whether two finite sets have the same cardinality without knowing what that cardinality is — just check whether a bijection between them exists.
A critical feature of finite sets is that they cannot be put into bijection with any proper subset of themselves. If A = {a, b, c} with |A| = 3, there is no bijection from A to {a, b} — you would have to leave c unpaired or send two elements to the same image. This Dedekind finiteness characterization (a set is finite if and only if it has no bijection with a proper subset) is equivalent to the standard definition and illuminates why infinite sets behave differently: the natural numbers ℕ can be put into bijection with the even numbers {2, 4, 6, ...}, a proper subset, via n ↦ 2n. This is impossible for any finite set.
The natural numbers themselves serve as the canonical measuring sticks for finite cardinality. Each number n is identified with the set {1, 2, ..., n} (or in von Neumann's construction, with {0, 1, ..., n-1}), so the natural numbers are simultaneously counting tools and sets in their own right. To find the cardinality of a finite set A, you find the unique n such that there is a bijection f: A → {1, ..., n}. Uniqueness is guaranteed by a basic theorem: if f: A → {1,...,m} and g: A → {1,...,n} are both bijections, then m = n. This theorem, which follows from properties of injections and surjections, is what makes the notion of "the size of a finite set" well-defined.