Proving NTG Relation on S x S: Reflexive, Non-Transitive, and Non-Antisymmetric

  • Thread starter Thread starter mamma_mia66
  • Start date Start date
  • Tags Tags
    Discrete
mamma_mia66
Messages
51
Reaction score
0
confused:Given the simple LTE (less then equal) relation on S= {1,2,3,4} defined by [less and equal ], we define a complex NTG (not grater then) relation on S x S by (w,x) NTG (y,z) if w[less and equal) y or x [less and equal z. (this or confusing me )
Show that NTG is (R) reflexive, but not (T) transitive and not (AS) antisymmetric.

After I list the pairs: (1,1) (1,2) (1,3) (1,4) (2,1) (2,2), (2,3) (2,4) (3,1) (3,2) (3,3) (3,4)
(4,1) (4,2) (4,3) (4,4)

Now I don't know how to start at all. Or may be...

Reflexive property means that (x,x) is in the realation for any x in S.
Antisymmetric (AS) (x,y) and (y,x) both in the relation implies that x=y, but I need to show not AS. Does that mean I have to show non-symetric?
Transitive property means that if (x,y) and (y,z) are in the realation, then (x,z) is also.


How about if I start with (1,1) NGT (2,1) b/c {1 is < and = to 2}

I would appreciate any suggestions.
Thank you again
 
Physics news on Phys.org
mamma_mia66 said:
confused:Given the simple LTE (less then equal) relation on S= {1,2,3,4} defined by [less and equal ], we define a complex NTG (not grater then) relation on S x S by (w,x) NTG (y,z) if w[less and equal) y or x [less and equal z. (this or confusing me )
The notation is confusing to me. LTE must mean less than OR equal, because with any two numbers one of them can't be both less than the other AND equal to it.

For example, 1 LTE 2 and 1 LTE 1, using elements of set S.

The other relation, for "not greater than" ought to be NGT, not NTG, but that's a minor point.

According to how NGT is defined above (w, x) NGT (y, z) iff w LTE y OR x LTE z.

For example (1, 3) NGT (2, 3) since 1 LTE 2. It's also true that 3 LTE 3. You should confirm that GTE is defined with "or" not "and".
mamma_mia66 said:
Show that NTG is (R) reflexive, but not (T) transitive and not (AS) antisymmetric.

After I list the pairs: (1,1) (1,2) (1,3) (1,4) (2,1) (2,2), (2,3) (2,4) (3,1) (3,2) (3,3) (3,4)
(4,1) (4,2) (4,3) (4,4)

Now I don't know how to start at all. Or may be...

Reflexive property means that (x,x) is in the realation for any x in S.
Antisymmetric (AS) (x,y) and (y,x) both in the relation implies that x=y, but I need to show not AS. Does that mean I have to show non-symetric?
Transitive property means that if (x,y) and (y,z) are in the realation, then (x,z) is also.

How about if I start with (1,1) NGT (2,1) b/c {1 is < and = to 2}

I would appreciate any suggestions.
Thank you again

For the reflexive property, you only need to consider (1, 1), (2, 2), (3, 3), and (4, 4), and show that (1, 1) GTE (1, 1) and so on with each of the other three pairs.
For the antisymmetric property, I think you need to show that if (x, y) GTE (y, x) then it's not true that (y, x) GTE (x, y). Don't do this symbolically; pick values from S and try them out.
For the transitive property, show that if (x, y) GTE (y, z) and if (y, z) GTE (z, w) then (x, y) GTE (z, w).
 
"LTE" (less than or equal) to is exactly the same as "NGT". (not greater than) (surely not "NTG"!) .
 
HallsofIvy said:
"LTE" (less than or equal) to is exactly the same as "NGT". (not greater than) (surely not "NTG"!) .
Maybe NTG stands for "not that great"

Well, you'd think that LTE is exactly the same as NGT, but the NGT relation is defined on pairs in the OP's problem.
 
Thank you so much. I am sorry for the typo NTG instead NGT, but you figured out. The example for OR confusion was very helpful.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top