Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Can we define a compatible ordering in $\Bbb{Z}_m$?

The ordering is compatible with the operation if:

$x,y,z \in G$ with $x\leq y$ then $x\cdot z\leq y\cdot z$

I have the belief that we can not find this ordering, but how can I prove it?

share|cite|improve this question

Hint: Consider whether $x<e$ or $x>e$ for arbitrary $x$; where $e$ is the identity element.

share|cite|improve this answer
Thank you for your help. – art Mar 30 '13 at 16:50

In case you ask about $(\mathbb{Z}/m,+)$: Try to prove that ordered groups are trivial or infinite.

share|cite|improve this answer
It appears that OP is interested in the multiplicative monoid of $\Bbb{Z}_{m}$, where $m$ looks arbitrary. – Andreas Caranti Mar 23 '13 at 18:21

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.