ABSTRACT ALGEBRAIC STRUCTURES OPERATIONS AND ...
ABSTRACT ALGEBRAIC STRUCTURES OPERATIONS AND ...
ABSTRACT ALGEBRAIC STRUCTURES OPERATIONS AND ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
to yield g ◦ ♡ = ♠ ◦ g, using that f and so f is surjective.<br />
Regarding (3) we combine the equations<br />
g ◦ f ◦ ♢ = h ◦ ♢<br />
g ◦ ♡ ◦ f = g ◦ f ◦ ♢ = h ◦ ♢<br />
to deduce that f ◦ ♢ = ♡ ◦ f, since g is injective.<br />
Since these proofs may seem very formalistic and concentrated we repeat them<br />
for the binary case in a more simple form<br />
Proof of (1):<br />
Let a1, a2 ∈ A then<br />
h(a1 ♢ a2) =g(f(a1 ♢ a2))<br />
Proof of (2):<br />
Let b1, b2 ∈ B.<br />
=g(f(a1) ♡ f(a2)) = g(f(a1)) ♠ g(f(a2))<br />
=h(a1) ♠ h(a2)<br />
As f is surjective we can choose a1, a2 ∈ A such that f(a1) = b1, f(a2) = b2.<br />
We then have that<br />
g(b1 ♡ b2) =g(f(a1) ♡ f(a2)) = g(f(a1 ♢ a2)) = h(a1 ♢ a2)<br />
Proof of (3):<br />
=h(a1) ♠ h(a2) = g(f(a1)) ♠ g(f(a2))<br />
=g(b1) ♠ g(b2)<br />
Let a1, a2 ∈ A. First we see that<br />
g(f(a1 ♢ a2)) = h(a1 ♢ a2) = h(a1) ♠ h(a2)<br />
and next that<br />
g(f(a1) ♡ f(a2)) = g(f(a1)) ♠ g(f(a2)) = h(a1) ♠ h(a2)<br />
13