Other Structures Of Rings Of Integers Numbers, Isomorphic Between Them

Abstract

As it is known, often solving a problem in a certain algebraic structure is quite difficult. That is why it is sometimes necessary to transfer the problem in an isomorphic structure with the given one and where it can be solved more easily. But the problem of determining isomorphic algebraic structures at once is quite difficult for pupils / students or even teachers. In this paper we aim to determine other isomorphic commutative ring structures with the ring of integers Z , on different subsets of the set Z , structures different from those known so far. For the beginning, we will see that if a and b are two integers, then on the set of integers at most equal to a, so on the set Z - , a ; and on the set of integers at least equal to b, so on the set Z b , + , we will be able to define such a structure. On the other hand, as it is known, on the set of natural numbers N two internal operations can be defined so that they determine on N an isomorphic ring structure with Z . We will reach this result in this paper for the particular case b=0; moreover, such a structure of the ring we can also define on the set of non-positive integers, for the particular case a=0. In conclusion, we will show that, all known structures of rings of integers are isomorphic to each other and isomorphs with the ring ( Z ,+,.)

Keywords: MathematicsDidactics of Mathematicsinteger numbercommutative ringisomorphism

Introduction

First, we specify that this paper is a continuation of the paper (Vălcan, 2020). So, everything I wrote there is also valid for this work. In addition, it should be noted that the topic proposed for study in this paper is a research topic in Didactics of Mathematics.

Research in Didactics of Mathematics, (which is nothing more than a search with specific reasoning and tools, to access a rational and / or spiritual knowledge in different directions), it is a relatively new field in the world, integrated in the sciences of education (Astolfi & Develey, 1989).

Today, research in the socio-human sciences (hence also in applied didactics), represents a transition from rational to spiritual knowledge; the current tendency being to unite the two ways of knowledge, (the interaction between facts and values takes place in the initial phases of scientific discovery, in the motivation of the approach or in “ inspiration ”, and / or in the stage of connecting the new result to the scientific and social context, that is, to “ contemplate ” the result). The precise direction of research, the choice of methodologies, the coagulation of the results that entered the “ market of ideas ”, the rapid application of conclusions in the daily process of learning Mathematics, all these are concerns of more recent date, fruit of collaboration between teachers, mathematicians, researchers, psychologists, etc. (Ausubel, 1968).

The requirements of a research in didactics must be formulated on the basis that, here, the “ object ” of research becomes the “ subject ” (he is man and society), and “ cause-effect ” relationships are replaced by “ involvement ” relationships, hence the need for interference between the two modes of access to knowledge (Vălcan 2013).

Problem Statement

As I mentioned in (Vălcan, 1997) in the research part, we consider the Didactics of Mathematics as an activity of mathematicians who are interested in learning Mathematics - as an educational discipline, using the methodologies and theories used in science, philosophy, psychology and / or pedagogy. From this point of view, at present, we can distinguish four major trends in Didactics of Mathematics:

  • the reconstruction of the contents of the Mathematics taught in the school, a reconstruction guided by an epistemological exigency;

  • designing, testing and evaluating new projects in mathematics education (not only Romanian), proposing in a coherent manner:

  • purposes and objectives adapted to the current requirements of society,

  • notional contents to keep up with the development of Mathematics as a science,

  • activities and didactic means specific to learning Mathematics, which should take into account:

  • the cognitive processes through which the assimilation and understanding of students is achieved,

and

  • the processes that appear in the communication relations of the teacher-social microgroup type.

  • intensive study of the acquisition of notions, formation of ideas and reasoning in students, for a better knowledge of their difficulties or possibilities, in learning Mathematics;

  • the extensive evaluation of the competencies and attitudes developed in the students, by learning Mathematics, as well as the psycho-socio-economic implications of this learning.

Well, considering all this, we can say that the topic under study in this paper, as well as others, falls into Category (A).

Research Questions

In our research we will try to find answers to the following questions:

-There are others structures of commutative ring defined on sets of integers, apart from the known ones, and which are isomorphic to the commutative ring of integers, (Z,+,)?

-How can these structures be identified?

Regarding the first question

We are thinking here of sets of integers, unbounded inferior, but bordered superiorly, or vice versa.

Regarding the second question

We refer here to the ways of determining both these structures and the isomorphisms between them.

Purpose of the Study

Therefore, we answered the two questions in Paragraph 3. Thus, for any numbers a , b Z there are two pairs of laws of internal composition on the sets Z - , a and Zb,+∞, let's say „♣” and „♦”, respectively „♥” and „♠”, so that (Z-∞,a,♣, ♦) and (Zb,+∞,♥,♠,) become commutative rings isomorphic to the ring (Z,+,).

Concretely, on the set of integers at most equal to 3, which we denote with Z -∞,3 and on the set of integers at least equal to 5, which we denote with Z 5, + ; we can define two pairs of laws of internal composition so that let's say „” and „”, respectively „” and „”, so that ( Z -∞,3,♣, ♦) and ( Z 5,+∞,♥,♠) become commutative rings isomorphic to the ring ( Z ,+,).

Research Methods

Let be a, b Z . We note with:

Z -∞,a=x Z xaand Z b,+∞=x Z xb.

Then the functions:

fb : Z Z b,+∞and ga : Z Z -∞,a

defined by:

f b x = b + 2 x , i f x 0 b - 2 x - 1 , i f x < 0 and g a x = a - 2 x , if x 0 a + 2 x + 1 , if x < 0

are bijections, and their inverses are functions:

f b - 1 : Z b,+∞ Z and g b - 1 : Z -∞,a Z ,

defined by:

f b - 1 ( x ) = x - b 2 , i f x - b i s e v e n - ( x - b ) + 1 2 , i f x - b i s o d d and g a - 1 (x)= a - x 2 , i f x - a i s e v e n - ( a - x ) + 1 2 , i f x - a i s o d d ,

which, according to Vălcan, (2019) shows that:

Z Z b,+∞and Z Z -∞,a,

whence it follows that:

Z b,+∞ Z -∞,a;

the bijection that accomplishes this is:

ha,b=ga f b - 1 : Z b,+∞ Z -∞,a;

where, for every x Z b,+∞,

ha,b(x)=ga( f b - 1 (x))= a - 2 f - 1 ( x ) , i f f - 1 ( x ) 0 a + 2 f - 1 ( x ) + 1 , i f f - 1 ( x ) < 0 =a+b-x

=a-(x-b),

and

h a , b - 1 =fb g a - 1 : Z -∞,a Z b,+∞;

where, for every x Z -∞,a,

h a , b - 1 x = f b g a - 1 x = b + 2 g - 1 x , i f g - 1 x 0 b - 2 g - 1 x - 1 , i f g - 1 x < 0 = a + b - x

It follows that the following diagram (A) is commutative (see figure 1 ):

Diagram (A)

The first fundamental result of this paragraph is:

Theorem 5.1: For every number a Z , there are two laws of internal composition, let's say „♣” and „♦”, on the set Z -∞,a, such that ( Z -∞,a,♣, ♦) to become is a commutative ring isomorphic to the ring ( Z ,+,).

Proof : We transfer the ring structure from Z to Z -∞,a, using the function:

ga : Z Z -∞,a,

where, for every x Z ,

g a x = a - 2 x , i f x 0 a + 2 x + 1 , i f x < 0 and

and

g a - 1 : Z -∞,a Z ,

is defined by:

g a - 1 x = a - x 2 , i f a - x i s e v e n - a - x + 1 2 , i f a - x i s o d d .

So, according to Vălcan (2017), we obtain the two laws of composition „♣” and „♦” on the set of integers Z -∞,a. Let be x, y Z -∞,a. For defining the law „♣”, we distinguish the following cases:

Case 1 : a-x and a-y are even. Then:

x y = g g - 1 x + g - 1 y = g a - x 2 + a - y 2 = g 2 a - x - y 2

= a - 2 2 a - x - y 2 = x + y - a = a - a - x - a - y .

Case 2 : a-x and a-y are odd. Then:

x y = g g - 1 x + g - 1 y = g - a - x + 1 2 - a - y + 1 2

= g - 2 a + x + y - 2 2 = a + 2 - 2 a + x + y - 2 2 + 1 = x + y - a - 1

= a - ( a - x ) - ( a - y ) - 1 .

Case 3 : a-x is even and a-y is odd. Then:

x y = g g - 1 x + g - 1 y = g a - x 2 - a - y + 1 2

= g - x + y - 1 2 = a - ( - x + y - 1 ) , i f y x + 1 a + ( - x + y - 1 ) + 1 , i f y < x + 1

= a - a - x + a - y + 1 , i f y x + 1 a + a - x - a - y , i f y < x + 1 .

Case 4 : a-x is odd and a-y is even. Then:

x y = g g - 1 x + g - 1 y = g - a - x - 1 2 + a - y 2

= g x - y - 1 2 = a - x - y - 1 , i f x y + 1 a + x - y - 1 + 1 , i f x < y + 1

= a + a - x - a - y + 1 , i f x y + 1 a - a - x + a - y , i f x < y + 1 .

Therefore, for every x, y Z -∞,a.,

x y = a - a - x - a - y , i f a - x , a - y a r e e v e n a - a - x - a - y - 1 , i f a - x , a - y a r e o d d , a - a - x + a - y + 1 , i f a - x i s e v e n , a - y i s o d d a n d y x + 1 a + a - x - a - y , i f a - x i s e v e n , a - y i s o d d a n d y < x + 1 a + a - x - a - y + 1 , i f a - x i s o d d , a - y i s e v e n a n d x y + 1 a - a - x + a - y , i f a - x i s o d d , a - y i s e v e n a n d x < y + 1 .

Now, for defining the law „♦”, we distinguish the following cases:

Case 1 : a-x and a-y are even. Then:

x♦y=g(g-1(x)g-1(y))= g a - x 2 a - y 2 =g ( a - x ) ( a - y ) 4 =a-2 ( a - x ) ( a - y ) 4

=a- ( a - x ) ( a - y ) 2 .

Case 2 : a-x and a-y are odd. Then:

x♦y=g(g-1(x)g-1(y))= g ( a - x ) + 1 2 ( a - y ) + 1 2 =a-2 [ ( a - x ) + 1 ] 2 [ ( a - y ) + 1 ] 2

=a- [ ( a - x ) + 1 ] [ ( a - y ) + 1 ] 2 .

Case 3 : a-x is even and a-y is odd. Then:

x♦y=g(g-1(x)g-1(y))= g - a - x 2 ( a - y ) + 1 2

=a- ( a - x ) [ ( a - y ) + 1 ] 2 +1.

Case 4 : a-x is odd and a-y is even. Then:

x♦y=g(g-1(x)g-1(y)) =g - ( a - x ) - 1 2 a - y 2

=a- ( a - y ) [ ( a - x ) + 1 ] 2 +1.

Therefore, for every x, y Z -∞,a,

x♦y= a - a - x a - y 2 , i f a - x , a - y a r e e v e n a - a - x + 1 a - y + 1 2 , i f a - x , a - y a r e o d d , a - a - x a - y + 1 2 + 1 , i f a - x i s e v e n a n d a - y i s o d d , a - a - x + 1 a - y 2 + 1 , i f a - x i s o d d a n d a - y i s e v e n , .

On the other hand,

e Z - , a =ga(e Z )=ga(0)=a

and

-x Z - , a =ga(-g a - 1 (x))= a - a - x - 1 , i f a - x i s o d d a - a - x + 1 , i f a - x i s e v e n

= x - 1 , i f a - x i s o d d x + 1 , i f a - x i s e v e n ,

and:

1 Z - , a =ga(1)=a-2

and

x Z - , a - 1 =ga 1 g a - 1 ( x ) = g a 2 a - x , i f a - x i s e v e n g a - 2 a - x + 1 , i f a - x i s o d d

= a - 4 a - x , i f a - x i s e v e n a - 4 a - x + 1 + 1 , i f a - x i s o d d .

But, if a-x is even, then:

2 a - x Z if and only ifa-x=2,

that is:

x=a-2=ga(1),

and if a-x is odd, then:

2 a - x + 1 Z if and only ifa-x=1,

that is:

x=a-1=ga(-1).

Therefore, according to Vălcan (2017), ( Z -∞,a,♣, ♦) is a commutative ring isomorphic to the ring ( Z ,+,), and the only invertible elements in the ring Z -∞,a are:

a-2 and a-1.

Now let's show that, indeed, the function:

ga : Z Z -∞,a,

defined by: for any x Z ,

ga(x)= a - 2 x , i f x 0 a + 2 x + 1 , i f x < 0 ,

is an isomorphism between the two rings. For this, we first notice that, for every x, y Z ,

ga(x+y)= a - 2 x + y , i f x + y 0 a + 2 x + y + 1 , i f x + y < 0 .

Then:

a-ga(x)= 2 x , i f x 0 - 2 x - 1 , i f x < 0 anda-ga(y)= 2 y , i f y 0 - 2 y - 1 , i f y < 0 .

To determine the expression ga(x)♣ga(y) we distinguish the following cases:

Case 1 : a-ga(x) and a-ga(y) are even. Then:

ga(x)♣ga(y)=a-(a-ga(x))-(a-ga(y))=ga(x)+ga(y)-a

=a-2(x+y).

Case 2 : a-ga(x) and a-ga(y) are odd. Then:

ga(x)♣ga(y)=a-(a-ga(x))-(a-ga(y))-1=ga(x)+ga(y)-a-1

=a+2(x+y)+1.

Case 3 : a-ga(x) is even and a-ga(y) is odd. Then:

ga(x)♣ga(y)= a - a - g a x + a - g a y + 1 , i f g a y g a x + 1 a + a - g a x - a - g a y , i f g a y < g a x + 1

= a - 2 x + y , i f x + y 0 a + 2 x + y + 1 , i f x + y < 0 .

Case 4 : a-ga(x) is odd and a-ga(y) is even. Then:

ga(x)♣ga(y)= a + a - g a x - a - g a y + 1 , i f g a ( x ) g a ( y ) + 1 a - a - g a x + a - g a y , i f g a ( x ) < g a ( y ) + 1

= a - 2 x + y , i f x + y 0 a + 2 x + y + 1 , i f x + y < 0 .

It follows that for every x, y Z :

ga(x+y)=ga(x)♣ga(y).

Now, to determine the expression ga(x)♦ga(y) we distinguish the following cases:

Case 1 : a-ga(x) and a-ga(y) are even. Then x0 and y0, and

ga(x)♦ga(y)= a - ( a - g a ( x ) ) ( a - g a ( y ) ) 2

=a-2xy.

Case 2 : a-ga(x) and a-ga(y) are odd. Then x0 and y0, and:

