A − B and A ∩ B′ Are the Same — Pick Whichever Simplifies the Algebra

The identity A - B = A \cap B' is one of the first things students memorise in set operations. But memorising it is not the point — the point is using it as a translator between two ways of writing the same set, and picking the form that makes your current calculation shortest. This is a thinking-process skill, not a definition to recall.

The two forms in one line

A - B = A \cap B'.

Left side: "elements of A not in B." Right side: "elements of A and in B' (the complement of B)." Both describe the same region on any Venn diagram — the crescent of A outside B.

Since the two forms denote the same set, you can substitute one for the other inside any larger expression at any time. The question becomes: when is that substitution useful?

Rule of thumb: which form to pick

Your instincts should pull you toward the form that matches the operations you want to use.

Pick A - B when:

The problem reads "take away B from A" in natural language. The dash matches the narrative.
You are counting and the numbers suggest subtraction: |A - B| = |A| - |A \cap B|.
You want to think of set-difference as an operation with intuitive properties (non-commutative, reduces to \varnothing when B \supseteq A).

Pick A \cap B' when:

You need to apply a Boolean identity — distributivity, De Morgan's, absorption. These identities are stated in terms of \cap, \cup, and ', never in terms of -.
The expression already contains other intersections or complements, and matching the surrounding syntax lets you combine terms.
You are proving set equalities by chasing membership conditions. The \cap-' form unpacks cleanly into logical and and not.

The costly mistake is getting stuck in one form because it was the first one you learned. Mature algebra means switching fluently.

A proof that picks the right form

Claim. (A - B) \cup (A - C) = A - (B \cap C).

Attempt with - throughout. You need a distributive-like rule for - over \cup and \cap. Set difference does satisfy such rules, but they are easy to misremember and there is no textbook "list of - identities" to lean on.

Attempt with \cap-' everywhere. Rewrite using A - B = A \cap B':

(A - B) \cup (A - C) = (A \cap B') \cup (A \cap C').

Factor A out with distributivity: A \cap (B' \cup C').

By De Morgan's law, B' \cup C' = (B \cap C)', so

A \cap (B' \cup C') = A \cap (B \cap C)' = A - (B \cap C).

Three lines, each citing a standard identity. The proof is frictionless because you translated into the language where your tools live.

Why: the identities you have memorised — associativity, distributivity, De Morgan's — are all phrased in \cap, \cup, and '. Set difference is not one of the primitive operations in Boolean algebra, so operating with - means constantly translating in your head. Translate once at the start, stay in the new language, translate back at the end.

A counting problem that picks the other form

Suppose you are given |A| = 40, |B| = 25, |A \cap B| = 15, and asked for |A - B|.

Two valid approaches:

Approach 1 (using A - B directly).

|A - B| = |A| - |A \cap B| = 40 - 15 = 25.

One line. Clean.

Approach 2 (rewrite as A \cap B'). You would need the size of B' inside a universal set — which you don't have, so this approach requires introducing information the problem didn't give you. Slower.

Here, A - B is the natural form because the counting formula is built around it. The \cap-' form would make you work harder.

The thinking process, made explicit

When you see A - B in an expression, pause for half a second and ask:

Is my next move algebraic? (Am I going to apply distributivity, De Morgan's, associativity, or prove a set equality?) If yes → rewrite as A \cap B'.
Is my next move numerical or definitional? (Am I counting, applying |A - B| = |A| - |A \cap B|, or interpreting "take away"?) If yes → keep A - B.
Is the expression asking for set-builder unpacking? (Need to describe the set explicitly as \{x \mid \ldots\}.) The \cap-' form unpacks to "x \in A and x \in B'," which is easier to reason about with logical operators.

This is not a deep principle — it is a habit of matching notation to the next move. Once you have it, set identities that used to require scratch paper become visible in one read.

See both forms on the same Venn

Both forms describe the same crescent. The choice of notation is about ergonomics, not about the set.

A compact JEE example that rewards switching

Question. Simplify (A - B) \cap (A - C) into a single set difference.

Translate to \cap-':

(A \cap B') \cap (A \cap C') = A \cap A \cap B' \cap C' = A \cap (B' \cap C').

By De Morgan, B' \cap C' = (B \cup C)'. So

(A - B) \cap (A - C) = A \cap (B \cup C)' = A - (B \cup C).

The simplification is clean because you stayed in the \cap-' algebra until the very last step, then translated back. If you had tried to simplify the intersection of two differences directly, you would have been guessing identities.

Two quick sanity checks

These are worth memorising because they let you spot whether you have the translation right.

A - A = A \cap A' = \varnothing. A set minus itself is empty. ✓
A - \varnothing = A \cap \varnothing' = A \cap U = A. A set minus nothing is itself. ✓

Both identities fall out instantly from the \cap-' form. They also fall out from the - form, but you have to think about them. The \cap-' form makes them mechanical.

One-sentence rule for revision

A - B = A \cap B' is not a static definition to memorise — it is a switch you flick when the next move is algebraic (use \cap-') or numerical (use -). Fluency with both forms, not loyalty to one, is the goal.