Complement (set theory)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In set theory, the complement of a set , often denoted by A^c (or ), is the set of elements not in . When all elements in the universe, i.e. all elements under consideration, are considered to be members of a given set , the absolute complement of is the set of elements in that are not in . The relative complement of with respect to a set , also termed the set difference of and , written B \setminus A, is the set of elements in that are not in .

In set theory, the complement of a set , often denoted by A^c (or ), is the set of elements not in . When all elements in the universe, i.e. all elements under consideration, are considered to be members of a given set , the absolute complement of is the set of elements in that are not in . The relative complement of with respect to a set , also termed the set difference of and , written B \setminus A, is the set of elements in that are not in . A^c= U \setminus A = \{ x \in U : x \notin A \}. The absolute complement of is usually denoted by A^c .

Other notations include \overline A , A', \complement_U A, \text{ and } \complement A. \left(A \cup B \right)^c= A^c \cap B^c. \left(A \cap B \right)^c = A^c \cup B^c. Complement laws: A \cup A^c = U. A \cap A^c = \empty . \empty^c = U. U^c = \empty. \text{If }A\subseteq B\text{, then }B^c \subseteq A^c. (this follows from the equivalence of a conditional with its contrapositive). Involution or double complement law: \left(A^c\right)^c = A. Relationships between relative and absolute complements: A \setminus B = A \cap B^c.

(A \setminus B)^c = A^c \cup B = A^c \cup (B \cap A). Relationship with a set difference: A^c \setminus B^c = B \setminus A. The first two complement laws above show that if is a non-empty, proper subset of , then is a partition of . B \setminus A = \{ x\in B : x \notin A \}. \{ 1, 2, 3\} \setminus \{ 2,3,4\} = \{ 1 \}. \{ 2, 3, 4 \} \setminus \{ 1,2,3 \} = \{ 4 \} . If \mathbb{R} is the set of real numbers and \mathbb{Q} is the set of rational numbers, then \mathbb{R}\setminus\mathbb{Q} is the set of irrational numbers.

C \setminus (A \cap B) = (C \setminus A) \cup (C \setminus B). C \setminus (A \cup B) = (C \setminus A) \cap (C \setminus B). C \setminus (B \setminus A) = (C \cap A) \cup (C \setminus B), with the important special case C \setminus (C \setminus A) = (C \cap A) demonstrating that intersection can be expressed using only the relative complement operation. (B \setminus A) \cap C = (B \cap C) \setminus A = B \cap (C \setminus A). (B \setminus A) \cup C = (B \cup C) \setminus (A \setminus C). A \setminus A = \emptyset. \empty \setminus A = \empty.

A \setminus \empty = A. A \setminus U = \empty. If A\subset B , then C\setminus A\supset C\setminus B . A \supseteq B \setminus C is equivalent to C \supseteq B \setminus A . \bar{R} \ = \ (X \times Y) \setminus R. Here, R is often 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.

External links

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376636821 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.