ga(x)♦ga(y)= a - [ ( a - g a ( x ) ) + 1 ] [ ( a - g a ( y ) ) + 1 ] 2

=a-2xy.

Case 3 : a-ga(x) is even and a-ga(y) is odd. Then x0 and y0, and:

ga(x)♦ga(y)= a - ( a - g a ( x ) ) [ ( a - g a ( y ) ) + 1 ] 2 + 1

=a+2xy+1.

Case 4 : a-ga(x) is odd and a-ga(y) is even. Then x0 and y0, and:

ga(x)♦ga(y)=a- ( a - g a ( y ) ) [ ( a - g a ( x ) ) + 1 ] 2 +1

=a+2xy+1.

On the other hand,

ga(xy)= a - 2 ( x y ) , i f x y 0 a + 2 ( x y ) + 1 , i f x y < 0 .

So, for every x, y Z ,

ga(xy)=ga(x) ♦ga(y).

Therefore, according to Vălcan (2017), ( Z -∞,a,♣, ♦) is a commutative ring isomorphic to the ring ( Z ,+,).

Remark 5.2: For a=0, from Theorem 5.1, obtain the ring structure on the set Z -∞,0, of non-positive integers, transferred from the ring ( Z ,+,) by function:

g0 : Z -∞,0 Z ,

defined by:

g0(x)= - 2 x , i f x 0 2 x + 1 , i f x < 0

and for which the inverse is:

g 0 - 1 : Z - ,0 Z ,

defined by :

g 0 - 1 x = - x 2 , i f x i s e v e n x - 1 2 , i f x i s o d d .

The second fundamental result of this paper is:

Theorem 5.3: For every b Z , there are two laws of internal composition, let's say „♥” and „♠”, on the set Z b,+∞, such that ( Z b,+∞,♥,♠) to become is a commutative ring isomorphic to the ring ( Z ,+,).

Proof : We transfer the ring structure from Z to Z b,+∞, using the bijection function:

fb : Z Z b,+∞,

where, for every x Z ,

fb(x)= b + 2 x , i f x 0 b - 2 x - 1 , i f x < 0 ,

and

f b - 1 : Z b,+∞ Z ,

is defined by:

f b - 1 ( x ) = x - b 2 , i f x - b i s e v e n - x - b + 1 2 , i f x - b i s o d d .

Hence, according to Vălcan (2017), obtain the two composition laws „♥” and „♠” on Z b,+∞. Let be x, y Z b,+∞. For defining the law „♥”, we distinguish the following cases:

Case 1 : x-b and y-b are even. Then:

x♥y= fb(f b - 1 (x)+f b - 1 (y))=fb x - b 2 + y - b 2 =fb x + y - 2 b 2

=b+2 x + y - 2 b 2 =x+y-b

=b+(x-b)+(y-b).

Case 2 : x-b and y-b are odd. Then:

x♥y=fb(f b - 1 (x)+f b - 1 (y))=fb - ( x - b ) + 1 2 - ( y - b ) + 1 2

=fb 2 b - x - y - 2 2 =b-2 2 b - x - y - 2 2 -1=x+y-b+1

=b+(x-b)+(y-b)+1.

Case 3 : x-b is even and y-b is odd. Then:

x♥y=fb(f b - 1 (x)+f b - 1 (y))=fb x - b 2 - ( y - b ) + 1 2

=fb x - y - 1 2 = b + x - y - 1 , i f x y + 1 b - x - y - 1 - 1 , i f x < y + 1

= b + x - b - y - b - 1 , i f x y + 1 b - x - b + y - b , i f x < y + 1 .

Case 4 : x-b is odd and y-b is even. Then:

x♥y=fb(f b - 1 (x)+f b - 1 (y))=fb - ( x - b ) - 1 2 + y - b 2

=fb - x + y - 1 2 = b + ( - x + y - 1 ) , i f y x + 1 b - ( - x + y - 1 ) + 1 , i f y < x + 1

= b - ( x - b ) + ( y - b ) - 1 , i f y x + 1 b + ( x - b ) - ( y - b ) , i f y < x + 1 .

Therefore, for every x, y Z b,+∞,

x♥y= b + x - b + y - b , i f x - b a n d y - b a r e e v e n b + x - b + y - b + 1 , i f x - b a n d y - b a r e o d d , b + x - b - y - b - 1 , i f x - b i s e v e n , y - b i s o d d a n d x y + 1 b - x - b + y - b , i f x - b i s e v e n , y - b i s o d d a n d x < y + 1 b - x - b + y - b - 1 , i f x - b i s o d d , y - b i s e v e n a n d y x + 1 b + x - b - y - b , i f x - b i s o d d , y - b i s e v e n a n d y < x + 1 .

Now, defining the law „♠”, we distinguish the following cases:

Case 1 : x-b and y-b are even. Then:

x♠y=fb(f b - 1 (x)f b - 1 (y))=fb x - b 2 y - b 2 =fb ( x - b ) ( y - b ) 4 =b+2 ( x - b ) ( y - b ) 4

