Determine which binary relations are true, reflexive, symmetric, antisymmetric, and/or transitive.
The relation R on the set {(m, n)|(m, n) ∈ Z}, where (m, n)R(x,y) when m = x and n = y.
This is unlike the problems I've usually seen and I'm not sure how to answer it.
Any direction would be appreciated.
That's exactly how the question was given.
For the first part, {(m, n)|(m, n) ∈ Z}, I assume means (m,n) such that (m,n) is a member of the set of integers. Does that make sense?
I guess if the question doesn't make sense, none of the relationships exist.
The problem is that (m, n) ∈ ℤ is a type mismatch. Here (m, n) is a pair of integers; they can only belong to ℤ × ℤ. If you want to say that m and n are integers, you can write "m, n ∈ ℤ," which is an abbreviation for "m ∈ ℤ and n ∈ ℤ."
Also, as Plato noted, (m, n) R (x,y) iff m = x and n = y makes R a simple equality on pairs (two pairs are equal if their corresponding elements are equal). It's trivial, but it can be checked that equality is an equivalence relation. Are you sure it's not "(m, n)R(x,y) when m = x or n = y"?
Concerning "This is unlike the problems I've usually seen," you should first look at several examples of proving that a relation is reflexive, symmetric or transitive. Find them in your textbook or lecture notes or search this forum. This is an absolutely standard type of problem.
Yeah, we've done a bunch of these problems. What I meant is that this is unlike the problems of this type that I've seen. Thus, I have no idea how to answer it. We're only given reflexive, symmetric, antisymmetric and transitive as relationship options. Equivalence is not given as an option.Concerning "This is unlike the problems I've usually seen," you should first look at several examples of proving that a relation is reflexive, symmetric or transitive. Find them in your textbook or lecture notes or search this forum. This is an absolutely standard type of problem.
I checked again and this is exactly as the problem is written.
Thanks for your help.