Finite set

In mathematics, a finite set is a collection of finitely many different things. The things in the set are called elements or members and can be numbers, symbols, points in space, lines, geometric shapes, variables, or even other sets.

A finite set is one that you could, in principle, count completely. For example, { 2 , 4 , 6 , 8 , 10 } is a finite set with five elements. The number of elements in a finite set is a natural number (which could be zero) and is called the cardinality (or the cardinal number)_ of the set. In contrast, a set that goes on forever, like the set of all positive integers { 1 , 2 , 3 , … }, is called an infinite set.

Finite sets are very useful in combinatorics, the area of mathematics that studies counting. One important idea used with finite sets is the pigeonhole principle, which tells us that you cannot have an injective function from a larger finite set to a smaller one. This helps mathematicians solve many problems about how things can be arranged and grouped.

Definition and terminology

A finite set is a collection of a specific number of different items. These items are called elements. For example, the set {2, 4, 6, 8, 10} is a finite set because it has exactly five elements.

In mathematics, a set is finite if we can match each element in the set with a unique number from 1 up to some natural number n. This helps us count the elements in the set. If the set has no elements, it is called empty and is related to the number 0.

Basic properties

A finite set has a limited number of elements. If you take a smaller group from this set, called a proper subset, it will also be finite and have fewer elements than the whole set. The combination of two finite sets is also finite. For example, if one set has 3 elements and another has 4, together they have at most 7 elements.

A finite set with n elements has exactly 2<sup>n</sup> different groups of elements, including the empty set and the set itself. This means that the number of possible subsets grows very quickly as the size of the set increases.

Necessary and sufficient conditions for finiteness

In Zermelo–Fraenkel set theory without the axiom of choice (ZF), several conditions can tell us if a set is finite. These conditions all mean the same thing:

1. A set is finite if you could count its elements one by one and finish.
2. The set has properties that can be shown using a step-by-step process starting from nothing and adding one item at a time.
3. The set can be arranged in a way that every part has both a first and a last element.

If we also assume the axiom of choice, more conditions work too:

1. A set is finite if every one-to-one matching from the set to itself covers the whole set.
2. Every matching that fully covers the set must also be one-to-one.

These ideas help mathematicians understand what it means for a collection to be finite.

Uniqueness of cardinality

An important property of finite sets is that a set can only have one specific number of elements. For example, if a set has 4 elements, it cannot also have 5 elements. This might seem obvious, but mathematicians have proven it using careful reasoning.

The proof uses a idea called induction. It starts with smaller sets where the property is easy to see, and then shows that if it works for one size, it must also work for the next size. This step-by-step approach helps confirm that the number of elements in a finite set is always unique and cannot change.

Terence Tao