Complementation — Definition, Formula & Examples

Complementation is the operation of finding the complement of a set — that is, collecting every element in the universal set that does not belong to the given set.

Given a universal set $U$ and a subset $A \subseteq U$ , complementation is the unary operation that maps $A$ to the set $A' = \{x \in U : x \notin A\}$ , containing exactly those elements of $U$ not in $A$ .

Key Formula

A' = U \setminus A = \{x \in U : x \notin A\}

Where:

$A'$ = The complement of set A
$U$ = The universal set containing all elements under discussion
$A$ = The given subset of U

How It Works

To perform complementation, start with a clearly defined universal set

U

and a subset

A

. Remove every element that belongs to

A

from

U

. The remaining elements form the complement

A'

. A key property is that

A

and

A'

together partition the universal set:

A \cup A' = U

and

A \cap A' = \varnothing

. Complementation applied twice returns the original set:

(A')' = A

Worked Example

Problem: Let

U = \{1, 2, 3, 4, 5, 6, 7, 8\}

and

A = \{2, 4, 6, 8\}

. Find the complement of

A

Identify elements not in A: Compare each element of U against A. The elements 1, 3, 5, and 7 are in U but not in A.

A' = \{1, 3, 5, 7\}

Verify the partition property: Check that A and A' together cover U with no overlap.

A \cup A' = \{1,2,3,4,5,6,7,8\} = U, \quad A \cap A' = \varnothing

Answer:

A' = \{1, 3, 5, 7\}

Why It Matters

Complementation is essential in probability, where

P(A') = 1 - P(A)

lets you calculate the chance of an event not happening. It also appears in logic (negation), database queries, and De Morgan's Laws, which connect complements with unions and intersections.

Common Mistakes

Mistake: Finding the complement without specifying or considering the universal set.

Correction: The complement depends entirely on what U is. The same set A can have different complements under different universal sets. Always define U first.