Question

In: Computer Science

Determine whether the relation R on the set of all people is reflexive, symmetric, antisymmetric, and/or...

Determine whether the relation R on the set of all people is reflexive, symmetric, antisymmetric, and/or transitive, where (a, b) ∈ R if and only if


a) a is taller than b.
b) a and b were born on the same day.


Solutions

Expert Solution

a) R(a,b) means a is taller than b

  • Not Reflexive: since R(a,a) doesn't hold as a is not taller than a
  • Not Symmetric: since if R(a,b) then R(b,a) does not hold as if a is taller than b then b cannot be taller than a.
  • Antisymmetric: since if R(a,b) with a not equals b then R(b,a) must not hold. This is true because for two distinct people a and b, if a is taller than b then b is not taller than a.
  • Transitive: since if R(a,b) and R(b,c) then R(a,c) must hold. This is true because if a is taller than b and b is taller than c then a is taller than c.

b) R(a,b) means a and b were born on the same day.

  • Reflexive: since R(a,a) holds as for a person a, it is true that a and a were born on the same day.
  • Symmetric: since if R(a,b) then R(b,a) holds. This is true because a and b were born on the same day is same as b and a were born on the same day.
  • Not Antisymmetric: since R is symmetric as above, it can't be Antisymmetric.
  • Transitive: if R(a,b) and R(b,c) then R(a,c) holds. This is true because if a and b are born on the same day and b and c are born on the same day then a and c are also born on the same day.

Feel free to ask any doubt you may have. Happy to help.


Related Solutions

Let R be a relation on a set that is reflexive and symmetric but not transitive?...
Let R be a relation on a set that is reflexive and symmetric but not transitive? Let R(x) = {y : x R y}. [Note that R(x) is the same as x / R except that R is not an equivalence relation in this case.] Does the set A = {R(x) : x ∈ A} always/sometimes/never form a partition of A? Prove that your answer is correct. Do not prove by examples.
Determine whether the relations described by the conditions below are reflexive, symmetric, antisymmetric or transitive on...
Determine whether the relations described by the conditions below are reflexive, symmetric, antisymmetric or transitive on a set A = {1, 2, 3, 4} All ordered pairs of (x, y) such that x   not Equal   y. All ordered pairs of (x, y) such that y > 2. All ordered pairs of (x, y) such that x = y ± 1. All ordered pairs of (x, y) such that x = y2. All ordered pairs of (x, y) such that x...
Determine if the following is is reflexive, symmetric, antisymmetric and transitive and why? x relates y...
Determine if the following is is reflexive, symmetric, antisymmetric and transitive and why? x relates y <-> x divides y 2 (on all positive numbers)
A JAVA program that will read a boolean matrix corresponding to a relation R and output whether R is Reflexive, Symmetric, Anti-Symmetric and/or Transitive.
A JAVA program that will read a boolean matrix corresponding to a relation R and output whether R is Reflexive, Symmetric, Anti-Symmetric and/or Transitive. Input to the program will be the size n of an n x n boolean matrix followed by the matrix elements. Document your program nicely.NOTE: The program must output a reason in the case that an input relation fails to have a certain property.
For each of the properties reflexive, symmetric, antisymmetric, and transitive, carry out the following. Assume that...
For each of the properties reflexive, symmetric, antisymmetric, and transitive, carry out the following. Assume that R and S are nonempty relations on a set A that both have the property. For each of R complement (Rc), R∪S, R∩Sand R−1. determine whether the new relation must also have that property; might have that property, but might not; or cannot have that property. Any time you answer Statement i or Statement iii, outline a proof. Any time you answer Statement ii,...
For each of the properties reflexive, symmetric, antisymmetric, and transitive, carry out the following. Assume that...
For each of the properties reflexive, symmetric, antisymmetric, and transitive, carry out the following. Assume that R and S are nonempty relations on a set A that both have the property. For each of R complement, R∪S, R∩S, and R−1, determine whether the new relation must also have that property; might have that property, but might not; or cannot have that property. A ny time you answer Statement i or Statement iii, outline a proof. Any time you answer Statement...
Suppose we define the relation R on the set of all people by the rule "a...
Suppose we define the relation R on the set of all people by the rule "a R b if and only if a is Facebook friends with b." Is this relation reflexive? Is is symmetric? Is it transitive? Is it an equivalence relation? Briefly but clearly justify your answers.
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)
Determine whether the given relation is an equivalence relation on the set. Describe the partition arising...
Determine whether the given relation is an equivalence relation on the set. Describe the partition arising from each equivalence relation. (c) (x1,y1)R(x2,y2) in R×R if x1∗y2 = x2∗y1.
Let A = Σ*, and let R be the relation "shorter than." Determine whether or not...
Let A = Σ*, and let R be the relation "shorter than." Determine whether or not the given relation R, on the set A, is reflexive, symmetric, antisymmetric, or transitive.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT