Complement (set theory)
In set theory, the complement of a set A refers to elements not in A.
When all sets under consideration are considered to be subsets of a given set U, the absolute complement of A is the set of elements in U but not in A.
The relative complement of A with respect to a set B, also termed the difference of sets A and B, written B \ A, is the set of elements in B but not in A.
Absolute complementEdit
DefinitionEdit
If A is a set, then the absolute complement of A (or simply the complement of A) is the set of elements not in A, within a larger set that is implicitly defined. In other words, let U be a set that contains all the elements under study; if it is no need to mention U, either because it has been previously specified, or it is obvious and unique, then the absolute complement of A is the relative complement of A in U:^{[1]}
 .
Formally:
The absolute complement of A is usually denoted by . Other notations include , , , and .^{[2]}
ExamplesEdit
 Assume that the universe is the set of integers. If A is the set of odd numbers, then the complement of A is the set of even numbers. If B is the set of multiples of 3, then the complement of B is the set of numbers congruent to 1 or 2 modulo 3 (or, in simpler terms, the integers that are not multiples of 3).
 Assume that the universe is the standard 52card deck. If the set A is the suit of spades, then the complement of A is the union of the suits of clubs, diamonds, and hearts. If the set B is the union of the suits of clubs and diamonds, then the complement of B is the union of the suits of hearts and spades.
PropertiesEdit
Let A and B be two sets in a universe U. The following identities capture important properties of absolute complements:
 De Morgan's laws:^{[3]}
 Complement laws:^{[3]}

 (this follows from the equivalence of a conditional with its contrapositive).
 Involution or double complement law:
 Relationships between relative and absolute complements:
 Relationship with set difference:
The first two complement laws above show that if A is a nonempty, proper subset of U, then {A, A^{c}} is a partition of U.
Relative complementEdit
DefinitionEdit
If A and B are sets, then the relative complement of A in B,^{[3]} also termed the set difference of B and A,^{[4]} is the set of elements in B but not in A.
The relative complement of A in B is denoted B ∖ A according to the ISO 3111 standard. It is sometimes written B − A, but this notation is ambiguous, as in some contexts it can be interpreted as the set of all elements b − a, where b is taken from B and a from A.
Formally:
ExamplesEdit
 .
 .
 If is the set of real numbers and is the set of rational numbers, then is the set of irrational numbers.
PropertiesEdit
Let A, B, and C be three sets. The following identities capture notable properties of relative complements:
 .
 .
 ,
 with the important special case demonstrating that intersection can be expressed using only the relative complement operation.
 .
 .
 .
 .
 .
 .
Complementary relationEdit
A binary relation R is defined as a subset of a product of sets X × Y. The complementary relation is the set complement of R in X × Y. The complement of relation R can be written
Often R is viewed as a logical matrix with rows representing the elements of X, and columns elements of Y. The truth of aRb corresponds to 1 in row a, column b. Producing the complementary relation to R then corresponds to switching all 1s to 0s and 0s to 1s for the logical matrix of the complement.
Together with composition of relations and converse relations, complementary relations and the algebra of sets are the elementary operations of the calculus of relations.
LaTeX notationEdit
In the LaTeX typesetting language, the command \setminus
^{[5]} is usually used for rendering a set difference symbol, which is similar to a backslash symbol. When rendered, the \setminus
command looks identical to \backslash
except that it has a little more space in front and behind the slash, akin to the LaTeX sequence \mathbin{\backslash}
. A variant \smallsetminus
is available in the amssymb package.
In programming languagesEdit
Some programming languages have sets among their builtin data structures. Such a data structure behaves as a finite set, that is it consists of a finite number of data, that are not specifically ordered, and may thus be considered as the elements of a set. In some cases, the elements are not necessary distinct, and the data structure codes multisets rather than sets. These programming languages have operators or functions for computing the complement and the set differences.
These operators may generally be applied also to data structures that are not really mathematical sets, such as ordered lists or arrays. It follows that some programming languages may have a function called "set_difference" even if they have not any data structure for sets.
See alsoEdit
NotesEdit
 ^ The set in which the complement is considered is thus implicitly mentioned in an absolute complement, and explicitly mentioned in a relative complement.
 ^ Bourbaki 1970, p. E II.6.
 ^ ^{a} ^{b} ^{c} Halmos 1960, p. 17.
 ^ Devlin 1979, p. 6.
 ^ [1] The Comprehensive LaTeX Symbol List
ReferencesEdit
 Bourbaki, N. (1970). Théorie des ensembles (in French). Paris: Hermann. ISBN 9783540340348.
 Devlin, Keith J. (1979). Fundamentals of contemporary set theory. Universitext. Springer. ISBN 0387904417. Zbl 0407.04003.
 Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate Mathematics. van Nostrand Company. Zbl 0087.04403.