Question

In: Computer Science

Given the relation R = {(n, m) | n, m ∈ ℤ, n ≥ m}. Which...

Given the relation R = {(n, m) | n, m ∈ ℤ, n ≥ m}. Which of the following statements about R is correct?

R is not a partial order because it is not antisymmetric

R is not a partial order because it is not reflexive

R is a partial order

R is not a partial order because it is not transitive

Solutions

Expert Solution

R is a partial order relation. Because it satisfies all the three properties, it is reflexive,antisymmetric and transitive.

Z is the set of integers.

Lets look at all the properties one by one.

Reflexive:

The relation is reflexive because for every  a ∈ Z,  (a, a) ∈ R

Why? Because any integer is also greter than equal to itself. eg. 2>=2 , -1>=-1 , 3>=3 and so on. This is true for all integers in Z.

Antisymmetric:

It is antisymmetric because whenever (m,n) and (n, m) ∈ R, we have m = n.

Why?

(n, m) ∈ R means n>= m

(m, n) ∈ R means m>= n

Only possibility is both are equal, and we already proved this above in the reflexive part that for every a belongs to Z, (a, a) ∈ R

Transitive:

The relation is transitive because whenever (m, n) and (n, o) ∈ R, we have (m, o) ∈ R.

Example:

4>=2 hence (4, 2) ∈ R

and 2>=1 hence (2, 1) ∈ R,

implies (4, 1) ∈ R. because 4>=1

Since the relation is reflexive, antisymetric and transitive,it is partial order relation.


Related Solutions

Consider f,g:ℤ→ℤ given by: f(n) = 2n g(n) = n div 2 Which of the following...
Consider f,g:ℤ→ℤ given by: f(n) = 2n g(n) = n div 2 Which of the following statements are true? Select all that apply (a) f is an injection (b) g is an injection (c) f∘g is an injection (d) g∘f is an injection (e) f is a surjection (f) g is a surjection (g) f∘g is a surjection (h) g∘f is a surjection
Consider the relation R defined on the set Z as follows: ∀m, n ∈ Z, (m,...
Consider the relation R defined on the set Z as follows: ∀m, n ∈ Z, (m, n) ∈ R if and only if m + n = 2k for some integer k. For example, (3, 11) is in R because 3 + 11 = 14 = 2(7). (a) Is the relation reflexive? Prove or disprove. (b) Is the relation symmetric? Prove or disprove. (c) Is the relation transitive? Prove or disprove. (d) Is it an equivalence relation? Explain.
Consider the following functions from ℤ × ℤ → ℤ. Which functions are onto? Justify your...
Consider the following functions from ℤ × ℤ → ℤ. Which functions are onto? Justify your answer by proving the function is onto or providing a counterexample and explaining why it is a counterexample. (a) f(x,y) = xy + 3 (b) f(x,y) = | xy | + 10 (c) f(x,y) = ⌊( x+y ) / 3⌋
Consider the following functions from ℤ × ℤ → ℤ. Which functions are onto? Justify your...
Consider the following functions from ℤ × ℤ → ℤ. Which functions are onto? Justify your answer by proving the function is onto or providing a counterexample and explaining why it is a counterexample. (a) f(x,y) = xy + 3 (b) f(x,y) = | xy | + 10 (c) f(x,y) = ⌊( x+y ) / 3⌋
Which of the following integer examples provides a proof of the existential statement "∃n ∈ ℤ,...
Which of the following integer examples provides a proof of the existential statement "∃n ∈ ℤ, n² ≤ 0 ∧ n ≥ 0"? a n = -1 b n = 1 c n = 0 d n = 10
Consider the relation R on N such that xRy if and only if the sum of...
Consider the relation R on N such that xRy if and only if the sum of the digits of x and y coincide. (i) Prove or disprove R is an equivalence relation. (ii) What are the equivalence classes of R.
Show that the given relation R is an equivalence relation on set S. Then describe the...
Show that the given relation R is an equivalence relation on set S. Then describe the equivalence class containing the given element z in S, and determine the number of distinct equivalence classes of R. Let S be the set of all possible strings of 3 or 4 letters, let z = ABCD and define x R y to mean that x has the same first letter as y and also the same third letter as y.
Let R be the relation on the set of people given by aRb if a and...
Let R be the relation on the set of people given by aRb if a and b have at least one parent in common. Is R an equivalence relation? (Equivalence Relations and Partitions)
1. Which of the following predicate calculus statements is true? Question 1 options: ∀n ∈ ℤ,...
1. Which of the following predicate calculus statements is true? Question 1 options: ∀n ∈ ℤ, n + 1 > n ∃n ∈ ℤ, n + 1 < n ∀n ∈ ℤ, n > 2n ∀n ∈ ℤ, 2n > n 2. Which of the following is the correct predicate calculus translation of the sentence "Some natural numbers are at least 100"? Question 2 options: ∃n ∈ ℕ, n > 100 ∀n ∈ ℕ, n ≥ 100 ∃n ∈ ℕ,...
. Let T : R n → R m be a linear transformation and A the...
. Let T : R n → R m be a linear transformation and A the standard matrix of T. (a) Let BN = {~v1, . . . , ~vr} be a basis for ker(T) (i.e. Null(A)). We extend BN to a basis for R n and denote it by B = {~v1, . . . , ~vr, ~ur+1, . . . , ~un}. Show the set BR = {T( r~u +1), . . . , T( ~un)} is a...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT