Proving Symmetric Difference Properties of Sets

In summary, we defined the symmetric difference of two sets $A$ and $B$ as $A \triangle B = (A \setminus B) \cup (B \setminus A)$. Using this definition, we proved that if the intersection of two sets $A$ and $B$ is empty, then their symmetric difference is equal to their union. We also proved that the symmetric difference of a set with itself is equal to the empty set, and that the symmetric difference is commutative and associative. Finally, we used the distributive property to show that the intersection of a set with the symmetric difference of two other sets is equal to the symmetric difference of the intersections of the original two sets.
  • #1
evinda
Gold Member
MHB
3,836
0
Hello! (Wave)

Given the following definition:

If $A,B$ are sets, we define the set $A \triangle B =(A \setminus B) \cup (B \setminus A)$ and we call it symmetric difference of $A,B$.

I have to prove the following sentences:

  1. $A \cap B= \varnothing$, then $A \triangle B=A \cup B$
  2. $A \triangle A=\varnothing$
  3. $A \triangle B=B \triangle A$
  4. $(A \triangle B) \triangle C= A \triangle (B \triangle C)$
  5. $A \cap (B \triangle C)=(A \cap B) \triangle (A \cap C)$

That's what I have tried:

  1. Since $A \cap B=\varnothing$, $A \setminus B=A$ and $B \setminus A=B$.
    So, $A \triangle B=(A \setminus B) \cup (B \setminus A)=A \cup B$

    Can we just say it like that or do we have to prove it further?
  2. Do I have to take a $x \in A \triangle A$, or isn't it necessary? :confused:

    If so, then is it like that?

    $x \in A \triangle A \leftrightarrow x \in (A \setminus A) \cup (A \setminus A) \leftrightarrow x \in \varnothing \cup \varnothing \leftrightarrow x \in \varnothing$, that cannot be true, therefore there is no set $x$, for which $x \in A \triangle A$, so $A \triangle A=\varnothing$.
  3. $x \in A \triangle B \leftrightarrow x \in (A \setminus B) \cup (B \setminus A) \leftrightarrow x \in (A \setminus B) \lor x \in (B \setminus A) \leftrightarrow x \in (B \setminus A) \lor x \in (A \setminus B) \leftrightarrow x \in B \triangle A $

Also, how can I show the last two sentences? :confused: :confused:
 
Physics news on Phys.org
  • #2


For the third sentence, we can use the definition of symmetric difference to show that $A \triangle B = B \triangle A$:

$A \triangle B = (A \setminus B) \cup (B \setminus A)$

$= (B \setminus A) \cup (A \setminus B)$ (commutative property of union)

$= B \triangle A$ (definition of symmetric difference)

For the fourth sentence, we can use the associative property of union to show that $(A \triangle B) \triangle C = A \triangle (B \triangle C)$:

$(A \triangle B) \triangle C = ((A \setminus B) \cup (B \setminus A)) \cup C$

$= (A \setminus B) \cup ((B \setminus A) \cup C)$ (associative property of union)

$= A \triangle (B \triangle C)$ (definition of symmetric difference)

For the last sentence, we can use the distributive property of intersection over union to show that $A \cap (B \triangle C) = (A \cap B) \triangle (A \cap C)$:

$A \cap (B \triangle C) = A \cap ((B \setminus C) \cup (C \setminus B))$

$= (A \cap (B \setminus C)) \cup (A \cap (C \setminus B))$ (distributive property)

$= ((A \cap B) \setminus C) \cup ((A \cap C) \setminus B)$ (definition of set difference)

$= ((A \cap B) \cup (A \cap C)) \setminus (B \cup C)$ (distributive property)

$= (A \cap B) \triangle (A \cap C)$ (definition of symmetric difference)

Hope this helps!
 

FAQ: Proving Symmetric Difference Properties of Sets

What is the definition of symmetric difference of two sets?

The symmetric difference of two sets, A and B, is the set of elements that are in either A or B, but not in both. It is denoted by A △ B.

How do you prove that the symmetric difference of two sets is commutative?

To prove commutativity, we need to show that A △ B = B △ A. This can be done by showing that for any element x, x is in either A or B, but not both, if and only if it is in either B or A, but not both. Therefore, the symmetric difference of two sets is commutative.

What is the relationship between symmetric difference and union of two sets?

The symmetric difference of two sets, A and B, is the set of elements that are in either A or B, but not in both. In contrast, the union of two sets, A and B, is the set of all elements that are in either A or B. Therefore, the symmetric difference is a subset of the union of two sets.

How can we prove that the symmetric difference of two sets is associative?

To prove associativity, we need to show that (A △ B) △ C = A △ (B △ C). This can be done by showing that for any element x, x is in either A, B, or C, but not in two of them, if and only if it is in either A, B, or C, but not in two of them. Therefore, the symmetric difference of three sets is associative.

Can the symmetric difference of two sets be empty?

Yes, the symmetric difference of two sets can be empty if and only if the two sets are equal. This is because in order for the symmetric difference to be empty, there must be no elements that are in either A or B, but not both. This only occurs when the two sets are the same.

Similar threads

Replies
1
Views
1K
Replies
2
Views
2K
Replies
11
Views
3K
Replies
17
Views
2K
Replies
3
Views
2K
Replies
2
Views
1K
Replies
6
Views
1K
Replies
1
Views
1K
Back
Top