Structures of Fields of Rational Numbers, Isomorphic Between Them

Abstract

As it is known, (I mentioned this) often solving a problem / exercise in a certain algebraic structure is quite difficult. That is why it is sometimes necessary to transfer the respective problem / exercise to an isomorphic structure with the given one and where it can be solved / studied more easily. But the problem of determining isomorphic algebraic structures at once is quite difficult for both pupils and students and teachers. In this paper we propose to build other structures of isomorphic (commutative) field with the field of rational numbers Q, on different subsets of the set Q, structures different from those known / presented so far. To begin with, we will see that if a and b are any two rational numbers, then on the set of rational numbers at most equal to a, so on the set of Q-,a, and on the set of rational numbers at least equal to b, so on the set Qb,+, we will be able to define such a structure. Moreover, all new structures of fields defined here will be isomorphic to each other. It will result, then, that there is a double infinity of structures of (commutative) fields of rational numbers, all isomorphic to each other, but also to the field (Q,+,).

Keywords: Didactics of Mathematics, field, isomorphism, mathematics, rational number

Introduction

To begin with, we will try to answer the following question:

What influence should logic have on the learning of Mathematics?

This question shapes the sector of a fundamental problem of education through Mathematics, because not every notional mathematical content can be learned at once and, consequently, the content of the instruction must be ordered in a certain logical sequence.

When the content of the training is logically ordered, it is arranged according to a hierarchy of principles and concepts that are supposed to be part of the discipline itself. In general, the mathematical knowledge taught in school is organized in a number of mathematical subdisciplines:

Arithmetic,

Algebra,

Geometry, ...,

Each being both a field of knowledge and a way of knowing. Each mathematical subdiscipline includes a way of thinking or investigating a world, a way that has proven its functionality over time. As the knowledge of Mathematics progresses, new sub-domains open up in front of the investigation:

Trigonometry,

Analytical geometry,

Mathematical analysis,

and where existing methods cannot be extended, new disciplines are defined:

Mathematics in art,

Astronomy.

Sometimes established disciplines, such as Projective Geometry, are abandoned. It would therefore follow that the mathematical subdisciplines, at least some of them, do not represent permanent ways of thinking, although it is difficult to imagine how we could dispense with the study of Algebra or Geometry, for example. They are forms of investigation that have proven to be the most effective over time, although they are likely to be reviewed at any time (Vălcan, 2022).

We can say from the perspective of cultural experience that mathematical subdisciplines have proven to be the most efficient way to acquire and organize mathematical knowledge. We can formulate from this experience the premise that those who will learn Mathematics in this framework will acquire their knowledge more efficiently, if they analyze the methods by which this knowledge was discovered and the structures according to which it was organized.

Therefore, in order to be mastered and used, mathematical knowledge must be organized in the lesson, largely similar to the way they are organized, in Mathematical Science. They remain the essential determinant, even if we cannot say that they represent the ideal order of school learning. Other factors must be taken into account in school learning, how are the psychological ones,

a degree of maturity of the student,

skills

his motivation,

factors that act in the manner of conditioning, by reference to the determining character of the mathematical subdisciplines (Astolfi & Develey, 1989).

The term school learning, in general, refers to the process of mnemonic acquisition, active assimilation of information, formation of intellectual operations, motor skills and attitudes. As you can see, we define the school learning process through its product:

information,

intellectual operations,

motor skills,

attitudes,

so depending on what is learned, the content – see (Ausubel, 1968). There is, however, a relative autonomy of the learning process from the product, which results in the existence of legitimacy common to the process as a whole. A study of facts and principles has emerged from the study of learning processes, which remain valid in a wide variety of situations. These make up the theory of learning (or epistemology) whose data and conclusions are taken from and incorporated into Didactics, in particular, in Didactics of Mathematics.

It would be wrong to equate learning with memorization. As some experts note, learning Mathematics is not limited to simply "" the information transmitted by the teacher, storing this information in the "" of the student or updating it when checking the data purchased. Not infrequently, in school practice, there is such an equivalence between learning Mathematics and various memory functions (recognition, preservation or reproduction of mathematical knowledge). The acquisition of mathematical knowledge, the formation of skills to solve exercises and problems, are not just memory tasks; attention intervenes here - as a first condition of learning - then perception (in the form of observation) and thinking - with its operations of analysis, synthesis and generalization - followed by fixation in memory – see (Vălcan, 1997).

Problem Statement

Starting from those presented in the previous paragraph, but within a more general context, that of training and developing the competencies of pupils and students and teachers of solving Mathematics problems, we propose in this paper the construction of new body structures. rational numbers, isomorphic to each other, but also isomorphic to the field (Q,+,).

But, as it is known, and as I mentioned above, often solving a problem / exercise in a certain algebraic structure is quite difficult. That is why it is sometimes necessary to transfer the respective problem / exercise to an isomorphic structure with the given one and where it can be solved / studied more easily. But the problem of determining isomorphic algebraic structures at once is quite difficult for both pupils and students and teachers.

In this paper we propose to build other structures of isomorphic (commutative) field with the field of rational numbers Q, on different subsets of the set Q, structures different from those known / presented so far. To begin with, we will see that if a and b are any two rational numbers, then on the set of rational numbers at most equal to a, so on the set of Q-,a, and on the set of rational numbers at least equal to b, so on the set Qb,+, we will be able to define such a structure. Moreover, all new structures of fields defined here will be isomorphic to each other. It will result, then, that there is a double infinity of structures of (commutative) fields of rational numbers, all isomorphic to each other, but also to the field (Q,+,).

Of course, we will use the ideas from the other papers that focused on similar aspects: first of all, the paper (Vălcan, 2017), which was the basis for the elaboration of other similar papers. We refer here to the work (Vălcan, 2018), where we showed that there is an isomorphic field of functions with the field of real numbers (,+,), then the papers (Vălcan, 2020) and (Vălcan, 2021), where we showed that there are a series of rings of integer numbers, isomorphic between them, but also isomorphic with the ring of integer numbers (,+,).

Research Questions

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

There are others structures of field defined on sets of rational numbers, apart from the known ones, and which are isomorphic to the field of rationals, (Q,+,)?

How can these structures be identified?

Regarding the first question

We are thinking here of sets of rational numbers, 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, bQ there are two pairs of laws of internal composition on the sets Q-,a and Qb,+, let's say „” and „”, respectively „” and „”, so that (Q-,a,,) and (Qb,+,,,) become commutative fields isomorphic to the field (Q,+,).

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

Research Methods

Let be a, b. We note with:

=x xaand=x xb.

Then the functions:

fa :and gb :,

defined by:

fa(x)= a + 1 x , if x ( - , - 1 ] a + x - 1 , if x ( - 1,0 ) a - x - 2 , if x [ 0 , + ) andgb(x)= b - 1 x , , if x ( - , - 1 ] b - x + 1 , if x ( - 1,0 ) b + x + 2 , if x [ 0 , + )

are bijections, and their inverses are functions:

fa-1:and g a-1 :,

defined by:

f a-1 (x)= a - x - 2 ,  if  x ( - , a - 2 ] x - a + 1 ,  if  x ( a - 2 , a - 1 ) 1 x - a ,  if  x [ a - 1 , a ) and g لا-1 (x)= 1 b - x ,  if  x ( b , b + 1 ] b - x + 1 ,  if  x ( b + 1 , b + 2 ) x - b - 2 ,  if  x [ b + 2 , + ) ,

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

and,

whence it follows that:

Q-,a Qb,+;

the bijection that accomplishes this is:

ha,b=gb◦f a-1 :;

where, for every x,

ha,b(x)=(gb◦f a-1)(x)=gb(f a-1 (x))= b - 1 f a - 1 ( x ) ,  if  f a - 1 ( x ) ( - , - 1 ] b - f a - 1 ( x ) + 1 ,  if  f a - 1 ( x ) ( - 1,0 ) b + f a - 1 ( x ) + 2 , if  f a - 1 ( x ) [ 0 , + )

= b - x + a , if  x [ a - 1 , a ) b - x + a - 1 + 1 , , if  x ( a - 2 , a - 1 ) b + a - x - 2 + 2 ,  if  x ( - , a - 2 ] =a+b-x=b+(a-x),

and

h a,b-1 : fa◦g b-1 :; where, for every x,h a,b-1 (x)=a-(x-b).

It follows that the following diagram (a) in Figure 1, is commutative:

Q fa Q-,a

gb

ha,b=gb◦f a-1.

Qb,+

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

The first fundamental result of this paragraph is:

For every number a, there are two laws of internal composition, let's say „” and „”, on the set, such that (,,) to become is a (commutative) field isomorphic to the field (,+,).

We transfer the field structure from to, using the functions:

fa :, where, for every x, fa(x)= a + 1 x ,  if  x ( - , - 1 ] a + x - 1 ,  if  x ( - 1,0 ) a - x - 2 ,  if  x [ 0 , + )

and

f a-1 :,is defined by:f a-1 (x)= a - x - 2 ,  if  x ( - , a - 2 ] x - a + 1 ,  if  x ( a - 2 , a - 1 ) 1 x - a ,  if  x [ a - 1 , a ) .

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

: x, y(-,a-2]. Then:

xy=fa(f a-1 (x)+f a-1 (y))=fa((a-x-2)+(a-y-2))=fa(2a-x-y-4)=a-(2a-x-y-4)-2

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

: x(-,a-2] and y(a-2,a-1). Then:

xy=fa(f a-1 (x)+f a-1 (y))=fa((a-x-2)+(y-a+1))=fa(-x+y-1)

= a + ( a - x ) - ( a - y ) - 2 ,  if  y < x + 1 a - ( a - x ) + ( a - y ) - 1 ,  if  y x + 1 .

: x(-,a-2] and y[a-1,a). Then:

xy=fa(f a-1 (x)+f a-1 (y))=fa ( a - x - 2 ) - 1 a - y

= a + a - y [ ( a - x ) - 2 ] ( a - y ) - 1 ,f  [ ( a - x ) - 1 ] ( a - y ) - 1 a + ( a - x ) - 1 a - y - 3 ,if  [ ( a - x ) - 1 ] ( a - y ) > 1 [ ( a - x ) - 2 ] ( a - y ) < 1 a - ( a - x ) + 1 a - y , if  [ ( a - x ) - 2 ] ( a - y ) 1 .

: x, y(a-2,a-1). Then:

xy=fa(f a-1 (x)+f a-1 (y))=fa((x-a+1)+(y-a+1))=fa(x+y-2a+2)

= a - 1 ( a - x ) + ( a - y ) - 2 ,  if  3 ( a - x ) + ( a - y ) < 4 a - ( a - x ) - ( a - y ) + 1 , , if  2 < ( a - x ) + ( a - y ) < 3 .

: x(a-2,a-1) and y[a-1,a). Then:

xy=fa(f a-1 (x)+f a-1 (y))=fa ( x - a + 1 ) - 1 a - y =a+(a-x)+ 1 a - y -3.

: x, y[a-1,a). Then:

xy=fa(f a-1 (x)+f a-1 (y))=fa - 1 a - x - 1 a - x =a- a - x . a - y a - x + a - y .

Therefore, for every x, y,

xy=a-(a-x)-(a-y)+2, if x, y(-,a-2];

xy= a + ( a - x ) - ( a - y ) - 2 , if y < x + 1 a - ( a - x ) + ( a - y ) - 1 , if y = x + 1 and x(-,a-2], y(a-2,a-1);

xy= a + a - y [ ( a - x ) - 2 ] ( a - y ) - 1 ,f  [ ( a - x ) - 1 ] ( a - y ) 1 a + [ ( a - x ) - 3 ] - 1 a - y , if  [ ( a - x ) - 1 ] ( a - y ) > 1 [ ( a - x ) - 2 ] ( a - y ) < 1 a - ( a - x ) + 1 a - y , if  [ ( a - x ) - 2 ] ( a - y ) 1 and x(-,a-2], y[a-1,a);

xy= a - 1 ( a - x ) + ( a - y ) - 2 ,  if  3 ( a - x ) + ( a - y ) < 4 a - ( a - x ) - ( a - y ) + 1 ,  if  2 < ( a - x ) + ( a - y ) < 3 and x, y(a-2,a-1);

xy=a+(a-x)+ 1 a - y -3, if x(a-2,a-1) and y[a-1,a);

xy=a- a - x . a - y a - x + a - y and x, y[a-1,a).

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

: x, y(-,a-2]. Then:

xy=fa(f a-1 (x)f a-1 (y))=fa((a-x-2)(a-y-2))=a-(a-x-2)(a-y-2)-2

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

: x(-,a-2] and y(a-2,a-1). Then:

  • if x=a-2, then:

xy=fa(f a-1 (x)f a-1 (y))=fa(0(y-a+1))=fa(0)=a-2,

  • if xa-2, then:

xy= a + a - x - 2 y - a + 1 - 1 i f a - x - 2 . [ a - y - 1 ] < 1 a - 1 ( a - x - 2 ) ( a - y - 1 ) , if  [ ( a - x ) - 2 ] [ ( a - y ) - 1 ] 1

= a - ( a - x ) ( a - y ) + ( a - x ) + 2 ( a - y ) - 3 , if  [ ( a - x ) - 2 ] [ ( a - y ) - 1 ] < 1 a - 1 [ ( a - x ) - 2 ] [ ( a - y ) - 1 ] , if  [ ( a - x ) - 2 ] [ ( a - y ) - 1 ] 1

: x(-,a-2] and y[a-1,a). Then:

  • if x=a-2, then:

xy=fa(f a-1 (x)f a-1 (y)) =fa 0 . - 1 a - y =fa(0)=a-2,

  • if xa-2, then:

