Finite set

From Example Problems
Jump to navigation Jump to search

In mathematics, a set is called finite if and only if there is a bijection between the set and some set of the form {1, 2, ..., n} where Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "":): {\displaystyle n} is a natural number. (The value n=0 is allowed; that is, the empty set is finite.) All finite sets are countable [1], but not all countable sets are finite.

Equivalently, a set is finite if its cardinality, i.e. the number of its elements, is a natural number. For instance, the set of integers between -15 and 3 is finite, since it has 17 elements. The set of all prime numbers is not finite. Sets that are not finite are called infinite.

A set is called Dedekind finite if there exists no bijection between the set and any of its proper subsets. It is a theorem (assuming the axiom of choice) that a set is finite if and only if it is Dedekind finite.

See also


  1. ^  Some authors use "countable" to mean "countably infinite", and thus do not consider finite sets to be countable.

nl:Eindig pl:Zbiór skończony fi:Äärellinen uk:Скінченна множина zh:有限集合