In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example,
is a finite set with five elements. The number of elements of a finite set is a natural number (possibly zero) and is called the cardinality (or the cardinal number) of the set. A set that is not a finite set is called an infinite set . For example, the set of all positive integers is infinite:
Finite sets are particularly important in combinatorics, the mathematical study of counting. Many arguments involving finite sets rely on the pigeonhole principle, which states that there cannot exist an injective function from a larger finite set to a smaller finite set.
The natural numbers are defined abstractly by the Peano axioms, and may be constructed set-theoreticaly (for example, by the Von Neumann ordinals). Then, formally, a set is called finite if there exists a bijection
for some natural number , analogous to counting its elements. If is empty, this is vacuously satisfied for with the empty function. The number is the set's cardinality, denoted as .
If a nonempty set is finite, its elements may be written in a sequence:
If n≥2, then there are multiple such sequences. In combinatorics, a finite set with elements is sometimes called an -set and a subset with elements is called a -subset. For example, the set is a 3-set – a finite set with three elements – and is a 2-subset of it.
This notation , may be defined recursively as
Any proper subset of a finite set 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
In fact, by the inclusion–exclusion principle:
More generally, the union of any finite number of finite sets is finite. The Cartesian product of finite sets is also finite, with:
Similarly, the Cartesian product of finitely many finite sets is finite. A finite set with elements has distinct subsets. That is, the power set of a finite set S is finite, with cardinality .
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.
In Zermelo–Fraenkel set theory without the axiom of choice (ZF), the following conditions are all equivalent: [1]
If the axiom of choice is also assumed (the axiom of countable choice is sufficient), [4] then the following conditions are all equivalent:
In ZF set theory without the axiom of choice, the following concepts of finiteness for a set are distinct. They are arranged in strictly decreasing order of strength, i.e. if a set 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. [5] (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 ω.)
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. [7]
Most of these finiteness definitions and their names are attributed to Tarski 1954 by Howard & Rubin 1998 , p. 278. However, definitions I, II, III, IV and V were presented in Tarski 1924 , pp. 49, 93, 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.
An intuitive 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. [8]
Lemma: If a set has cardinality and then the set (i.e. with the element removed) has cardinality
Proof: Given as above, since has cardinality there is a bijection from to Then, since there must be some number in We need to find a bijection from to (which may be empty). Define a function such that for all and . Then is a bijection from to
Theorem: If a set has cardinality then it cannot have any other cardinality. That is, cannot also have cardinality
Proof: If is empty (has cardinality 0), then there cannot exist a bijection from to any nonempty set since nothing mapped to Assume, by induction that the result has been proven up to some cardinality If has cardinality assume it also has cardinality We want to show that By the lemma above, must have cardinality and Since, by induction, cardinality is unique for sets with cardinality it must be that and thus
{{citation}}
: CS1 maint: multiple names: authors list (link){{citation}}
: ISBN / Date incompatibility (help)