Set Theoretic Definition of Numbers

I am reading the book by Goldrei on Classic Set Theory. My question is more of a clarification. It is on if we are overloading symbols in some cases. For instance, when we define 2 as a natural number, we define 2N={,{}} When we define 2 as an integer, 2Z is an equivalence class of ordered pair 2Z={(n+N2N,n):nN} Similarly, when we define 2 as a rational number, 2Q is an equivalence class of ordered pair 2Q={(a×Z2Z,a):aZ{0}} and as a real number we define it as the left Dedekind cut of rationals less than 2Q, i.e. 2R={qQ:q<Q2Q}

The clarification is each of the above are different objects right? So when we say 2, it depends on the context? Also, if the above is true, is it correct or incorrect to say that "The set of natural numbers is a subset of reals"? Should we take the statement with a pinch of salt and understand accordingly?


Yes. And no.

You start with N, and define + and × (and < and so on) appropriately.

Then you define an equivalence relation on N×N given by
and call the quotient set (N×N)/ by the name Z. (Behind the scenes, we are thinking of (a,b) as meaning "the solution to a=x+b").

We can then define an addition +Z and a product ×Z on Z, as well as an order Z by
[(a,b)]+Z[(c,d)]=[(a+c,b+d)] [(a,b)]×Z[(c,d)]=[(ac+bd,ad+bc)] [(a,b)]Z[(c,d)]a+db+c,
and show that this is well defined. (I am using [(a,b)] to denote the equivalence class of the pair (a,b).

Certainly, N and Z are entirely different animals; set-theoretically, you can even show that they are disjoint.

But we can define a map f:NZ by f(n)=[(n,0)]. This map is one-to-one, and for all n,mN,
f(n+m)=f(n)+Zf(m), f(n×m)=f(n)×Zf(m) nmf(n)Zf(m)
That means that even though N and Z are disjoint, there is a "perfect copy" of N (in so far as its operations + and × are concerned, and as far as the order is concerned) sitting inside of Z. (Added: In fact, this f not only gives us perfect copy, it is the only map from N to Z that is one-to-one and respects all the operations; we say it is a "canonical embedding"). Since we have this perfect copy, and a very specific map identifying this copy with the original, we can think of N as being a subset of Z by "identifying it with its copy". So we do that. We can then introduce notation by showing that for every [(a,b)]Z, either a=b, or there exists nN, n0, such that [(a,b)]=f(n)=[(n,0)], or there exists nN, n0, such that [(b,a)]=f(n)=[(n,0)]; and then using 0 to denote the class with a=b, n to denote the class with [(a,b)]=[(n,0)], and n to denote the class [(c,d)] with [(d,c)]=[(n,0)]. This notation makes the identification clearer.

Similarly, once we have Z, we define Q as the quotient of Z×(Z{0} modulo , where
(behind the scenes, we think of (a,b) as meaning "the solution to a=xb").
We can then proceed as before, defining
[(a,b)]+Q[(c,d)]=[(ad+bc,bd)] [(a,b)]×Q[(c,d)]=[(ac,bd)]
and showing this is well defined; defining an order, etc. Again, Q and Z (and the original N) are completely different sets. But we have a function g:ZQ defined by g(a)=[(a,1)]. This is one-to-one, g(a+Zb)=g(a)+Qg(b), and g(a×Zb)=g(a)×Qg(b). (Added: And again, this is the only map from Z to Q that satisfies these conditions.) So again, we have a "perfect copy" of Z sitting inside of Q (and so also a perfect copy of the perfect copy of N that is sitting inside of Z). So once again we "identify" Z with its image inside Q (and so we identify N with its image inside the image of Z). Because, via f and g, we have perfect copies of them anyway.

We do the same thing with Q as being "inside of R", by identifying elements of Q with specific Dedekind cuts or with specific equivalence classes of Cauchy sequences, showing the identification is one-to-one and respects all the operations (and is essentially unique), and so obtaining a "perfect copy" of Q inside of R (and by extension, perfect copies of N and of Z also sitting inside of R).

You can keep going, of course: define C as the set of all pairs R×R; then identify R with the pairs R×{0}, and you have a copy of N sitting inside a copy of Z sitting inside a copy of Q sitting inside a copy of R sitting inside C. (And then you can stick C inside the quaternions, the quaternions inside the octonions).

So even though they are actually very different sets, we have copies of each sitting inside the "next one", copies that respect all the structures we are interested in, so we can still think of them as being "subsets".

You used to do that all the time without the formalism: we think of "fractions" as being made up of an integer, a solidus, and a nonzero integer, so that "3" is not a fraction; but when needed, we are perfectly happy writing "3=31" and working with either version of 3 (the integer, or the fraction) depending on context.

Source : Link , Question Author : Community , Answer Author : Mike

Leave a Comment