Jump to content

Integer

From Wikipedia, the free encyclopedia

Anintegeris thenumberzero (0), a positivenatural number(1, 2, 3,...), or the negation of a positive natural number (−1,−2, −3,...).[1]The negations oradditive inversesof the positive natural numbers are referred to asnegative integers.[2]Thesetof all integers is often denoted by theboldfaceZorblackboard bold.[3][4]

The set of natural numbersis asubsetof,which in turn is a subset of the set of allrational numbers,itself a subset of thereal numbers.[a]Like the set of natural numbers, the set of integersiscountably infinite.An integer may be regarded as a real number that can be written without afractional component.For example, 21, 4, 0, and −2048 are integers, while 9.75,⁠5+1/2,5/4 and2are not.[8]

The integers form the smallestgroupand the smallestringcontaining thenatural numbers.Inalgebraic number theory,the integers are sometimes qualified asrational integersto distinguish them from the more generalalgebraic integers.In fact, (rational) integers are algebraic integers that are alsorational numbers.

History

The word integer comes from theLatinintegermeaning "whole" or (literally) "untouched", fromin( "not" ) plustangere( "to touch" ). "Entire"derives from the same origin via theFrenchwordentier,which means bothentireandinteger.[9]Historically the term was used for anumberthat was a multiple of 1,[10][11]or to the whole part of amixed number.[12][13]Only positive integers were considered, making the term synonymous with thenatural numbers.The definition of integer expanded over time to includenegative numbersas their usefulness was recognized.[14]For exampleLeonhard Eulerin his 1765Elements of Algebradefined integers to include both positive and negative numbers.[15]

The phrasethe set of the integerswas not used before the end of the 19th century, whenGeorg Cantorintroduced the concept ofinfinite setsandset theory.The use of the letter Z to denote the set of integers comes from theGermanwordZahlen( "numbers" )[3][4]and has been attributed toDavid Hilbert.[16]The earliest known use of the notation in a textbook occurs inAlgèbrewritten by the collectiveNicolas Bourbaki,dating to 1947.[3][17]The notation was not adopted immediately, for example another textbook used the letter J[18]and a 1960 paper used Z to denote the non-negative integers.[19]But by 1961, Z was generally used by modern algebra texts to denote the positive and negative integers.[20]

The symbolis often annotated to denote various sets, with varying usage amongst different authors:,orfor the positive integers,orfor non-negative integers, andfor non-zero integers. Some authors usefor non-zero integers, while others use it for non-negative integers, or for{–1, 1}(thegroup of unitsof). Additionally,is used to denote either the set ofintegers modulop(i.e., the set ofcongruence classesof integers), or the set ofp-adic integers.[21][22]

Thewhole numberswere synonymous with the integers up until the early 1950s.[23][24][25]In the late 1950s, as part of theNew Mathmovement,[26]American elementary school teachers began teaching thatwhole numbersreferred to thenatural numbers,excluding negative numbers, whileintegerincluded the negative numbers.[27][28]Thewhole numbersremain ambiguous to the present day.[29]

Algebraic properties

Integers can be thought of as discrete, equally spaced points on an infinitely longnumber line.In the above, non-negativeintegers are shown in blue and negative integers in red.

Like thenatural numbers,isclosedunder theoperationsof addition andmultiplication,that is, the sum and product of any two integers is an integer. However, with the inclusion of the negative natural numbers (and importantly,0),,unlike the natural numbers, is also closed undersubtraction.[30]

The integers form aunital ringwhich is the most basic one, in the following sense: for any unital ring, there is a uniquering homomorphismfrom the integers into this ring. Thisuniversal property,namely to be aninitial objectin thecategory of rings,characterizes the ring.

is not closed underdivision,since the quotient of two integers (e.g., 1 divided by 2) need not be an integer. Although the natural numbers are closed underexponentiation,the integers are not (since the result can be a fraction when the exponent is negative).

The following table lists some of the basic properties of addition and multiplication for any integersa,bandc:

