Hi guys, im am so frustrated right now. I suck at discrete math. I dont understand it at all, the proffesor talks to fast. Im on the vergre of tears. Plus theres no tutoring for this class, and i really need help. right now i have two problems
1. suppose g: A--->B and f: B---> C are both one to one, prove f (o) g what does the little o mean?) i have no idea how to start this.
2. if E is an equivalance equation on A , then prove or give an counter example, E (o) E is an equivalnce on A. Im not even sure what this is asking. i dont really get equivalance equations or sets and relations really, all i know is E are transitive, reflexive and symmetric.
September 16th 2007, 07:15 PM
Originally Posted by Wardub
1. suppose g: A--->B and f: B---> C are both one to one, prove f (o) g ) i have no idea how to start this.
This notation suggests the succcessive operation of the two functions.
Start with a value from the Domain of 'g'.
Map this through 'g' to the range of 'g'.
This becomes the Domain of some subset of 'f'.
Map the new value through 'f'.
September 16th 2007, 07:17 PM
but there is no value of f or g, what do i do when theres nothing to begin with?
September 17th 2007, 09:20 AM
prove f (o) g
Is this REALLY the problem statement? Doesn't seem like much to go on.
September 17th 2007, 10:17 AM
I assume that #1 is, if are both one-to-one then so is .
The proof is quite easy:
For #2. If are relations on a set that are reflexive, symmetric and transitive then is reflexive, symmetric and transitive.