Advertisements
Advertisements
Question
Let A = {a, b, c}. What is the equivalence relation of smallest cardinality on A? What is the equivalence relation of largest cardinality on A?
Advertisements
Solution
R = {{a, a), (b, b), (c, c)} is this smallest cardinality of A to make it equivalence relation n(R) = 3
R = {(a, a), (a, b), (a, c), (b, c), (b, b), {b, a), (c, a), (c, b), (c, c)}
n(R) = 9 is the largest cardinality of R to make it equivalence
APPEARS IN
RELATED QUESTIONS
Let A = {1, 2, 3, 4, 6}. Let R be the relation on A defined by {(a, b): a, b ∈ A, b is exactly divisible by a}.
- Write R in roster form
- Find the domain of R
- Find the range of R.
Let R be the relation on Z defined by R = {(a, b): a, b ∈ Z, a – b is an integer}. Find the domain and range of R.
Let A = (x, y, z) and B = (a, b). Find the total number of relations from A into B.
If R is a relation defined on the set Z of integers by the rule (x, y) ∈ R ⇔ x2 + y2 = 9, then write domain of R.
Write the relation in the Roster Form. State its domain and range
R3 = {(x, y)/y = 3x, y∈ {3, 6, 9, 12}, x∈ {1, 2, 3}
Write the relation in the Roster Form. State its domain and range
R5 = {(x, y)/x + y = 3, x, y∈ {0, 1, 2, 3}
Answer the following:
If A = {1, 2, 3}, B = {4, 5, 6} check if the following are relations from A to B. Also write its domain and range
R2 = {(1, 5), (2, 4), (3, 6)}
Answer the following:
If A = {1, 2, 3}, B = {4, 5, 6} check if the following are relations from A to B. Also write its domain and range
R3 = {(1, 4), (1, 5), (3, 6), (2, 6), (3, 4)}
Answer the following:
Find R : A → A when A = {1, 2, 3, 4} such that R = (a, b)/a − b = 10}
Let A = {9, 10, 11, 12, 13, 14, 15, 16, 17} and let f : A → N be defined by f(n) = the highest prime factor of n ∈ A. Write f as a set of ordered pairs and find the range of f
Let A = {a, b, c} and R = {(a, a), (b, b), (a, c)}. Write down the minimum number of ordered pairs to be included to R to make it reflexive
Let A = {a, b, c} and R = {(a, a), (b, b), (a, c)}. Write down the minimum number of ordered pairs to be included to R to make it symmetric
Let A = {a, b, c} and R = {(a, a), (b, b), (a, c)}. Write down the minimum number of ordered pairs to be included to R to make it transitive
On the set of natural numbers let R be the relation defined by aRb if a + b ≤ 6. Write down the relation by listing all the pairs. Check whether it is transitive
Is the following relation a function? Justify your answer
R1 = `{(2, 3), (1/2, 0), (2, 7), (-4, 6)}`
If R1 = {(x, y) | y = 2x + 7, where x ∈ R and – 5 ≤ x ≤ 5} is a relation. Then find the domain and Range of R1.
Let n(A) = m, and n(B) = n. Then the total number of non-empty relations that can be defined from A to B is ______.
Let f: R `rightarrow` R be defined by f(x) = `x/(1 + x^2), x ∈ R`. Then the range of f is ______.
Which statement defines a relation from set \(A\) to set \(B\)?
Which statement violates the condition for a function?
