Equivalence relations and partitions: some core basic theorems

Suppose R is an equivalence relation on a set S. For each a in S, let [a] denote the set of elements of S to which a is related under R, that is, [a] = \{ x: (a,x) \in R\}

We call [a] the equivalence class of a in S under R. The collection of all such equivalence classes is denoted by S/R, that is, S/R = \{ [a]: a \in S\}. It is called the quotient set of S by R.

The fundamental property of an equivalence relation and its quotient set is contained in the following theorem:

Theorem I:

Let R be an equivalence relation on a set S. Then, the quotient set S/R is a partition of S. Specifically,

(i) For each a \in S, we have a \in [a].

(ii) [a]=[b] if and only if (a,b) \in R.

(iii) If [a] \neq [b], then [a] and [b] are disjoint.

Proof of (i):

Since R is reflexive, (a,a) \in R for every a \in S and therefore a \in [a].

Proof of (ii):

Assume: (a,b) \in R.

we want to show that [a] = [b]. That is, we got to prove, (i) [b] \subseteq [a] and (ii) [a] \subseteq [b].

Let x \in [b]; then, (b,x) \in R. But, by hypothesis (a,b) \in R and so, by transitivity, (a,x) \in R. Accordingly, x \in [a]. Thus, [b] \subseteq [a].

To prove that [a] \subseteq [b], we observe that (a,b) \in R implies, by symmetry, that (b,a) \in R. Then, by a similar argument, we obtain [a] \subseteq [b]. Consequently, [a]=[b].

Now, assume [a] = [b].

Then by part (i) of this proof that for each a \in S, we have a \in [a]. So, also, here b \in [b]=[a]; hence, (a,b) \in R.

Proof of (iii):

Here, we prove the equivalent contrapositive of the statement (iii), that is:

If [a] \bigcap [b] \neq \emptyset then [a] = [b].

if [a] \bigcap [b] \neq \emptyset then there exists an element x \in A with x \in [a] \bigcap [b]. Hence, (a,x) \in R and (b,x) \in R. By symmetry, (x,b) \in R, and, by transitivity, (a,b) \in R. Consequently, by proof (ii), [a] = [b].

The converse of the above theorem is also true. That is,

Theorem II:

Suppose P = \{ A_{i}\} is a partition of set S. Then, there is an equivalence relation \sim on S such that the set S/\sim of equivalence classes is the same as the partition P = \{ A_{i}\}.

Specifically, for a, b \in S, the equivalence \sim in Theorem I is defined by a \sim b if a and b belong to the same cell in P.

Thus, we see that there is a one-one correspondence between the equivalence relations on a set S and the partitions of S.

Proof of Theorem II:

Let a, b \in S, define a \sim b if a and b belong to the same cell A_{k} in P. We need to show that \sim is reflexive, symmetric and transitive.

(i) Let a \in S. Since P is a partition there exists some A_{k} in P such that a \in A_{k}. Hence, a \sim a. Thus, \sim is reflexive.

(ii) Symmetry follows from the fact that if a, b \in A_{k}, then b, a \in A_{k}.

(iii) Suppose a \sim b and b \sim c. Then, a, b \in A_{i} and b, c \in A_{j}. Therefore, b \in A_{i} \bigcap A_{j}. Since P is a partition, A_{i} = A_{j}. Thus, a, c \in A_{i} and so a \sim c. Thus, \sim is transitive.

Accordingly, \sim is an equivalence relation on S.

Furthermore,

[a] = \{ x: a \sim x\}.

Thus, the equivalence classes under \sim are the same as the cells in the partition P.

More later,

Nalin Pithwa.

Some more foundation mathematics — notions from set theory: Tutorial problems

It’s a strange way of starting a lecture that I adopt..sometimes…I first give my students quizzes or exams…Here is some foundation mathematics for my deserving students and also, if any of my reader is interested:

Basic Notions from Set Theory:

Reference: Introduction to Analysis, Maxwell Rosenlicht, Dover Publications,

Dover Pub, math link: http://store.doverpublications.com/by-subject-mathematics.html

Exercises:

Question 1:

Let \Re be the set of real numbers and let the symbols <, \leq have their conventional meanings:

a) Show that \{ x \in \Re: 0 \leq x \leq 3\} \bigcap \{x \in \Re: -1 <x <1 \}=\{ x \in \Re: 0 \leq x <1\}

b) List the elements of

(\{2,3,4 \} \bigcup \{ x \in \Re: x^{2}-4x+3 = 0\}) \bigcap \{x \in \Re: -1 \leq x < 3 \}

c) Show that

