If $A$ and $B$ are any two sets, then $A - B$ is equal to ______________.

> [!TLDR] > The set difference $A - B$ consists of all elements that belong to $A$ but do not belong to $B$; equivalently, $A - B = A \cap B^c$. ## Understanding Set Difference The operation $A - B$ (read as "$A$ minus $B$" or "the difference of $A$ and $B$") captures a simple idea: we want everything in $A$ that is *not* in $B$. Think of it as removing from $A$ all elements that happen to be in $B$. For example, if $A = \{1, 2, 3, 4\}$ and $B = \{3, 4, 5, 6\}$, then $A - B = \{1, 2\}$ because we keep only the elements $1$ and $2$ from $A$ (the elements $3$ and $4$ are discarded since they appear in $B$). ## Formal Definition and Equivalent Forms 1. **Set-builder notation**: The most direct way to express $A - B$ is $$A - B = \{x : x \in A \text{ and } x \notin B\}$$ An element qualifies for membership in $A - B$ if and only if it satisfies both conditions simultaneously. 2. **Using complement and intersection**: Since "$x \notin B$" is the same as "$x \in B^c$" (where $B^c$ denotes the complement of $B$), we can rewrite the condition as $$A - B = A \cap B^c$$ This form is particularly useful in proofs and when working with Venn diagrams, because it expresses the difference purely in terms of the fundamental operations of intersection and complementation. > [!TIP] > The notation $A \setminus B$ is also commonly used for set difference, especially in more advanced texts. Both $A - B$ and $A \setminus B$ mean exactly the same thing. 3. **Relationship with other operations**: Notice that $A - B$ is *not* the same as $B - A$. In fact, $A - B$ and $B - A$ are generally disjoint sets. Also, $A - B \subseteq A$ always holds, but $A - B$ may be empty (when $A \subseteq B$) or equal to $A$ itself (when $A$ and $B$ are disjoint). …

If A and B are any two sets, then A - B is equal t – Class 11 Mathematics

NCERT Exemplar · Q47

A

Assam AhsecShort· 1mImportance★★★★★est

92% · 121/132 Questions

🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Concept understanding — Set Difference

Set Difference

The idea in plain words

Imagine two groups of students: those who play cricket ( $A$ ) and those who play football ( $B$ ). The set difference $A - B$ (also written $A \setminus B$ ) answers one specific question: "Who plays cricket but NOT football?" You start with everything in $A$ , then remove whatever also happens to be in $B$ .

Set difference is a one-way street: $A - B$ keeps only what's uniquely in $A$ . It has nothing to do with what's uniquely in $B$ .

The precise definition

For two sets $A$ and $B$ :

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

Read as: "the set of all $x$ such that $x$ is in $A$ but $x$ is not in $B$ ."

Worked example

Let:

A = \{1, 2, 3, 4, 5\}, \qquad B = \{3, 4, 5, 6, 7\}

Step 1: Go through each element of $A$ .

Step 2: Keep it only if it is NOT also in $B$ .

$1 \in A$ , $1 \notin B$ → keep
$2 \in A$ , $2 \notin B$ → keep
$3 \in A$ , $3 \in B$ → remove
$4 \in A$ , $4 \in B$ → remove
$5 \in A$ , $5 \in B$ → remove

A - B = \{1, 2\}

Now compute the other direction:

B - A = \{6, 7\}

Notice $A - B \neq B - A$ — set difference is not commutative.

Key properties

Property	Statement
Not commutative	$A - B \neq B - A$ in general
Difference with itself	$A - A = \emptyset$
Difference with empty set	$A - \emptyset = A$ , and $\emptyset - A = \emptyset$
Difference with universal set	$U - A = A^c$ (the complement of $A$ )
Disjoint sets	If $A \cap B = \emptyset$ , then $A - B = A$

The last property is worth pausing on: if two sets share nothing in common, subtracting one from the other changes nothing — there was nothing to remove.

Set difference vs. complement — the classic mix-up

Students frequently confuse $A - B$ with $A^c$ (complement of $A$ ). The difference is what you're comparing against:

Complement $A^c$ is always relative to the universal set $U$ : everything outside $A$ .
Difference $A - B$ is relative to whatever second set you name: everything in $A$ that isn't in $B$ .

In fact, complement is just a special case: $A^c = U - A$ .

Set difference vs. symmetric difference …

Why this formula?

Let's break down the definition of a set — not as a formula to memorise, but as a fundamental idea that underpins all of mathematics.

