Scribd
Upload
7 views1 page

Assinment-4 121750

The document discusses various properties of relations defined on sets, specifically focusing on reflexivity, symmetry, transitivity, and equivalence relations. It presents multiple examples and asks to prove or justify the nature of these relations. The document includes exercises related to relations on real numbers, integers, and finite sets.

Uploaded by

harshaadhikary2006
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
7 views1 page

Assinment-4 121750

The document discusses various properties of relations defined on sets, specifically focusing on reflexivity, symmetry, transitivity, and equivalence relations. It presents multiple examples and asks to prove or justify the nature of these relations. The document includes exercises related to relations on real numbers, integers, and finite sets.

Uploaded by

harshaadhikary2006
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/ 1

P M Math

but not symmetric.

[VIII] Show that the relation p on R defined by '𝜌 = {la, b) ∈


ℝ × ℝ |a≤ b} is reflexive, transitive but not symmetric.

[IX] Let 𝜌 be a relation on ℝ defined by 𝜌 {(a, b) ∈ ℝ × ℝ |


a2 + b2 = 1}. Prove that 𝜌 is not an equivalence relation.

[X] Show that the relation R defined on the set A of all


polygons in a plane as R = {(P1, P2): P1 and P2 have same
number of sides} is an equivalence relation. What is the
[I] If A = {1, 2, 3} then the relation R= {(1, 1),(2, 2),(3, 3), set of elements in A related to the right angled triangle T
(1, 3), (3, 2),(1, 2)} on A is with sides 3, 4 and 5?
(A) symmetric, transitive but not reflexive
(B) reflexive, symmetric but not transitive [XI] Let 𝜌 be a relation defined on ℕ as 𝜌 = (x, y) ∈
(C) transitive, reflexive but not symmetric ℕ × ℕ |2x+y = 41}. Prove that this relation is neither
(D) an equivalence relation. reflexive nor symmetric, not evern transitive.

[II] If A = {1, 2, 3} then the relation R = {(1, 1), (2, 2), (1, 2), [XII] Justify each of the following
(2, 1), (1, 3)} on the set A is (a) The relation 𝜌 defined on ℤ by 𝜌 = {(a, b) ∈ ℤ ×
(A) reflexive (B) symmetric ℤ|a-b = 5} is none of reflexive, symmetric and
(C) transitive (D) none of these. transitive.
(b) The relation 𝜌 defined on ℝ by 𝜌 = {a, b) ∈
[III] If A = {a, b, c, then the relation R = {(a, a), (b, b), (c, c),
ℝ × ℝ|a > b = 0 } is symmetric and transitive but
(b, c), (a, b)} on the set A is
not reflexive.
(A) reflexive but not symmetric
(B) symmetric but not reflexive (c) The relation 𝜌 defined on ℤ by 𝜌 = {(a, b) ∈
(C) tranisitive but not symmetric ℤ × ℤ|a − b = 0 or 2 or − 2} is reflexive symmetric
(D) symmetric and transitive. but not transitive.
(d) The relation 𝜌 defined on ℚ by 𝜌 = {(a, b) ∈
[IV] The relation R = {(1, 1), (2, 2), (4, 4),(1, 2), (1, 3), (2, ℚ × ℚ|a − b = 0 or 5} is reflexive but neither
3)} on the set A = {1, 2, 3, 4} is symmetric nor transitive.
(A) reflexive (B) symmetric (e) The relation 𝜌 defined on ℤ by 𝜌 ={(a, b) ∈
(C) transitive (D) an equivalence ℤ × ℤ|a − b =0 or 5} is symmetric but neither
reflexive nor transitive.
[V] A is a finite set of n elements. The number of relations (f) The relation 𝜌 defined on ℤ by 𝜌 = {(a, b) ∈
from the set A into itself is ℤ × ℤ|a − b is an even integer} is reflexive
(A) 2n (B) n2 symmetric and transitive.
2 𝑛
(C) 2𝑛 (D) 22
[XIII] What is the smallest equivalence relation on the set
[VI] A relation R on the set of all real numbers R is defined A = {1, 2, 3}
by, 'for any x, y ∈ ℝ, x Ry holds if and only if |x -y|≤1: Then
R is [XIV]
(A) reflexive, symmetric but not transitive (a) Let 𝜌 be a relation defined on ℤ by, 'a 𝜌 b ⇔ (a-
(B) reflexive, transitive but not symmetric b) is divisible by n' where n is given positive integer.
(C) reflexive, transitive but not symmetric Prove that 𝜌 is an equivalence relation on ℤ.
(D) an equivalence relation. (b) A relation 𝜌 on the set ℤ of integers is defined as
follows: 'å 𝜌 b holds ⇔ the number (a - b) is
divisible' by n, where n is a given positive integer, a,
[VII] Let a relation 𝜌 on ℝ be defined as: (a, b) ∈ 𝜌 if and
b ∈ ℤ. Prove that 𝜌 is an equivalence relation on ℤ.
only if 1 + ab > 0, for all a, b ∈ ℝ Prove that 𝜌 is reflexive,
symmetric but not transitive. [XV] Let ℕ be the set of natural numbers and p be a
Show that the relation 𝜌 on ℝ defined by relation on ℕ × ℕdefined by, '(a, b) 𝜌 (c, d) iff ad(b + c) =
' 𝜌 = {la, b) e ℝ x ℝ a ≤ b} is reflexive, transitive bc(a+d)’. Prove that 𝜌 is an equivalence relation.

You might also like