Imagine you and your friend both make a list of your favorite snacks. Now, you decide to keep only the snacks that you like but your friend doesn’t. So you remove everything common and keep only what’s uniquely yours. That leftover list is exactly what mathematics calls the difference of sets. In set theory and discrete mathematics, the difference of sets is an important set operation that helps us subtract one set from another to find elements that belong to one set but not the other. It is widely used in Venn diagrams, probability, logic, and data filtering problems. In this article, we’ll clearly cover the definition, notation, formula, properties, and step-by-step examples of set difference, so you can understand the concept easily and solve exam questions with confidence.
This Story also Contains
In set theory and discrete mathematics, the difference of sets is one of the most important set operations used to remove or exclude elements from a group. While union combines elements and intersection finds common elements, the set difference operation focuses on identifying elements that belong to one set but not to another.
The difference of two sets $A$ and $B$ (in that order) refers to the set of elements that are present in $A$ but not in $B$. In simple words, we subtract the elements of $B$ from $A$.
Symbolically, this is written as $A - B$, which is read as “A minus B”.
Mathematically, the set difference is defined as $A - B = {x : x \in A \text{ and } x \notin B}$, meaning the result contains only those elements that belong to $A$ and not to $B$.
Practising examples helps you clearly understand how set subtraction works in real problems.
Let $A = \{1, 2, 3, 4\}$ and $B = \{4, 5, 6, 8\}$.
Then $A - B = \{1, 2, 3\}$, which are elements in $A$ but not in $B$, and $B - A = \{5, 6, 8\}$, which are elements in $B$ but not in $A$.
Let $A = \{\text{blue, violet, green, yellow, black, white, red}\}$ and $B = \{\text{black, blue, red, grey, brown}\}$.
Then $A - B = \{\text{violet, green, yellow, white}\}$ and $B - A = \{\text{grey, brown}\}$.
This example shows how the difference operation removes shared items.
Let $A = \{x : x \in \mathbb{N} \text{ and } x \leq 9\}$ and $B$ be the set of integers greater than $-5$ and less than or equal to $5$.
So $A = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}$ and $B = \{-4, -3, -2, -1, 0, 1, 2, 3, 4, 5\}$.
Then $A - B = \{6, 7, 8, 9\}$ and $B - A = \{-4, -3, -2, -1, 0\}$.
Let $A$ be the set of all even natural numbers less than $10$ and $B = \{2, 4, 6, 8\}$.
Since both sets are equal, $A - B = \phi$ and $B - A = \phi$.
This shows that when two sets are identical, their difference is always the empty set.
These difference of sets examples clearly demonstrate how to subtract elements from one set based on their presence in another set. In every case, only the non-common or unique elements remain in the final result.
To find the difference between two sets, follow this systematic method:
Step 1: Write the given sets clearly in roster or set-builder form.
Step 2: Check the order carefully, because $A - B$ and $B - A$ give different results.
Step 3: Find the common elements using the intersection $A \cap B$.
Step 4: Remove these common elements from the first set.
Step 5: The remaining elements form the difference set. Hence, $A - B$ contains only elements that belong to $A$ but not to $B$.
The difference of sets Venn diagram visually represents the elements that belong to one set but not to another. When we write $A - B$, it means we are looking for all the elements in Set $A$ that are not present in Set $B$.
This concept is best understood with the help of a Venn diagram, where overlapping areas show common elements, and the shaded part represents the set difference.
Example Using Venn Diagram:
Let $A = \{1, 2, 3, 4\}$ and $B = \{4, 5, 6, 8\}$.
From the Venn diagram:

Thus, the Venn diagram for the difference of sets clearly shows how the common element is excluded from the result, helping learners visually understand the subtraction between sets.
Understanding the properties of difference of sets in mathematics helps clarify how this operation behaves under different conditions. These properties are useful in solving problems related to set operations, Venn diagrams, and logical reasoning.
Here are the key properties of set difference:
The symmetric difference of sets refers to the set of elements that belong to either set $A$ or set $B$ but not to both. In other words, it excludes the common elements.
The symmetric difference of two sets $A$ and $B$ is defined as:
$A \Delta B = (A - B) \cup (B - A)$
Alternatively, it can also be represented as:
$A \Delta B = (A \cup B) - (A \cap B)$
This operation is useful in identifying non-overlapping elements between sets and is commonly applied in data filtering, logic circuits, and set-based problem-solving.
To find the symmetric difference between two sets, follow these simple steps:
Example 1:
Let $A = \{1, 2, 3, 4\}$ and $B = \{4, 5, 6, 8\}$
Then:
$A - B = \{1, 2, 3\}$,
$B - A = \{5, 6, 8\}$
So, $A \Delta B = \{1, 2, 3, 5, 6, 8\}$
Example 2:
Let $A = \{\text{blue, violet, green, yellow, black, white, red}\}$
and $B = \{\text{black, blue, red, grey, brown}\}$
Then:
$A - B = \{\text{violet, green, yellow, white}\}$
$B - A = \{\text{grey, brown}\}$
So, $A \Delta B = \{\text{violet, green, yellow, white, grey, brown}\}$
Example 3:
Let $A = \{x \in \mathbb{N} \mid x \leq 10\}$
Let $B$ = set of all integers greater than $-5$ and less than or equal to $5$
Now,
$A = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}$
$B = \{-4, -3, -2, -1, 0, 1, 2, 3, 4, 5\}$
Then:
$A - B = \{6, 7, 8, 9\}$
$B - A = \{-4, -3, -2, -1, 0\}$
So, $A \Delta B = \{6, 7, 8, 9, -4, -3, -2, -1, 0\}$
Example 4:
Let $A$ = set of all even natural numbers less than $10$
Let $B = {2, 4, 6, 8}$
Then:
$A = {2, 4, 6, 8}$, $B = {2, 4, 6, 8}$
$A - B = \phi$, $B - A = \phi$
So, $A \Delta B = \phi$
The symmetric difference of sets Venn diagram shows the regions of both sets $A$ and $B$ excluding their intersection. The shaded areas represent elements that are either in $A$ or in $B$, but not in both.
For instance, let $A = \{1, 2, 3, 4\}$ and $B = \{4, 5, 6, 8\}$
Then:
The Venn diagram will shade only the non-overlapping parts of the two circles, clearly illustrating the symmetric difference.

In set theory and discrete mathematics, the three most important set operations are union, intersection, and difference. These operations work together to help us combine sets, find common elements, or remove unwanted elements.
Think of them like three tools:
Union → combines everything
Intersection → keeps only common parts
Difference → removes common parts
Understanding the relationship between union, intersection, and difference of sets is essential for solving Venn diagram questions, probability problems, logical reasoning, and data classification tasks.
In set theory and discrete mathematics, the difference of sets removes common elements, while the symmetric difference keeps only the non-common elements from both sets. These operations are closely connected to union and intersection, so learning their formulas helps you simplify problems faster.