xy=fa(f a-1 (x)f a-1 (y))=fa ( a - x - 2 ) - 1 a - y = a - ( a - x ) - 2 a - y - 1 ,  if  y < x + 2 a - ( a - y ) ( a - x ) - 2 , if  y x + 2 .

: x, y(a-2,a-1). Then:

xy=fa(f a-1 (x)f a-1 (y))=fa((x-a+1)(y-a+1))=a+(x-a+1)(y-a+1)-1

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

: x(a-2,a-1) and y[a-1,a). Then:

xy=fa(f a-1 (x)f a-1 (y)) =fa x - a + 1 . - 1 a - y =fa a - x - 1 a - y =a- a - x - 1 a - y -2.

: x, y[a-1,a). Then:

xy=fa(f a-1 (x)f a-1 (y)) =fa 1 a - x . 1 a - y =a- 1 a - x . a - y -2.

Therefore, for every x, y,

xy=a-(a-x)(a-y)+2(a-x)+(a-y)-6, if x, y(-,a-2];

  • if x=a-2 and y(a-2,a-1), then:

xy=(a-2)y=a-2;

  • x(-,a-2) and y(a-2,a-1), then:

xy= a - ( a - x ) · ( a - y ) + ( a - x ) + 2 · ( a - y ) - 3 , if [ ( a - x ) - 2 ] · [ ( a - y ) - 1 ] < 1 a - 1 [ ( a - x ) - 2 ] · [ ( a - y ) - 1 ] , if [ ( a - x ) - 2 ] · [ ( a - y ) - 1 ] = 1 ;

  • if x=a-2 and y[a-1,a), then:

xy=(a-2)y=a-2;

  • if x(-,a-2) and y[a-1,a), then:

xy= a - ( a - x ) - 2 a - y - 1 , if y < x + 2 a - ( a - y ) ( a - x ) - 2 , if y = x + 2 ;

xy=a+(a-x)(a-y)-(a-x)-(a-y), if x, y(a-2,a-1);

xy=a- a - x - 1 a - y -2, if x(a-2,a-1) and y[a-1,a);

xy=a- 1 a - x . a - y -2, if x, y[a-1,a).

On the other hand,

eQ-∞aQ-∞a =fa(e)=fa(0)=a-2

and

-x Q-∞a =fa(-f a-1 (x))= a - 1 ( a - x ) - 2 ,f  x ( - , a - 3 ] x + 1 ,  if  x ( a - 3 , a - 2 ) a - 2 ,  if  x = a - 2 x - 1 , if  x ( a - 2 , a - 1 ) a - 1 a - x - 2 ,  if  x [ a - 1 , a ) ,

and:

1 Q-∞a =fa(1)=a-3

and, for every x\a-2,

x -1Q-∞a =fa 1 f a - 1 ( x ) = a - 1 ( a - x ) - 2 - 2 , if  x ( - , a - 2 ) a - 1 ( a - x ) - 1 , if  x ( a - 2 , a - 1 ) a - 1 ,  if  x = a - 1 x - 1 , if  x ( a - 1 , a ) .

Therefore, according to Vălcan (2017), (,,) is a (commutative) field isomorphic to the field of rational numbers, (,+,).

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

fa :, defined by:fa(x)= a + 1 x ,  if  x ( - , - 1 ] a + x - 1 ,  if  x ( - 1,0 ) a - x - 2 ,  if  x [ 0 , + ) ,

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

fa(x+y)= a + 1 x + y ,  if  x + y ( - , - 1 ] a + x + y - 1 ,  if  x + y ( - 1,0 ) a - x - y - 2 ,  if  x + y [ 0 , + ) and fa(xy)= a + 1 x y ,  if  x y ( - , - 1 ] a + x y - 1 ,  if  x y ( - 1,0 ) a - x y - 2 ,  if  x y [ 0 , + ) .

To determine the expressions fa(x)fa(y), respectively fa(x)fa(y), we distinguish the following cases:

: x, y(-,-1. Then:

fa(x)=a+ 1 x a-1,a)andfa(y)=a+ 1 y a-1,a).

It follows that:

fa(x)fa(y)=a+ 1 x + y andfa(x)fa(y)=a-xy-2.

: x(-,-1 and y(-1,0). Then:

fa(x)=a+ 1 x a-1,a)andfa(y)=a+y-1(a-2,a-1).

It follows that:

fa(x)fa(y)=a-x-y-2andfa(x)fa(y)=a-xy-2.

: x(-,-1 and y0,+). Then:

