We define the relationship between the two sets $S_1≡S_2$ if and only if $|S_1|=|S_2|$.
How to show that $≡$ is an equivalence relation ?
sorry I'm from Iran and Basic my English is poor.
We define the relationship between the two sets $S_1≡S_2$ if and only if $|S_1|=|S_2|$.
How to show that $≡$ is an equivalence relation ?
sorry I'm from Iran and Basic my English is poor.
we say that $|s_1|=|s_2|$ if there is a funtion $f:S_1\rightarrow S_2$ such that $f$ is a bijection, so Is clear that $S\cong S$ putting $f=I_s$ where $I_s(x)=x, \forall x \in S$, now if $S_1\cong S_2$ then $S_2\cong S_1$ ussing like bijecction $f^{-1}:S_2\rightarrow S_1$, and finally if $S_1\cong S_2$ and $S_2\cong S_3$ there are bijeecion $f,g$ and doing the composition $g\circ f $ we get a bijecction between $S_1$ and $S_3$ so $S_1\cong S_3$, formally this is not a relation because the realction are definided over sets and this not, but I think tah this is that you want. the best :)