Properties of addition and multiplication on integers
Addition Multiplication
Closure: a+bis an integer a×bis an integer
Associativity: a+ (b+c) = (a+b) +c a× (b×c) = (a×b) ×c
Commutativity: a+b=b+a a×b=b×a
Existence of anidentity element: a+ 0 =a a× 1 =a
Existence ofinverse elements: a+ (−a) = 0 The only invertible integers (calledunits) are−1and1.
Distributivity: a× (b+c) = (a×b) + (a×c)and(a+b) ×c= (a×c) + (b×c)
Nozero divisors: Ifa×b= 0,thena= 0orb= 0(or both)

The first five properties listed above for addition say that,under addition, is anabelian group.It is also acyclic group,since every non-zero integer can be written as a finite sum1 + 1 +... + 1or(−1) + (−1) +... + (−1).In fact,under addition is theonlyinfinite cyclic group—in the sense that any infinite cyclic group isisomorphicto.

The first four properties listed above for multiplication say thatunder multiplication is acommutative monoid.However, not every integer has a multiplicative inverse (as is the case of the number 2), which means thatunder multiplication is not a group.

All the rules from the above property table (except for the last), when taken together, say thattogether with addition and multiplication is acommutative ringwithunity.It is the prototype of all objects of suchalgebraic structure.Only thoseequalitiesofexpressionsare true infor allvalues of variables, which are true in any unital commutative ring. Certain non-zero integers map tozeroin certain rings.

The lack ofzero divisorsin the integers (last property in the table) means that the commutative ringis anintegral domain.

The lack of multiplicative inverses, which is equivalent to the fact thatis not closed under division, means thatisnotafield.The smallest field containing the integers as asubringis the field ofrational numbers.The process of constructing the rationals from the integers can be mimicked to form thefield of fractionsof any integral domain. And back, starting from analgebraic number field(an extension of rational numbers), itsring of integerscan be extracted, which includesas itssubring.

Although ordinary division is not defined on,the division "with remainder" is defined on them. It is calledEuclidean division,and possesses the following important property: given two integersaandbwithb≠ 0,there exist unique integersqandrsuch thata=q×b+rand0 ≤r< |b|,where|b|denotes theabsolute valueofb.The integerqis called thequotientandris called theremainderof the division ofabyb.TheEuclidean algorithmfor computinggreatest common divisorsworks by a sequence of Euclidean divisions.

The above says thatis aEuclidean domain.This implies thatis aprincipal ideal domain,and any positive integer can be written as the products ofprimesin anessentially uniqueway.[31]This is thefundamental theorem of arithmetic.

Order-theoretic properties

is atotally ordered setwithoutupper or lower bound.The ordering ofis given by: :... −3 < −2 < −1 < 0 < 1 < 2 < 3 <... An integer ispositiveif it is greater thanzero,andnegativeif it is less than zero. Zero is defined as neither negative nor positive.

The ordering of integers is compatible with the algebraic operations in the following way:

  1. ifa<bandc<d,thena+c<b+d
  2. ifa<band0 <c,thenac<bc.

Thus it follows thattogether with the above ordering is anordered ring.

The integers are the only nontrivialtotally orderedabelian groupwhose positive elements arewell-ordered.[32]This is equivalent to the statement that anyNoetherianvaluation ringis either afield—or adiscrete valuation ring.

Construction

Traditional development

In elementary school teaching, integers are often intuitively defined as the union of the (positive) natural numbers,zero,and the negations of the natural numbers. This can be formalized as follows.[33]First construct the set of natural numbers according to thePeano axioms,call this.Then construct a setwhich isdisjointfromand in one-to-one correspondence withvia a function.For example, taketo be theordered pairswith the mapping.Finally let 0 be some object not inor,for example the ordered pair.Then the integers are defined to be the union.

The traditional arithmetic operations can then be defined on the integers in apiecewisefashion, for each of positive numbers, negative numbers, and zero. For examplenegationis defined as follows:

The traditional style of definition leads to many different cases (each arithmetic operation needs to be defined on each combination of types of integer) and makes it tedious to prove that integers obey the various laws of arithmetic.[34]

Equivalence classes of ordered pairs

Representation of equivalence classes for the numbers −5 to 5
Red points represent ordered pairs ofnatural numbers.Linked red points are equivalence classes representing the blue integers at the end of the line.

In modern set-theoretic mathematics, a more abstract construction[35][36]allowing one to define arithmetical operations without any case distinction is often used instead.[37]The integers can thus be formally constructed as theequivalence classesofordered pairsofnatural numbers(a,b).[38]

