In mathematics, a set is a collection of distinct elements or members.
The elements that make up a set can be any kind of things, people, letters of the alphabet, or mathematical objects, such as numbers, points in space, lines or other geometrical shapes, algebraic constants and variables, or even other sets. Two sets are equal if and only if they have precisely the same elements.
This is known as the axiom of extensionality.
Sets are ubiquitous in modern mathematics. The more specialized subject of set theory is part of the foundations of mathematics.
Origin
The concept of a set emerged in mathematics at the end of the 19th century.
The German word
Menge, rendered as "set" in English, was coined by
Bernard Bolzano in his work
The Paradoxes of the Infinite.
Georg Cantor was one of the founders of set theory. He gave the following definition of a set at the beginning of his
Beiträge zur Begründung der transfiniten Mengenlehre:
["Eine Menge, ist die Zusammenfassung bestimmter, wohlunterschiedener Objekte unserer Anschauung oder unseres Denkens – welche Elemente der Menge genannt werden – zu einem Ganzen." ]
Naïve set theory
The foremost basic property of a set is that it can have elements. Another essential property of sets is that two sets are equal (one set equals the other, so the two sets are in fact one and the same) if and only if every element of each set is an element of the other. This property is called the
extensionality of sets.
The simple concept of a set has proved enormously useful in mathematics, but it suffers from inconsistencies at the most fundamental level. A loose notion that allows any property without restriction to define a collection, leads to several paradoxes, most notably:

Russell's paradoxIt shows that the "set of all sets that do not contain themselves," i.e. the "set" does not exist.

Cantor's paradoxIt shows that "the set of all sets" cannot exist.
Naïve set theory defines a set as any welldefined collection of distinct elements. Problems arise from the vague meaning of the term welldefined.
Axiomatic set theory
In subsequent efforts to resolve these paradoxes since the time of the original formulation of naïve set theory, the properties of sets have been defined by
axioms. Axiomatic set theory takes the concept of a set as a
primitive notion.
The purpose of the axioms is to provide a basic framework from which to deduce the truth or falsity of particular mathematical propositions (statements) about sets, using firstorder logic. According to Gödel's incompleteness theorems however, it is not possible to use firstorder logic to prove any such particular axiomatic set theory is free from paradox.
How sets are defined and set notation
Mathematical texts commonly use
capital letters[ in Italic type such as , , to denote sets.]
A set can be defined either intensionally, extensionally
or ostensively.
Semantic definition
The simplest intensional method of defining a set is by using a rule or semantic description:
[
]
 is the set whose members are the first four positive integer.
 is the set of colors of the French flag.
Roster notation
Sets are not limited to collections of elements following simple rules, such as the sets in the examples above, however. Roster notation (or enumeration notation) is a method of defining a set by listing (or enumerating) the members of the set, enclosing the list of members in curly bracket:
 =
 = .
This is an example of enumerative definition.
Unlike a sequence, a tuple or a permutation of a set, the order in which the elements of a set are listed in roster notation is irrelevant, so is the same set as , and , , , or all represent the same set.
For sets with many elements, especially those following an implicit pattern, the list of members can be abbreviated using ellipsis ("...").
For instance, the set of the first thousand positive integers may be specified in roster notation as:
 ,
where the ellipsis indicates that the list continues by following the established pattern.[
]
Infinite sets in roster notation
Some sets have an endless list of elements. These are called
infinite set. For example, the set of integers, including positive, negative and zero, is an infinite set. In roster notation, this set can be written with just one ellipsis:
or alternatively, using two:
Setbuilder notation
Setbuilder notation is another intensional method of describing a set, which is often found in mathematical texts.
[ The set is specified as a selection from a larger set, determined by a condition involving the elements.] For example, a set can be defined as follows:
 $=\; \backslash \{n\; \backslash mid\; n\; \backslash text\{\; is\; an\; integer,\; and\; \}\; 0\; \backslash leq\; n\; \backslash leq\; 19\backslash \}.$
or:
 $=\; \backslash \{n\; :\; n\; \backslash text\{\; is\; an\; integer,\; and\; \}\; 0\; \backslash leq\; n\; \backslash leq\; 19\backslash \}.$
In this notation, the vertical bar ("") means "such that", and the description can be interpreted as " is the set of all numbers , such that is an integer in the range from 0 to 19 inclusive". Some authors use a colon (":") instead of the vertical bar.
Membership
If
B is a set and
x is an element of
B, this is written in shorthand as
x ∈
B, which can also be read as
"x belongs to B", or
"x is in B". The statement
"y is not an element of B" is written as
y ∉
B, which can also be read as or
"y is not in B".
For example, with respect to the sets A = , B = , and F = ,
 4 ∈ A and 12 ∈ F; and
 20 ∉ F and green ∉ B.
