Show that for any sets A and B, A = (A ∩ B) ∪ (A – B) and A ∪ (B – A) = (A ∪ B)

To Prove,

A = (A ∩ B) ∪ (A – B)

Proof: Let x ∈ A

To show,

X ∈ (A ∩ B) ∪ (A – B)

In Case I,

X ∈ (A ∩ B)

⇒ X ∈ (A ∩ B) ⊂ (A ∪ B) ∪ (A – B)

In Case II,

X ∉A ∩ B

⇒ X ∉ B or X ∉ A

⇒ X ∉ B (X ∉ A)

⇒ X ∉ A – B ⊂ (A ∪ B) ∪ (A – B)

A ⊂ (A ∩ B) ∪ (A – B) ................(i)

It can be concluded that, A ∩ B ⊂ A and (A – B) ⊂ A

Thus, (A ∩ B) ∪ (A – B) ⊂ A .........(ii)

Equating (i) and (ii),

A = (A ∩ B) ∪ (A – B)

We also have to show,

A ∪ (B – A) ⊂ A ∪ B

Let us assume,

X ∈ A ∪ (B – A)

X ∈ A or X ∈ (B – A)

⇒ X ∈ A or (X ∈ B and X ∉A)

⇒ (X ∈ A or X ∈ B) and (X ∈ A and X ∉A)

⇒ X ∈ (B ∪A)

A ∪ (B – A) ⊂ (A ∪ B) ................ (iii)

According to the question,

To prove:

(A ∪ B) ⊂ A ∪ (B – A)

Let y ∈ A∪B

Y ∈ A or y ∈ B

(y ∈ A or y ∈ B) and (X ∈ A and X ∉A)

⇒ y ∈ A or (y ∈ B and y ∉A)

⇒ y ∈ A ∪ (B – A)

Thus, A ∪ B ⊂ A ∪ (B – A) ............... (iv)

From equations (iii) and (iv), we get:

A ∪ (B – A) = A ∪ B