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

just need clarification with a quick proof of properties of the modulus function to make sure I'm doing the right thing.

$$\forall\ x \in\mathbb{R} : |xy| = |x||y| $$

If I let $ x,y \in\mathbb{ R} $ and prove by exhaustion do I do this by considering when $x \ge 0, y\ge0$ then $|xy| = |x||y|$ and when $x < 0, y<0$ then $|xy| = |-x||-y| = |x||y|$.

Is this the correct way to go about it?

share|cite|improve this question
up vote 2 down vote accepted

That works, but then to complete the proof, you also need to consider,

  • the cases where $\;x \geq 0, \;y\leq 0,\;$ and by symmetry: $\;x \leq 0,\; y\geq 0$.

Since there are only four cases to consider, proof by exhaustion works just fine.

share|cite|improve this answer

yes, but don't forget the case where one argument is positive and the other is negative. In proofs by exhaustion you must make sure you really did exhaust all cases.

Just for the sake of pleasing the most pedantic among us, the proof will look nicer if you write it like this: Assume $x\ge 0$ and $y\ge 0$. Then $xy\ge 0$, and thus, by definition, $|x|=x$ and $|y|=y$ and $|xy|=xy$. So, $|xy|=xy=|x||y|$.

Similarly for the other cases.

share|cite|improve this answer

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.