Section 5 – Complements and Powers

The difference between sets and , also known as the relative complement of in , is the set defined by

.

If we assume the existence of a universe, , such that all the sets are subsets of , then we can considerably simplify our notation. So, for instance, can simply be written as , which denotes the complement of in . Similarly, , , and so on. A quick look at a few more facts:

• ,
• ,
• 
• if and only if .

The last one is proved as follows. We prove the “if” part first. Suppose . If , then clearly . But, since , we have , which implies . Hence, . This closes the proof of the “if” part. Now, we prove the “only if” part. So, suppose . Now, if , then clearly . But, since , we have , which implies . Hence, . This closes the proof of the “only if” part, and, we are done.

The following are the well-known DeMorgan’s laws (about complements):

, and .

Let’s quickly prove the first one. Suppose belongs to the left hand side. Then, , which implies and , which implies and , which implies . This proves that the left hand side is a subset of the right hand side. We can similarly prove the right hand side is a subset of the left hand side, and this closes our proof.

Though it isn’t very apparent, but if we look carefully at the couple of problems whose proofs we did above, we note something called the principle of duality for sets. One encounters such dual principles in mathematics quite often. In this case, this dual principle is stated a follows.

Principle of duality (for sets): If in an inclusion or equation involving unions, intersections and complements of subsets of (the universe) we replace each set by its complement, interchange unions and intersections, and reverse all set-inclusions, the result is another theorem.

Using the above principle, it is easy to “derive” one of the DeMorgan’s laws from another and vice versa. In addition, DeMorgan’s laws can be extended to larger collections of sets instead of just pairs.

Here are a few exercises on complementation.

1. ,
2. if and only if ,
3. ,
4. ,
5. ,
6. .

 

We will prove the last one, leaving the remaining as exercises to the reader. Suppose belongs to the left hand side. Then, and . Now, note that if , then , which implies , which implies . If, on the other hand, , then , which implies , which implies . Hence, in either case, the left hand side is a subset of , and we are done.

We now define the symmetric difference (or Boolean sum) of two sets and as follows:

.

This is basically the set of all elements in or but not in . In other words, . Again, a few facts (involving symmetric differences) that aren’t hard to prove:

1. ,
2. ,
3. (commutativity),
4. (associativity),
5. ,
6. .

This brings us now to the axiom of powers, which basically states if is a set then there exists a set that contains all the possible subsets of as its elements.

Axiom of powers: If is a set, then there exists a set (collection) , such that if , then .

The set , described above, may be too “comprehens ive”, i.e., it may contain sets other than the subsets of . Once again, we “fix” this by applying the axiom of specification to form the new set . The set is called the power set of , and the axiom of extension, again, guarantees its uniqueness. We denote by to show the dependence of on . A few illustrative examples: , , , and so on.

Note that if is a finite set, containing elements, then the power set contains elements. The “usual” way to prove this is by either using a simple combinatorial argument or by using some algebra. The combinatorial argument is as follows. An element in either belongs to a subset of or it doesn’t: there are thus two choices; since there are elements in , the number of all possible subsets of is therefore . A more algebraic way of proving the same result is as follows. The number of subsets with elements is . So, the number of subsets of is . But, from the binomial theorem, we have . Putting , we get as our required answer.

A few elementary facts:

1. .
2. If , then .
3. .

EXERCISES:

1. Prove that .

2. Prove that .