(Warning: This might be a silly question.) Suppose we have a commutative and associative binary operator $\cdot$ over a set of elements $S$. If $a \cdot t = b\cdot t$ for all $t\in S$, does $a=b$ necessarily? Intuitively I would say "yes", because in the world of this binary operator/set, $a$ and $b$ have the exact same properties. But I'm not sure what being "equal" entails in this context.
Equality with a Binary Operator
2
$\begingroup$
abstract-algebra
-
0I wonder, is there a counterexample where $S^2=S$, i.e., $S=\{xy:x,y\in S\}$? – 2012-12-04
1 Answers
2
No: if $S=\{0,1\}$ and $x\cdot y=0$ for all $x,y\in S$, you can easily check that $\cdot$ is commutative and associative.
-
0@E.R.: You could define relations $\sim_\ell,\sim_r$, and $\sim$ on $S$ by $a\sim_\ell b$ iff $as=bs$ for all $s\in S$, $a\sim_r b$ iff $sa=sb$ for all $s\in S$, and $a\sim b$ iff $a\sim_\ell b$ **and** $a\sim_r b$ and prove easily that all are equivalence relations. – 2012-12-04