Why is this relation not a total order? A = ℝ, R = {(x,y)∈ℝxℝ | (|x| < |y| or x = y) }
I need to find a particular x and y so that (x,y)∉R and (y,x)∉R
the relation is already a partial order btw
Obviously I can't choose x and y to be the same because that would satisfies the condition x = y. So either x < y , or x > y. but it seems either (x,y) or (y,x) will be in R in both cases.
how about opposites
O.O ahaha how could I not think of that!!??
think about it if (x,y) is in R then |x|<|y| if (y,x) is in R then |y|<|x| this impllies |y|<|x|<|y| which implies |x|=|y| which is true for two certain cases can you guess which cases
you just saved me from going insane :DD thank you
np
btw, how does |y|<|x|<|y| implies |x| = |y| ?
how can something be less than something else and also greater than it?
oh...
huhmm... but |y|<|x|<|y| is just false. Why would it imply anything?
it is false but i i said that part imply the other part because your relation also contains that one equality part about x=y
|x|=|y| implies x=y or x=-y x=-y would be the one I want to look at because that is the equality my relation did not have
x=-y means I want x and y to be opposites
ah i see
now this |y|<=|x|<=|y| isn't false because it is true only when |x|=|y|
if you wanted to replace what i said with that i wouldn't see a problem with it
since x=y implies |x|=|y|
I see. Thanks again
np
Join our real-time social learning platform and learn together with your friends!