Why is this a flawed proof?
Knowing that $a$ is an element in $A$ and $b$ is an element in $B$. $R$ being a symmetric binary relation:
“Consider any $a$ and $b$ such that $aRb$.
Since $R$ is symmetric, we have $bRa$.
Since $aRb$ and $bRa$, we have $bR^{−1}a$ and $aR^{−1}b$.
Since our choice of $a$ and $b$ was arbitrary, we have proven that $R^{−1}$ is symmetric.”
There's apparently a flaw with this, but I can't for the life of me figure it out.
[Homework Question]
Thanks in advance.
Apart from the oddity of talking about symmetry in connection with a relation $R\subseteq A\times B$, where $A$ and $B$ may be different, there is a logical flaw in the argument. The assumption is that $R$ is symmetric, and you want to prove from this that $R^{-1}$ is symmetric. That means that you want to show that
That’s what you have to prove, using the assumption that $R$ is symmetric. That means that you should be starting with an arbitrary $b\in B$ and $a\in A$ such that $bR^{-1}a$, not with an arbitrary $a\in A$ and $b\in B$ such that $aRb$. Here’s a correct argument:
I’m reasonably sure that that’s what they had in mind, but there is, as Babak suggests in his answer, a completely different way to prove the result: prove that a relation $R$ is symmetric if and only if $R=R^{-1}$, and the result that you want here is a trivial consequence. The proof that $R$ is symmetric if and only if $R=R^{-1}$ is pretty straightforward. If $R$ is symmetric, then for any $a\in A$ and $b\in B$,
$$\begin{align*} \langle a,b\rangle\in R\quad&\text{iff}\quad\langle b,a\rangle\in R&&\text{by symmetry of }R\\ &\text{iff}\quad\langle a,b\rangle\in R^{-1}&&\text{by definition of }R^{-1}\;, \end{align*}$$
so $R=R^{-1}$, and the reverse implication is essentially the same steps in reverse.