# Complement (set theory)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In set theory, a complement of a set A refers to things not in (that is, things outside of), A. The relative complement of A with respect to a set B, is the set of elements in B but 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 all elements in U but not in A.

## Relative complement

If A and B are sets, then the relative complement of A in B, also termed the set-theoretic difference of B and A, is the set of elements in B, but not in A.

The relative complement of A (left circle) in B (right circle):
${\displaystyle A^{c}\cap B~~~~=~~~~B\smallsetminus A}$

The relative complement of A in B is denoted BA according to the ISO 31-11 standard (sometimes written BA, but this notation is ambiguous, as in some contexts it can be interpreted as the set of all ba, where b is taken from B and a from A).

Formally

${\displaystyle B\smallsetminus A=\{x\in B\,|\,x\notin A\}.}$

Examples:

The following lists some notable properties of relative complements in relation to the set-theoretic operations of union and intersection.

If A, B, and C are sets, then the following identities hold:

• C ∖ (A ∩ B)  =  (C ∖ A)∪(C ∖ B)
• C ∖ (A ∪ B)  =  (C ∖ A)∩(C ∖ B)
• C ∖ (B ∖ A)  =  (A ∩ C)∪(C ∖ B)
• (B ∖ A) ∩ C  =  (B ∩ C) ∖ A  =  B∩(C ∖ A)
• (B ∖ A) ∪ C  =  (B ∪ C) ∖ (A ∖ C)
• A ∖ A  =  Ø
• Ø ∖ A  =  Ø
• A ∖ Ø  =  A

If a universe U is defined, then the relative complement of A in U is called the absolute complement (or simply complement) of A, and is denoted by Ac or sometimes A′, also the same set often{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} is denoted by ${\displaystyle \complement _{U}A}$ or ${\displaystyle \complement A}$ if U is fixed, that is: Ac = U ∖ A. For example, if the universe is the set of integers, then the complement of the set of odd numbers is the set of even numbers. The following lists some important properties of absolute complements in relation to the set-theoretic operations of union and intersection. If A and B are subsets of a universe U, then the following identities hold: De Morgan's laws: Complement laws: Involution or double complement law: Relationships between relative and absolute complements: • A ∖ B = A ∩ Bc • (A ∖ B)c = Ac ∪ B The first two complement laws above shows that if A is a non-empty, proper subset of U, then {A, Ac} is a partition of U. ## Notation In the LaTeX typesetting language, the command \setminus 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. ## Complements in various programming languages Some programming languages allow for manipulation of sets as data structures, using these operators or functions to construct the difference of sets a and b: SQL  SELECT * FROM A MINUS SELECT * FROM B Mathematica Complement[1] MATLAB setdiff[2] MathML <apply xmlns="http://www.w3.org/1998/Math/MathML"> <setdiff/> <ci type="set">A</ci> <ci type="set">B</ci></apply> Pascal SetDifference := a - b; Python diff = a.difference(b)[3] diff = a - b[3] Java diff = a.clone();   diff.removeAll(b);[4] Scala diff = a -- b[5] C++ set_difference(a.begin(), a.end(), b.begin(), b.end(), result.begin()); .NET Framework a.Except(b); Haskell a \\ b [6] Common Lisp set-difference, nset-difference[7] OCaml Set.S.diff[8] Unix shell comm -23 a b[9] grep -vf b a # less efficient, but works with small unsorted sets PHP array_diff($a, $b);[10] R setdiff[11] Ruby diff = a - b[12] Perl #for perl version >= 5.10 @a = grep {not$_ ~~ @b} @a;
Prolog
a(X),\+ b(X).