Set Difference — Definition, Formula & Examples

Set difference is the operation that produces a new set containing all elements that belong to one set but not to another. If you start with set

A

and remove every element that also appears in set

B

, the remaining elements form the set difference

A \setminus B

Given sets $A$ and $B$ , the set difference $A \setminus B$ (also written $A - B$ ) is defined as $\{x \mid x \in A \text{ and } x \notin B\}$ .

Key Formula

A \setminus B = \{x \mid x \in A \text{ and } x \notin B\}

Where:

$A$ = The set you start with
$B$ = The set whose elements you remove from A
$x$ = An arbitrary element being tested for membership

Worked Example

Problem: Let

A = \{1, 2, 3, 4, 5\}

and

B = \{3, 5, 7, 9\}

. Find

A \setminus B

and

B \setminus A

Find A \ B: Keep elements of

A

that are not in

B

. The elements 3 and 5 appear in both sets, so remove them from

A

A \setminus B = \{1, 2, 4\}

Find B \ A: Now keep elements of

B

that are not in

A

. The elements 7 and 9 are in

B

but not in

A

B \setminus A = \{7, 9\}

Observe order matters:

A \setminus B \neq B \setminus A

, which confirms that set difference is not commutative.

\{1, 2, 4\} \neq \{7, 9\}

Answer:

A \setminus B = \{1, 2, 4\}

and

B \setminus A = \{7, 9\}

Why It Matters

Set difference appears in database queries (SQL's EXCEPT operator), probability calculations where you subtract overlapping events, and programming when filtering collections. In discrete mathematics courses, it is essential for proving subset relationships and working with partitions.

Common Mistakes

Mistake: Treating set difference as commutative, assuming

A \setminus B = B \setminus A

Correction: Set difference depends on which set comes first.

A \setminus B

removes

B

's elements from

A

, while

B \setminus A

removes

A

's elements from

B

. These generally produce different results.