Can we always find a non-commutative algebraic operation in a non-empty set?
Noncommutative algebraic operation.
111 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail AtThere are 3 best solutions below
On
If the set has just one element, there's only one binary operation, which is obviously commutative.
If the set has at least two elements, let $x$ and $y$ be distinct elements and define $$ x\cdot y=x,\quad y\cdot x=y, $$ and $z\cdot x=x\cdot z=z\cdot y=y\cdot z=x$ for all other elements $z$
On
If I understand your question, the answer is yes - given any set $X$ with more than one element, let $*$ be left projection: $x*y=x$.
If we ask for a noncommutative operation satisfying some other restrictions, of course, then the answer can be quite surprising. My favorite example: there are no noncommutative division rings of finite cardinality! That is, given any finite abelian group $(G, +)$, there is no binary operation $*$ on $G$ such that $(G, *)$ is a division ring and $*$ is noncommutative. This is Wedderburn's little theorem; I'm still shocked by this result.
composition is a non-commutative binary operation on the set of bijections with domain and codomain $A$ whenever $|A|>2$