Finite set

The natural numbers are defined abstractly by the Peano axioms, and can be constructed set-theoretically (for example, by the Von Neumann ordinals). Then, formally, a set S is called finite if there exists a bijection f\colon S\to \{1, 2, \cdots, n \} for some natural number n, analogous to counting its elements. If S is empty, this is vacuously satisfied for n = 0 with the empty function. The number n is the set's cardinality, denoted as |S|. If a nonempty set is finite, its elements may be written in a sequence: x_1,x_2,\ldots,x_n \quad (x_i \in S, \ 1 \le i \le n). If n ≥ 2, then there are multiple such sequences. In combinatorics, a finite set with n elements is sometimes called an n-set and a subset with k elements is called a k-subset. For example, the set \{5,6,7\} is a 3-set – a finite set with three elements – and \{6,7\} is a 2-subset of it. This notation \{ 1, \cdots, n \} may be defined recursively as \{1,\cdots,n\} = \left\{ \begin{array}{lll} \varnothing \text{ (the empty set)} & \text{if} & n = 0 \\ \{1,\cdots,n-1\} \cup \{n\} & \text{if} & n \geq 1 \\ \end{array} \right. == Basic properties ==

Any proper subset of a finite set S is finite and has fewer elements than S itself. As a consequence, there cannot exist a bijection between a finite set S and a proper subset of S. Any set with this property is called Dedekind-finite. Using the standard ZFC axioms for set theory, every Dedekind-finite set is also finite, but this implication cannot be proved in ZF (Zermelo–Fraenkel axioms without the axiom of choice) alone. The axiom of countable choice, a weak version of the axiom of choice, is sufficient to prove this equivalence. Any injective function between two finite sets of the same cardinality is also a surjective function (a surjection). Similarly, any surjection between two finite sets of the same cardinality is also an injection. The union of two finite sets is finite, with |S \cup T| \le |S| + |T|. In fact, by the inclusion–exclusion principle: |S \cup T| = |S| + |T| - |S\cap T|. More generally, the union of any finite number of finite sets is finite. The Cartesian product of finite sets is also finite, with: |S \times T| = |S|\times|T|. Similarly, the Cartesian product of finitely many finite sets is finite. A finite set with n elements has 2^n distinct subsets. That is, the power set \wp(S) of a finite set S is finite, with cardinality 2^. Any subset of a finite set is finite. The set of values of a function when applied to elements of a finite set is finite. All finite sets are countable, but not all countable sets are finite. (Some authors, however, use "countable" to mean "countably infinite", so do not consider finite sets to be countable.) The free semilattice over a finite set is the set of its non-empty subsets, with the join operation being given by set union. == Necessary and sufficient conditions for finiteness ==

In Zermelo–Fraenkel set theory without the axiom of choice (ZF), the following conditions are all equivalent: • S is a finite set. That is, S can be placed into a one-to-one correspondence with the set of those natural numbers less than some specific natural number. • (Kazimierz Kuratowski) S has all properties which can be proved by mathematical induction beginning with the empty set and adding one new element at a time. • (Paul Stäckel) S can be given a total ordering which is well-ordered both forwards and backwards. That is, every non-empty subset of S has both a least and a greatest element in the subset. • Every one-to-one function from \wp\bigl(\wp(S)\bigr) into itself is onto. That is, the powerset of the powerset of S is Dedekind-finite (see below). • Every surjective function from \wp\bigl(\wp(S)\bigr) onto itself is one-to-one. • (Alfred Tarski) Every non-empty family of subsets of S has a minimal element with respect to inclusion. (Equivalently, every non-empty family of subsets of S has a maximal element with respect to inclusion.) • S can be well-ordered and any two well-orderings on it are order isomorphic. In other words, the well-orderings on S have exactly one order type. If the axiom of choice is also assumed (the axiom of countable choice is sufficient), then the following conditions are all equivalent: • S is a finite set. • (Richard Dedekind) Every one-to-one function from S into itself is onto. A set with this property is called Dedekind-finite. • Every surjective function from S onto itself is one-to-one. • S is empty or every partial ordering of S contains a maximal element. Other concepts of finiteness In ZF set theory without the axiom of choice, the following concepts of finiteness for a set S are distinct. They are arranged in strictly decreasing order of strength, i.e. if a set S meets a criterion in the list then it meets all of the following criteria. In the absence of the axiom of choice the reverse implications are all unprovable, but if the axiom of choice is assumed then all of these concepts are equivalent. (Note that none of these definitions need the set of finite ordinal numbers to be defined first; they are all pure "set-theoretic" definitions in terms of the equality and membership relations, not involving ω.) • I-finite. Every non-empty set of subsets of S has a \subseteq-maximal element. (This is equivalent to requiring the existence of a \subseteq-minimal element. It is also equivalent to the standard numerical concept of finiteness.) • Ia-finite. For every partition of S into two sets, at least one of the two sets is I-finite. (A set with this property which is not I-finite is called an amorphous set.) • II-finite. Every non-empty \subseteq-monotone set of subsets of S has a \subseteq-maximal element. • III-finite. The power set \wp(S) is Dedekind finite. • IV-finite. S is Dedekind finite. • V-finite. |S|=0 or 2\cdot|S|>|S|. • VI-finite. |S|=0 or |S|=1 or |S|^2>|S|. (See Tarski's theorem about choice.) • VII-finite. S is I-finite or not well-orderable. The forward implications (from strong to weak) are theorems within ZF. Counter-examples to the reverse implications (from weak to strong) in ZF with urelements are found using model theory. Most of these finiteness definitions and their names are attributed to by . However, definitions I, II, III, IV and V were presented in , together with proofs (or references to proofs) for the forward implications. At that time, model theory was not sufficiently advanced to find the counter-examples. Each of the properties I-finite thru IV-finite is a notion of smallness in the sense that any subset of a set with such a property will also have the property. This is not true for V-finite thru VII-finite because they may have countably infinite subsets. == Uniqueness of cardinality ==

An important property of finite sets is that, for example, if a set has cardinality 4, then it cannot also have cardinality 5. Intuitively meaning that a set cannot have both exactly 4 elements and exactly 5 elements. However, it is not so obviously proven. The following proof is adapted from Analysis I by Terence Tao. Lemma: If a set X has cardinality n \geq 1, and x_0 \in X, then the set X - \{x_0\} (i.e. X with the element x_0 removed) has cardinality n-1. Proof: Given X as above, since X has cardinality n, there is a bijection f from X to \{1,\,2,\, \dots, \, n\}. Then, since x_0 \in X, there must be some number f(x_0) in \{1,\,2,\, \dots, \, n\}. We need to find a bijection from X - \{x_0\} to \{1, \dots n-1\} (which may be empty). Define a function g such that g(x) = f(x_0) if f(x) = n, and g(x) = f(x) otherwise. Then g is a bijection from X - \{x_0\} to \{1, \dots n-1\}. Theorem: If a set X has cardinality n, then it cannot have any other cardinality. That is, X cannot also have cardinality m \neq n. Proof: If X is empty (has cardinality 0), then there cannot exist a bijection from X to any nonempty set Y, since, vacuously, nothing can map to y_0 \in Y. Assume, by induction that the result has been proven up to some cardinality n. If X, has cardinality n+1, assume it also has cardinality m. We want to show that m = n+1. By the lemma above, X - \{x_0\} must have cardinality n and m-1. Since, by induction, cardinality is unique for sets with cardinality n, it must be that m-1 = n, and thus m = n+1. == See also ==