Canonical: https://knowlpedia.com/shared-foundations/finite-set/

# Finite set

A set admitting a bijection with an initial segment of the natural numbers.

A [set](https://knowlpedia.com/shared-foundations/set/) \(A\) is **finite** if there is a [natural number](https://knowlpedia.com/shared-foundations/natural-numbers/) \(n\) and a [bijection](https://knowlpedia.com/shared-foundations/bijective-function/)
\[
\{0,1,\ldots,n-1\}\longrightarrow A.
\]
For \(n=0\), the domain is empty. The unique such number \(n\) is the **cardinality** of \(A\), written \(|A|\). A set is **infinite** if it is not finite.

## Counting and enumeration

A finite set can be listed without repetition as \(a_1,\ldots,a_n\); the enumeration is a choice of order, not additional data intrinsic to the set. An indexed list can contain repetitions, so the number of its indices need not equal the number of distinct values.

## Examples

The empty set has cardinality zero. The set \(\{1,3,5\}\) has cardinality three. A finite family of sets can have an infinite union if even one member is infinite; a finite union of finite sets is finite.

## References

- [Jonathan Pila, Set Theory, Sections 2–9 and 15](https://www.maths.ox.ac.uk/system/files/attachments/SetTheoryHT18.pdf).
