I'm taking a college course about first order logics right now and the teacher emphasised the difference between a homomorphism and a strong homomorphism. He also asked us to provide a example of a injective homomorphism that isn't an embedding which is a injective strong homomorphism.
So the difference between a regular homomorphism and a strong homomorphism is that for a regular homomorphism if a relation holds in the source structure it also has to hold in the images of those elements, and the other way is not required. A strong homomorphism also demands that if a relation is true (or false) in the image it also has to be true (or false) in the source. So for a function $h:A\rightarrow B$ to be a strong homomorphism the following has to be true: $R^A(a_1,...,a_n)$ IFF $R^B(h(a_1),...,h(a_n))$
The problem is that since it has to be an injection and a homomorphism (so if $R^A(a_1,...,a_n)$ then $R^B(h(a_1),...,h(a_n))$) I always also make a function for which if $R^B(h(a_1),...,h(a_n))$ then $R^A(a_1,...,a_n)$ also holds true and i get a strong homomorphism.
I already tried it with the usual sets $N,Z,Q$ and relations $<,>,=$ but it seems like something more abastract is needed for this one.
Can someone please give me a hint and prefereably not a complete answer? Thanks in advance!
It should be possible to create a contrived example by picking the relations in the signature just for the purpose of satisfying the condition of homomorphism but not strong homomorphism. Try looking at finite sets, so that you can define a relation $R(x)$ on each element manually in order to control the properties.
Once you have a contrived finite example, that might help you construct examples from more natural mathematical objects, or understand why each of the examples you tried failed.