=b+ ( x - b ) ( y - b ) 2 .

Case 2 : x-b and y-b are odd. Then:

x♠y=fb(f b - 1 (x)f b - 1 (y))=fb ( x - b ) + 1 2 ( y - b ) + 1 2 =b+2 [ ( x - b ) + 1 ] 2 [ ( y - b ) + 1 ] 2

=b+ [ ( x - b ) + 1 ] [ ( y - b ) + 1 ] 2 .

Case 3 : x-b is even and y-b is odd. Then:

x♠y=fb(f b - 1 (x)f b - 1 (y))=fb - x - b 2 ( y - b ) + 1 2

=b+ ( x - b ) [ ( y - b ) + 1 ] 2 -1.

Case 4 : x-b is odd and y-b is even. Then:

x♠y=fb(f b - 1 (x)f b - 1 (y))=fb - ( x - b ) - 1 2 y - b 2

=b+ ( y - b ) [ ( x - b ) + 1 ] 2 -1.

Therefore, for every x, y Z b,+∞,

x♠y= b + ( x - b ) ( y - b ) 2 , i f x - b a n d y - b a r e e v e n b + [ ( x - b ) + 1 ] [ ( y - b ) + 1 ] 2 , i f x - b a n d y - b a r e o d d , b + ( x - b ) [ ( y - b ) + 1 ] 2 - 1 , i f x - b i s e v e n a n d y - b i s o d d , b + [ ( x - b ) + 1 ] ( y - b ) 2 - 1 , i f x - b i s o d d a n d y - b i s e v e n , .

On the other hand,

e Z b , + =fb(e Z )=fb(0)=b

and

-x Z b , + =fb(-f b - 1 (x))= b + x - b - 1 , i f x - b i s e v e n a n d x - b 2 b , i f x = b b + x - b + 1 , i f x - b i s o d d

= x - 1 , i f x - b i s e v e n a n d x - b 2 b , i f x = b x + 1 , i f x - b i s o d d ,

and:

1 Z b , + =fb(1)=b+2

and

x Z a , + - 1 =fb 1 f b - 1 ( x ) = f b 2 x - b , i f x - b i s e v e n f b - 2 x - b + 1 , i f x - b i s o d d

= b + 4 x - b , i f x - b i s e v e n b + 4 x - b + 1 - 1 , i f y - b i s o d d .

But, if x-b is even, then:

2 x - b Z if and only ifx-b=2,

that is:

x=b+2=fb(1),

and if x-b is odd, then:

2 x - b + 1 Z if and only ifx-b=1,

that is:

x=b+1=fb(-1).

Therefore, according to Vălcan (2017), ( Z b,+∞,♥,♠) is a commutative ring isomorphic to the ring ( Z ,+,), and the only invertible elements in the ring Z b,+∞ are:

b+2 and b+1.

Now let's show that, indeed, the function:

fb : Z Z b,+∞,

defined by: for every x Z ,

fb(x)= b + 2 x , i f x 0 b - 2 x - 1 , i f x < 0

is an isomorphism between the two rings. For every x, y Z ,

fb(x+y)= b + 2 ( x + y ) , i f x + y 0 b - 2 ( x + y ) - 1 , i f x + y < 0 .

Then:

fb(x)-b= 2 x , i f x 0 - 2 x - 1 , i f x < 0 andfb(y)-b= 2 y , i f y 0 - 2 y - 1 , i f y < 0 .

Now we determine the value of fb(x)♥fb(y). We distinguish the following cases:

Case 1 : fb(x)-b and fb(y)-b are even. Then x0 and y0, and:

fb(x)♥fb(y)=b+(fb(x)-b)+(fb(y)-b)=fb(x)+fb(y)-b=b+2(x+y).

Case 2 : fb(x)-b and fb(y)-b are odd. Then x0 and y0, and:

fb(x)♥fb(y)=b+(fb(x)-b)+(fb(y)-b)+1=fb(x)+fb(y)-b+1=b-2(x+y)-1.

Case 3 : fb(x)-b is even and fb(y)-b is odd. Then x0 and y0, and:

fb(x)♥fb(y)= b + f b x - b - f b y - b - 1 , i f f b ( x ) f b ( y ) + 1 b - f b x - b + f b y - b , i f f b ( x ) < f b ( y ) + 1

= b + 2 x + y , i f x + y 0 b - 2 x + y - 1 , i f x + y < 0 .

Case 4 : fb(x)-b is odd and fb(y)-b is even. Then:

fb(x)♥fb(y)= b - ( f b ( x ) - b ) + ( f b ( y ) - b ) - 1 , i f f b ( x ) f b ( y ) + 1 b + ( f b ( x ) - b ) - ( f b ( y ) - b ) , i f f b ( x ) < f b ( y ) + 1

= b - ( f b ( x ) - b ) + ( f b ( y ) - b ) - 1 , i f f b ( x ) f b ( y ) + 1 b + f b x - b - f b y - b , i f f b ( x ) < f b ( y ) + 1 .

