Discrete math - equivalence relation

  • Thread starter tukilala
  • Start date
  • #1
3
0

Main Question or Discussion Point

Let A be a set. For every set B and total function f:A->B we define a relation R on A by R={(x,y) belonging to A*A:f(x)=f(y)}



*belonging to - because i dont know how to make the symbole....


Prove that f is one-to-one if and only if the equivalence classes of R are all singletones
 

Answers and Replies

  • #2
623
0
You can write TeX code by inserting [ tex] ... [\ tex] and putting the code in between (obviously without the spaces). The notation for element of is \in: [tex] x \in A [/tex].

You can hit quote to see the code behind what I wrote.
 
  • #3
534
1
Have you made any attempt at this problem? It should follow easily from the definitions.
 
  • #4
MathematicalPhysicist
Gold Member
4,168
161
OK, here is one attempt.
f is 1-1 iff for every x,y if f(x)=f(y) then x=y.

The relation is defined by ~<=> x~y<=>f(x)=f(y), thus the equivalence class [x]={y|y~x}={y|f(x)=f(y)} if it's one to one it's evident that [x] is a singleton.
 
  • #5
MathematicalPhysicist
Gold Member
4,168
161
Btw, it's not in the right place this thread of yours, it should be in the set theory section.
 

Related Threads for: Discrete math - equivalence relation

Replies
4
Views
6K
Replies
1
Views
2K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
7
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
9
Views
3K
  • Last Post
Replies
5
Views
5K
Top