In mathematics, a rational number is any number that can be expressed as the quotient or fraction a/b of two integers, with the denominator b not equal to zero. Since b may be equal to 1, every integer is a rational number. The set of all rational numbers is usually denoted by a boldface Q (or blackboard bold Failed to parse (Missing texvc executable; please see math/README to configure.): \mathbb{Q} , Unicode ℚ), which stands for quotient.

The decimal expansion of a rational number always either terminates after a finite number of digits or begins to repeat the same finite sequence of digits over and over. Moreover, any repeating or terminating decimal represents a rational number. These statements hold true not just for base 10, but also for binary, hexadecimal, or any other integer base.

A real number that is not rational is called irrational. Irrational numbers include √2, π, and e. The decimal expansion of an irrational number continues forever without repeating. Since the set of rational numbers is countable, and the set of real numbers is uncountable, almost all real numbers are irrational.

The rational numbers can be formally defined as the equivalence classes of the quotient set (Z × (Z ∖ {0})) / ~, where the cartesian product Z × (Z ∖ {0}) is the set of all ordered pairs (m,n) where m and n are integers, n is not zero (n ≠ 0), and "~" is the equivalence relation defined by (m₁,n₁) ~ (m₂,n₂) if, and only if, m₁n₂ − m₂n₁ = 0.

In abstract algebra, the rational numbers together with certain operations of addition and multiplication form a field. This is the archetypical field of characteristic zero, and is the field of fractions for the ring of integers. Finite extensions of Q are called algebraic number fields, and the algebraic closure of Q is the field of algebraic numbers.

In mathematical analysis, the rational numbers form a dense subset of the real numbers. The real numbers can be constructed from the rational numbers by completion, using Cauchy sequences, Dedekind cuts, or infinite decimals.

Zero divided by any other integer equals zero, therefore zero is a rational number (but division by zero is undefined).

Terminology[link]

The term rational in reference to the set Q refers to the fact that a rational number represents a ratio of two integers. In mathematics, the adjective rational often means that the underlying field considered is the field Q of rational numbers. Rational polynomial usually, and most correctly, means a polynomial with rational coefficients, also called a “polynomial over the rationals”. However, rational function does not mean the underlying field is the rational numbers, and a rational algebraic curve is not an algebraic curve with rational coefficients.

Arithmetic[link]

Embedding of integers[link]

Any integer Failed to parse (Missing texvc executable; please see math/README to configure.): n

can be expressed as the rational number Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{n}{1}

.

Equality[link]

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} = \frac{c}{d}

if and only if  Failed to parse (Missing texvc executable; please see math/README to configure.): ad = bc.

Ordering[link]

Where both denominators are positive:

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} < \frac{c}{d}

if and only if  Failed to parse (Missing texvc executable; please see math/README to configure.): ad < bc.

If either denominator is negative, the fractions must first be converted into equivalent forms with positive denominators, through the equations:

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{-a}{-b} = \frac{a}{b}

and

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{-b} = \frac{-a}{b}.

Addition[link]

Two fractions are added as follows:

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} + \frac{c}{d} = \frac{ad+bc}{bd}.

Subtraction[link]

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} - \frac{c}{d} = \frac{ad-bc}{bd}.

Multiplication[link]

The rule for multiplication is:

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} \cdot \frac{c}{d} = \frac{ac}{bd}.

Division[link]

Where Failed to parse (Missing texvc executable; please see math/README to configure.): c \neq 0

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} \div \frac{c}{d} = \frac{ad}{bc}.

Note that division is equivalent to multiplying by the reciprocal of the divisor fraction:

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{ad}{bc} = \frac{a}{b} \times \frac{d}{c}.

Inverse[link]

Additive and multiplicative inverses exist in the rational numbers:

Failed to parse (Missing texvc executable; please see math/README to configure.): - \left( \frac{a}{b} \right) = \frac{-a}{b} = \frac{a}{-b} \quad\mbox{and}\quad \left(\frac{a}{b}\right)^{-1} = \frac{b}{a} \mbox{ if } a \neq 0.

Exponentiation to integer power[link]

If Failed to parse (Missing texvc executable; please see math/README to configure.): n

is a non-negative integer, then

Failed to parse (Missing texvc executable; please see math/README to configure.): \left(\frac{a}{b}\right)^n = \frac{a^n}{b^n}

and (if Failed to parse (Missing texvc executable; please see math/README to configure.): a \neq 0 ):

Failed to parse (Missing texvc executable; please see math/README to configure.): \left(\frac{a}{b}\right)^{-n} = \frac{b^n}{a^n}.

Continued fraction representation[link]

A finite continued fraction is an expression such as

Failed to parse (Missing texvc executable; please see math/README to configure.): a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cfrac{1}{ \ddots + \cfrac{1}{a_n} }}},

where a_i are integers. Every rational number a/b has two closely related expressions as a finite continued fraction, whose coefficients a_i can be determined by applying the Euclidean algorithm to (a,b).

Formal construction[link]

File:RationalRepresentation.pdf

Mathematically we may construct the rational numbers as equivalence classes of ordered pairs of integers (m,n), with n ≠ 0. This space of equivalence classes is the quotient space (Z × (Z ∖ {0})) / ∼, where (m₁,n₁) ∼ (m₂,n₂) if, and only if, m₁n₂ − m₂n₁ = 0. We can define addition and multiplication of these pairs with the following rules:

