TheInfoList

An integer (from the Latin ''integer'' meaning "whole") is colloquially defined as a number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and  are not. The set of integers consists of zero (), the positive natural numbers (, , , ...), also called ''whole numbers'' or ''counting numbers'', and their additive inverses (the negative integers, i.e., −1, −2, −3, ...). The set of integers is often denoted by the boldface () or blackboard bold $\left(\mathbb\right)$ letter "Z"—standing originally for the German word ''Zahlen'' ("numbers"). is a subset of the set of all rational numbers , which in turn is a subset of the real numbers . Like the natural numbers, is countably infinite. The integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers to distinguish them from the more general algebraic integers. In fact, (rational) integers are algebraic integers that are also rational numbers.

Symbol

The symbol can be annotated to denote various sets, with varying usage amongst different authors: , or for the positive integers, or for non-negative integers, and for non-zero integers. Some authors use for non-zero integers, while others use it for non-negative integers, or for . Additionally, is used to denote either the set of integers modulo (i.e., the set of congruence classes of integers), or the set of -adic integers.Keith Pledger and Dave Wilkins, "Edexcel AS and A Level Modular Mathematics: Core Mathematics 1" Pearson 2008

Algebraic properties

Like the natural numbers, is closed under the operations of addition and multiplication, that is, the sum and product of any two integers is an integer. However, with the inclusion of the negative natural numbers (and importantly, ), , unlike the natural numbers, is also closed under subtraction. The integers form a unital ring which is the most basic one, in the following sense: for any unital ring, there is a unique ring homomorphism from the integers into this ring. This universal property, namely to be an initial object in the category of rings, characterizes the ring . is not closed under division, since the quotient of two integers (e.g., 1 divided by 2) need not be an integer. Although the natural numbers are closed under exponentiation, 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 integers , and : In the language of abstract algebra, the first five properties listed above for addition say that , under addition, is an abelian group. It is also a cyclic group, since every non-zero integer can be written as a finite sum or . In fact, under addition is the ''only'' infinite cyclic group—in the sense that any infinite cyclic group is isomorphic to . The first four properties listed above for multiplication say that under multiplication is a commutative monoid. However, not every integer has a multiplicative inverse (as is the case of the number 2), which means that under multiplication is not a group. All the rules from the above property table (except for the last), when taken together, say that together with addition and multiplication is a commutative ring with unity. It is the prototype of all objects of such algebraic structure. Only those equalities of expressions are true in  for all values of variables, which are true in any unital commutative ring. Certain non-zero integers map to zero in certain rings. The lack of zero divisors in the integers (last property in the table) means that the commutative ring  is an integral domain. The lack of multiplicative inverses, which is equivalent to the fact that is not closed under division, means that is ''not'' a field. The smallest field containing the integers as a subring is the field of rational numbers. The process of constructing the rationals from the integers can be mimicked to form the field of fractions of any integral domain. And back, starting from an algebraic number field (an extension of rational numbers), its ring of integers can be extracted, which includes as its subring. Although ordinary division is not defined on , the division "with remainder" is defined on them. It is called Euclidean division, and possesses the following important property: given two integers and with , there exist unique integers and such that and , where denotes the absolute value of . The integer is called the ''quotient'' and is called the ''remainder'' of the division of by . The Euclidean algorithm for computing greatest common divisors works by a sequence of Euclidean divisions. Again, in the language of abstract algebra, the above says that is a Euclidean domain. This implies that is a principal ideal domain, and any positive integer can be written as the products of primes in an essentially unique way. This is the fundamental theorem of arithmetic.

Order-theoretic properties

is a totally ordered set without upper or lower bound. The ordering of is given by: An integer is ''positive'' if it is greater than zero, and ''negative'' if 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: # if and , then # if and , then . Thus it follows that together with the above ordering is an ordered ring. The integers are the only nontrivial totally ordered abelian group whose positive elements are well-ordered. This is equivalent to the statement that any Noetherian valuation ring is either a field—or a discrete valuation ring.

Construction

In elementary school teaching, integers are often intuitively defined as the (positive) natural numbers, zero, and the negations of the natural numbers. However, this 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. Therefore, in modern set-theoretic mathematics, a more abstract construction allowing one to define arithmetical operations without any case distinction is often used instead. The integers can thus be formally constructed as the equivalence classes of ordered pairs of natural numbers . The intuition is that stands for the result of subtracting from . To confirm our expectation that and denote the same number, we define an equivalence relation on these pairs with the following rule: :$\left(a,b\right) \sim \left(c,d\right)$ precisely when :$a + d = b + c.$ Addition and multiplication of integers can be defined in terms of the equivalent operations on the natural numbers; by using to denote the equivalence class having as a member, one has: :$a,b\right)+c,d\right):=a+c,b+d\right)$ :$a,b\right)cdotc,d\right):=ac+bd,ad+bc\right)$ The negation (or additive inverse) of an integer is obtained by reversing the order of the pair: :$-a,b\right):=b,a\right)$ Hence subtraction can be defined as the addition of the additive inverse: :$a,b\right)-c,d\right):=a+d,b+c\right)$ The standard ordering on the integers is given by: :$a,b\right)if and only ifa+d < b+c.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 or \left(or both at once\right). The natural number is identified with the class \left(i.e., the natural numbers areembeddedinto the integers by map sending to \right), and the class is denoted \left(this covers all remaining classes, and gives the class a second time since Thus, is denoted by :\begin a - b, & \mbox a \ge b \\ -\left(b - a\right), & \mbox a < b. \endIf the natural numbers are identified with the corresponding integers \left(using the embedding mentioned above\right), this convention creates no ambiguity. This notation recovers the familiarrepresentationof the integers as . Some examples are: :\begin 0 &=0,0\right)&=1,1\right)&= \cdots & &=k,k\right)\\ 1 &=1,0\right)&=2,1\right)&= \cdots & &=k+1,k\right)\\ -1 &=0,1\right)&=1,2\right)&= \cdots & &=k,k+1\right)\\ 2 &=2,0\right)&=3,1\right)&= \cdots & &=k+2,k\right)\\ -2 &=0,2\right)&=1,3\right)&= \cdots & &=k,k+2\right)\endIn 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 \left(e.g., zero, succ, pred\right) and, possibly, usingnatural numbers, which are assumed to be already constructed \left(using, say, the Peano approach\right). There exist at least ten such constructions of signed integers.These constructions differ in several ways: the number of basic operations used for the construction, the number \left(usually, between 0 and 2\right) 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 above in this section corresponds to the particular case where there is a single basic operation pair\left(x,y\right)that takes as arguments two natural numbersxandy, and returns an integer \left(equal tox-y\right). This operation is not free since the integer 0 can be written pair\left(0,0\right), or pair\left(1,1\right), or pair\left(2,2\right), 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 primitive data type in computer languages. However, integer data types can only represent a subset of all integers, since practical computers are of finite capacity. Also, in the common two's complement representation, the inherent definition of sign distinguishes 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 denoted ''int'' or Integer in several programming languages (such as Algol68, C, Java, Delphi, etc.). Variable-length representations of integers, such as bignums, 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 cardinality of the set of integers is equal to (aleph-null). This is readily demonstrated by the construction of a bijection, that is, a function that is injective and surjective from to . If then consider the function: :$f\left(x\right) = \begin 2|x|, & \mbox x \leq 0\\ 2x-1, & \mbox x > 0. \end$ If then consider the function: :$g\left(x\right) = \begin 2|x|, & \mbox x < 0 \\ 2x+1, & \mbox x \ge 0. \end$ If the domain is restricted to then each and every member of has one and only one corresponding member of and by the definition of cardinal equality the two sets have equal cardinality.

* Canonical factorization of a positive integer * Hyperinteger * Integer complexity * Integer lattice * Integer part * Integer sequence * Integer-valued function * Mathematical symbols * Parity (mathematics) * Profinite integer

Footnotes

References

Sources

* Bell, E.T., ''Men of Mathematics.'' New York: Simon & Schuster, 1986. (Hardcover; )/(Paperback; ) * Herstein, I.N., ''Topics in Algebra'', Wiley; 2 edition (June 20, 1975), . * Mac Lane, Saunders, and Garrett Birkhoff; ''Algebra'', American Mathematical Society; 3rd edition (1999). .