I am trying to prove the equivalence relation of $(x, y) $ ~ $ (a,b)\ \ \lambda >0$ such that $(a,b) = (\lambda x, \lambda y) $
And describe its equivalence classes. So far I proved that
reflexive: $(x,y)$ ~ $(x, y) \longrightarrow (x, y) = (\lambda x, \lambda y)$ when $\lambda = 1$
symmetry: $(x,y)$ ~ $(a, b) \longrightarrow (x, y) = (\lambda a, \lambda b)$ and $(a,b)$ ~ $(x, y) \longrightarrow (a, b) = (\lambda x, \lambda y)$ are the same when $\lambda = 1$
transitive: $(x,y)$ ~ $(a, b) $ and $(a,b)$ ~ $(c, d) \longrightarrow (x, y)$ ~ $(c, d)$ when $\lambda = 1$
I am not so sure about the equivalence classes and how they would look geometrically.
Your proof for $2$ and $3$ is wrong.
For symmetry:
however, what you then did was assume that $(a,b)\sim (x,y)$, when in fact, that's what you want to prove.
So, I suggest you try this again. And just to recap:
What you know:
What you need to prove:
For transitivity:
You do not know that $(x,y)\sim (c,d)$ when $\lambda=1$. For example, if $(x,y)=(1,1)$, and $(a,b)=(2,2)$, and $(c,d)=(4,4)$, then $(1,1)\sim (4,4)$ even though $\lambda$ in that case is not equal to $1$.
Again, try this proof again, and again, here is a recap:
So, I suggest you try this again. And just to recap:
What you know:
What you need to prove: