In mathematics, the real numbers include both rational numbers, such as 42 and −23/129, and irrational numbers, such as pi and the square root of two; or, a real number can be given by an infinite decimal representation, such as 2.4871773339..., where the digits continue in some way; or, the real numbers may be thought of as points on an infinitely long number line.
These descriptions of the real numbers, while intuitively accessible, are not sufficiently rigorous for the purposes of pure mathematics. The discovery of a suitably rigorous definition of the real numbers—indeed, the realization that a better definition was needed—was one of the most important developments of 19th century mathematics. Popular definitions in use today include equivalence classes of Cauchy sequences of rational numbers; Dedekind cuts; a more sophisticated version of "decimal representation"; and an axiomatic definition of the real numbers as the unique complete Archimedean ordered field. These definitions are all described in detail below.
A real number may be either rational or irrational; either algebraic or transcendental; and either positive, negative, or zero. Real numbers are used to measure continuous quantities. They may in theory be expressed by decimal representations that have an infinite sequence of digits to the right of the decimal point; these are often represented in the same form as 324.823122147… The ellipsis (three dots) indicate that there would still be more digits to come.
More formally, real numbers have the two basic properties of being an ordered field, and having the least upper bound property. The first says that real numbers comprise a field, with addition and multiplication as well as division by nonzero numbers, which can be totally ordered on a number line in a way compatible with addition and multiplication. The second says that if a nonempty set of real numbers has an upper bound, then it has a least upper bound. These two together define the real numbers completely, and allow its other properties to be deduced. For instance, we can prove from these properties that every polynomial of odd degree with real coefficients has a real root, and that if you add the square root of −1 to the real numbers, obtaining the complex numbers, the resulting field is algebraically closed.
In the physical sciences, most of the physical constants such as the universal gravitational constant, and physical variables, such as position, mass, speed, and electric charge, are modeled using real numbers. Note importantly, however, that all actual measurements of physical quantities yield rational numbers because the precision of such measurements can only be finite.
Computers cannot directly operate on real numbers, but only on a finite subset of rational numbers, limited by the number of bits used to store them. However, computer algebra systems are able to treat some irrational numbers exactly by storing their algebraic description (such as "sqrt(2)") rather than their rational approximation.
A real number is said to be computable if there exists an algorithm that yields its digits. Because there are only countably many algorithms, but an uncountable number of reals, almost all real numbers are not computable. Some constructivists accept the existence of only those reals that are computable. The set of definable numbers is broader, but still only countable. If computers could use unlimited precision real numbers (real computation), then one could solve NP-complete problems, and even #P-complete problems in polynomial time, answering affirmatively the P = NP problem. Unlimited precision real numbers in the physical universe are prohibited by the holographic principle and the Bekenstein bound.[1]
Mathematicians use the symbol R (or alternatively,
, the letter "R" in blackboard bold, Unicode ℝ) to represent the set of all real numbers. The notation Rn refers to an n-dimensional space with real coordinates; for example, a value from R3 consists of three real numbers and specifies a location in 3-dimensional space.
In mathematics, real is used as an adjective, meaning that the underlying field is the field of real numbers. For example real matrix, real polynomial and real Lie algebra. As a substantive, the term is used almost strictly in reference to the real numbers themselves (e.g., The "set of all reals").
Vulgar fractions had been used by the Egyptians around 1000 BC; the Vedic "Sulba Sutras" ("rule of chords" in, ca. 600 BC, include what may be the first 'use' of irrational numbers. The concept of irrationality was implicitly accepted by early Indian mathematicians since Manava (c. 750–690 BC), who was aware that the square roots of certain numbers such as 2 and 61 could not be exactly determined.[2] Around 500 BC, the Greek mathematicians led by Pythagoras realized the need for irrational numbers, in particular the irrationality of the square root of 2.
The Middle Ages saw the acceptance of zero, negative, integral and fractional numbers, first by Indian and Chinese mathematicians, and then by Arabic mathematicians, who were also the first to treat irrational numbers as algebraic objects,[3] which was made possible by the development of algebra. Arabic mathematicians merged the concepts of "number" and "magnitude" into a more general idea of real numbers.[4] The Egyptian mathematician Abū Kāmil Shujā ibn Aslam (c. 850–930) was the first to accept irrational numbers as solutions to quadratic equations or as coefficients in an equation, often in the form of square roots, cube roots and fourth roots.[5]
In the 16th century, Simon Stevin created the basis for modern decimal notation, and insisted that there is no difference between rational and irrational numbers in this regard.
In the 18th and 19th centuries there was much work on irrational and transcendental numbers. Lambert (1761) gave the first flawed proof that π cannot be rational; Legendre (1794) completed the proof, and showed that π is not the square root of a rational number. Ruffini (1799) and Abel (1842) both constructed proofs of Abel–Ruffini theorem: that the general quintic or higher equations cannot be solved by a general formula involving only arithmetical operations and roots.
Évariste Galois (1832) developed techniques for determining whether a given equation could be solved by radicals which gave rise to the field of Galois theory. Joseph Liouville (1840) showed that neither e nor e2 can be a root of an integer quadratic equation, and then established existence of transcendental numbers, the proof being subsequently displaced by Georg Cantor (1873). Charles Hermite (1873) first proved that e is transcendental, and Ferdinand von Lindemann (1882), showed that π is transcendental. Lindemann's proof was much simplified by Weierstrass (1885), still further by David Hilbert (1893), and has finally been made elementary by Hurwitz and Paul Albert Gordan.
The development of calculus in the 1700s used the entire set of real numbers without having defined them cleanly. The first rigorous definition was given by Georg Cantor in 1871. In 1874 he showed that the set of all real numbers is uncountably infinite but the set of all algebraic numbers is countably infinite. Contrary to widely held beliefs, his first method was not his famous diagonal argument, which he published in 1891. See Cantor's first uncountability proof.
The real numbers can be constructed as a completion of the rational numbers in such a way that a sequence defined by a decimal or binary expansion like {3, 3.1, 3.14, 3.141, 3.1415,...} converges to a unique real number. For details and other constructions of real numbers, see construction of the real numbers.
Let R denote the set of all real numbers. Then:
The last property is what differentiates the reals from the rationals. For example, the set of rationals with square less than 2 has a rational upper bound (e.g., 1.5) but no rational least upper bound, because the square root of 2 is not rational.
The real numbers are uniquely specified by the above properties. More precisely, given any two Dedekind-complete ordered fields R1 and R2, there exists a unique field isomorphism from R1 to R2, allowing us to think of them as essentially the same mathematical object.
For another axiomatization of R, see Tarski's axiomatization of the reals.
The main reason for introducing the reals is that the reals contain all limits. More technically, the reals are complete (in the sense of metric spaces or uniform spaces, which is a different sense than the Dedekind completeness of the order in the previous section). This means the following:
A sequence (xn) of real numbers is called a Cauchy sequence if for any ε > 0 there exists an integer N (possibly depending on ε) such that the distance |xn − xm| is less than ε for all n and m that are both greater than N. In other words, a sequence is a Cauchy sequence if its elements xn eventually come and remain arbitrarily close to each other.
A sequence (xn) converges to the limit x if for any ε > 0 there exists an integer N (possibly depending on ε) such that the distance |xn − x| is less than ε provided that n is greater than N. In other words, a sequence has limit x if its elements eventually come and remain arbitrarily close to x.
It is easy to see that every convergent sequence is a Cauchy sequence. An important fact about the real numbers is that the converse is also true :
Every Cauchy sequence of real numbers is convergent.That is, the reals are complete.
Note that the rationals are not complete. For example, the sequence (1, 1.4, 1.41, 1.414, 1.4142, 1.41421, ...) is Cauchy but it does not converge to a rational number. (In the real numbers, in contrast, it converges to the positive square root of 2.)
The existence of limits of Cauchy sequences is what makes calculus work and is of great practical use. The standard numerical test to determine if a sequence has a limit is to test if it is a Cauchy sequence, as the limit is typically not known in advance.
For example, the standard series of the exponential function
converges to a real number because for every x the sums
can be made arbitrarily small by choosing N sufficiently large. This proves that the sequence is Cauchy, so we know that the sequence converges even if the limit is not known in advance.