fa(x)=a+ 1 x a-1,a)andfa(y)=a-y-2(-,a-2.

It follows that:

fa(x)fa(y)= a + 1 x + y , i f Y + 1 x 1 a + x + y - 1 , i f x + y - 1 , 0 = a + x + y - 1 , i f x + y ( - 1 , 0 ) a - x - y - 2 , i f x + y 0 a - x - y - 2 , i f x + y 0

because the first option is not possible, and

fa(x)fa(y)= a + x y - 1 ,  if  x y + 1 x < 0 a + 1 x y ,  if  x x y + 1 x 0 = a + x y - 1 ,  if  x y > - 1 a + 1 x y ,  if  x y - 1 .

: x, y(-1,0). Then:

fa(x)=a+x-1(a-2,a-1)andfa(y)=a+y-1(a-2,a-1).

It follows that:

fa(x)fa(y)= a + 1 x + y ,  if  - 2 x + y - 1 a + x + y - 1 , andfa(x)fa(y)=a+xy-1.

: x(-1,0) and y0,+). Then:

fa(x)=a+x-1(a-2,a-1)andfa(y)=a-y-2(-,a-2.

It follows that:

fa(x)fa(y)= a + x + y - 1 ,  if  x + y < 0 a + x + y - 2 , i f x + y > 0 andfa(x)fa(y)= a + x . y - 1 ,  if  x . y > - 1 a + 1 x . y , i f x . y - 1 .

: x, y0,+). Then:

fa(x)=a-x-2(-,a-2andfa(y)=a-y-2(-,a-2.

It follows that:

fa(x)fa(y)=a-x-y-2andfa(x)fa(y)=a-xy-2.

It follows that for every x, y:

fa(x+y)=fa(x)fa(y)andfa(xy)=fa(x)fa(y).

Therefore, according to Vălcan (2017), (-,a,,) is a (commutative) field isomorphic to the field of rational nambers, (,+,).

For a=0, from Theorem 5.1, obtain the field structure on the set, of negative rational numbers, transferred from the filed (,+,) by function:

f0 :-,0,defined by:f0(x)= 1 x , , if  x ( - , - 1 ] x - 1 , , if  x ( - 1,0 ) - x - 2 ,  if  x [ 0 , + )

and for which the inverse is:

f 0-1 :-,0,defined by:f(x)= - x - 2 , if  x ( - , - 2 ] x + 1 , if  x ( - 2 , - 1 ) 1 x , if  x [ - 1,0 ) .

The second fundamental result of this paper is:

For every b, there are two laws of internal composition, let's say „” and „”, on the set, such that (,,) to become is a (commutative) field isomorphic to the field (,+,).

We transfer the ring structure from to, using the bijection function:

gb :, where, gb(x)= b - 1 x ,  if  x ( - , - 1 ] b - x + 1 ,  if  x ( - 1,0 ) b + x + 2 ,  if  x [ 0 , + ) ,

and

g b-1 :,is defined by:g b-1 (x)= 1 b - x ,  if  x ( b , b + 1 ] b - x + 1 ,  if  x ( b + 1 , b + 2 ) x - b - 2 ,  if  x [ b + 2 , + ) .

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

: x, y(b,b+1]. Then:

xy=gb(g b-1 (x)+g b-1 (y)) =gb - 1 x - b - 1 y - b =b+ x - b , ( y - b ) x - b + ( y - b ) .

: x(b,b+1] and y(b+1,b+2). Then:

xy=gb(g b-1 (x)+g b-1 (y)) =gb

- 1 x - b + b - y + 1 = b + x - b ( x - b ) [ ( y - b ) - 1 ] + 1 ,  if  ( x - b ) [ ( y - b ) - 2 ] - 1 b + 1 x - b + ( y - b ) ,if  ( x - b ) [ ( y - b ) - 1 ] > - 1 ( x - b ) [ ( y - b ) - 2 ] < - 1 .

: x(b,b+1] și y[b+2,+). Then:

xy=gb(g b-1 (x)+g b-1 (y))=gb - 1 x - b + y - b - 2

= b + x - b 1 - x - b . [ y - b - 2 ] , i f x - b . [ y - b + 1 ] 1 b - 1 b - x - y - b + 3 , i f x - b . y - b - 2 > 1 x - b . y - b - 1 < 1 b - 1 x - b + y - b , i f x - b . [ y - b - 2 ] 1 .

: x, y(b+1,b+2). Then:

xy=ga(g b-1 (x)+g b-1 (y))=gb((b-x+1)+(b-y+1))

= b + x - b + y - b - 1 ,  if 3≤(x-b)+(y-b)<4 b + 1 x - b + ( y - b ) ,if 2<(x-b)+(y-b)<3 .

: x(b+1,b+2) and y[b+2,+). Then:

xy=gb(g b-1 (x)+g b-1 (y))=gb(b-x+1+y-b-2)=gb-(x-b)+(y-b)-1

= b + x - b - y - b + 2 ,  if  y > x y < x + 1 b - ( x - b ) + ( y - b ) + 1 ,if y≥x+1 .

: x, y[b+2,+). Then:

xy=gb(g b-1 (x)+g b-1 (y))=gb(x-b)-2+(y-b)-2=b+(x-b)+(y-b)-2.

Therefore, for every x, y,

xy=b+ x - b . ( y - b ) x - b + ( y - b ) , if x, y(b,b+1];

xy= b + x - b 1 - x - b . [ y - b - 2 ] ,  if (x-b).[(y-b)-2]≥-1 b + 1 x - b + y - b ,if  x - b . y - b - 1 > - 1 x - b . y - b - 2 < - 1 , if x(b,b+1] and y(b+1,b+2);

xy= b + x - b 1 - x - b . [ y - b - 2 ] , i f x - b . [ y - b + 1 ] 1 b - 1 b - x - y - b + 3 , i f x - b . y - b - 2 > 1 x - b . y - b - 1 < 1 b - 1 x - b + y - b , i f x - b . [ y - b - 2 ] 1 and x(b,b+1] and y[b+2,+);

xy= b + x - b + y - b - 1 ,  if 3≤(x-b)+(y-b)<4 b + 1 x - b + y - b - 2 , if  2 < x - b + y - b < 3 and x, y(b+1,b+2);

xy= b + x - b + y - b + 2 ,  daca  y > x y < x + 1 b - x - b + y - b + 1 , daca y≥x+1 , if x(b+1,b+2) and y[b+2,+);

xy=b+(x-b)+(y-b)-2, if x, y[b+2,+).

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

: x, y(b,b+1]. Then:

xy=gb(g b-1 (x)g b-1 (y))=gb 1 x - b . 1 y - b =b+ 1 x - b . ( y - b ) +2.

: x(b,b+1] și y(b+1,b+2). Then:

xy=gb(g b-1 (x)g b-1 (y))=gb - 1 x - b . ( b - y + 1 ) =b+ y - b - 1 x - b +2.

: x(b,b+1] și y[b+2,+). Then:

xy=gb(g b-1 (x)g b-1 (y))=gb - 1 x - b . ( y - b - 2 ) = b + x - b y - b - 2 ,  if y≥x+2 b + y - b - 2 x - b + 1 , if  y < x + 2 .

: x, y(b+1,b+2). Then:

xy=ga(g b-1 (x)g b-1 (y))=gb((b-x+1)(b-y+1))=gb((1+(b-x))(1+(b-y))

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

: x(b+1,b+2) și y[b+2,+). Then:

xy=gb(g b-1 (x)g b-1 (y))=gb((b-x+1)(y-b-2))=gb(1-(x-b)(y-b)-2)

= b + 1 x - b - 1 . [ y - 2 - 2 ] ,  if [(x-b)-1].[(y-b)-2]≥1 b + x - b . y - b - 2 . x - b - y - b + 3 , if 0 < x - b - 1 . y - b - 2 < 1 .

: x, y[b+2,+). Then:

xy=gb(g b-1 (x)g b-1 (y))=gb((x-b)-2)(y-b)-2)=b+(x-b)(y-b)-2(x-b)-2(y-b)+6.

Therefore, for every x, y,

xy=b+ 1 x - b . ( y - b ) +2, if x, y(b,b+1];

xy=b+ y - b - 1 x - b +2, if x(b,b+1] and y(b+1,b+2);

xy= b + x - b y - b - 2 , i f y x + 2 b + y - b - 2 x - b + 1 , i f y < x + 2 and x(b,b+1] and y[b+2,+);

xy=b+(b-x)(b-y)+(b-x)+(b-y)+3, if x, y(b+1,b+2);

xy= b + 1 x - b - 1 . [ y - 2 - 2 ] , i f x - b - 1 . [ x - b - 2 ] 1 b + x - b - 1 . y - b - 2 , i f x - b - 1 . [ y - b - 2 ] ( 0,1 ) , if x(b+1,b+2) and y[b+2,+);

xy=b+(x-b)(y-b)-2(x-b)-2(y-b)+6, if x, y[b+2,+).

On the other hand,

e Qb,+∞=gb(e)=gb(0)=b+2

and

-x Qb,+∞=gb(-g b-1 (x))= b + 1 x - b + 2 , i f x b , b + 1 , i f x ( b , b + 1 ) x + 1 , i f x ( b + 1 , b + 2 ) b + 2 , i f x = b + 2 x - 1 , i f x ( b + 2 , b + 3 ) b - 1 2 - x - b , i f x b + 3 ,

and:

1 Qb,+∞=gb(1)=b+3

and

x -1Qb,+∞=gb 1 g b - 1 ( x ) = x + 1 , i f x ( b , b + 1 ) b + 1 , i f x = b + 1 b + 1 x - b - 1 + 1 , i f x ( b + 1 , b + 2 ) b + 1 x - b - 2 + 2 , i f x ( b + 2 , + ) .

Therefore, according to Vălcan (2017), (b,+,,) is a (commutative) field isomorphic to the field (,+,).

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

gb :,defined by: gb(x)= b - 1 x , i f x ( - , - 1 ] b - x + 1 , i f x ( - 1,0 ) b + x + 2 , i f x [ 0 , + )

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

gb(x+y)= b - 1 x + y , i f x + y ( - , - 1 ] b - x - y + 1 , i f x + y ( - 1,0 ) b + x + y + 2 , i f x + y [ 0 , + ) and gb(xy)= b - 1 x . y , i f x . y ( - , - 1 ] b - x . y + 1 , i f x . y ( - 1,0 ) b + x . y + 2 , i f x . y [ 0 , + ) .

Now, to determine the expressions gb(x)gb(y), respectively gb(x)gb(y), we distinguish the following cases:

: x, y(-,-1. Then:

gb(x)=b- 1 x (b,b+1andgb(y)=b- 1 y (b,b+1.

It follows that:

gb(x)gb(y)=b+ 1 x + y andgb(x)gb(y)=b+xy+2.

: x(-,-1 and y(-1,0). Then:

gb(x)=b- 1 x (b,b+1andgb(y)=b-y+1(b+1,b+2).

It follows that:

gb(x)gb(y)=b- 1 x + y andgb(x)gb(y)=b+xy+2.

: x(-,-1 and y0,+). Then:

gb(x)=b- 1 x (b,b+1andgb(y)=b+y+2b+2,+-).

It follows that:

gb(x)gb(y) b - 1 x + y , i f x + y + 1 0 b - x - y + 1 , i f x + y > 0 x + z < - 1 b + x + y + 2 , i f x + y + 1 0 = b - 1 x + y , i f x + y + 1 0 b + x + y + 2 , i f x + y + 1 0 , =

because the second option is not possible, and

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

: x, y(-1,0). Then:

gb(x)=b-x+1(b+1,b+2)andgb(y)=b-y+1(b+1,b+2).

It follows that:

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

: x(-1,0) and y0,+). Then:

gb(x)=b-x+1(b+1,b+2)andgb(y)=b+y+2b+2,+).

It follows that:

gb(x)gb(y)= b - x - y + 1 , i f x + y ( - 2,0 ) b + x + y + 2 , i f x + y 0 andgb(x)gb(y)= b - 1 x . y , i f x . y - 1 b - x . y + 1 , i f x . y ( - 1,0 ) .

: x, y0,+). Then:

gb(x)=b+x+2b+2,+-)andgb(y)=b+y+2b+2,+-).

It follows that:

gb(x)gb(y)=b+x+y+2andgb(x)gb(y)=b+xy+2.

Hence, for every x, y,

gb(x+y)=gb(x)gb(y)andgb(xy)=gb(x)gb(y).

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

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

For b=0 we get the structure of commutative field on the set, of positive rationals numbers, transferred from the field (,+,) by function:

,:, - 1 x , i f x ( - , - 1 ] - x + 1 , i f x - 1,0 x + 2 , i f x [ 0 , + )

whose inverse is the function:

g 0-1 :0,+,defined by:g 0-1 (x)= - 1 x , i f x ( b , b + 1 ] - x + 1 , i f x b + 1 , b + 2 x - 2 , i f x [ b + 2 , + ) .

As demonstrated above, for any a, b, the fields (,,) and (,,) are commutative, and the diagram (a) is a commutative diagram of commutative fields.

For every number a, there are two laws of internal composition, let's say „” and „”, on the set, such that (,,) to become is a commutative field isomorphic to the field (,+,) and there are two laws of internal composition, let's say „” and „”, on the set, such that (,,) to become is a commutative field isomorphic to the field (,+,) and so that the following diagram (B), in Figure 2, is a commutative diagram of commutative field:

Q fa Q-,a

ga

ha,a=ga f a - 1 .

Qa,+

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

In the diagram (B);

=x xaand=x xa.

and functions:

fa :and ga :

defined by:

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

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

f a-1 :and g a-1 :,

defined by:

f a-1 (x)= a - x - 2 , i f x ( - , a - 2 ] x - a + 1 , i f x a - 2 , a - 1 1 x - a , i f x [ a - 1 , a ] andg a-1 (x)=. 1 x - a , i f x [ a , a + 1 ] a - x + 1 , i f x a + 1 , a + 2 x - a - 2 , i f x [ a + 2 , + )

The function that achieves the isomorphism between the rings (,,) and (,,) is:

ha,a=ga◦f a-1 :;

where, for every x,

ha,a(x)=ga◦f a-1 (x)=ga(f a-1 (x))= a - 1 f a - 1 x , i f f a - 1 ( x ) ( - , - 1 ] a - f a - 1 x + 1 , i f f a - 1 x ( - 1,0 ) a + f a - 1 x + 2 , i f f a - 1 x [ 0 , + )

= a - x + a , i f x [ a - 1 , a ) a - x + a - 1 , i f x a - 2 , a - 1 = 2 . a - x = a + ( a - x ) a + a - x - 2 + 2 , i f x ( - , a - 2 ]

and

h a,a-1=fa◦g a-1 :;

where, for every x-,a,

h a,a-1 (x)=fa(g a-1 (x))=a-(x-a).

Findings

Therefore, we answered the two questions in Paragraph 3. Thus, for any number a, b there are two pairs of laws of internal composition on the sets and, let's say „” and „”, respectively „” and „”, so that (,,) and (,,) become commutative fields isomorphic to the field (,+,).

Concretely, on the set of rationals smaller than 3,, and on the set of rationals greater than 5,, we can define two pairs of laws of internal composition so that let's say „” and „”, respectively „” and „”, so that (,,) and (,,) become commutative fields isomorphic to the field (,+,).

Conclusion

As a general conclusion, we can say that any problem / exercise or equation in the set of rational numbers () can be solved in either of these two sets (,,), respectively (,,); but also vice versa, i.e. any problem / exercise or equation in any of these two sets (,,), respectively (,,), we can solve it in the set of rational numbers (,+,). Of course, after solving them in the new set, the solution is interpreted in the original set.

Moreover, because these fields (,,) and (,,) are isomorphic to the field, but also isomorphic to each other, it follows that these new fields have their own subsets / rings of "" (,,) and (,,)) and "" (,,) and (,,) numbers respectively , isomorphic to each other, and isomorphic to the sets (,+,) and (,+,) respectively.

Of course, this paper is one of Didactics of Mathematics and is addressed to pupils, students or teachers attentive and interested in these issues, which we believe we have formed, in this way, a good image about these matters.

References

  • Astolfi, J. P., & Develey, M. (1989). La didactique des sciences [Didactics of Science]. PUF.

  • Ausubel, D. P. (1968). Educational psychology, A cognitive view. Holt, Rinehart and Winston, Inc.

  • 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 (Vol. 2, pp. 157-181). Bucureşti.

  • 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.

  • Vălcan, D. (2018). A Field Of Function Isomorphic To The field Of Real Numbers, The European Proceedings of Social & Behavioural Sciences EpSBS, LXIII, 419-429.

  • Vălcan, D. (2019). Equipotent sets - fundamental results. In I. Todor, & L. Tăușan (Eds.), Tradiție și perspective în didactica modern (Vol. 3, pp. 262-268). International Conference: Didactics, tradition, current events, perspectives, 5th Edition. Publishing house AEternitas.

  • Vălcan, D. (2020). Structures of rings of integers numbers, isomorphic between them. European Proceedings of Social and Behavioural Sciences, 85, 492-506.

  • Vălcan, D. (2021). Other Structures Of Rings Of Integers Numbers, Isomorphic Between Them. The European Proceedings of Social & Behavioural Sciences EpSBS, 104, 384-402.

  • Vălcan, D. (2022). Formarea inițială a profesorilor de Matematică la Universitatea „Babeș-Bolyai”, Nivel licență, Didactica Matematicii, Vol. I, Note de curs Initial training of Mathematics teachers at "Babeș-Bolyai" University, Bachelor's level, Didactics of Mathematics, Vol. I, Course notes, Cluj-Napoca, Editura Casa Cărţii de Ştiinţă.

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 May 2023

eBook ISBN

978-1-80296-962-7

Publisher

European Publisher

Volume

6

Print ISBN (optional)

-

Edition Number

1st Edition

Pages

1-710

Subjects

Cite this article as:

Vălcan, T. (2023). Structures of Fields of Rational Numbers, Isomorphic Between Them. In I. Albulescu, & C. Stan (Eds.), Education, Reflection, Development - ERD 2022, vol 6. European Proceedings of Educational Sciences (pp. 81-98). European Publisher. https://doi.org/10.15405/epes.23056.8