The intuition is that(a,b)stands for the result of subtractingbfroma.[38]To confirm our expectation that1 − 2and4 − 5denote the same number, we define anequivalence relation~on these pairs with the following rule:

precisely when

Addition and multiplication of integers can be defined in terms of the equivalent operations on the natural numbers;[38]by using[(a,b)]to denote the equivalence class having(a,b)as a member, one has:

The negation (or additive inverse) of an integer is obtained by reversing the order of the pair:

Hence subtraction can be defined as the addition of the additive inverse:

The standard ordering on the integers is given by:

if and only if

It is easily verified that these definitions are independent of the choice of representatives of the equivalence classes.

Every equivalence class has a unique member that is of the form(n,0)or(0,n)(or both at once). The natural numbernis identified with the class[(n,0)](i.e., the natural numbers areembeddedinto the integers by map sendingnto[(n,0)]), and the class[(0,n)]is denotedn(this covers all remaining classes, and gives the class[(0,0)]a second time since−0 = 0.

Thus,[(a,b)]is denoted by

If the natural numbers are identified with the corresponding integers (using the embedding mentioned above), this convention creates no ambiguity.

This notation recovers the familiarrepresentationof the integers as{..., −2, −1, 0, 1, 2,...}.

Some examples are:

Other approaches

In theoretical computer science, other approaches for the construction of integers are used byautomated theorem proversandterm rewrite engines. Integers are represented asalgebraic termsbuilt using a few basic operations (e.g.,zero,succ,pred) and, possibly, usingnatural numbers,which are assumed to be already constructed (using, say, thePeano approach).

There exist at least ten such constructions of signed integers.[39]These constructions differ in several ways: the number of basic operations used for the construction, the number (usually, between 0 and 2) and the types of arguments accepted by these operations; the presence or absence of natural numbers as arguments of some of these operations, and the fact that these operations are free constructors or not, i.e., that the same integer can be represented using only one or many algebraic terms.

The technique for the construction of integers presented in the previous section corresponds to the particular case where there is a single basic operationpairthat takes as arguments two natural numbersand,and returns an integer (equal to). This operation is not free since the integer 0 can be writtenpair(0,0), orpair(1,1), orpair(2,2), etc. This technique of construction is used by theproof assistantIsabelle;however, many other tools use alternative construction techniques, notable those based upon free constructors, which are simpler and can be implemented more efficiently in computers.

Computer science

An integer is often a primitivedata typeincomputer languages.However, integer data types can only represent asubsetof all integers, since practical computers are of finite capacity. Also, in the commontwo's complementrepresentation, the inherent definition ofsigndistinguishes between "negative" and "non-negative" rather than "negative, positive, and 0". (It is, however, certainly possible for a computer to determine whether an integer value is truly positive.) Fixed length integer approximation data types (or subsets) are denotedintor Integer in several programming languages (such asAlgol68,C,Java,Delphi,etc.).

Variable-length representations of integers, such asbignums,can store any integer that fits in the computer's memory. Other integer data types are implemented with a fixed size, usually a number of bits which is a power of 2 (4, 8, 16, etc.) or a memorable number of decimal digits (e.g., 9 or 10).

Cardinality

The set of integers iscountably infinite,meaning it is possible to pair each integer with a unique natural number. An example of such a pairing is

(0, 1), (1, 2), (−1, 3), (2, 4), (−2, 5), (3, 6),. . . , (1 − k, 2k − 1), (k, 2k ),. . .

More technically, thecardinalityofis said to equal0(aleph-null). The pairing between elements ofandis called abijection.

See also

Number systems
Complex
Real
Rational
Integer
Natural
Zero:0
One:1
Prime numbers
Composite numbers
Negative integers
Fraction
Finite decimal
Dyadic (finite binary)
Repeating decimal
Irrational
Algebraic irrational
Transcendental
Imaginary

Footnotes

  1. ^More precisely, each system isembeddedin the next, isomorphically mapped to a subset.[5]The commonly-assumed set-theoretic containment may be obtained by constructing the reals, discarding any earlier constructions, and defining the other sets as subsets of the reals.[6]Such a convention is "a matter of choice", yet not.[7]

References

  1. ^Science and Technology Encyclopedia.University of Chicago Press. September 2000. p. 280.ISBN978-0-226-74267-0.
  2. ^Hillman, Abraham P.; Alexanderson, Gerald L. (1963).Algebra and trigonometry;.Boston: Allyn and Bacon.
  3. ^abcMiller, Jeff (29 August 2010)."Earliest Uses of Symbols of Number Theory".Archived fromthe originalon 31 January 2010.Retrieved20 September2010.
  4. ^abPeter Jephson Cameron (1998).Introduction to Algebra.Oxford University Press. p. 4.ISBN978-0-19-850195-4.Archivedfrom the original on 8 December 2016.Retrieved15 February2016.
  5. ^Partee, Barbara H.; Meulen, Alice ter; Wall, Robert E. (30 April 1990).Mathematical Methods in Linguistics.Springer Science & Business Media. pp. 78–82.ISBN978-90-277-2245-4.The natural numbers are not themselves a subset of this set-theoretic representation of the integers. Rather, the set of all integers contains a subset consisting of the positive integers and zero which is isomorphic to the set of natural numbers.
  6. ^Wohlgemuth, Andrew (10 June 2014).Introduction to Proof in Abstract Mathematics.Courier Corporation. p. 237.ISBN978-0-486-14168-8.
  7. ^Polkinghorne, John (19 May 2011).Meaning in Mathematics.OUP Oxford. p. 68.ISBN978-0-19-162189-5.
  8. ^Prep, Kaplan Test (4 June 2019).GMAT Complete 2020: The Ultimate in Comprehensive Self-Study for GMAT.Simon and Schuster.ISBN978-1-5062-4844-8.
  9. ^Evans, Nick (1995). "A-Quantifiers and Scope". In Bach, Emmon W. (ed.).Quantification in Natural Languages.Dordrecht, The Netherlands; Boston, MA: Kluwer Academic Publishers. p. 262.ISBN978-0-7923-3352-4.
  10. ^Smedley, Edward; Rose, Hugh James; Rose, Henry John (1845).Encyclopædia Metropolitana.B. Fellowes. p. 537.An integer is a multiple of unity
  11. ^Encyclopaedia Britannica 1771,p.367
  12. ^Pisano, Leonardo;Boncompagni, Baldassarre (transliteration) (1202).Incipit liber Abbaci compositus to Lionardo filio Bonaccii Pisano in year Mccij[The Book of Calculation] (Manuscript) (in Latin). Translated by Sigler, Laurence E. Museo Galileo. p. 30.Nam rupti uel fracti semper ponendi sunt post integra, quamuis prius integra quam rupti pronuntiari debeant.[And the fractions are always put after the whole, thus first the integer is written, and then the fraction]
  13. ^Encyclopaedia Britannica 1771,p.83
  14. ^Martinez, Alberto (2014).Negative Math.Princeton University Press. pp. 80–109.
  15. ^Euler, Leonhard (1771).Vollstandige Anleitung Zur Algebra[Complete Introduction to Algebra] (in German). Vol. 1. p. 10.Alle diese Zahlen, so wohl positive als negative, führen den bekannten Nahmen der gantzen Zahlen, welche also entweder größer oder kleiner sind als nichts. Man nennt dieselbe gantze Zahlen, um sie von den gebrochenen, und noch vielerley andern Zahlen, wovon unten gehandelt werden wird, zu unterscheiden.[All these numbers, both positive and negative, are called whole numbers, which are either greater or lesser than nothing. We call them whole numbers, to distinguish them from fractions, and from several other kinds of numbers of which we shall hereafter speak.]
  16. ^The University of Leeds Review.Vol. 31–32. University of Leeds. 1989. p. 46.Incidentally, Z comes from "Zahl": the notation was created by Hilbert.
  17. ^Bourbaki, Nicolas (1951).Algèbre, Chapter 1(in French) (2nd ed.). Paris: Hermann. p. 27.Le symétrisé deNse noteZ;ses éléments sont appelés entiers rationnels.[The group of differences ofNis denoted byZ;its elements are called the rational integers.]
  18. ^Birkhoff, Garrett (1948).Lattice Theory(Revised ed.). American Mathematical Society. p. 63.the setJof all integers
  19. ^Society, Canadian Mathematical (1960).Canadian Journal of Mathematics.Canadian Mathematical Society. p. 374.Consider the setZof non-negative integers
  20. ^Bezuszka, Stanley (1961).Contemporary Progress in Mathematics: Teacher Supplement [to] Part 1 and Part 2.Boston College. p. 69.Modern Algebra texts generally designate the set of integers by the capital letter Z.
  21. ^Keith Pledger and Dave Wilkins, "Edexcel AS and A Level Modular Mathematics: Core Mathematics 1" Pearson 2008
  22. ^LK Turner, FJ BUdden, D Knighton, "Advanced Mathematics", Book 2, Longman 1975.
  23. ^Mathews, George Ballard (1892).Theory of Numbers.Deighton, Bell and Company. p. 2.
  24. ^Betz, William (1934).Junior Mathematics for Today.Ginn.The whole numbers, or integers, when arranged in their natural order, such as 1, 2, 3, are called consecutive integers.
  25. ^Peck, Lyman C. (1950).Elements of Algebra.McGraw-Hill. p. 3.The numbers which so arise are called positive whole numbers, or positive integers.
  26. ^Hayden, Robert (1981).A history of the "new math" movement in the United States(PhD). Iowa State University. p. 145.doi:10.31274/rtd-180813-5631.A much more influential force in bringing news of the "new math" to high school teachers and administrators was the National Council of Teachers of Mathematics (NCTM).
  27. ^The Growth of Mathematical Ideas, Grades K-12: 24th Yearbook.National Council of Teachers of Mathematics. 1959. p. 14.ISBN9780608166186.
  28. ^Deans, Edwina (1963).Elementary School Mathematics: New Directions.U.S. Department of Health, Education, and Welfare, Office of Education. p. 42.
  29. ^"entry: whole number".The American Heritage Dictionary.HarperCollins.
  30. ^"Integer | mathematics".Encyclopedia Britannica.Retrieved11 August2020.
  31. ^Lang, Serge(1993).Algebra(3rd ed.). Addison-Wesley. pp. 86–87.ISBN978-0-201-55540-0.
  32. ^Warner, Seth (2012).Modern Algebra.Dover Books on Mathematics. Courier Corporation. Theorem 20.14, p. 185.ISBN978-0-486-13709-4.Archivedfrom the original on 6 September 2015.Retrieved29 April2015..
  33. ^Mendelson, Elliott (1985).Number systems and the foundations of analysis.Malabar, Fla.: R.E. Krieger Pub. Co. p. 153.ISBN978-0-89874-818-5.
  34. ^Mendelson, Elliott (2008).Number Systems and the Foundations of Analysis.Dover Books on Mathematics. Courier Dover Publications. p. 86.ISBN978-0-486-45792-5.Archivedfrom the original on 8 December 2016.Retrieved15 February2016..
  35. ^Ivorra Castillo:Álgebra
  36. ^Kramer, Jürg; von Pippich, Anna-Maria (2017).From Natural Numbers to Quaternions(1st ed.). Switzerland: Springer Cham. pp. 78–81.doi:10.1007/978-3-319-69429-0.ISBN978-3-319-69427-6.
  37. ^Frobisher, Len (1999).Learning to Teach Number: A Handbook for Students and Teachers in the Primary School.The Stanley Thornes Teaching Primary Maths Series. Nelson Thornes. p. 126.ISBN978-0-7487-3515-0.Archivedfrom the original on 8 December 2016.Retrieved15 February2016..
  38. ^abcCampbell, Howard E. (1970).The structure of arithmetic.Appleton-Century-Crofts. p.83.ISBN978-0-390-16895-5.
  39. ^Garavel, Hubert (2017).On the Most Suitable Axiomatization of Signed Integers.Post-proceedings of the 23rd International Workshop on Algebraic Development Techniques (WADT'2016). Lecture Notes in Computer Science. Vol. 10644. Springer. pp. 120–134.doi:10.1007/978-3-319-72044-9_9.ISBN978-3-319-72043-2.Archivedfrom the original on 26 January 2018.Retrieved25 January2018.

Sources

External links

This article incorporates material from Integer onPlanetMath,which is licensed under theCreative Commons Attribution/Share-Alike License.