It foolows that, for every x, y Z :

fb(x+y)=fb(x)♥fb(y).

Now, to determine the expression fb(x)♠fb(y), we distinguish the following cases:

Case 1 : fb(x)-b and fb(y)-b are even. Then, x0 and y0, and:

fb(x)♠fb(y)=b+ ( f b ( x ) - b ) ( f b ( y ) - b ) 2 =b+2xy.

Case 2 : fb(x)-b and fb(y)-b are odd. Then, x0 and y0, and:

fb(x)♠fb(y)=b+ [ ( f b ( x ) - b ) + 1 ] [ ( f b ( y ) - b ) + 1 ] 2 =b+2xy.

Case 3 : fb(x)-b is even and fb(y)-b is odd. Then, x0 and y0, and:

fb(x)♠fb(y)=b+ ( f b ( x ) - b ) [ ( f b ( y ) - b ) + 1 ] 2 -1=f-2xy-1.

Case 4 : fb(x)-b is odd and fb(y)-b is even. Then:

fb(x)♠fb(y)=b+ ( f b ( y ) - b ) [ ( f b ( x ) - b ) + 1 ] 2 -1=b-2xy-1.

On the other hand,

fb(xy)= b + 2 x y , i f x y 0 b - 2 x y - 1 , i f x y < 0 .

Hence, for every x, y Z ,

fb(xy)=fb(x)♠fb(y).

Now, we can say that the theorem is completely proved.

At the end of this paragraph, three further remarks are required:

Remark 5.4: For b=0 we get the structure of commutative ring on the set Z -∞,0= N , of non-negative integers, transferred from the ring ( Z ,+,) by function:

f0 : Z Z 0,+∞,

defined by:

f0(x)= 2 x , i f x 0 - 2 x - 1 , i f x < 0 ,

whose inverse is the function:

f 0 - 1 : Z 0,+∞ Z ,

defined by:

f 0 - 1 (x)= x 2 , i f x i s e v e n - x + 1 2 , i f x i s o d d .

Remark 5.5: As demonstrated above, for any a, b Z , the rings ( Z -∞,a,♣, ♦) and ( Z b,+∞,♥,♠) are commutative, and the diagram (A) is a commutative diagram of commutative rings.

Remark 5.6: For every number a Z , there are two laws of internal composition, let's say „♣” and „♦”, on the set Z -∞,a, such that ( Z -∞,a,♣, ♦) to become is a commutative ring isomorphic to the ring ( Z ,+,) and there are two laws of internal composition, let's say „♥” and „♠”, on the set Z a,+∞, such that ( Z a,+∞,♥,♠) to become is a commutative ring isomorphic to the ring ( Z ,+,) and so that the following diagram (B) is a commutative diagram of commutative rings:

Figure 1: Diagram (B)
Diagram (B)
See Full Size >

In the diagram (B) (see figure 2 );

Z a,+∞=x Z xaand Z -∞,a=x Z xa.

and functions:

fa : Z Z a,+∞and ga : Z Z -∞,a

defined by:

fa(x)= a + 2 x , i f x 0 a - 2 x - 1 , i f x < 0 andga(x)= a - 2 x , i f x 0 a + 2 x + 1 , i f x < 0 ,

are bijections (they are precisely isomorphisms of rings), whose inverses are:

f a - 1 : Z a,+∞ Z and g a - 1 : Z -∞,a Z ,

defined by:

f a - 1 (x)= x - a 2 , i f x - a i s e v e n - x - a + 1 2 , i f x - a i s o d d and g a - 1 (x)= a - x 2 , i f x - a i s e v e n - a - x + 1 2 , i f x - a i s o d d .

The function that achieves the isomorphism between the rings ( Z -∞,a,♣, ♦) și ( Z a,+∞,♥,♠) is:

ha,a=ga◦f : Z a,+∞ Z -∞,a;

where, for every x Z a,+∞,

ha,a(x)=ga(f(x))= a - 2 f a - 1 x , i f f a - 1 ( x ) 0 a + 2 f a - 1 ( x ) + 1 , i f f a - 1 ( x ) < 0 =2a-x

=a-(x-a),

and

h=fa◦g : Z -∞,a Z a,+∞;

where, for every x Z -∞,a,

h(x)=fa(g(x))= a + 2 g a - 1 x , i f g - 1 ( x ) 0 a - 2 g a - 1 ( x ) - 1 , i f g - 1 ( x ) < 0 =2a-x

=a+(a-x).

Findings

Therefore, we answered the two questions in Paragraph 3. Thus, for any number a, b Z there are two pairs of laws of internal composition on the sets Z -∞,a and Z b,+∞, let's say „♣” and „♦”, respectively „♥” and „♠”, so that ( Z -∞,a,♣, ♦) and ( Z b,+∞,♥,♠) become commutative rings isomorphic to the ring ( Z ,+,).