Failed to parse (Missing texvc executable; please see math/README to configure.): \left(m_1, n_1\right) + \left(m_2, n_2\right) \equiv \left(m_1n_2 + n_1m_2, n_1n_2\right)

Failed to parse (Missing texvc executable; please see math/README to configure.): \left(m_1, n_1\right) \times \left(m_2, n_2\right) \equiv \left(m_1m_2, n_1n_2\right)

and, if m₂ ≠ 0, division by

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{\left(m_1, n_1\right)} {\left(m_2, n_2\right)} \equiv \left(m_1n_2, n_1m_2\right).

The equivalence relation (m₁,n₁) ~ (m₂,n₂) if, and only if, m₁n₂ − m₂n₁ = 0 is a congruence relation, i.e. it is compatible with the addition and multiplication defined above, and we may define Q to be the quotient set (Z × (Z ∖ {0})) / ∼, i.e. we identify two pairs (m₁,n₁) and (m₂,n₂) if they are equivalent in the above sense. (This construction can be carried out in any integral domain: see field of fractions.) We denote by [(m₁,n₁)] the equivalence class containing (m₁,n₁). If (m₁,n₁) ~ (m₂,n₂) then, by definition, (m₁,n₁) belongs to [(m₂,n₂)] and (m₂,n₂) belongs to [(m₁,n₁)]; in this case we can write [(m₁,n₁)] = [(m₂,n₂)]. Given any equivalence class [(m,n)] there are a countably infinite number of representation, since

Failed to parse (Missing texvc executable; please see math/README to configure.): \cdots = [(-2m,-2n)] = [(-m,-n)] = [(m,n)] = [(2m,2n)] = \cdots.

The canonical choice for [(m,n)] is chosen so that gcd(m,n) = 1, i.e. m and n share no common factors, i.e. m and n are coprime. For example, we would write [(1,2)] instead of [(2,4)] or [(−12,−24)], even though [(1,2)] = [(2,4)] = [(−12,−24)].

We can also define a total order on Q. Let ∧ be the and-symbol and ∨ be the or-symbol. We say that [(m₁,n₁)] ≤ [(m₂,n₂)] if:

Failed to parse (Missing texvc executable; please see math/README to configure.): (n_1n_2 > 0 \ \and \ m_1n_2 \le n_1m_2) \ \or \ (n_1n_2 < 0 \ \and \ m_1n_2 \ge n_1m_2).

The integers may be considered to be rational numbers by the embedding that maps m to [(m, 1)].

Properties[link]

a diagram illustrating the countability of the rationals

The set Q, together with the addition and multiplication operations shown above, forms a field, the field of fractions of the integers Z.

The rationals are the smallest field with characteristic zero: every other field of characteristic zero contains a copy of Q. The rational numbers are therefore the prime field for characteristic zero.

The algebraic closure of Q, i.e. the field of roots of rational polynomials, is the algebraic numbers.

The set of all rational numbers is countable. Since the set of all real numbers is uncountable, we say that almost all real numbers are irrational, in the sense of Lebesgue measure, i.e. the set of rational numbers is a null set.

The rationals are a densely ordered set: between any two rationals, there sits another one, and, therefore, infinitely many other ones. For example, for any two fractions such that

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} < \frac{c}{d}

(where Failed to parse (Missing texvc executable; please see math/README to configure.): b,d

are positive), we have

Failed to parse (Missing texvc executable; please see math/README to configure.): \frac{a}{b} < \frac{ad + bc}{2bd} < \frac{c}{d}

Any totally ordered set which is countable, dense (in the above sense), and has no least or greatest element is order isomorphic to the rational numbers.

Real numbers and topological properties[link]

The rationals are a dense subset of the real numbers: every real number has rational numbers arbitrarily close to it. A related property is that rational numbers are the only numbers with finite expansions as regular continued fractions.

By virtue of their order, the rationals carry an order topology. The rational numbers, as a subspace of the real numbers, also carry a subspace topology. The rational numbers form a metric space by using the absolute difference metric d(x,y) = |x − y|, and this yields a third topology on Q. All three topologies coincide and turn the rationals into a topological field. The rational numbers are an important example of a space which is not locally compact. The rationals are characterized topologically as the unique countable metrizable space without isolated points. The space is also totally disconnected. The rational numbers do not form a complete metric space; the real numbers are the completion of Q under the metric d(x,y) = |x − y|, above.

[edit] p-adic numbers

In addition to the absolute value metric mentioned above, there are other metrics which turn Q into a topological field:

Let p be a prime number and for any non-zero integer a, let |a|_p = p^−n, where pⁿ is the highest power of p dividing a.

In addition set |0|_p = 0. For any rational number a/b, we set |a/b|_p = |a|_p / |b|_p.

Then d_p(x,y) = |x − y|_p defines a metric on Q.

The metric space (Q,d_p) is not complete, and its completion is the p-adic number field Q_p. Ostrowski's theorem states that any non-trivial absolute value on the rational numbers Q is equivalent to either the usual real absolute value or a p-adic absolute value.

See also[link]

• Rational data type
• Floating point
• Ford circles
• Niven's theorem

External links[link]

• “Rational Number” From MathWorld — A Wolfram Web Resource