Finite set

Template:Short description Template:CS1 config 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, Template:Bi 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: Template:Bi 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.

Definition and terminologyEdit

Formally, a set <math>S</math> is called finite if there exists a bijection Template:Bi for some natural number <math>n</math> (natural numbers are defined as sets in Zermelo-Fraenkel set theory). The number <math>n</math> is the set's cardinality, denoted as <math>|S|</math>.

If a nonempty set is finite, its elements may be written in a sequence: Template:Bi
If n≥2, then there are multiple such sequences. In combinatorics, a finite set with <math>n</math> elements is sometimes called an <math>n</math>-set and a subset with <math>k</math> elements is called a <math>k</math>-subset. For example, the set <math>\{5,6,7\}</math> is a 3-set – a finite set with three elements – and <math>\{6,7\}</math> is a 2-subset of it.

Basic propertiesEdit

Any proper subset of a finite set <math>S</math> 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 Template:Bi

In fact, by the inclusion–exclusion principle: Template:Bi More generally, the union of any finite number of finite sets is finite. The Cartesian product of finite sets is also finite, with: Template:Bi Similarly, the Cartesian product of finitely many finite sets is finite. A finite set with <math>n</math> elements has <math>2^n</math> distinct subsets. That is, the power set <math>\wp(S)</math> of a finite set S is finite, with cardinality <math>2^{|S|}</math>.

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 finitenessEdit

Template:Anchor

In Zermelo–Fraenkel set theory without the axiom of choice (ZF), the following conditions are all equivalent:<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

<math>S</math> is a finite set. That is, <math>S</math> can be placed into a one-to-one correspondence with the set of those natural numbers less than some specific natural number.
(Kazimierz Kuratowski) <math>S</math> 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) <math>S</math> can be given a total ordering which is well-ordered both forwards and backwards. That is, every non-empty subset of <math>S</math> has both a least and a greatest element in the subset.
Every one-to-one function from <math>\wp\bigl(\wp(S)\bigr)</math> into itself is onto. That is, the powerset of the powerset of <math>S</math> is Dedekind-finite (see below).<ref>The equivalence of the standard numerical definition of finite sets to the Dedekind-finiteness of the power set of the power set was shown in 1912 by Template:Harvnb. This Whitehead/Russell theorem is described in more modern language by Template:Harvnb.</ref>
Every surjective function from <math>\wp\bigl(\wp(S)\bigr)</math> onto itself is one-to-one.
(Alfred Tarski) Every non-empty family of subsets of <math>S</math> has a minimal element with respect to inclusion.<ref>Template:Harvnb, demonstrated that his definition (which is also known as I-finite) is equivalent to Kuratowski's set-theoretical definition, which he then noted is equivalent to the standard numerical definition via the proof by Template:Harvnb.</ref> (Equivalently, every non-empty family of subsets of <math>S</math> has a maximal element with respect to inclusion.)
<math>S</math> can be well-ordered and any two well-orderings on it are order isomorphic. In other words, the well-orderings on <math>S</math> have exactly one order type.

If the axiom of choice is also assumed (the axiom of countable choice is sufficient),<ref>Template:Cite book</ref> then the following conditions are all equivalent:

<math>S</math> is a finite set.
(Richard Dedekind) Every one-to-one function from <math>S</math> into itself is onto. A set with this property is called Dedekind-finite.
Every surjective function from <math>S</math> onto itself is one-to-one.
<math>S</math> is empty or every partial ordering of <math>S</math> contains a maximal element.

Other concepts of finitenessEdit

In ZF set theory without the axiom of choice, the following concepts of finiteness for a set <math>S</math> are distinct. They are arranged in strictly decreasing order of strength, i.e. if a set <math>S</math> 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.<ref>This list of 8 finiteness concepts is presented with this numbering scheme by both Template:Harvnb, and Template:Harvnb, although the details of the presentation of the definitions differ in some respects which do not affect the meanings of the concepts.</ref> (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 <math>S</math> has a <math>\subseteq</math>-maximal element. (This is equivalent to requiring the existence of a <math>\subseteq</math>-minimal element. It is also equivalent to the standard numerical concept of finiteness.)
Ia-finite. For every partition of <math>S</math> 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.<ref>Template:Harvtxt</ref>)
II-finite. Every non-empty <math>\subseteq</math>-monotone set of subsets of <math>S</math> has a <math>\subseteq</math>-maximal element.
III-finite. The power set <math>\wp(S)</math> is Dedekind finite.
IV-finite. <math>S</math> is Dedekind finite.
V-finite. <math>|S|=0</math> or <math>2\cdot|S|>|S|</math>.
VI-finite. <math>|S|=0</math> or <math>|S|=1</math> or <math>|S|^2>|S|</math>.
VII-finite. <math>S</math> 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.<ref>Template:Harvnb found counter-examples to each of the reverse implications in Mostowski models. Lévy attributes most of the results to earlier papers by Mostowski and Lindenbaum.</ref>

Most of these finiteness definitions and their names are attributed to Template:Harvnb by Template:Harvnb. However, definitions I, II, III, IV and V were presented in Template:Harvnb, 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.

NotesEdit

Template:Reflist

ReferencesEdit

External linksEdit

{{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web

|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:FiniteSet%7CFiniteSet.html}} |title = Finite Set |author = Barile, Margherita |website = MathWorld |access-date = |ref = Template:SfnRef }}

Template:Mathematical logic Template:Set theory