Concretely, on the set of integers not more than 3, Z -∞,3, and on the set of integers at least equal to 5, Z 5,+∞, we can define two pairs of laws of internal composition so that let's say „♣” and „♦”, respectively „♥” and „♠”, so that ( Z -∞,3,♣, ♦) and ( Z 5,+∞,♥,♠) become commutative rings isomorphic to the ring ( Z ,+,).

Conclusion

Everything we have done above can be rethought and put differently.

Let be a, b Z . We note with:

Z -∞,a=x Z xaand Z b,+∞=x Z xb.

Then the functions:

ga : Z Z -∞,aand fb : Z Z b,+∞,

defined by:

fb(x)= b - 2 x , i f x 0 b + 2 x - 1 , i f x > 0 andga(x)= a + 2 x , i f x 0 a - 2 x + 1 , i f x > 0

are bijections, and their inverses are functions:

g a - 1 : Z -∞,a Z and f b - 1 : Z b,+∞ Z ,

defined by:

g a - 1 (x)= - a - x 2 , i f x - a i s e v e n ( a - x ) + 1 2 , i f x - a i s o d d andf b - 1 (x)= b - x 2 , i f x - b i s e v e n - b - x - 1 2 , i f x - b i s o d d ,

which, again according to Vălcan (2019), shows that:

Z Z b,+∞and Z Z -∞,a,

whence it follows that:

Z b,+∞ Z -∞,a;

the bijection that accomplishes this is:

ha,b=fb g a - 1 : Z -∞,a Z b,+∞;

where, for every x Z -∞,a,

fb(x)= b - 2 x , i f x 0 b + 2 x - 1 , i f x > 0 andga(x)= a + 2 x , i f x 0 a - 2 x + 1 , i f x > 0

ha,b(x)=fb( g a - 1 (x))= b - 2 g a - 1 ( x ) , i f g a - 1 ( x ) 0 b + 2 g a - 1 ( x ) - 1 , i f g a - 1 ( x ) > 0 =a+b-x

=b+(a-x),

and

h a , b - 1 =ga f b - 1 : Z b,+∞ Z -∞,a;

where, for every x Z b,+∞,

h(x)=ga(f(x))= a + 2 f a - 1 ( x ) , i f f a - 1 ( x ) 0 a - 2 f a - 1 ( x ) + 1 , i f f a - 1 ( x ) > 0 =a+b-x

=a-(x-b).

Therefore the following diagram (C) is commutative (see figure 3 ):

Figure 2: Diagram (C)
Diagram (C)
See Full Size >

Moreover, the results in Paragraph 5 can be obtained in exactly the same way, also starting from these bijections, so that the diagram (C), above, is a commutative diagram of commutative rings. We leave this to the reader who is attentive and interested in these issues.

Now we can say that the next diagram of rings is commutative, that is all the rings in this diagram are isomorphic. Moreover, all commutative rings of integers, determined in (Vălcan, 2020) are isomorphic with those determined in this paper.

So we have the following commutative diagram (D):

Figure 3: Diagram (D)
Diagram (D)
See Full Size >

The isomorphisms in the diagram above are as follows (see figure 4):

f1 : Z Z -∞,a,f1(x)= a - 2 x , i f x 0 a + 2 x + 1 , i f x < 0 ,

f : Z -∞,a Z ,f(x)= a - x 2 , i f x - a i s e v e n - a - x + 1 2 , i f x - a i s o d d ,

f2 : Z Z b,+∞,f2(x)= b + 2 x , i f x 0 b - 2 x - 1 , i f x < 0 ,

f 2 - 1 : Z b,+∞ Z , f 2 - 1 (x)= x - b 2 , i f x - b i s e v e n - x - b + 1 2 , i f x - b i s o d d

f3 : Z N ,f3(x)= 2 x , i f x 0 - 2 x - 1 , i f x < 0 ,

f 3 - 1 : N Z ,f 3 - 1 (x)= x 2 , i f x i s e v e n - x + 1 2 , i f x i s o d d ,

f4 : Z → p Z ,f4(x)=px,

f 4 - 1 : p Z Z , f 4 - 1 (px)=x,

f5 : Z -∞,a Z b,+∞,f5(x)=b+(a-x),

f 5 - 1 : Z b,+∞ Z -∞,a,f 5 - 1 (x)=a-(x-b),

f6=f3◦ f 1 - 1 : Z -∞,a N ,f6(x)=a-x,

f 6 - 1 : N Z -∞,a,f 6 - 1 (x)=a-x,

f7=f4◦ f 2 - 1 : Z b+∞ → p Z ,f7(x)= p x - b 2 , i f x - b i s e v e n - p x - b + 1 2 , i f x - b i s o d d ,

f 7 - 1 : p Z Z b+∞, f 7 - 1 (px)= b + 2 x , i f p x 0 b - 2 x - 1 , i f p x < 0 ,

f8 : N → p Z , f8(x)= p x 2 , i f x i s e v e n - p ( x + 1 ) 2 , i f x i s o d d ,

