|
|
|
|
properties of symmetric difference
|
(Derivation)
|
|
|
Recall that the symmetric difference of two sets is the set
. In this entry, we list and prove some of the basic properties of .
- (commutativity of
)
, because and are commutative.
- If
, then
, because
and
.
-
, because
, and
.
-
, because
and
.
-
(hence the name symmetric difference).
Proof.
 . 
-
, because
.
- (distributivity of
over )
.
- (associativity of
)
.
Proof. Let  be a set containing  as subsets (take
 if necessary). For a given  , let
 be a function defined by
 . Associativity of  is then then same as showing that
 , since
 .
By expanding , we have
It is now easy to see that the last expression does not change if one exchanges  and  . Hence,
 and this shows that  is associative. 
Remark. All of the properties of on sets can be generalized to on Boolean algebras.
|
"properties of symmetric difference" is owned by CWoo. [ full author list (2) | owner history (1) ]
|
|
(view preamble)
Cross-references: Boolean algebras, expression, easy to see, function, necessary, subsets, associativity, proof, properties of set difference, distributivity, commutativity, properties, symmetric difference
There is 1 reference to this entry.
This is version 10 of properties of symmetric difference, born on 2004-09-18, modified 2008-05-01.
Object id is 6192, canonical name is ProofOfTheAssociativityOfTheSymmetricDifferenceOperator.
Accessed 7194 times total.
Classification:
| AMS MSC: | 03E20 (Mathematical logic and foundations :: Set theory :: Other classical set theory ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|