Equivalence relation induced by a function

From Maths
Jump to: navigation, search
Stub grade: B
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Something weird happened with every surjective map gives rise to an equivalence relation this page is what it SHOULD be. I also have a reference, granted not that strong of one
Grade: A
This page requires references, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable, it just means that the author of the page doesn't have a book to hand, or remember the book to find it, which would have been a suitable reference.
The message provided is:
Homework assignment isn't sufficient

Statement

Let X and Y be sets and let f:XY be any mapping between them. Then f induces an equivalence relation, ∼⊆X×X where[1]:

  • for x1,x2X we say x1x2 if f(x1)=f(x2)

Note that f may be factored through the canonical projection of an equivalence relation to yield an injection. Furthermore if f is surjective, then so is the induced map, and then the induced map is a bijection.

Proof

Grade: D
This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:
Easy proof, marked as such. Just gotta show it's an equivalence relation

This proof has been marked as an page requiring an easy proof

See also


TODO: Link to continuous version (File:MondTop2016ex1.pdf - Q5)



References

  1. Jump up File:MondTop2016ex1.pdf