f 8 - 1 : p Z N ,f 8 - 1 (px)= 2 x , i f p x 0 - 2 x - 1 , i f p x < 0 ,

f9 : N → p N ,f9(x)=px,

f 9 - 1 : p N N ,f 9 - 1 (px)=x,

f10 : p Z → q Z ,f10(px)=qx,

f 10 - 1 : q Z → p Z ,f 10 - 1 (qx)=px,

f11=f10◦f8 : N → q Z , f11(x)= q x 2 , i f x i s e v e n - q ( x + 1 ) 2 , i f x i s o d d ,

f 11 - 1 : q Z N ,f 11 - 1 (qx)= 2 x , i f q x 0 - 2 x - 1 , i f q x < 0 ,

f12=f11◦f 9 - 1 : p N → q Z ,f12(px)= q x 2 , i f x i s e v e n - q x + 1 2 , i f x i s o d d ,

f 12 - 1 : q Z → p N ,f 12 - 1 (qx)= 2 p x , i f q x 0 - p 2 x + 1 , i f q x < 0 ,

f13 : p N → q N , f13(px)=qx,

f 13 - 1 : q N → p N , f 13 - 1 (qx)=px,

f14= f13◦f 12 - 1 : q Z → q N ,f14(qx)= 2 q x , i f q x 0 - q 2 x + 1 , i f q x < 0 ,

f 14 - 1 : q N → q Z ,f 14 - 1 (qx)= q x 2 , i f x i s e v e n - q ( x + 1 ) 2 , i f x i s o d d ,

f15 : N → q N ,f15(x)=qx,

f 15 - 1 : q N N ,f 15 - 1 (qx)=x,

f16=f14◦f10 : p Z → q N ,f16(px)=,

f : q N → p Z ,f(qx)= 2 q x , i f p x 0 - q ( 2 x + 1 ) , i f p x < 0 ,

f17=f15◦f6 : Z -∞,a → q N ,f17(x)=q(a-x),

f 17 - 1 : q N Z -∞,a,f 17 - 1 (qx)=a-x,

f18=f16◦f7 : Z b+∞ → q N ,f18(x)=q(x-b),

f 18 - 1 : q N Z b,+∞,f 18 - 1 (qx)=b+x.

At the end of this paper, we specify that the bijection from Z to N can be considered as a function:

f : Z N ,f(x)= - 2 x , i f x 0 2 x - 1 , i f x > 0 ,

in which case:

f-1 : N Z ,f-1(x)= - x 2 , i f x i s e v e n x + 1 2 , i f x i s o d d .

The determination of the two operations on N is also left to the attentive and interested reader of these issues, to which we yield that we have formed a good image about the determination of the commutative rings of integers, isomorphic between them and isomorphic with the commutative ring ( Z ,+,).

References

  1. Astolfi, J. P., & Develey, M. (1989). La didactique des sciences [Didactics of Science]. PUF.
  2. Ausubel, D. P. (1968). Educational psychology, A cognitive view. New-York, Holt, Rinehart and Winston, Inc.
  3. Vălcan, D. (1997). Investigarea dificultăţilor întâmpinate de elevi în învăţarea unor componente ale conţinutului noţional la disciplinele de ştiinţele naturii [Investigating the difficulties faced by students in learning some components of the notional content in the disciplines of natural sciences]. Lucrările Conferinţei Anuale a Societăţii de Ştiinţe Matematice din România, Bucureşti, 29 May-01 June, vol. II, pp. 157-181.
  4. Vălcan, D. (2013). Didactica Matematicii [Didactics of Mathematics]. Editura Matrix Rom.
  5. Vălcan, D. (2017). An approach from the perspective triple of a problem of Algebra. International Journal of Innovative and Applied Research, 6(2), 5-32.
  6. Vălcan, D. (2019). Equipotent sets - fundamental results. In I. Todor, & L. Tăușan (Eds.), Tradiție și perspective în didactica modernă, Volume. 3, International Conference: "Didactics, tradition, current events, perspectives", 5th Edition, Cluj-Napoca, 17-18 May 2019 (pp. 262-268). Alba-Iulia, Publishing house AEternitas.
  7. Vălcan, D. (2020). Structures of rings of integers numbers, isomorphic between them. European Proceedings of Social and Behavioural Sciences, 85, 492-506.

Copyright information

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

About this article

Publication Date

31 March 2021

eBook ISBN

978-1-80296-103-4

Publisher

European Publisher

Volume

104

Print ISBN (optional)

-

Edition Number

1st Edition

Pages

1-536

Subjects

Education, teacher, digital education, teacher education, childhood education, COVID-19, pandemic

Cite this article as:

Vălcan, T. (2021). Other Structures Of Rings Of Integers Numbers, Isomorphic Between Them. In I. Albulescu, & N. Stan (Eds.), Education, Reflection, Development – ERD 2020, vol 104. European Proceedings of Social and Behavioural Sciences (pp. 384-402). European Publisher. https://doi.org/10.15405/epsbs.2021.03.02.40