Steven G
Elite Member
- Joined
- Dec 30, 2014
- Messages
- 14,561
I read a proof from Copilot that basically used the following to show that a mapping was 1-1.
Suppose there are two sets A and B with an equivalence relation, ~, on A. There is a homomorphic mapping T from A to B. In order to show that T is one-to-one the proof basically said suppose that T(x) = T(y), conclude that x~y, and then state T is 1-1
Is that enough to show that T is one-to-one? I really question this unless we think that everything in the same class is the same.
What do you think?
Suppose there are two sets A and B with an equivalence relation, ~, on A. There is a homomorphic mapping T from A to B. In order to show that T is one-to-one the proof basically said suppose that T(x) = T(y), conclude that x~y, and then state T is 1-1
Is that enough to show that T is one-to-one? I really question this unless we think that everything in the same class is the same.
What do you think?