Here’s a clear summary table.
| Concept | Formula | Meaning |
|---|---|---|
| Difference of Sets | $A - B$ | Elements in $A$ but not in $B$ |
| Set Builder Form | $A - B = \{x : x \in A \text{ and } x \notin B\}$ | Formal definition |
| Using Complement | $A - B = A \cap B'$ | Difference via complement |
| Reverse Difference | $B - A = B \cap A'$ | Elements only in $B$ |
| Complement of Difference | $(A - B)' = A' \cup B$ | De Morgan–type relation |
| Difference with Empty Set | $A - \phi = A$ | Nothing removed |
| Empty Difference | $A - A = \phi$ | Removing everything gives empty set |
| Subset Case | If $A \subseteq B$, then $A - B = \phi$ | No unique elements |
| Concept | Formula | Meaning |
|---|---|---|
| Symmetric Difference | $A \triangle B$ | Elements in exactly one set |
| Definition Form | $A \triangle B = (A - B) \cup (B - A)$ | Combine unique parts |
| Using Union & Intersection | $A \triangle B = (A \cup B) - (A \cap B)$ | Remove common part |
| Alternative Form | $A \triangle B = (A \cup B) \cap (A \cap B)'$ | Complement method |
| Commutative Law | $A \triangle B = B \triangle A$ | Order doesn’t matter |
| Identity Law | $A \triangle \phi = A$ | With empty set |
| Self Difference | $A \triangle A = \phi$ | Same sets cancel out |
Example 1: If $\mathbf{A}, \mathbf{B}$, and $\mathbf{C}$ are non-empty sets, then $(A-B) \cup(B-A)$
1) $(A \cup B)-B$
2) $A-(A \cap B)$
3) $(A \cup B)-(A \cap B)$
4) $(A \cap B) \cup(A \cup B)$
Solution:
Clearly, as the sets in the question and in the third option, both equal the symmetric difference of $A$ and $B$, so both these are equal.
$(A-B) \cup(B-A)=(A \cup B)-(A \cap B)$
Hence, the answer is the option 3.
Example 2: If $\mathrm{A}, \mathrm{B}, \mathrm{C}$ are any three sets,then $A-(B \cup C)$ is equal to?
Option 1) $(A-B) \cup(A-C)$
Option 2) $(A-B) \cap(A-C)$
Option 3) $(A-B) \cup C$
Option 4) $(A-B) \cap C$
Solution:
The difference of the sets $A$ and $B$ in this order is the set of elements which belong to $A$ but not to $B$ wherein Symbolically, we write A - B and read as "A minus B".
According to De Morgan's laws
$A-(B \cup C)=(A-B) \cap(A-C)$
Hence the answer is option 2.
Example 3: Let $\mathrm{A}, \mathrm{B}$, and $\mathbf{C}$ be sets such that $\phi \neq A \cap B \subseteq C$. Then which of the following statements is not true?
1) $B \cap C \neq \phi$
2) If $(A-B) \subseteq C$, then $A \subseteq C$
3) $(C \cup A) \cap(C \cup B)=C$
4) If $(A-C) \subseteq B$, then $A \subseteq B$
Solution:
$ \begin{aligned} & \text { As }(A \cap B) \subseteq C \\ & \Rightarrow(A \cap B) \subseteq(B \cap C) \\ & \text { as }(A \cap B) \neq \phi_{\Rightarrow}(B \cap C) \neq \phi \end{aligned} $
So, option (1) is true
Let $x \in A$ and $x \notin B \Rightarrow x \epsilon(A-B)_{\Rightarrow} \Rightarrow x \epsilon C$ let $x \in A$ and $x \epsilon B \Rightarrow x \epsilon(A \cap B) \Rightarrow x \epsilon C$ Hence $x \in A$ and $x \in C \Rightarrow A \subseteq C$ So, option (2) is true.
Let $\begin{aligned} & x \in C, x \in(C \cup A) \cap(C \cup B)) \\ & =>x \epsilon(C \cup A) \text { and } x \epsilon(C \cup B)) \\ & (x \in C \text { or } x \in A) \text { and }(x \in C \text { or } x \in B) \\ & =>x \epsilon C \text { or } x \epsilon(A \cap B) \\ & =>x \epsilon C \quad A s, A \cup B \subseteq C\end{aligned}$
$\begin{aligned} &(C \cup A) \cap(C \cup B) \subseteq C.......\text { (1) } \end{aligned}$
Now,$ \begin{aligned} & =>x \epsilon C \\ & =>x \epsilon(C \cup A) \cap(C \cup B) \\ & =>C \subseteq(C \cup A) \cap(C \cup B) ......(2) \end{aligned} $
From (1) and (2
$(C \cup A) \cap(C \cup B)=C$
=> Option (3) is correct.
For $\mathrm{A}=\mathrm{c}, A-C=\phi$
$=>\phi \subseteq B \text { but }=>A \nsubseteq B$
So, option (4) is not true.
Example 4: If $A \subset B$, then $A-B=$
1) A
2) B
3) $A \cap B$
4) $\phi$
Solution:
If A is subset of B , then Venn diagram looks something like this:

![]()
![]()
Clearly, $\mathrm{A}-\mathrm{B}=\phi$, as all elements of A are present in B.
To fully understand the difference of sets, it's important to explore related concepts in set theory. This section lists key topics that build the foundation for mastering set operations and their applications.
Explore essential NCERT study resources for Class 11 Sets, including detailed solutions, clear revision notes, and carefully selected exemplar problems. These materials are designed to strengthen your understanding and help you prepare confidently for board exams and competitive tests.
NCERT Solutions for Class 11 Chapter 1 Sets
Regular practice is key to mastering the difference of sets and its related operations. Below, you'll find a set of practice questions designed to test your understanding of definitions, formulas, properties, and real-world applications of set difference. Use these exercises to build accuracy and confidence.
Practice Here: Difference Of Set - Practice Question MCQ
You can practice the next topics of Sets below:
Complement Of A Set Law Of Complement Property Of Complement - Practice Question MCQ |
Ordered Pair Cartesian Product Of Two Sets - Practice Question MCQ |
Frequently Asked Questions (FAQs)
The difference of set definition is, $A-B$ in this order is the set of elements that belong to $A$ but not to $B$.
The intersection of any two of these sets is the null set is called a disjoint set.
The symmetric difference of two sets $A$ and $B$ is defined as
$A \Delta B=(A-B) \cup(B-A)$. The symmetric difference of set A and B can also represented as $A Δ B = ( A ∪ B) - ( A ∩ B )$
The set difference of set A with null set is $A-\{\} = A$.
No, $A-B$ is not equal to $B-A$.