Given $L = \{1, 2, 3, 4\}$, $M = \{3, 4, 5, 6\}$ and $N = \{1, 3, 5\}$. Verify that $L - (M \cup N) = (L - M) \cap (L - N)$.

Given L = \1, 2, 3, 4\, M = \3, 4, 5, 6\ and N = \ – Class 11 Mathematics

NCERT Exemplar · Q5

L = \{1, 2, 3, 4\}

Punjab PsebShort· 2mImportance★★★★★est

60% · 79/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 →

Set difference distributes over union: removing the union of two sets is the same as intersecting what remains after removing each separately. Both sides yield $\{2\}$ .

The question asks us to verify a fundamental identity in set theory: the relationship between set difference and union. This is one of De Morgan's laws for set difference, and it captures a simple intuition: if we want to remove from $L$ everything that belongs to either $M$ or $N$ , we're left with only those elements that survive removal from both sets individually.

Think of it this way: an element stays in $L - (M \cup N)$ if it's in $L$ but not in the combined pool of $M$ and $N$ . That's exactly the same as saying it must be in $L$ , not in $M$ , and not in $N$ — which is precisely $(L - M) \cap (L - N)$ .

Let's compute both sides and verify they match.

Left-hand side: $L - (M \cup N)$

Find $M \cup N$ The union collects all elements appearing in either set:

M \cup N = \{3, 4, 5, 6\} \cup \{1, 3, 5\} = \{1, 3, 4, 5, 6\}

Compute $L - (M \cup N)$ Remove from $L$ every element that appears in $M \cup N$ :

L - (M \cup N) = \{1, 2, 3, 4\} - \{1, 3, 4, 5, 6\}

Going through $L$ element by element:

$1 \in M \cup N$ → remove
$2 \notin M \cup N$ → keep
$3 \in M \cup N$ → remove
$4 \in M \cup N$ → remove

So $L - (M \cup N) = \{2\}$ .

Right-hand side: $(L - M) \cap (L - N)$

Compute $L - M$ Remove from $L$ every element in $M$ :

L - M = \{1, 2, 3, 4\} - \{3, 4, 5, 6\} = \{1, 2\}

(We keep $1$ and $2$ because they're not in $M$ .)

Compute $L - N$ …

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

←Previous questionQ4 — State which of the following statements are true and which are false. …→Next questionQ6 — If A and B are subsets of the universal set U, then show that (i) A ⊂ …

Q.Given L={1,2,3,4}L = \{1, 2, 3, 4\}L={1,2,3,4}, M={3,4,5,6}M = \{3, 4, 5, 6\}M={3,4,5,6} and N={1,3,5}N = \{1, 3, 5\}N={1,3,5}. Verify that L−(M∪N)=(L−M)∩(L−N)L - (M \cup N) = (L - M) \cap (L - N)L−(M∪N)=(L−M)∩(L−N).

Left-hand side: L−(M∪N)L - (M \cup N)L−(M∪N)

Right-hand side: (L−M)∩(L−N)(L - M) \cap (L - N)(L−M)∩(L−N)

🎓Unlock everything free for 14 days

Q.Given $L = \{1, 2, 3, 4\}$ , $M = \{3, 4, 5, 6\}$ and $N = \{1, 3, 5\}$ . Verify that $L - (M \cup N) = (L - M) \cap (L - N)$ .

Left-hand side: $L - (M \cup N)$

Right-hand side: $(L - M) \cap (L - N)$

Unlock everything free for 14 days