1
$\begingroup$

Let $f:A \rightarrow B$ be a function.

Define a relation $\sim$ on $A$ by $a\sim b$ iff $f(a)=f(b)$.

a) Show that $\sim$ is an equivalence relation on $A$.

b) If $A_{\sim}$ is the set of equivalence classes $\{[a]|a \in A\}$, show that the function $h:A_{\sim} \rightarrow B$ defined by $h([a])=f(a)$ is $1-1$.

I had no problem solving part a) but am confused on what to do for part b). Thanks

  • 1
    As an extra, show that $A=A_{\sim}$ if and ony if $f$ is injective. – 2017-01-21

1 Answers 1

1

Suppose $h([a])=h([b])$, we have $f(a)=f(b)$.

From definition of the relation$\sim$, we have hence we have $a \sim b$ and hence $[a]=[b]$.

  • 0
    thank you so much. I was really close, just didn't think it was that simple! – 2017-01-22