0% found this document useful (0 votes)
6 views8 pages

1 26

The document contains a series of proofs demonstrating that various relations defined on the set of integers Z are equivalence relations. Each proof establishes the properties of reflexivity, symmetry, and transitivity for relations based on divisibility by integers (3, 2, 5, n, and 13) and the condition of sums being even. Additionally, it includes a specific case for a relation on a finite set A, confirming its equivalence relation status.

Uploaded by

lucky0009shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views8 pages

1 26

The document contains a series of proofs demonstrating that various relations defined on the set of integers Z are equivalence relations. Each proof establishes the properties of reflexivity, symmetry, and transitivity for relations based on divisibility by integers (3, 2, 5, n, and 13) and the condition of sums being even. Additionally, it includes a specific case for a relation on a finite set A, confirming its equivalence relation status.

Uploaded by

lucky0009shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Question 1:

Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.

Answer 1:
We observe the following relations of relation R.

Reflexivity:
Let a be an arbitrary element of R. Then,
a−a=0=0 × 3
⇒ a − a is divisible by 3
⇒ (a, a) ∈ R for all a ∈ Z
So, R is reflexive on Z.

Symmetry:
Let (a, b) ∈ R
⇒ a − b is divisible by 3
⇒ a − b 3p for some p ∈ Z
⇒ b − a = 3 (−p)
Here, − p ∈ Z
⇒ b − a is divisible by 3
⇒ (b, a) ∈ R for all a, b ∈ Z
So, R is symmetric on Z.

Transitivity:
Let (a, b) and (b, c) ∈ R
⇒ a − b and b − c are divisible by 3
⇒ a − b = 3p for some p ∈ Z
and b − c = 3q for some q ∈ Z
Adding the above two, we get
a − b + b − c = 3p + 3q
⇒ a − c = 3 (p + q)
Here, p + q ∈ Z
⇒ a − c is divisible by 3
⇒ (a, c) ∈ R for all a, c ∈ Z
So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

Question 2:
Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b}, is an equivalence relation.
Answer 2:
We observe the following properties of relation R.

Reflexivity:
Let a be an arbitrary element of the set Z. Then,
a∈R
⇒a−a=0=0 × 2
⇒ 2 divides a − a
⇒ (a, a) ∈ R for all a ∈ Z
So, R is reflexive on Z.

Symmetry:
Let (a, b) ∈ R
⇒ 2 divides a − b
⇒ a−b
2
= p for some p ∈ Z
b−a
⇒ 2
= −p
Here, − p ∈ Z
⇒ 2 divides b − a
⇒ (b, a) ∈ R for all a, b ∈ Z
So, R is symmetric on Z.

Transitivity:
Let (a, b) and (b, c) ∈ R
⇒ 2 divides a − b and 2 divides b − c
⇒ a−b
2
= p and b−c2
= q for some p, q ∈ Z
Adding the above two, we get
a−b b−c
2 + 2 =p+q
a−c
⇒ 2
=p+q
Here, p + q ∈ Z
⇒ 2 divides a − c
⇒ (a, c) ∈ R for all a, c ∈ Z
So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

Question 3:
Prove that the relation R on Z defined by

(a, b) ∈ R a − b is divisible by 5
is an equivalence relation on Z.

Answer 3:
We observe the following properties of relation R.

Reflexivity:
Let a be an arbitrary element of R. Then,
⇒a−a = 0 = 0 × 5
⇒ a − a is divisible by 5
⇒ (a, a) ∈ R for all a ∈ Z
So, R is reflexive on Z.

Symmetry:
Let (a, b) ∈ R
⇒ a − b is divisible by 5
⇒ a − b = 5p for some p ∈ Z
⇒ b − a = 5 (−p)
Here, − p ∈ Z [Since p ∈ Z]
⇒ b − a is divisible by 5
⇒ (b, a) ∈ R for all a, b ∈ Z
So, R is symmetric on Z.

Transitivity:
Let (a, b) and (b, c) ∈ R
⇒ a − b is divisible by 5
⇒ a − b = 5p for some Z
Also, b − c is divisible by 5
⇒ b − c = 5q for some Z
Adding the above two, we get
a − b + b − c = 5p + 5q
⇒ a − c = 5 (p + q)
⇒ a − c is divisible by 5
Here, p + q ∈ Z
⇒ (a, c) ∈ R for all a, c ∈ Z
So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

Question 4:
Let n be a fixed positive integer. Define a relation R on Z as follows:

(a, b) ∈ R a − b is divisible by n.
Show that R is an equivalence relation on Z.

Answer 4:
We observe the following properties of R. Then,
Reflexivity:
Let a ∈ N
Here,
a−a=0=0 × n
⇒ a − a is divisible by n
⇒ (a, a) ∈ R
⇒ (a, a) ∈ R for all a ∈ Z
So, R is reflexive on Z.

