In mathematics, the symmetric difference, also known as the disjunctive union, 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
For example, the symmetric difference of the sets and is .
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.
The same fact can be stated as the indicator function (which we denote here by ) of the symmetric difference being the XOR (or addition mod 2) of the indicator functions of its two arguments: or using the Iverson bracket notation .
The symmetric difference can also be expressed as the union of the two sets, minus their intersection:
In particular, ; the equality in this non-strict inclusion occurs if and only if and are disjoint sets. Furthermore, if we denote and , then and are always disjoint, so and partition . Consequently, assuming intersection and symmetric difference as primitive operations, the union of two sets can be well defined in terms of symmetric difference by the right-hand side of the equality
Taken together, we see that the power set of any set X becomes an abelian group if we use the symmetric difference as operation. (More generally, any field of sets forms a group with the symmetric difference as operation.) A group in which every element is its own inverse (or, equivalently, in which every element has order 2) is sometimes called a Boolean group; the symmetric difference provides a prototypical example of such groups. Sometimes the Boolean group is actually defined as the symmetric difference operation on a set. In the case where X has only two elements, the group thus obtained is the Klein four-group.
Equivalently, a Boolean group is an Elementary abelian 2-group. Consequently, the group induced by the symmetric difference is in fact a vector space over the field with 2 elements Z2. 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.
From the property of the inverses in a Boolean group, it follows that the symmetric difference of two repeated symmetric differences is equivalent to the repeated symmetric difference of the join of the two multisets, where for each double set both can be removed. In particular:
This implies 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.)
Intersection distributes over symmetric difference:
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:
- , where , is 's complement,'s complement, respectively, relative to any (fixed) set that contains both.
- , where is an arbitrary non-empty index set.
- If is any function and are any sets in 's codomain, then .
The symmetric difference can be defined in any Boolean algebra, by writing
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:
Evidently, this is well-defined only when each element of the union is contributed by a finite number of elements of .
Suppose is a multiset and . Then there is a formula for , the number of elements in , given solely in terms of intersections of elements of :
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. First consider a finite set S and the counting measure on subsets given by their size. Now consider two subsets of S and set their distance apart as the size of their symmetric difference. This distance is in fact a metric so that the power set on S is a metric space. If S has n elements, then the distance from the empty set to S is n, and this is the maximum distance for any pair of subsets.
If , we have: . Indeed,
Let be some measure space and let and .
Symmetric difference is measurable: .
We write iff . The relation "" is an equivalence relation on the -measurable sets.
We write iff to each there's some such that . The relation "" is a partial order on the family of subsets of .
We write iff and . The relation "" is an equivalence relationship between the subsets of .
The "symmetric closure" of is the collection of all -measurable sets that are to some . The symmetric closure of contains . If is a sub--algebra of , so is the symmetric closure of .
Hausdorff distance vs. Symmetric difference
The Hausdorff distance and the (area of the) symmetric difference are both pseudo-metrics on the set of measurable geometric shapes. However, they behave quite differently. The figure at the right shows two sequences of shapes, "Red" and "Red ∪ Green". When the Hausdorff distance between them becomes smaller, the area of the symmetric difference between them becomes larger, and vice versa. By continuing these sequences in both directions, it is possible to get two sequences such that the Hausdorff distance between them converges to 0 and the symmetric distance between them diverges, or vice versa.
- Givant, Steven; Halmos, Paul (2009). Introduction to Boolean Algebras. Springer Science & Business Media. p. 6. ISBN 978-0-387-40293-2.
- Humberstone, Lloyd (2011). The Connectives. MIT Press. p. 782. ISBN 978-0-262-01654-4.
- Rotman, Joseph J. (2010). Advanced Modern Algebra. American Mathematical Soc. p. 19. ISBN 978-0-8218-4741-1.
- Rudin, Walter (January 1, 1976). Principles of Mathematical Analysis (3rd ed.). McGraw-Hill Education. p. 306. ISBN 978-0070542358.
- Claude Flament (1963) Applications of Graph Theory to Group Structure, page 16, Prentice-Hall MR 0157785
- Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate Mathematics. van Nostrand Company. Zbl 0087.04403.