Symmetric difference

Venn diagram of $~A\triangle B$ The symmetric difference is the union without the intersection: $~\setminus ~$ $~=~$

In mathematics, the symmetric difference of two sets is the set of elements which are in either of the sets and not in their intersection. The symmetric difference of the sets A and B is commonly denoted by

$A\,\triangle \,B\,$

or

$A\ominus B.$

For example, the symmetric difference of the sets $\{1,2,3\}$ and $\{3,4\}$ is $\{1,2,4\}$. The symmetric difference of the set of all students and the set of all females consists of all male students together with all female non-students.

The power set of any set becomes an abelian group under the operation of symmetric difference, with the empty set as the neutral element of the group and every element in this group being its own inverse. The power set of any set becomes a Boolean ring with symmetric difference as the addition of the ring and intersection as the multiplication of the ring.

Properties

Venn diagram of $~A\triangle B\triangle C$ $~\triangle ~$ $~=~$

The symmetric difference is equivalent to the union of both relative complements, that is:

$A\,\triangle \,B=(A\smallsetminus B)\cup (B\smallsetminus A),\,$

and it can also be expressed as the union of the two sets, minus their intersection:

$A\,\triangle \,B=(A\cup B)\smallsetminus (A\cap B),$

or with the XOR operation:

$A\,\triangle \,B=\{x:(x\in A)\oplus (x\in B)\}.$

In particular, $A\triangle B\subseteq A\cup B$.

The symmetric difference is commutative and associative:

$A\,\triangle \,B=B\,\triangle \,A,\,$

$(A\,\triangle \,B)\,\triangle \,C=A\,\triangle \,(B\,\triangle \,C).\,$

Thus, the repeated symmetric difference is an operation on a multiset of sets giving the set of elements which are in an odd number of sets.

The symmetric difference of two repeated symmetric differences is the repeated symmetric difference of the join of the two multisets, where for each double set both can be removed. In particular:

$(A\,\triangle \,B)\,\triangle \,(B\,\triangle \,C)=A\,\triangle \,C.\,$

This implies a sort of triangle inequality: the symmetric difference of A and C is contained in the union of the symmetric difference of A and B and that of B and C. (But note that for the diameter of the symmetric difference the triangle inequality does not hold.)

The empty set is neutral, and every set is its own inverse:

$A\,\triangle \,\varnothing =A,\,$

$A\,\triangle \,A=\varnothing .\,$

Taken together, we see that the power set of any set X becomes an abelian group if we use the symmetric difference as operation. Because every element in this group is its own inverse, this is in fact a vector space over the field with 2 elements Z₂. If X is finite, then the singletons form a basis of this vector space, and its dimension is therefore equal to the number of elements of X. This construction is used in graph theory, to define the cycle space of a graph.

Intersection distributes over symmetric difference:

$A\cap (B\,\triangle \,C)=(A\cap B)\,\triangle \,(A\cap C),$

and this shows that the power set of X becomes a ring with symmetric difference as addition and intersection as multiplication. This is the prototypical example of a Boolean ring.

Further properties of the symmetric difference:

• $A\triangle B=A^{c}\triangle B^{c}$, where $A^{c}$,$B^{c}$ is $A$'s complement,$B$'s complement, respectively, relative to any (fixed) set that contains both.
• $\left(\bigcup _{\alpha \in {\mathcal {I}}}A_{\alpha }\right)\triangle \left(\bigcup _{\alpha \in {\mathcal {I}}}B_{\alpha }\right)\subseteq \bigcup _{\alpha \in {\mathcal {I}}}\left(A_{\alpha }\triangle B_{\alpha }\right)$, where ${\mathcal {I}}$ is an arbitrary non-empty index set.

The symmetric difference can be defined in any Boolean algebra, by writing

$x\,\triangle \,y=(x\lor y)\land \lnot (x\land y)=(x\land \lnot y)\lor (y\land \lnot x)=x\oplus y.$

This operation has the same properties as the symmetric difference of sets.

n-ary symmetric difference

As above, the symmetric difference of a collection of sets contains just elements which are in an odd number of the sets in the collection:

$\triangle M=\left\{a\in \bigcup M:|\{A\in M:a\in A\}|{\mbox{ is odd}}\right\}$.

Evidently, this is well-defined only when each element of the union $\bigcup M$ is contributed by a finite number of elements of $M$.

Suppose $M=\{M_{1},M_{2},\ldots ,M_{n}\}$ is a multiset and $n\geq 2$. Then there is a formula for $|\triangle M|$, the number of elements in $\triangle M$, given solely in terms of intersections of elements of $M$:

$|\triangle M|=\sum _{l=1}^{n}(-2)^{l-1}\sum _{i_{1}\neq i_{2}\neq \ldots \neq i_{l}}|M_{i_{1}}\cap M_{i_{2}}\cap \ldots \cap M_{i_{l}}|$,

where $i_{1}\neq i_{2}\neq \ldots \neq i_{l}$ is meant to indicate that $\{i_{1},i_{2},\ldots ,i_{l}\}$ is a subset of distinct elements of $\{1,2,\ldots ,n\}$, of which there are ${\binom {n}{l}}$.

Symmetric difference on measure spaces

As long as there is a notion of "how big" a set is, the symmetric difference between two sets can be considered a measure of how "far apart" they are. Formally, if μ is a σ-finite measure defined on a σ-algebra Σ, the function,

$d(X,Y)=\mu (X\,\triangle \,Y)$

is a pseudometric on Σ. d becomes a metric if Σ is considered modulo the equivalence relation X ~ Y if and only if $\mu (X\,\triangle \,Y)=0$. The resulting metric space is separable if and only if L²(μ) is separable.

Let $S=\left(\Omega ,{\mathcal {A}},\mu \right)$ be some measure space and let $F,G\in {\mathcal {A}}$ and ${\mathcal {D}},{\mathcal {E}}\subseteq {\mathcal {A}}$.

Symmetric difference is measurable: $F\triangle G\in {\mathcal {A}}$.

We write $F=G\left[{\mathcal {A}},\mu \right]$ iff $\mu \left(F\triangle G\right)=0$. The relation "$=\left[{\mathcal {A}},\mu \right]$" is an equivalence relation on the ${\mathcal {A}}$-measurable sets.

We write ${\mathcal {D}}\subseteq {\mathcal {E}}\left[{\mathcal {A}},\mu \right]$ iff to each $D\in {\mathcal {D}}$ there's some $E\in {\mathcal {E}}$ such that $D=E\left[{\mathcal {A}},\mu \right]$. The relation "$\subseteq \left[{\mathcal {A}},\mu \right]$" is a partial order on the family of subsets of ${\mathcal {A}}$.

We write ${\mathcal {D}}={\mathcal {E}}\left[{\mathcal {A}},\mu \right]$ iff ${\mathcal {D}}\subseteq {\mathcal {E}}\left[{\mathcal {A}},\mu \right]$ and ${\mathcal {E}}\subseteq {\mathcal {D}}\left[{\mathcal {A}},\mu \right]$. The relation "$=\left[{\mathcal {A}},\mu \right]$" is an equivalence relationship between the subsets of ${\mathcal {A}}$.

The "symmetric closure" of ${\mathcal {D}}$ is the collection of all ${\mathcal {A}}$-measurable sets that are $=\left[{\mathcal {A}},\mu \right]$ to some $D\in {\mathcal {D}}$. The symmetric closure of ${\mathcal {D}}$ contains ${\mathcal {D}}$. If ${\mathcal {D}}$ is a sub-$\sigma$-algebra of ${\mathcal {A}}$, so is the symmetric closure of ${\mathcal {D}}$.

$F=G\left[{\mathcal {A}},\mu \right]$ iff $\left|\mathbf {1} _{F}-\mathbf {1} _{G}\right|=0$ $\left[{\mathcal {A}},\mu \right]$-a.e.

See also

• Algebra of sets
• Boolean function
• Difference (set theory)
• Exclusive or
• Fuzzy set

• Logical graph
• Set theory
• Symmetry

References

• Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate Mathematics. van Nostrand Company. Zbl 0087.04403.

• "Symmetric difference". PlanetMath.
• Weisstein, Eric W. "Symmetric Difference". MathWorld.
• Symmetric difference of sets. In Encyclopaedia of Mathematics