Page 2 of 2 FirstFirst 12
Results 16 to 18 of 18

Math Help - Show that this is an equivalence relation

  1. #16
    Senior Member Danneedshelp's Avatar
    Joined
    Apr 2009
    Posts
    303
    Yes, this shows the relation is transitive by your definition.
    Follow Math Help Forum on Facebook and Google+

  2. #17
    Junior Member
    Joined
    Oct 2008
    Posts
    74
    Awards
    1
    Thanks mate!

    Any idea on the following:Function is defined as followed:
    ⊕:
    by


    Show that,
    ~ and ~
    then
    ~
    Follow Math Help Forum on Facebook and Google+

  3. #18
    Senior Member Danneedshelp's Avatar
    Joined
    Apr 2009
    Posts
    303
    Suppose (n,m)~(n,m). Then, by definition, n+m=m+n ⇒ 0=0. This clearly true; thus, ~ is refexive.

    Suppose (n,m)~(k,l), where (n,m) and (k,l) are arbitrary elements of N^2. Then n+l=m+k ⇔ m+k=n+l. Therefore, (k,l)~(n,m). Consequently, ~ is symmetric.
    Follow Math Help Forum on Facebook and Google+

Page 2 of 2 FirstFirst 12

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: April 6th 2011, 11:46 PM
  2. Show Equivalence Relation
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: October 19th 2010, 08:51 AM
  3. Show that R is an equivalence relation
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: March 21st 2010, 11:43 AM
  4. Equivalence relation and order of each equivalence class
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: September 30th 2009, 09:03 AM
  5. Equivalence relation and Equivalence classes?
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: January 7th 2009, 03:39 AM

Search Tags


/mathhelpforum @mathhelpforum