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

We will define the relation ~ on $\mathbb N \times \mathbb N$ by $(a,b)\sim (c,d)$ iff $a + d = b + c$.

Prove that the operation given by: $[(a,b)][(c,d)] \stackrel{\text{def}}= [(ac + bd, ad + bc)]$ is well-defined.

My attempt at this proof:

Let $(a,b)$ and $(a',b')$ be elements of $[(a,b)]$, and similarly, $(c,d)$ and $(c',d')$ be elements of $[(c,d)]$.

My guess is that we need to show that:

$(a'c' + b'd', a'd' + b'c')$ is an element of $[(ac + bd, ad + bc)]$.

So we know the following:

$$aa' + bb' = ab' + ba' \\ cc' + dd' = cd' + bc'$$

But now I'm wondering what to work with. It would be great if someone could give some assistance. Thank you!

Edit: I am also seeking assistance on the following problems:

Q: Prove that $\mathbb N \times \mathbb N$/~ contains an additive identity, i.e. find an element [(i, j)] ∈ $\mathbb N \times \mathbb N$/~ with the property that

$$[(i,j)] + [(c,d)] = [(c,d)] $$

Q: Prove that every element of $\mathbb N \times \mathbb N$/~ has an additive inverse, i.e. for any $[(a,b)] \in \mathbb N \times \mathbb N/~$, show that there exists $[(c,d)] \in \mathbb N \times \mathbb N/~$ such that

$$[(a,b)] + [(c,d)] = [(i,j)]$$ where [(i,j)] is the additive identity.

share|cite|improve this question

What is it all about? We want to introduce the negative numbers, constructed somehow using only the naturals. An integer is represented by $(a,b)$ and it wants to be $a-b$ which not necessarily exist yet (in $\mathbb N$), and now we are only allowed to use $+$ and natural numbers.

How did you get the last 2 equations? They should be $a+b' = b+a'$ and $c+d' = d+c'$..

When $(a,b)\sim(a',b')$, either $a\le a'$ or $a'<a$, because of symmetry, we may also assume the former, if it makes you more comfortable. Then $a'=a+n$ for some $n\in\mathbb N$, and hence, using the defn. of $\sim$, we also have $b'=b+n$. Similarly, we can assume that $c\le c'$ and hence $c'=c+m$ and $d'=d+m$. And.. probably the best is to make one step at one time:

First assume that $C:=(c,d)$ is fixed, and $A:=(a,b)\sim (a',b')=:A'$, then show that $AC\sim A'C$. Finally this same step applies for $A'C\sim A'C'$.

For the rest two questions, guess what integers are represented by the following pairs: $(149,149)$, $(2,7)$, $(7,2)$.. hope it helps

share|cite|improve this answer
Makes sense, thank you. Would you be able to assist on the other 2 questions? – Julian Park Oct 7 '12 at 16:17
just post them.. – Berci Oct 7 '12 at 16:17
Dear Berci, they're in this thread. (under the edit). Thank you. – Julian Park Oct 7 '12 at 16:21
..well.. I would suggest to start them by yourself. Have any ideas? Guess, what could be an $(i,j)$ for the unit of +? What could be the additive inverse of an $(a,b)$? – Berci Oct 7 '12 at 16:23
Yes. But, what $(i,j)$ pairs represent zero, and, for $(a,b)$, what pair represents "$-(a,b)$"? Note that we still don't have $-$ yet. For example, what integer does $(2,7)$ represent? – Berci Oct 7 '12 at 16:54

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.