Exercise 3.1.9

Let A, B, X be sets such that A ∪ B = X and A ∩ B = ∅. Show that A = X ∖ B and B = X ∖ A.

Answers

Proof.

1.
(A = X ∖ B) By Exercise 3.1.4 it suffices to show that A ⊆ X ∖ B and vice versa.

A ⊆ X ∖ B

Let x ∈ A be arbitrary. We have x ∈ A ∪ B by Axiom 3.4. Since x ∈ A ∪ B, we have x ∈ X by theorem assumption.
Since x ∈ A, we have x∉B since A ∩ B = ∅ (if x ∈ B, we would have x ∈ A ∩ B, which would contradict A ∩ B = ∅).
Since x ∈ X, x∉B, we have x ∈ X ∖ B.

X ∖ B ⊆ A

Let x ∈ X ∖ B be arbitrary. By the definition of the set difference, we have x ∈ X and x∉B.
Since x ∈ X, by theorem assumption we have x ∈ A ∪ B. by Axiom 3.4 this means that x ∈ A or x ∈ B. But x ∈ B is false, and therefore, x ∈ A. Thus, we’re done.

2.
(B = X ∖ A) By Exercise 3.1.4 it suffices to show that B ⊆ X ∖ A and vice versa.

B ⊆ X ∖ A

Let x ∈ B be arbitrary. We have x ∈ A ∪ B by Axiom 3.4. Since x ∈ A ∪ B, we have x ∈ X by theorem assumption.
Since x ∈ B, we have x∉A since A ∩ B = ∅ (if x ∈ A, we would have x ∈ A ∩ B, which would contradict that A ∩ B = ∅).
Since x ∈ X, x∉A, we have x ∈ X ∖ A. Since x ∈ B implies x ∈ X ∖ A, we have B ⊆ X ∖ A.

X ∖ A ⊆ B

Let x ∈ X ∖ A be arbitrary. By the definition of the set difference, we have x ∈ X and x∉A.
Since x ∈ X, by theorem assumption we have x ∈ A ∪ B. by Axiom 3.4 this means that x ∈ A or x ∈ B. But x ∈ A is false, and therefore, x ∈ B. Thus, we’re done.

□
User profile picture
2022-08-27 09:18
Comments