Set (mathematics)

In mathematics, a set is a collection of distinct objects. These objects are called elements or members of the set. Members can be almost anything, such as numbers, symbols, or geometric shapes. They can also be variables, functions, or even other sets.

While it is hard to provide a single, perfect definition for a set, they serve as the foundational building blocks for nearly all mathematical thought. This is similar to how points and lines function in Euclidean geometry. Instead of defining a set directly, mathematicians use axioms to describe how sets behave. These rules allow us to rigorously define every other mathematical object.

There are two primary ways to specify what is inside a set. The first is roster notation, which was introduced by Ernst Zermelo in 1908. In this method, you list every element between curly braces, separated by commas.

For example, the order of elements does not matter, and repeating an element does not change the set. The second method is set-builder notation. This uses a logical formula to characterize elements. It defines a set by stating a property that its members must satisfy. For instance, you might define a set as all integers between 0 and 19 inclusive. This is helpful when a list is too long to write out manually.

Sets can be categorized by their size. A set is considered finite if there is a natural number that matches the count of its elements. A singleton is a specific type of finite set containing exactly one element. Conversely, a set is infinite if no such natural number exists.

The empty set, denoted by the symbol ∅, is a unique finite set with no elements. According to the axiom of extensionality, there is only one empty set. This axiom also tells us that two sets are equal if they contain the exact same elements.

We can also describe the relationship between different sets using the concept of a subset. A set is a subset of another if every one of its elements is also found in the larger set. If the subset is not equal to the larger set, it is called a proper subset. For example, the set of all humans is a proper subset of the set of all mammals. This relationship is known as inclusion or containment. The empty set is a special case because it is a subset of every possible set.

Mathematicians use several standard operations to create new sets from existing ones. The union of two sets, denoted by A ∪ B, combines all elements from both sets.

The intersection, denoted by A ∩ B, includes only the elements that appear in both sets.

The set difference, A \ B, contains elements that belong to the first set but not the second.

There is also the symmetric difference, which includes elements that belong to either set but not to both.

Finally, the complement refers to all elements in a universal set that are not in a specific subset.

The history of set theory is marked by significant shifts in understanding. Before the late 19th century, sets were not studied as a distinct field. Most mathematicians viewed infinity as a potential process rather than a completed collection. This changed with the work of Georg Cantor between 1845 and 1918. Cantor's study of infinite sets revealed that some infinities are strictly larger than others. For example, the number line contains more elements than the set of natural numbers. This discovery led to paradoxes, such as Russell's paradox, which challenged the idea of a set of all sets.

These challenges created a foundational crisis in mathematics. To resolve this, mathematicians developed formal axiom systems. The most common system used today is Zermelo-Fraenkel set theory with the axiom of choice, known as ZFC. This system provides the logical framework for modern mathematics. Today, sets are used to define algebraic structures and mathematical spaces. Even classical ideas, like Euclid's theorem about prime numbers, are often restated using the language of sets. As David Hilbert once suggested, the mathematical paradise created by Cantor has become an essential part of the field.