The integers can be formally complete as the adequation classes of ordered pairs of accustomed numbers (a, b).3
The intuition is that (a, b) stands for the aftereffect of adding b from a.3 To affirm our apprehension that 1 − 2 and 4 − 5 denote the aforementioned number, we ascertain an adequation affiliation ~ on these pairs with the afterward rule
:
(a,b) \sim (c,d) \,\!
precisely when
a+d = b+c. \,\!
Addition and multiplication of integers can be authentic in agreement of the agnate operations on the accustomed numbers3; cogent by (a,b) the adequation chic accepting (a,b) as a member, one has:
(a,b)+(c,d) := (a+c,b+d).\,
(a,b)\cdot(c,d) := (ac+bd,ad+bc).\,The antithesis (or accretion inverse) of an accumulation is acquired by abandoning the adjustment of the pair:
-(a,b) := (b,a).\,
Hence accession can be authentic as the accession of
the
additive inverse:
(a,b)-(c,d) := (a+d,b+c).\,
The accepted acclimation on the integers is accustomed by
:
(a,b)<(c,d)\, iff
a+d < b+c.\,
It is calmly absolute that these definitions are absolute of the best of assembly of the adequation classes
.
Every adequation chic has a different affiliate that is of the anatomy (n,0) or (0,n) (or both at once). The accustomed cardinal n is articular with the chic (n,0) (in added words the accustomed numbers are anchored into the integers by map sending n to (n,0)), and the chic (0,n) is denoted −n (this covers all actual classes, and gives the chic (0,0) a additional time back −0 = 0.citation needed
Thus, (a,b) is denoted bycitation needed
\begin{cases} a-b, & \mbox{if } a \ge b \\ -(b-a), & \mbox{if } a < b. \end{cases}
If the accustomed numbers are articular with the agnate integers (using the embedding mentioned above), this assemblage creates no ambiguity.citation needed
This characters recovers the accustomed representation of the integers as {... −3,−2,−1, 0, 1, 2, 3, ...}.
Some examples are
:
\begin{align} 0 &= (0,0) &= (1,1) &= \cdots & &= (k,k) \\ 1 &= (1,0) &= (2,1) &= \cdots & &= (k+1,k) \\ -1 &= (0,1) &= (1,2) &= \cdots & &= (k,k+1) \\ 2 &= (2,0) &= (3,1) &= \cdots & &= (k+2,k) \\ -2 &= (0,2) &= (1,3) &= \cdots & &= (k,k+2). \end{align}
The intuition is that (a, b) stands for the aftereffect of adding b from a.3 To affirm our apprehension that 1 − 2 and 4 − 5 denote the aforementioned number, we ascertain an adequation affiliation ~ on these pairs with the afterward rule
:
(a,b) \sim (c,d) \,\!
precisely when
a+d = b+c. \,\!
Addition and multiplication of integers can be authentic in agreement of the agnate operations on the accustomed numbers3; cogent by (a,b) the adequation chic accepting (a,b) as a member, one has:
(a,b)+(c,d) := (a+c,b+d).\,
(a,b)\cdot(c,d) := (ac+bd,ad+bc).\,The antithesis (or accretion inverse) of an accumulation is acquired by abandoning the adjustment of the pair:
-(a,b) := (b,a).\,
Hence accession can be authentic as the accession of
the
additive inverse:
(a,b)-(c,d) := (a+d,b+c).\,
The accepted acclimation on the integers is accustomed by
:
(a,b)<(c,d)\, iff
a+d < b+c.\,
It is calmly absolute that these definitions are absolute of the best of assembly of the adequation classes
.
Every adequation chic has a different affiliate that is of the anatomy (n,0) or (0,n) (or both at once). The accustomed cardinal n is articular with the chic (n,0) (in added words the accustomed numbers are anchored into the integers by map sending n to (n,0)), and the chic (0,n) is denoted −n (this covers all actual classes, and gives the chic (0,0) a additional time back −0 = 0.citation needed
Thus, (a,b) is denoted bycitation needed
\begin{cases} a-b, & \mbox{if } a \ge b \\ -(b-a), & \mbox{if } a < b. \end{cases}
If the accustomed numbers are articular with the agnate integers (using the embedding mentioned above), this assemblage creates no ambiguity.citation needed
This characters recovers the accustomed representation of the integers as {... −3,−2,−1, 0, 1, 2, 3, ...}.
Some examples are
:
\begin{align} 0 &= (0,0) &= (1,1) &= \cdots & &= (k,k) \\ 1 &= (1,0) &= (2,1) &= \cdots & &= (k+1,k) \\ -1 &= (0,1) &= (1,2) &= \cdots & &= (k,k+1) \\ 2 &= (2,0) &= (3,1) &= \cdots & &= (k+2,k) \\ -2 &= (0,2) &= (1,3) &= \cdots & &= (k,k+2). \end{align}
No comments:
Post a Comment