(\{ x \in \Re: -2 \leq x \leq 0\} \bigcup \{ x \in \Re: 2 < x <4\}) \bigcap \{ x \in \Re: 0 \leq x \leq 3\} = \{ x \in \Re: 2 < x \leq 3\} \bigcup \{ 0\}

Question 2:

If A is a subset of the set S, prove that :

2a) (A^{'})^{'}=A

2b) A \bigcup A = A \bigcap A = A \bigcup \phi = A

2c) A \bigcap \phi = \phi

2d) A \times \phi = \phi

Question 3:

Let A, B, C be elements of a set S. Prove the following statements and illustrate them with diagrams:

(a) A^{'} \bigcup B^{'} = (A\bigcap B)^{'}… a De Morgan law. In words, it can be said that the union of two complements is the complement of the intersection of the two.

(b) A \bigcap (B \bigcup C) = (A \bigcap B) \bigcup (A \bigcap C)

(c) A \bigcup (B \bigcap C) = (A \bigcup B) \bigcap (A \bigcup C).

Question 4:

If A, B, C are sets, then prove that :

i) (A-B) \bigcap C = (A \bigcap C)-B

ii) (A \bigcup B)-(A \bigcap B) = (A-B) \bigcup (B-A)

iii) A-(B-C) = (A-B) \bigcup (A \bigcap B \bigcap C)

iv) (A-B) \times C = (A \times C) - (B \times C)

Question 5:

Let f be a non-empty set and for each i \in I, let X be a set. Prove that

(i) for any set B, we have :

B \bigcap \bigcup_{i \in I}X_{i} = \bigcup_{i \in I}(B \bigcap X_{i})

(ii) if each X_{i} is a subset of a given set S, then

(\bigcup_{i \in I}X_{i})^{'}=\bigcap_{i \in I}(X_{i})^{'}

Question 6:

Prove that if f: X \rightarrow Y, g: Y \rightarrow Z, and h: Z \rightarrow W are functions, then

h \circ (g \circ f) = (h \circ g) \circ f

Question 7:

Let f: X \rightarrow Y be a function, let A and B be subsets of X, and let C and D be subsets of Y. Prove that:

(i) f(A \bigcup B) = f(A) \bigcup f(B)

(ii) f(A \bigcap B) \subset f(A) \bigcap f(B)

(iii) f^{-1}(C \bigcup D) = f^{-1}(C) \bigcup f^{-1}(D)

(iv) f^{-1}(C \bigcap D) = f^{-1}(C) \bigcap f^{-1}(D)

(v) f^{-1}(f(A)) \supset A

(vi) f(f^{-1}(C)) \subset C

Question 8:

(a) Prove that a function f is one-to-one if and only if f^{-1}(f(A)) = A for all A \subset X.

(b) Prove that a function f is onto if and only if f(f^{-1}(C)) = C for all C \subset Y.

Cheers,

Nalin Pithwa

PS: These tutorial problems can be used for IIT JEE Maths, Pre RMO, RMO Maths etc. also.

Some foundation mathematics

Well-Ordering Principle:

Every non-empty set S of non-negative integers contains a least element; that is, there is some integer a in S such that a \leq b for all b’s belonging to S.

Because this principle plays a role in many proofs related to foundations of mathematics, let us use it to show that the set of positive integers has what is known as the Archimedean property.

Archimedean property:

If a and b are any positive integers, then there exists a positive integer n such that na \geq b.

Proof:

By contradiction:

Assume that the statement of the theorem is not true so that for some a and b, we have na <b for every positive integer n. Then, the set S = \{ b-na : n \in Z^{+}\} consists entirely of positive integers. By the Well-Ordering Principle, S will possess a least element, say, b-ma. Notice that b- (m+1)a also lies in S; because S contains all integers of this form. Further, we also have b-(m+1)a=(b-ma)-a<b-ma contrary to the choice of b-ma as the smallest integer in S. This contradiction arose out of original assumption that the Archimedean property did not hold; hence, the proof. QED.

First Principle of Finite Induction:

Let S be a set of positive integers with the following properties:

a) the integer 1 belongs to S.

b) Whenever the integer k is in S, the next integer k+1 is also in S.

Then, S is the set of all positive integers.

Second Principle of Finite Induction:

Let S be a set of positive integers with the following properties:

a) the integer 1 belongs to S.

b) If k is a positive integer such that 1,2,\ldots k belong to S, then (k+1) must also be in S.

Then, S is the set of all positive integers.

So, in lighter vein, we assume a set of positive integers is given just as Kronecker had observed: “God created the natural numbers, all the rest is man-made.”

More later,

Nalin Pithwa.