Set Theory And Foundations Codexery

Complement (set theory)

Set of elements not in a given set.

In set theory, the complement of a set A, often denoted by A^c (or A′), is the set of elements not in A. When all elements under consideration belong to a given universal 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 B, also called the set difference of B and A, written B ∖ A, is the set of elements in B that are not in A.

field
Set theory
known_for
Definition of absolute and relative complements, De Morgan's laws, complement laws, involution law

Lore & Background

The absolute complement of a set A, denoted A^c, is defined as U ∖ A = {x ∈ U : x ∉ A}, where U is the universal set containing all elements under study. Other notations include A̅, A′, ∁_U A, and ∁ A. For example, if the universe is the integers and A is the set of odd numbers, then the complement of A is the set of even numbers. If the universe is a standard 52-card deck and A is the suit of spades, then the complement of A is the union of clubs, diamonds, and hearts.

Reader's Guide

The complement operation is fundamental in set theory, providing a way to express negation. Key properties include De Morgan's laws: (A ∪ B)^c = A^c ∩ B^c and (A ∩ B)^c = A^c ∪ B^c. Complement laws state A ∪ A^c = U, A ∩ A^c = ∅, ∅^c = U, U^c = ∅, and if A ⊆ B then B^c ⊆ A^c. The double complement law gives (A^c)^c = A. The relative complement B ∖ A = {x ∈ B : x ∉ A} relates to absolute complement via A ∖ B = A ∩ B^c. These identities are essential for manipulating set expressions and form the basis for Boolean algebra and logic.

Did You Know?

More in Set Theory And Foundations 1-20

Spotted an error? Know more?

This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record

Comments

Loading…
Open in the interactive codex →