Every surjective map gives rise to an equivalence relation
From Maths
Contents
[hide]Warning:
Warning:There is something wrong here, as the surjective property is never used! It is true though that every map, f:X→Y gives rise to an equivalence relation, where x1∼x2 if f(x2)=f(x2) but this doesn't use the surjective part!
- Notice also that in such a case we can factor f through π:X→X/∼ always to yield ˉf, and "distil" the information of f into this new map, ˉf.
This page is a dire page and is in desperate need of an update.
The message is:
Why was it even created?! Fix the surjective problem
Stub grade: C
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:
Flesh out, check existing content then demote to grade F
Grade: D
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:
The message provided is:
Something in Topological Manifolds (Lee) should cover this. Under Quotient topology
Statement
Let X and Y be sets, and let f:X→Y be a surjective mapping. Then we can define an equivalence relation on X, ∼⊆X×X, by:
- For x1,x2∈X, we say x1∼x2 if f(x1)=f(x2)
So we have ∀x1,x2∈X[x1∼x2⟺f(x1)=f(x2)] (for the "and only if" part, see definitions and iff)
- See also: every equivalence relation gives rise to a surjective map, usually written π:X→X/∼ given by π:x↦[x] where [x]:={y∈X |x∼y}, an equivalence class
Purpose
The quotient topology can be defined using a map to identify parts together, but also an equivalence relation can do the same job, this page is half way to showing them to be the same.
Proof
Grade: C
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:
This proof has been marked as an page requiring an easy proof
The message provided is:
This is easy. Truly
This proof has been marked as an page requiring an easy proof
References
Categories:
- Dire pages
- Stub pages
- Pages requiring references
- Pages requiring proofs: Easy proofs
- Pages requiring proofs
- Theorems
- Theorems, lemmas and corollaries
- Elementary Set Theory Theorems
- Elementary Set Theory Theorems, lemmas and corollaries
- Elementary Set Theory
- Set Theory Theorems
- Set Theory Theorems, lemmas and corollaries
- Set Theory