Finite set

In mathematics, a finite set is a group of things that has a limited number of items. The items in the set are called elements or members. These can be numbers, symbols, points in space, lines, geometric shapes, variables, or even other sets.

A finite set is one that you could count completely, if you had enough time. 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 can be zero). This number is called the cardinality (or the cardinal number)_ of the set. A set that never ends, like the set of all positive integers { 1 , 2 , 3 , … }, is called an infinite set.

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

Definition and terminology

A finite set is a group of a certain number of different things. These things 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 give each element a unique number from 1 up to some other number. This helps us count the elements. If the set has no elements, it is called empty and is linked 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 the number of possible subsets grows very quickly as the size of the set gets bigger.

Necessary and sufficient conditions for finiteness

In Zermelo–Fraenkel set theory without the axiom of choice (ZF), there are a few ways to know if a set is finite. These ideas 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

A special thing about finite sets is that each set has just one exact number of elements. For example, if a set has 4 elements, it cannot also have 5 elements. This may seem clear, but mathematicians have shown it with careful thinking.

The proof uses a concept called induction. It begins with smaller sets where the idea is simple, and then it shows that if it is true for one size, it must also be true for the next size. This step-by-step method helps prove that the number of elements in a finite set is always unique and cannot change.

Terence Tao