Loading AI tools
Set of the elements not in a given subset From Wikipedia, the free encyclopedia
In set theory, the complement of a set A, often denoted by (or A′),[1] is the set of elements not in A.[2]
When all elements in the universe, i.e. all elements under consideration, are considered to be members of a given set U, the absolute complement of A is the set of elements in U that are not in A.
The relative complement of A with respect to a set B, also termed the set difference of B and A, written is the set of elements in B 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]
The absolute complement of A is usually denoted by . Other notations include [2] [4]
Let A and B be two sets in a universe U. The following identities capture important properties of absolute complements:
Complement laws:[5]
Involution or double complement law:
Relationships between relative and absolute complements:
Relationship with a set difference:
The first two complement laws above show that if A is a non-empty, proper subset of U, then {A, A∁} is a partition of U.
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.
The relative complement of A in B is denoted according to the ISO 31-11 standard. It is sometimes written but this notation is ambiguous, as in some contexts (for example, Minkowski set operations in functional analysis) it can be interpreted as the set of all elements where b is taken from B and a from A.
Formally:
Let A, B, and C be three sets in a universe U. The following identities capture notable properties of relative complements:
A binary relation is defined as a subset of a product of sets The complementary relation is the set complement of in The complement of relation can be written Here, is often viewed as a logical matrix with rows representing the elements of and columns elements of The truth of corresponds to 1 in row column Producing the complementary relation to 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.
In the LaTeX typesetting language, the command \setminus
[7] 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, but this symbol is not included separately in Unicode. The symbol (as opposed to ) is produced by \complement
. (It corresponds to the Unicode symbol U+2201 ∁ COMPLEMENT.)
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.