The empty set
The empty set or null set, the set of no members, denoted or ∅, is unique. Other notations are also in use (see empty set).[
]
Singleton sets
A set with exactly one element, x, is a unit set, or singleton, .[
]
The set is semantically distinct from the element x. (Halmos draws the analogy that a box containing a hat is not the same as the hat.)
Subsets
If every element of set A is also in B, then A is described as being a subset of B, or contained in B, written A ⊆ B. B ⊇ A means B contains A, B includes A, or B is a superset of A; B ⊇ A is equivalent to A ⊆ B.[ The relationship between sets established by ⊆ is called inclusion or containment. Two sets are equal if they contain each other: A ⊆ B and B ⊆ A is equivalent to A = B.][
]
If A is a subset of B, but A is not equal to B, then A is called a proper subset of B. This can be written A ⊊ B. Likewise, B ⊋ A means B is a proper superset of A, i.e. B contains A, and is not equal to A.
A third pair of operators ⊂ and ⊃ are used differently by different authors: some authors use A ⊂ B and B ⊃ A to mean A is any subset of B (and not necessarily a proper subset),[ while others reserve A ⊂ B and B ⊃ A for cases where A is a proper subset of B.][
]
Examples:

The set of all humans is a proper subset of the set of all mammals.

⊂ .

⊆ .
The empty set is a subset of every set, and every set is a subset of itself:
Euler and Venn diagrams
An Euler diagram is a graphical representation of a set as a closed loop, enclosing its elements, or the relationships between different sets, as closed loops. If two sets have no members in common, the loops do not overlap.
This is distinct from a Venn diagram, which shows all possible relations between two or more sets, with each loop overlapping the others.
Special sets of numbers in mathematics
There are sets of such mathematical importance, to which mathematicians refer so frequently, that they have acquired special names and notational conventions to identify them.
Many of these important sets are represented in mathematical texts using bold (e.g. ) or blackboard bold (e.g. $\backslash mathbb\; Z$) typeface.
These include:[
]

or $\backslash mathbb\; N$, denoting the set of all : (some authors exclude )
[
]

or $\backslash mathbb\; Z$, denoting the set of all (whether positive, negative or zero):
[
]

or $\backslash mathbb\; Q$, denoting the set of all (that is, the set of all proper fraction and improper fractions): , for example, and , and since every integer can be expressed as the fraction , all integers are members of this set ($\backslash mathbf\; Z\; \backslash subsetneq\; \backslash mathbf\; Q$)
[
]

or $\backslash mathbb\; R$, denoting the set of all real number, including all rational numbers, together with all irrational numbers (that is, that cannot be rewritten as fractions such as , as well as transcendental numbers such as , )
[
]

or $\backslash mathbb\; C$, denoting the set of all : , for example,
[
]
Each of the above sets of numbers has an infinite number of elements, and each can be considered to be a proper subset of the sets listed below it.
Sets of positive or negative numbers are sometimes denoted by superscript plus and minus signs, respectively. For example, $\backslash mathbb\; Q^+$ represents the set of positive rational numbers.
Mappings and onetoone correspondence
In mathematics, a mapping or function from set to a set is a relation between the two sets, which relates each element of set with exactly one element of set . A onetoone correspondence or bijection is a mapping where each element of set is paired with exactly one element of set , and each element of set is paired with exactly one element of set , so that there are no unpaired elements.
Cardinality
The cardinality of a set S, denoted , is the number of members of S. For example, if B = , then . Repeated members in roster notation are not counted, so , too.
More formally, two sets share the same cardinality if there exists a onetoone correspondence between them.
The cardinality of the empty set is zero.
Infinite sets and infinite cardinality
The list of elements of some sets is endless, or Infinite set. For example, the set ℕ of natural number is infinite.[ In fact, all the special sets of numbers mentioned in the section above, are infinite. Infinite sets have infinite cardinality.
]
Some infinite cardinalities are greater than others. Sets with the same cardinality as ℕ are called countable set. Arguably one of the most significant results from set theory is that the set of real number has greater cardinality than the set of natural numbers.
Sets with cardinality greater than the set of natural numbers are called uncountable set.
However, it can be shown that the cardinality of a straight line (i.e., the number of points on a line) is the same as the cardinality of any line segment of that line, of the entire plane, and indeed of any finitedimensional Euclidean space.
The Continuum Hypothesis
The Continuum Hypothesis of Georg Cantor in 1878 stated that there are no sets with cardinality between that of countable sets and that of a straight line. In 1963, Paul Cohen proved the Continuum Hypothesis is independent of Zermelo–Fraenkel set theory with the axiom of choice (ZFC, the most widelystudied version of axiomatic set theory).[
]
Power sets
The power set of a set S is the set of all subsets of S.[ The empty set and S itself are elements of the power set of S because these are both subsets of S. For example, the power set of is . The power set of a set S is commonly written as P( S) or 2^{ P}.][
]
The power set of a finite set with n elements has 2^{ n} elements. For example, the set contains three elements, and the power set shown above contains 2^{3} = 8 elements.
The power set of an infinite (either countable or uncountable) set is always uncountable. Moreover, within the most widelyused frameworks of set theory, the power set of a set is always strictly "bigger" than the original set, in the sense that there is no way to pair every element of S with exactly one element of P( S). (There is never an onto map or surjection from S onto P( S).)
Partitions
A partition of a set S is a set of nonempty subsets of S, such that every element x in S is in exactly one of these subsets. That is, the subsets are pairwise disjoint (meaning any two sets of the partition contain no element in common), and the union of all the subsets of the partition is S.
Basic operations
There are several fundamental operations for constructing new sets from given sets.
Unions
Two sets can be "added" together. The union of A and B, denoted by A ∪ B,[ is the set of all things that are members of either A or B.
]
Examples:

{1, 2, 3} ∪ {3, 4, 5} = {1, 2, 3, 4, 5}
Some basic properties of unions:
Intersections
A new set can also be constructed by determining which members two sets have "in common". The intersection of A and B, denoted by [ is the set of all things that are members of both A and B. If then A and B are said to be disjoint.
]
Examples:
Some basic properties of intersections:
Complements
Two sets can also be "subtracted". The relative complement of B in A (also called the settheoretic difference of A and B), denoted by (or ),[ is the set of all elements that are members of A, but not members of B. It is valid to "subtract" members of a set that are not in the set, such as removing the element green from the set ; doing so will not affect the elements in the set.
]
In certain settings, all sets under discussion are considered to be subsets of a given universal set U. In such cases, is called the absolute complement or simply complement of A, and is denoted by A′ or A^{c}.[
]
Examples:

If U is the set of integers, E is the set of even integers, and O is the set of odd integers, then U \ E = E′ = O.
Some basic properties of complements include the following:
An extension of the complement is the symmetric difference, defined for sets A, B as
 $A\backslash ,\backslash Delta\backslash ,B\; =\; (A\; \backslash setminus\; B)\; \backslash cup\; (B\; \backslash setminus\; A).$
For example, the symmetric difference of and is the set . The power set of any set becomes a Boolean ring with symmetric difference as the addition of the ring (with the empty set as neutral element) and intersection as the multiplication of the ring.
Cartesian product
A new set can be constructed by associating every element of one set with every element of another set. The Cartesian product of two sets A and B, denoted by A × B,[ is the set of all ordered pairs ( a, b) such that a is a member of A and b is a member of B.
]
Examples:
Some basic properties of Cartesian products:
Let A and B be finite sets; then the cardinality of the Cartesian product is the product of the cardinalities:

 A × B  =  B × A  =  A  ×  B .
Applications
Sets are ubiquitous in modern mathematics. For example, structures in abstract algebra, such as groups, fields and rings, are sets closed under one or more operations.
One of the main applications of naive set theory is in the construction of relations. A relation from a domain A to a codomain B is a subset of the Cartesian product A × B. For example, considering the set S = { rock, paper, scissors } of shapes in the game of the same name, the relation "beats" from S to S is the set B = { (scissors,paper), (paper,rock), (rock,scissors) }; thus x beats y in the game if the pair ( x, y) is a member of B. Another example is the set F of all pairs ( x, x^{2}), where x is real. This relation is a subset of R × R, because the set of all squares is subset of the set of all real numbers. Since for every x in R, one and only one pair ( x,...) is found in F, it is called a function. In functional notation, this relation can be written as F( x) = x^{2}.
Principle of inclusion and exclusion
The inclusion–exclusion principle is a counting technique that can be used to count the number of elements in a union of two sets—if the size of each set and the size of their intersection are known. It can be expressed symbolically as
 $A\; \backslash cup\; B\; =\; A\; +\; B\; \; A\; \backslash cap\; B.$
A more general form of the principle can be used to find the cardinality of any finite union of sets:
 $\backslash begin\{align\}$
\leftA_{1}\cup A_{2}\cup A_{3}\cup\ldots\cup A_{n}\right=& \left(\leftA_{1}\right+\leftA_{2}\right+\leftA_{3}\right+\ldots\leftA_{n}\right\right) \\
&{}  \left(\leftA_{1}\cap A_{2}\right+\leftA_{1}\cap A_{3}\right+\ldots\leftA_{n1}\cap A_{n}\right\right) \\
&{} + \ldots \\
&{} + \left(1\right)^{n1}\left(\leftA_{1}\cap A_{2}\cap A_{3}\cap\ldots\cap A_{n}\right\right).
\end{align}
De Morgan's laws
Augustus De Morgan stated two laws about sets.
If A and B are any two sets then,
The complement of A union B equals the complement of A intersected with the complement of B.
The complement of A intersected with B is equal to the complement of A union to the complement of B.
See also
Notes
External links