86 Finite Sets 4B Corollary 6.6. If B is a subset of the finite set A, then B is finite. If B is a proper subset of A, then the cardinality of B is less than the cardinality of A Corollary 6.7. Let B be a nonempty set. Then the following are equivalent: (1) Bis finite. (2) There is a surjective function from a section of the positive integers onto B. (3) There is an injective function from B into a section of the positive integers. Proof (1) => (2). Since B is nonempty, there is, for some n, a bijective function PML...) > B. @ => @. Fst, the equation sn} > Bis surjective, define g : B > (1,....n} by g(b) = smallest element of f~!({6)) Because f is surjective, the set f~'{(b)) is nonempty; then the well-ordering property of Z, tells us that g(b) is uniquely defined. The map g is injective, for if b # 0’, then the sets f~!({b}) and f~!((b'}) are disjoint, so their smallest elements must be different. (3) = (1). Ig: B— (1,....,n) isinjective, then changing the range of g gives a bijection of B with a subset of {1,...,n}. It follows from the preceding corollary that B is finite. . Corollary 6.8. Finite unions and finite cartesian products of finite sets are finite Proof, We first show that if A and B are finite, so is AUB. The result is trivial if A or B is empty. Otherwise, there are bijections f : {1,...,m) — A and g : {1,....m) > B for some choice of m and n, Define a function ht : (1.....m+ n) > AUB by setting h(i) = f(i) fori = 1,2,...,m and h@) = g(i — m) for i = m-+1,....m-+n. Itis easy to check that h is surjective, from which it follows that 4 U Bis finite. Now we show by induction that finiteness of the sets A, ..., Ay implies finiteness of their union, This result is trivial for n = 1. Assuming it true for n — 1, we note that ‘Ay U-++U Ay is the union of the two finite sets Ay U---U Ay and An, 50 the result of the preceding paragraph applies. Now we show that the cartesian product of two finite sets A and B is finite. Given a € A, the set {a} x B is finite, being in bijective correspondence with B. The set ‘A x Bis the union of these sets; since there are only finitely many of them, A x B is a finite union of finite sets and thus finite. To prove that the product Ay x --- x Ay is finite if each A, is finite, one proceeds by induction. .