Prove that the empty set is unique.

# Set theory and logic

# Notes I: Sets and Functions: Solutions

Problem 1:

If and are two classes of sets such that , prove that and .

Answer 1:

The first part is clear as the hypothesis says the set of sets is a subset of the set of sets . So, quite clearly . For the second part, we can use the generalized De Morgan’s laws. (Note: if you try to derive it straight, you will prove exactly what is opposite of the required result :-)). For the second part note that . Using the result in the first part, that is, consider and now take the complement of both sides so we get: , that is, . QED.

Problem 2:

The difference between two sets A and B, denoted by , is the set of all elements in A and not in B, thus . Show the following:

(a).

Answer (a): is the set of elements , but not in B. Hence, , simply by definition. Again, if we consider elements in A or B or both, and then take away elements of B, we are just left with elements of A only, but not of B. That is, . QED. ps: A venn diagram may help visualize v well.

(b) TPT: (PS: a Venn diagram can help visualize and perhaps, guide the writing of the proof also).

Let , but . Then, , but , or , or not in both B and C. That is, . By reversing the argument, we get the other subset relationship. Hence, . QED.

(c) TPT: .

Answer (c): Let . That is, and . That is, . That is, , or x could be both in A and C. That is, . Simply reversing the arguments, we get the reverse subset relation. Hence, the two sets are equal. Hence, . QED.

(d) TPT: .

answer (d): let , but . Then, , or , or x is an element of both A and B, but x is not an element of C. Which clearly means, x is an element of A but not C, OR x is an element of B but not C. That is, (upon reversing the arguments, we get the other subset relations. Hence, the two sets are equal). QED.

problem (e): TPT: (once again, note that for set theoretic relations with up to three sets, venn diagrams are helpful to visualize and guide the proofs..)

answer (c): let , but not in . That is, x is an element of A, but not of B, not of C, or not both of B and C. That is, x is an element of A not of B, and x is an element of A not of C. That is, . Reversing the arguments, we get the other subset relationship. Hence, the two sets are equal. Hence, . QED.

Problem 3:

The symmetric difference of two sets A and B, denoted by , is defined by ; it is the union of the difference of two sets in opposite orders. Prove the following:

3(a) Symmetric difference is associative: .

Answer 3a: please refer a previous blog.

3(b): TPT: ; and . (this is some sort of ‘existence of additive inverse of ‘in a symmetric relation’).

Answer 3b: both results are obvious from definition.

3(c): TPT: Symmetric difference is commutative operation: .

answer 3c: By definition, LHS is , which is RHS. Hence, done.

3(d): TPT: Some sort of distributive law: .

answer 3d: Let , and also simultaneously . That is, , and . That is, . That is, . Reversing the arguments, we get the other subset relation. Hence, the two sets are equal. Hence, we can say “intersection distributes over symmetric difference.” QED.

Problem 4:

A ring of sets is a non-empty class **A** of sets such that if A and B are in **A** then is in **A** and is also in **A. **Show that **A **must contain the empty set, and . Also, show that if a non empty class of sets contains the union and difference of any pair of the sets, then it is a ring of sets. Also, prove that a Boolean algebra of sets is a ring of sets.

Answer 4(i): TPT: **A** must also contain the empty set, the set and the set . As is in **A**, so also ; now, it is already given that the ring of sets is non-empty, so it contains a non empty universal set also, call it U. We know from problem 2 in this blog that . As U exists, so does by definition and so is in **A. **Also, as exists, exists in **A**, but also exists in **A. ** QED.

Answer 4(ii): TPT: If a non empty class of sets contains the union and difference of any pair of the sets, then it is a ring of sets.

Let **A** be any non-empty class of sets. Clearly, it therefore has a non empty universal set. As , so also is contained in **A.** Hence, the complement of a set A is also in **A. **Now, , so is in **A**, that is, by De Morgan law, is in A. That is, again, is in **A**. Now, since is in **A**, hence, is in **A**, and since is in **A**, then is in **A **also. Hence, **A** is a ring of sets.

