My Math Forum Equivalence relation on cartesian product

 Abstract Algebra Abstract Algebra Math Forum

 September 26th, 2014, 04:04 AM #1 Newbie   Joined: Sep 2014 From: Norway Posts: 2 Thanks: 0 Equivalence relation on cartesian product I need some help to interpret the statement below: Let ~ be a relation on a set C. ~ is a transitive, reflexive and symmetric relation on C. Show that ~ âˆ© ({x âˆˆ C: x~x} Ã— {x âˆˆ C: x~x}) is a equivalence relation on {x âˆˆ C: x~x}. How should I interpret the intersection of two sets of ordered pairs generated by ~ and the cartesian product?
 September 26th, 2014, 02:59 PM #2 Senior Member   Joined: Dec 2013 From: Russia Posts: 327 Thanks: 108 If $\sim$ if reflexive, as the problem says, then $\{x\in C: x\sim x\}=C$ and ${\sim}\cap(C\times C)={\sim}$. I think it makes more sense not to assume that $\sim$ is reflexive. Then it is a PER, and it is an equivalence relation on the set where it is reflexive. Thanks from TheRapollo

 Tags cartesian, equivalence, product, relation

### algebra cartesian product relation equivalance relation

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post Taladhis Abstract Algebra 2 February 11th, 2013 09:20 AM page929 Abstract Algebra 1 October 11th, 2010 01:33 PM Dontlookback Abstract Algebra 1 April 20th, 2010 12:52 PM tinynerdi Abstract Algebra 1 January 11th, 2010 10:24 AM otaniyul Linear Algebra 0 October 30th, 2009 07:40 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top