This is a problem about relations from Proofs and Fundamentals by Ethan D. Bloch that I’m having some doubts and I would really appreciate if you could guide me.
The problem starts with the following definition:
Definition: Let $A,B$ be sets, and let $\mathcal{R}, \mathcal{S}$ be relations on $A$ and $B$, respectively. Let $f: A \rightarrow B$ be a map. We say that $f$ is relation preserving if and only if $xRy$ iff $f(x)Sf(y)$ for all $x, y \in A$.
After this we have the following result:
Result: Suppose that $f$ is surjective and relation preserving. Then $\mathcal{R}$ is reflexive, symmetric or transitive iff $\mathcal{S}$ is reflexive, symmetric or transitive (respectively).
I attempt to show the reflexive part. And I have the following:
Proof: $\implies$. Suppose that $\mathcal{R}$ is reflexive. By definition, we have that $aRa$ for all $a \in A$. Since $f$ is relation preserving, it follows that $f(a)Sf(a)$. Since $f$ is surjective, we know that for all $b \in B$, there existis an element $a \in A$ such that $b = f(a)$. From this we know that $f(a)Sf(a)$ for all $f(a) \in B$. Hence, by definition, $\mathcal{S}$ is reflexive.
$\Longleftarrow$. Suppose that $\mathcal{S}$ is reflexive. By definition, we have that $bSb$ for all $b \in B$.
Although, I don’t know what the next step should be. How can I deduce that $\mathcal{R}$ is reflexive?
Also, will the proof for the other two properties be similar to this one?
Thank you for your attention!
Suppose that $\mathcal{S}$ is reflexive, let $a\in A$, and let $b=f(a)$. Since $f$ is relation-preserving, $a\,\mathcal{R}\,a$ iff $f(a)\,\mathcal{S}\,f(a)$, i.e., iff $b\,\mathcal{S}\,b$. And $\mathcal{S}$ is reflexive, so $b\,\mathcal{S}\,b$, and therefore $a\,\mathcal{R}\,a$. Thus, $\mathcal{R}$ is reflexive.
Yes, the other two properties can be proved in much the same fashion.