Complement (set theory)

In set theory, the complement of a set A, often denoted by Ac (or A),[1] are the elements not in A.[2]

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 that are not in A.

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 there 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:[3]

Let A and B be two sets in a universe U. The following identities capture important properties of absolute complements:

If A and B are sets, then the relative complement of A in B,[5] also termed the set difference of B and A,[6] is the set of elements in B but not in A.

Let A, B, and C be three sets. The following identities capture notable properties of relative complements:

Together with composition of relations and converse relations, complementary relations and the algebra of sets are the elementary operations of the calculus of relations.

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 do not have any data structure for sets.