In mathematics, a finite set is a set that has a finite number of elements. For example,

\{2,4,6,8,10\}\,\!
is a finite set with five elements. The number of elements of a finite set is a natural number (a nonnegative integer) and is called the cardinality of the set. A set that is not finite is called infinite. For example, the set of all positive integers is infinite:

\{1,2,3,\ldots\}.
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.
Contents

Definition and terminology 1

Basic properties 2

Necessary and sufficient conditions for finiteness 3

Foundational issues 4

Settheoretic definitions of finiteness 5

Other concepts of finiteness 5.1

See also 6

Notes 7

References 8

External links 9
Definition and terminology
Formally, a set S is called finite if there exists a bijection

f\colon S\rightarrow\{1,\ldots,n\}
for some natural number n. The number n is the set's cardinality, denoted as S. The empty set {} or Ø is considered finite, with cardinality zero.
If a set is finite, its elements may be written — in many ways — in a sequence:

x_1,x_2,\ldots,x_n \quad (x_i \in S, 1 \le i \le n).
In combinatorics, a finite set with n elements is sometimes called an nset and a subset with k elements is called a ksubset. For example, the set {5,6,7} is a 3set – a finite set with three elements – and {6,7} is a 2subset of it.
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 Dedekindfinite. Using the standard ZFC axioms for set theory, every Dedekindfinite set is also finite, but this requires at least the axiom of countable choice.
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:

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\timesT.
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 of a finite set is finite, with cardinality 2^{n}.
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 nonempty 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 onetoone 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. (See below for the settheoretical formulation of Kuratowski finiteness.)

(Paul Stäckel) S can be given a total ordering which is wellordered both forwards and backwards. That is, every nonempty subset of S has both a least and a greatest element in the subset.

Every onetoone function from P(P(S)) into itself is onto. That is, the powerset of the powerset of S is Dedekindfinite (see below).^{[1]}

Every surjective function from P(P(S)) onto itself is onetoone.

(Alfred Tarski) Every nonempty family of subsets of S has a minimal element with respect to inclusion.^{[2]} (Equivalently, every nonempty family of subsets of S has a maximal element with respect to inclusion.)

S can be wellordered and any two wellorderings on it are order isomorphic. In other words, the wellorderings 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 onetoone function from S into itself is onto.

Every surjective function from S onto itself is onetoone.