1. What is a Set? (The Core Idea)

A set is a well-defined collection of distinct objects.

The "why" here is about clarity and precision — we need to know exactly what belongs and what does not.

Well-defined: For any object, we can say yes or no — no ambiguity.
Distinct: No duplicates — each object appears only once.

Why? Because if we couldn't decide membership, we couldn't do any logical operations. Sets are the building blocks of all mathematical structures.

2. The Key "Formula": Set-Builder Notation

The most common way to define a set is:

S = \{ x \mid P(x) \}

This reads: "S is the set of all objects $x$ such that property $P(x)$ is true."

Why does this work?

$x$ is a placeholder for any object.
$P(x)$ is a logical condition (a predicate) that is either true or false for each $x$ .
The vertical bar $\mid$ means "such that".

Example:

A = \{ n \mid n \in \mathbb{N}, n \text{ is even} \}

Here, $P(n)$ is " $n$ is a natural number and $n$ is even".

Only those $n$ that satisfy both conditions are included.

Why this form? It avoids listing infinitely many elements. It gives a rule — a decision procedure — for membership.

3. The Two Fundamental Properties (Axioms)

Every set definition relies on two intuitive truths:

(a) Extensionality — Two sets are equal if they have the same elements.

A = B \iff (\forall x)(x \in A \iff x \in B)

Why? A set is completely determined by its members. There is no other hidden property.

If you know what's inside, you know the set.

(b) Membership — The only relation is $\in$ (belongs to).

x \in S \quad \text{or} \quad x \notin S

Why? Because a set is just a container. The only question we can ask is: "Is this object inside?"

4. Why Can't We Just List Everything?

For small sets, listing works:

\{1, 2, 3\}

But for infinite sets (like all natural numbers), listing is impossible.

Set-builder notation solves this by giving a rule instead of a list.

Example:

\mathbb{N} = \{ n \mid n \text{ is a positive integer} \}

This is not a formula to memorise — it's a definition by property.

5. The "Empty Set" — Why It Exists

The empty set $\emptyset$ (or $\{\}$ ) is the set with no elements. …

Start your 14-day free trial to unlock the full solution →

The set difference $A - B$ consists of all elements that belong to $A$ but do not belong to $B$ ; equivalently, $A - B = A \cap B^c$ .

Understanding Set Difference

The operation $A - B$ (read as " $A$ minus $B$ " or "the difference of $A$ and $B$ ") captures a simple idea: we want everything in $A$ that is not in $B$ . Think of it as removing from $A$ all elements that happen to be in $B$ .

For example, if $A = \{1, 2, 3, 4\}$ and $B = \{3, 4, 5, 6\}$ , then $A - B = \{1, 2\}$ because we keep only the elements $1$ and $2$ from $A$ (the elements $3$ and $4$ are discarded since they appear in $B$ ).

Formal Definition and Equivalent Forms

Set-builder notation: The most direct way to express $A - B$ is

A - B = \{x : x \in A \text{ and } x \notin B\}

An element qualifies for membership in $A - B$ if and only if it satisfies both conditions simultaneously.

Using complement and intersection: Since " $x \notin B$ " is the same as " $x \in B^c$ " (where $B^c$ denotes the complement of $B$ ), we can rewrite the condition as

A - B = A \cap B^c

This form is particularly useful in proofs and when working with Venn diagrams, because it expresses the difference purely in terms of the fundamental operations of intersection and complementation.

Tip

The notation $A \setminus B$ is also commonly used for set difference, especially in more advanced texts. Both $A - B$ and $A \setminus B$ mean exactly the same thing.

Relationship with other operations: Notice that $A - B$ is not the same as $B - A$ . In fact, $A - B$ and $B - A$ are generally disjoint sets. Also, $A - B \subseteq A$ always holds, but $A - B$ may be empty (when $A \subseteq B$ ) or equal to $A$ itself (when $A$ and $B$ are disjoint). …

Start your 14-day free trial to unlock the full solution →

←Previous questionQ46 — If A and B are finite sets such that A ⊂ B, then n(A ∪ B) = _______.→Next questionQ48 — Power set of the set A = \1, 2\ is _______.

Q.If AAA and BBB are any two sets, then A−BA - BA−B is equal to ______________.

Understanding Set Difference

Formal Definition and Equivalent Forms

🎓Unlock everything free for 14 days

Q.If $A$ and $B$ are any two sets, then $A - B$ is equal to ______________.

Unlock everything free for 14 days