Some abstract algebra books assume that multiplication is closed for the natural numbers, integers, rational numbers, real numbers and complex numbers.
Multiplication in the complex numbers is defined at the expense of multiplication in the real numbers. In fact the complex numbers themselves are constructed at the expense of the real numbers.
Multiplication in the real numbers is defined at the expense of multiplication in the rational numbers. In fact the real numbers themselves are constructed at the expense of the rational numbers.
Multiplication in the rational numbers is defined at the expense of multiplication in the integers. Once this is done, you can prove that multiplication in the rational numbers is closed. In fact the rational numbers themselves are constructed at the expense of the integer numbers.
Multiplication in the integers in defined at the expense of multiplication in the natural numbers. In fact the integers themselves are constructed at the expense of the natural numbers.
It works just the same for the sum.
So it boils down to knowing how to define multiplication in the natural numbers and then constructing each of the steps above.
Multiplication in the natural numbers is defined, by the way, at the expense of the sum in the natural numbers.
Some abstract algebra books deal with part of the process above. I've never seen it all done in an abstract algebra book. Usually sum in the natural numbers is assumed and the rest is done from there.
To see how the sum is defined in the natural numbers, you should pick up an elementary set theory book.
It goes roughly like this. One starts with the set of natural numbers (which can also be defined) to which something called $0$ belongs and a successor function, i.e., a function that given a natural number, yields what one would intuitively call its successor. Given a natural number $n$, it's common to denote it's successor by $n^+$.
From this one defines $+_{\mathbb N}$, recursively, as follows: let $m,n\in \mathbb N$, then
- $n+_{\mathbb N}0:=0$
- $n+_{\mathbb N}m^+:=(n+_{\mathbb N}m)^+$
From here one can prove the expected properties such as $n+_{\mathbb N}1=n^+, m+_{\mathbb N}(n+_{\mathbb N}k)=(m+_{\mathbb N}n)+_{\mathbb N}k$, etc.
Then multiplication in $\mathbb N$ can defined and one goes up from there.
I didn't focus on actually proving that multiplication in $\mathbb Q$ is closed because such a problem only arose to the OP because of his unawareness of the process explained above.
\langleinstead of<in the TeX code, it looks better, for example $\langle D,* \rangle$ instead of $< D,* >$. – Jeppe Stig Nielsen Mar 12 '14 at 11:08