S is empty or every partial ordering of S contains a maximal element.
Foundational issues
strict finitists, reject the existence of infinite sets and thus advocate a mathematics based solely on finite sets. Mainstream mathematicians consider strict finitism too confining, but acknowledge its relative consistency: the universe of hereditarily finite sets constitutes a model of Zermelo–Fraenkel set theory with the axiom of infinity replaced by its negation.
Even for those mathematicians who embrace infinite sets, in certain important contexts, the formal distinction between the finite and the infinite can remain a delicate matter. The difficulty stems from Gödel's incompleteness theorems. One can interpret the theory of hereditarily finite sets within Peano arithmetic (and certainly also vice versa), so the incompleteness of the theory of Peano arithmetic implies that of the theory of hereditarily finite sets. In particular, there exists a plethora of socalled nonstandard models of both theories. A seeming paradox, nonstandard models of the theory of hereditarily finite sets contain infinite sets  but these infinite sets look finite from within the model. (This can happen when the model lacks the sets or functions necessary to witness the infinitude of these sets.) On account of the incompleteness theorems, no firstorder predicate, nor even any recursive scheme of firstorder predicates, can characterize the standard part of all such models. So, at least from the point of view of firstorder logic, one can only hope to characterize finiteness approximately.
More generally, informal notions like set, and particularly finite set, may receive interpretations across a range of formal systems varying in their axiomatics and logical apparatus. The best known axiomatic set theories include ZermeloFraenkel set theory (ZF), ZermeloFraenkel set theory with the Axiom of Choice (ZFC), Von Neumann–Bernays–Gödel set theory (NBG), Nonwellfounded set theory, Bertrand Russell's Type theory and all the theories of their various models. One may also choose among classical firstorder logic, various higherorder logics and intuitionistic logic.
A formalist might see the meaning of set varying from system to system. A Platonist might view particular formal systems as approximating an underlying reality.
Settheoretic definitions of finiteness
In contexts where the notion of natural number sits logically prior to any notion of set, one can define a set S as finite if S admits a bijection to some set of natural numbers of the form \{xx. Mathematicians more typically choose to ground notions of number in set theory, for example they might model natural numbers by the order types of finite wellordered sets. Such an approach requires a structural definition of finiteness that does not depend on natural numbers.
Interestingly, various properties that single out the finite sets among all sets in the theory ZFC turn out logically inequivalent in weaker systems such as ZF or intuitionistic set theories. Two definitions feature prominently in the literature, one due to Richard Dedekind, the other to Kazimierz Kuratowski. (Kuratowski's is the definition used above.)
A set S is called Dedekind infinite if there exists an injective, nonsurjective function f:S \rightarrow S. Such a function exhibits a bijection between S and a proper subset of S, namely the image of f. Given a Dedekind infinite set S, a function f, and an element x that is not in the image of f, we can form an infinite sequence of distinct elements of S, namely x,f(x),f(f(x)),.... Conversely, given a sequence in S consisting of distinct elements x_1,x_2,x_3,..., we can define a function f such that on elements in the sequence f(x_i)=x_{i+1} and f behaves like the identity function otherwise. Thus Dedekind infinite sets contain subsets that correspond bijectively with the natural numbers. Dedekind finite naturally means that every injective selfmap is also surjective.
Kuratowski finiteness is defined as follows. Given any set S, the binary operation of union endows the powerset P(S) with the structure of a semilattice. Writing K(S) for the subsemilattice generated by the empty set and the singletons, call set S Kuratowski finite if S itself belongs to K(S).^{[3]} Intuitively, K(S) consists of the finite subsets of S. Crucially, one does not need induction, recursion or a definition of natural numbers to define generated by since one may obtain K(S) simply by taking the intersection of all subsemilattices containing the empty set and the singletons.
Readers unfamiliar with semilattices and other notions of abstract algebra may prefer an entirely elementary formulation. Kuratowski finite means S lies in the set K(S), constructed as follows. Write M for the set of all subsets X of P(S) such that:

X contains the empty set;

For every set T in P(S), if X contains T then X also contains the union of T with any singleton.
Then K(S) may be defined as the intersection of M.
In ZF, Kuratowski finite implies Dedekind finite, but not vice versa. In the parlance of a popular pedagogical formulation, when the axiom of choice fails badly, one may have an infinite family of socks with no way to choose one sock from more than finitely many of the pairs. That would make the set of such socks Dedekind finite: there can be no infinite sequence of socks, because such a sequence would allow a choice of one sock for infinitely many pairs by choosing the first sock in the sequence. However, Kuratowski finiteness would fail for the same set of socks.
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. In other words, if a set S meets one of the criteria in this list, it meets all of the criteria which follow that one. In the absence of the axiom of choice, the reverse implications are all unprovable. If the axiom of choice is assumed, then all of these concepts are equivalent.^{[4]} (Note that none of these definitions need the set of finite ordinal numbers to be defined first. They are all pure "settheoretic" definitions in terms of the equality and elementof relations, not involving ω.)

Ifinite. Every nonempty set of subsets of S has a ⊆maximal element. (This is equivalent to requiring the existence of a ⊆minimal element. It is also equivalent to the standard numerical concept of finiteness.)

Iafinite. For every partition of S into two sets, at least one of the two sets is Ifinite.

IIfinite. Every nonempty ⊆monotone set of subsets of S has a ⊆maximal element.

IIIfinite. The power set P(S) is Dedekind finite.

IVfinite. S is Dedekind finite.

Vfinite. ∣S∣ = 0 or 2⋅∣S∣ > ∣S.

VIfinite. ∣S∣ = 0 or ∣S∣ = 1 or ∣S∣² > ∣S.

VIIfinite. S is Ifinite or not wellorderable.
The forward implications (from strong to weak) are theorems within ZF. Counterexamples to the reverse implications (from weak to strong) are found using model theory.^{[5]}
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 counterexamples.
See also
Notes

^ The equivalence of the standard numerical definition of finite sets to the Dedekindfiniteness of the power set of the power set was shown in 1912 by Whitehead & Russell 2009, p. 288. This Whitehead/Russell theorem is described in more modern language by Tarski 1924, pp. 73–74.

^ Tarski 1924, pp. 48–58, demonstrated that his definition (which is also known as Ifinite) is equivalent to Kuratowski's settheoretical definition, which he then noted is equivalent to the standard numerical definition via the proof by Kuratowski 1920, pp. 130–131.

^ The original paper by Kuratowski 1920 defined a set S to be finite when

P(S)∖{∅} = ⋂{X ∈ P(P(S)∖{∅}); (∀x∈S, {x}∈X) and (∀A,B∈X, A∪B∈X)}.
In other words, S is finite when the set of all nonempty subsets of S is equal to the intersection of all classes X which satisfy:

all elements of X are nonempty subsets of S,

the set {x} is an element of X for all x in S,

X is closed under pairwise unions.
Kuratowski showed that this is equivalent to the numerical definition of a finite set.

^ This list of 8 finiteness concepts is presented with this numbering scheme by both Howard & Rubin 1998, pp. 278–280, and Lévy 1958, pp. 2–3, although the details of the presentation of the definitions differ in some respects which do not affect the meanings of the concepts.

^ Lévy 1958 found counterexamples to each of the reverse implications in Mostowski models. Lévy attributes most of the results to earlier papers by Mostowski and Lindenbaum.
References
External links
This article was sourced from Creative Commons AttributionShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, EGovernment Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a nonprofit organization.