4(iii) TPT: Show that a boolean algebra of sets is a ring of sets.

Answer 4(iii); Firstly, as a boolean algebra of sets is non-empty, and it also contains the empty set and the Universal set. As A is in **A **implies that is in **A**, so is also in **A **(by definition of Boolean algebra), but this is precisely that is in **A. **Now, as clearly is also in **A.** Hence, a Boolean algebra of sets is a ring of sets.

Problem 5:

Show that the class of all finite subsets (including the empty set) of an infinite set is a ring of sets but is not a Boolean algebra.

Answer 5:

In problem 4 above, we showed that if a non empty class of sets contains the union and difference of any pair of the sets, then it is a ring of sets. The given class is a subclass of all an infinite set such that it contains finite subsets only; that is, again, we know that finite unions of finite subsets and finite intersections of finite subsets also lie in that subclass, but the complements might be infinite sets so that it need not always be a Boolean algebra of sets.

Problem 6:

Show that the class of all finite unions of closed-open intervals on the real line is a ring of sets but is not a Boolean algebra of sets.

Answer 6:

Same reasoning as above tells us that it is indeed a ring of sets; but consider for example the closed-open interval , the complement of this is not in that class as it is an infinite interval so that it is not a Boolean algebra of sets.

Problem 7:

Assuming that the Universal set U is non empty, show that Boolean algebras of sets can be described as rings of sets which contain U.

Answer 7:

As , by definition of Boolean algebras, is in this class of sets, so that the empty set is also a part of this class of sets. Again, by definition of Boolean algebras, the union of two sets of this class is also in this set so also the intersection of any two sets of this class is also in this class. So, for any two sets A and B, is also in this set (as complement of B exists), and so also, is also in this set. In other words, this is also a ring of sets.

Regards,

Nalin Pithwa

# Set theory: more basic problems to solve and clear and apply

I am producing the list of questions first so that the motivated reader can first read and try them …and can compare with my answers by scrolling down only much later; here we go:

- If and are two classes of sets such that , then prove that and .
- The difference between two sets A and B, denoted by , is the set of elements in A and not in B; thus, . Prove the following simple properties: (a) ; (b) ; (c) ; (d) ; (e)
- The symmetric difference of two sets A and B, denoted by , is defined by ; it is thus the union of their differences in opposite orders. Prove the following : (a) Symmetric difference is associative : (b) (c) (c) Symmetric difference is commutative: (d) Some sort of distributive rule also holds:
- A ring of sets is a non-empty class
**A**of sets such that if A and B are in**A**, then and are also in A. Show that**A**must also contain the empty set, , and . Show that if a non-empty class of sets contains the union and difference of sets any pair of its sets, then it is a ring of sets. Prove that a Boolean algebra of sets is a ring of sets. - Show that the class of all finite subsets (including the empty set) of an infinite set is a ring of sets but is not a Boolean algebra of sets.
- Show that the class of all finite unions of closed-open intervals on the real line is a ring of sets but is not a Boolean algebra of sets.
- Assuming that the universal set U is non-empty, show that Boolean algebras of sets can be described as a ring of sets which contain U.

I will put up my solutions as soon as I can.

Regards,

Nalin Pithwa.

# Symmetric difference is associative

We want to show that :

Part I: TPT:

Proof of Part I: let

Then, . By definition of symmetric difference,

Hence, , , OR ,

That is, .

Hence, , and

Hence, and .

Hence, .

Hence, , , but .

Therefore, , but . —- Call this I.

Consider .

Therefore, .

Therefore, , and

Therefore, , and .

Therefore, .

Hence, , , but .

That is, , . Call this II.

From I and II, .

Part II: TPT: .

Quite simply, reversing the above steps we prove part II.

QED.

Cheers,

Nalin Pithwa