Symmetry:
Let (a, b) ∈ R
Here,
a − b is divisible by n
⇒ a − b = np for some p ∈ Z
⇒ b − a = n (−p)
⇒ b − a is divisible by n [p ∈ Z ⇒ −p ∈ Z]
⇒ (b, a) ∈ R
So, R is symmetric on Z.

Transitivity:
Let (a, b) and (b, c) ∈ R
Here, a − b is divisible by n and b − c is divisible by n.
⇒ a − b = np for some p ∈ Z
and b − c = nq for some q ∈ Z
Adding the above two, we get
a − b + b − c = np + nq
⇒ a − c = n (p + q)
Here, p + q ∈ Z
⇒ (a, c) ∈ R for all a, c ∈ Z
So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

Question 5:
Let Z be the set of integers. Show that the relation
R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.

Answer 5:
We observe the following properties of R.

Reflexivity:
Let a be an arbitrary element of Z. Then,
a∈R
Clearly, a + a = 2a is even for all a ∈ Z.
⇒ (a, a) ∈ R for all a ∈ Z
So, R is reflexive on Z.
Symmetry:
Let (a, b) ∈ R
⇒ a + b is even
⇒ b + a is even
⇒ (b, a) ∈ R for all a, b ∈ Z
So, R is symmetric on Z.

Transitivity:
Let (a, b) and (b, c) ∈ R
⇒ a + b and b + c are even
Now, let a + b = 2x for some x ∈ Z
and b + c = 2y for some y ∈ Z
Adding the above two, we get
a + 2b + c = 2x + 2y
⇒ a + c = 2(x + y − b), which is even for all x, y, b ∈ Z
Thus, (a, c) ∈ R
So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

Question 6:
m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence
relation?

Answer 6:
We observe the following properties of relation R.
Let R = {(m, n) : m, n ∈ Z : m − n is divisible by 13}
Relexivity : Let m be an arbitrary element of Z. Then,
m∈R
⇒ m − m = 0 = 0 × 13
⇒ m − m is divisible by 13
⇒ (m, m) is reflexive on Z.
Symmetry : Let (m, n) ∈ R. Then,
m − n is divisible by 13
⇒ m − n = 13p
Here, p ∈ Z
⇒ n − m = 13 (−p)
Here, − p ∈ Z
⇒ n − m is divisible by 13
⇒ (n, m) ∈ R for all m, n ∈ Z
So, R is symmetric on Z.
Transitivity : Let (m, n) and (n, o) ∈ R
⇒ m − n and n − o are divisible by 13
⇒ m − n = 13p and n − o = 13q for some p, q ∈ Z
Adding the above two, we get
m − n + n − o = 13p + 13q
⇒ m − o = 13 (p + q)
Here, p + q ∈ Z
⇒ m − o is divisible by 13
⇒ (m, o) ∈ R for all m, o ∈ Z
So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

Question 7:
Let R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = yu. Show that R is an
equivalence relation.

Answer 7:
We observe the following properties of R.
Reflexivity : Let (a, b) be an arbitrary element of the set A. Then,
(a, b) ∈ A
⇒ ab = ba
⇒ (a, b) R (a, b)
Thus, R is reflexive on A.
Symmetry : Let (x, y) and (u, v) ∈ A such that (x, y) R (u, v). Then,
xv = yu
⇒ vx = uy
⇒ uy = vx
⇒ (u, v) R (x, y)
So, R is symmetric on A.
Transitivity : Let (x, y), (u, v) and (p, q) ∈ R such that (x, y) R (u, v) and (u, v) R (p, q).
⇒ xv = yu and uq = vp
Multiplying the corresponding sides, we get
xv × uq = yu × vp
⇒ xq = yp
⇒ (x, y) R (p, q)
So, R is transitive on A.

Hence, R is an equivalence relation on A.

Question 8:
Show that the relation R on the set A = {x ∈ Z ; 0 ≤ x ≤ 12}, given by R = {(a, b) : a = b}, is an equivalence relation.
Find the set of all elements related to 1.

Answer 8:

We observe the following properties of R.

Reflexivity: Let a be an arbitrary element of A. Then,


a∈R
⇒a=a [Since, every element is equal to itself]
⇒ (a, a) ∈ R for all a ∈ A
So, R is reflexive on A.
Symmetry : Let (a, b) ∈ R
⇒ab
⇒b=a
⇒ (b, a) ∈ R for all a, b ∈ A
So, R is symmetric on A.
Transitivity : Let (a, b) and (b, c) ∈ R
⇒ a = b and b = c
⇒a=bc
⇒a=c
⇒ (a, c) ∈ R
So, R is transitive on A.
Hence, R is an equivalence relation on A.

The set of all elements related to 1 is {1}.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy