Difference between revisions of "Real Numbers (Rational vs. Irrational Numbers)"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
(Created page with "= Rational number = File:Number-systems.svg|thumb|The rational numbers (<math>\mathbb{Q}</math>) are included in the real numbers (<math>\mathbb{R}</math>), while themselves...")
 
 
(11 intermediate revisions by the same user not shown)
Line 2: Line 2:
 
[[File:Number-systems.svg|thumb|The rational numbers (<math>\mathbb{Q}</math>) are included in the real numbers (<math>\mathbb{R}</math>), while themselves including the integers (<math>\mathbb{Z}</math>), which in turn include the natural numbers (<math>\mathbb{N}</math>)]]
 
[[File:Number-systems.svg|thumb|The rational numbers (<math>\mathbb{Q}</math>) are included in the real numbers (<math>\mathbb{R}</math>), while themselves including the integers (<math>\mathbb{Z}</math>), which in turn include the natural numbers (<math>\mathbb{N}</math>)]]
  
In mathematics, a '''rational number''' is a number that can be expressed as the quotient or fraction <math>\frac{p}{q}</math> of two integers, a numerator {{math|''p''}} and a non-zero denominator {{math|''q''}}. For example, <math>\frac{−3}{7}</math> is a rational number, as is every integer (e.g. <math>5 = \frac{5}{1}</math>). The set of all rational numbers, also referred to as "'''the rationals'''", the '''field of rationals''' or the '''field of rational numbers''' is usually denoted by a boldface {{math|'''Q'''}} ; it was thus denoted in 1895 by Giuseppe Peano after ''quoziente'', Italian for "quotient", and first appeared in Bourbaki's ''Algèbre''.
+
In mathematics, a '''rational number''' is a number that can be expressed as the quotient or fraction <math>\frac{p}{q}</math> of two integers, a numerator {{math|''p''}} and a non-zero denominator {{math|''q''}}. For example, <math>\frac{-3}{7}</math> is a rational number, as is every integer (e.g. <math>5 = \frac{5}{1}</math>). The set of all rational numbers, also referred to as "'''the rationals'''", the '''field of rationals''' or the '''field of rational numbers''' is usually denoted by a boldface {{math|'''Q'''}} ; it was thus denoted in 1895 by Giuseppe Peano after ''quoziente'', Italian for "quotient", and first appeared in Bourbaki's ''Algèbre''.
  
 
The decimal expansion of a rational number either terminates after a finite number of digits (example: <math>\frac{3}{4} = 0.75</math>), or eventually begins to repeat the same finite sequence of digits over and over (example: <math>\frac{9}{44} = 0.20454545...</math>). Conversely, any repeating or terminating decimal represents a rational number. These statements are true in base 10, and in every other integer base (for example, binary or hexadecimal).
 
The decimal expansion of a rational number either terminates after a finite number of digits (example: <math>\frac{3}{4} = 0.75</math>), or eventually begins to repeat the same finite sequence of digits over and over (example: <math>\frac{9}{44} = 0.20454545...</math>). Conversely, any repeating or terminating decimal represents a rational number. These statements are true in base 10, and in every other integer base (for example, binary or hexadecimal).
Line 71: Line 71:
  
 
===Inverse===
 
===Inverse===
Every rational number {{math|{{sfrac|''a''|''b''}}}} has an [[additive inverse]], often called its ''opposite'',
+
Every rational number <math>\frac{a}{b}</math> has an additive inverse, often called its ''opposite'',
 
:<math> - \left( \frac{a}{b} \right) = \frac{-a}{b}.</math>
 
:<math> - \left( \frac{a}{b} \right) = \frac{-a}{b}.</math>
If {{math|{{sfrac|''a''|''b''}}}} is in canonical form, the same is true for its opposite.
+
If <math>\frac{a}{b}</math> is in canonical form, the same is true for its opposite.
  
A nonzero rational number {{math|{{sfrac|''a''|''b''}}}} has a [[multiplicative inverse]], also called its ''reciprocal'',
+
A nonzero rational number <math>\frac{a}{b}</math>  has a multiplicative inverse, also called its ''reciprocal'',
 
:<math> \left(\frac{a}{b}\right)^{-1} = \frac{b}{a}. </math>
 
:<math> \left(\frac{a}{b}\right)^{-1} = \frac{b}{a}. </math>
If {{math|{{sfrac|''a''|''b''}}}} is in canonical form, then the canonical form of its reciprocal is either {{math|{{sfrac|''b''|''a''}}}} or {{math|{{sfrac|−''b''|−''a''}}}}, depending on the sign of {{mvar|a}}.
+
If <math>\frac{a}{b}</math> is in canonical form, then the canonical form of its reciprocal is either <math>\frac{b}{a}</math>  or <math>\frac{-b}{-a}</math> , depending on the sign of {{mvar|a}}.
  
 
===Division===
 
===Division===
Line 83: Line 83:
 
:<math>\frac{\frac{a}{b}} {\frac{c}{d}} = \frac{ad}{bc}.</math>
 
:<math>\frac{\frac{a}{b}} {\frac{c}{d}} = \frac{ad}{bc}.</math>
  
Thus, dividing {{math|{{sfrac|''a''|''b''}}}} by {{math|{{sfrac|''c''|''d''}}}} is equivalent to multiplying {{math|{{sfrac|''a''|''b''}}}} by the reciprocal of {{math|{{sfrac|''c''|''d''}}}}:
+
Thus, dividing <math>\frac{a}{b}</math>  by <math>\frac{c}{d}</math> is equivalent to multiplying <math>\frac{a}{b}</math>  by the reciprocal of <math>\frac{c}{d}</math>:
 
:<math>\frac{ad}{bc} = \frac{a}{b} \cdot \frac{d}{c}.</math>
 
:<math>\frac{ad}{bc} = \frac{a}{b} \cdot \frac{d}{c}.</math>
  
Line 89: Line 89:
 
If {{math|''n''}} is a non-negative integer, then
 
If {{math|''n''}} is a non-negative integer, then
 
:<math>\left(\frac{a}{b}\right)^n = \frac{a^n}{b^n}.</math>
 
:<math>\left(\frac{a}{b}\right)^n = \frac{a^n}{b^n}.</math>
The result is in canonical form if the same is true for {{math|{{sfrac|''a''|''b''}}}}. In particular,  
+
The result is in canonical form if the same is true for <math>\frac{a}{b}</math>. In particular,  
 
:<math>\left(\frac{a}{b}\right)^0 = 1.</math>
 
:<math>\left(\frac{a}{b}\right)^0 = 1.</math>
  
 
If {{math|''a'' ≠ 0}}, then
 
If {{math|''a'' ≠ 0}}, then
 
:<math>\left(\frac{a}{b}\right)^{-n} = \frac{b^n}{a^n}.</math>
 
:<math>\left(\frac{a}{b}\right)^{-n} = \frac{b^n}{a^n}.</math>
If {{math|{{sfrac|''a''|''b''}}}} is in canonical form, the canonical form of the result is {{math|{{sfrac|''b<sup>n</sup>''|''a<sup>n</sup>''}}}} if {{math|''a'' > 0}} or {{mvar|n}} is even. Otherwise, the canonical form of the result is {{math|{{sfrac|−''b<sup>n</sup>''|−''a<sup>n</sup>''}}}}.
+
If <math>\frac{a}{b}</math>  is in canonical form, the canonical form of the result is <math>\frac{b^n}{a^n}</math> if {{math|''a'' > 0}} or {{mvar|n}} is even. Otherwise, the canonical form of the result is <math>\frac{-b^n}{-a^n}</math> .
  
 
==Continued fraction representation==
 
==Continued fraction representation==
 
A '''finite continued fraction''' is an expression such as
 
A '''finite continued fraction''' is an expression such as
 
:<math>a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cfrac{1}{ \ddots + \cfrac{1}{a_n} }}},</math>
 
:<math>a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cfrac{1}{ \ddots + \cfrac{1}{a_n} }}},</math>
where {{math|''a<sub>n</sub>''}} are integers. Every rational number {{math|{{sfrac|''a''|''b''}}}} can be represented as a finite continued fraction, whose coefficients {{math|''a<sub>n</sub>''}} can be determined by applying the Euclidean algorithm to {{math|(''a'', ''b'')}}.
+
where {{math|''a<sub>n</sub>''}} are integers. Every rational number <math>\frac{a}{b}</math>  can be represented as a finite continued fraction, whose coefficients {{math|''a<sub>n</sub>''}} can be determined by applying the Euclidean algorithm to {{math|(''a'', ''b'')}}.
  
 
== Other representations ==
 
== Other representations ==
  
* common fraction: {{math|{{sfrac|8|3}}}}
+
* common fraction: <math>\frac{8}{3}</math>
* mixed numeral: {{math|{{sfrac|2|2|3}}}}
+
* mixed numeral: <math>2 \frac{2}{3}</math>
* repeating decimal using a vinculum: {{math|2.{{overline|6}}}}
+
* repeating decimal using a vinculum: <math>2.\overline{6}</math>
 
* repeating decimal using parentheses: {{math|2.(6)}}
 
* repeating decimal using parentheses: {{math|2.(6)}}
* continued fraction using traditional typography: {{math|2 + {{sfrac|1|1 + {{sfrac|1|2}}}}}}
+
* continued fraction using traditional typography: <math>2 + \frac{1}{1 + \frac{1}{2}}</math>
 
* continued fraction in abbreviated notation: {{math|[2; 1, 2]}}
 
* continued fraction in abbreviated notation: {{math|[2; 1, 2]}}
* Egyptian fraction: {{math|2 + {{sfrac|1|2}} + {{sfrac|1|6}}}}
+
* Egyptian fraction: <math> 2+ \frac{1}{2} + \frac{1}{6}</math>
 
* prime power decomposition: {{math|2<sup>3</sup> × 3<sup>−1</sup>}}
 
* prime power decomposition: {{math|2<sup>3</sup> × 3<sup>−1</sup>}}
 
* quote notation: {{math|'''3'6'''}}
 
* quote notation: {{math|'''3'6'''}}
Line 126: Line 126:
 
:<math>\left(m_1, n_1\right) \times \left(m_2, n_2\right) \equiv \left(m_1m_2, n_1n_2\right).</math>
 
:<math>\left(m_1, n_1\right) \times \left(m_2, n_2\right) \equiv \left(m_1m_2, n_1n_2\right).</math>
  
This equivalence relation is a congruence relation, which means that it is compatible with the addition and multiplication defined above; the set of rational numbers {{math|'''Q'''}} is the defined as the [[quotient set]] by this equivalence relation, {{math|1=('''Z''' × ('''Z''' \ {0})) / ~}}, equipped with the addition and the multiplication induced by the above operations. (This construction can be carried out with any [[integral domain]] and produces its field of fractions.)
+
This equivalence relation is a congruence relation, which means that it is compatible with the addition and multiplication defined above; the set of rational numbers {{math|'''Q'''}} is the defined as the quotient set by this equivalence relation, {{math|1=('''Z''' × ('''Z''' \ {0})) / ~}}, equipped with the addition and the multiplication induced by the above operations. (This construction can be carried out with any integral domain and produces its field of fractions.)
  
The equivalence class of a pair {{math|(''m'', ''n'')}} is denoted {{math|{{sfrac|''m''|''n''}}}}.   
+
The equivalence class of a pair {{math|(''m'', ''n'')}} is denoted <math>\frac{m}{n}</math>.   
Two pairs {{math|(''m''<sub>1</sub>, ''n''<sub>1</sub>)}} and {{math|(''m''<sub>2</sub>, ''n''<sub>2</sub>)}} belong to the same equivalence class (that is are equivalent) if and only if {{math|''m''<sub>1</sub>''n''<sub>2</sub> {{=}} ''m''<sub>2</sub>''n''<sub>1</sub>}}. This means that {{math|{{sfrac|''m''<sub>1</sub>|''n''<sub>1</sub>}} {{=}} {{sfrac|''m''<sub>2</sub>|''n''<sub>2</sub>}}}} if and only {{math|''m''<sub>1</sub>''n''<sub>2</sub> {{=}} ''m''<sub>2</sub>''n''<sub>1</sub>}}.
+
Two pairs {{math|(''m''<sub>1</sub>, ''n''<sub>1</sub>)}} and {{math|(''m''<sub>2</sub>, ''n''<sub>2</sub>)}} belong to the same equivalence class (that is are equivalent) if and only if ''m''<sub>1</sub>''n''<sub>2</sub> = ''m''<sub>2</sub>''n''<sub>1</sub>. This means that <math>\frac{m_1}{n_1)} = \frac{m_2}{n_2}</math> if and only ''m''<sub>1</sub>''n''<sub>2</sub> = ''m''<sub>2</sub>''n''<sub>1</sub>.
  
Every equivalence class {{math|{{sfrac|''m''|''n''}}}} may be represented by infinitely many pairs, since
+
Every equivalence class <math>\frac{m}{n}</math> may be represented by infinitely many pairs, since
 
:<math>\cdots  = \frac{-2m}{-2n} = \frac{-m}{-n} = \frac{m}{n} = \frac{2m}{2n} = \cdots.</math>
 
:<math>\cdots  = \frac{-2m}{-2n} = \frac{-m}{-n} = \frac{m}{n} = \frac{2m}{2n} = \cdots.</math>
 
Each equivalence class contains a unique ''canonical representative element''. The canonical representative is the unique pair {{math|(''m'', ''n'')}} in the equivalence class such that {{mvar|m}} and {{mvar|n}} are coprime, and {{math|''n'' > 0}}. It is called the representation in lowest terms of the rational number.
 
Each equivalence class contains a unique ''canonical representative element''. The canonical representative is the unique pair {{math|(''m'', ''n'')}} in the equivalence class such that {{mvar|m}} and {{mvar|n}} are coprime, and {{math|''n'' > 0}}. It is called the representation in lowest terms of the rational number.
  
The integers may be considered to be rational numbers identifying the integer {{mvar|n}} with the rational number {{math|{{sfrac|''n''|1}}}}.
+
The integers may be considered to be rational numbers identifying the integer {{mvar|n}} with the rational number <math>\frac{n}{1}</math>.
  
 
A total order may be defined on the rational numbers, that extends the natural order of the integers. One has
 
A total order may be defined on the rational numbers, that extends the natural order of the integers. One has
Line 166: Line 166:
 
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.
 
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 {{math|''d''(''x'', ''y'') {{=}} {{abs|''x'' − ''y''}}}}, and this yields a third topology on {{math|'''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 {{math|'''Q'''}} under the metric {{math|''d''(''x'', ''y'') {{=}} {{abs|''x'' − ''y''}}}} above.
+
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 {{math|'''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 {{math|'''Q'''}} under the metric ''d''(''x'', ''y'') = |''x'' − ''y''| above.
  
 
=={{math|''p''}}-adic numbers==
 
=={{math|''p''}}-adic numbers==
 
In addition to the absolute value metric mentioned above, there are other metrics which turn {{math|'''Q'''}} into a topological field:
 
In addition to the absolute value metric mentioned above, there are other metrics which turn {{math|'''Q'''}} into a topological field:
  
Let {{mvar|p}} be a [[prime number]] and for any non-zero integer {{mvar|a}}, let {{math|{{abs|''a''}}<sub>''p''</sub> {{=}} ''p''<sup>−''n''</sup>}}, where {{math|''p<sup>n</sup>''}} is the highest power of {{mvar|p}} dividing {{mvar|a}}.
+
Let {{mvar|p}} be a prime number and for any non-zero integer {{mvar|a}}, let |''a''|<sub>''p''</sub> = ''p''<sup>−''n''</sup>, where {{math|''p<sup>n</sup>''}} is the highest power of {{mvar|p}} dividing {{mvar|a}}.
  
In addition set {{math|{{abs|0}}<sub>''p''</sub> {{=}} 0}}. For any rational number {{math|{{sfrac|''a''|''b''}}}}, we set {{math|{{abs|{{sfrac|''a''|''b''}}}}<sub>''p''</sub> {{=}} {{sfrac|{{abs|''a''}}<sub>''p''</sub>|{{abs|''b''}}<sub>''p''</sub>}}}}.
+
In addition set |0|<sub>''p''</sub> = 0. For any rational number <math>\frac{a}{b}</math>, we set <math>|\frac{a}{b}|_p = \frac{|a|_p}{|b|_p}</math>.
  
Then {{math|''d<sub>p</sub>''(''x'', ''y'') {{=}} {{abs|''x'' − ''y''}}<sub>''p''</sub>}} defines a metric on {{math|'''Q'''}}.
+
Then ''d<sub>p</sub>''(''x'', ''y'') = |''x'' − ''y''|<sub>''p''</sub> defines a metric on {{math|'''Q'''}}.
  
 
The metric space {{math|('''Q''', ''d<sub>p</sub>'')}} is not complete, and its completion is the {{mvar|p}}-adic number field {{math|'''Q'''<sub>''p''</sub>}}. Ostrowski's theorem states that any non-trivial absolute value on the rational numbers {{math|'''Q'''}} is equivalent to either the usual real absolute value or a {{mvar|p}}-adic absolute value.
 
The metric space {{math|('''Q''', ''d<sub>p</sub>'')}} is not complete, and its completion is the {{mvar|p}}-adic number field {{math|'''Q'''<sub>''p''</sub>}}. Ostrowski's theorem states that any non-trivial absolute value on the rational numbers {{math|'''Q'''}} is equivalent to either the usual real absolute value or a {{mvar|p}}-adic absolute value.
 +
 +
= Irrational number =
 +
 +
[[File:Square root of 2 triangle.svg|right|thumb|240px|The number <math>\sqrt{2}</math> is irrational.]]
 +
 +
In mathematics, the '''irrational numbers''' (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers which are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being ''incommensurable'', meaning that they share no "measure" in common, that is, there is no length ("the measure"), no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.
 +
 +
Among irrational numbers are the ratio <math>\pi</math> of a circle's circumference to its diameter, Euler's number ''e'', the golden ratio ''φ'', and the square root of two. In fact, all square roots of natural numbers, other than of perfect squares, are irrational.
 +
 +
Like all real numbers, irrational numbers can be expressed in positional notation, notably as a decimal number. In the case of irrational numbers, the decimal expansion does not terminate, nor end with a repeating sequence. For example, the decimal representation of <math>\pi</math> starts with 3.14159, but no finite number of digits can represent <math>\pi</math> exactly, nor does it repeat. Conversely, a decimal expansion that terminates or repeats must be a rational number. These are provable properties of rational numbers and positional number systems, and are not used as definitions in mathematics.
 +
 +
Irrational numbers can also be expressed as non-terminating continued fractions and many other ways.
 +
 +
As a consequence of Cantor's proof that the real numbers are uncountable and the rationals countable, it follows that almost all real numbers are irrational.
 +
 +
== Examples ==
 +
 +
=== Square roots ===
 +
The square root of 2 was the first number proved irrational, and that article contains a number of proofs. The golden ratio is another famous quadratic irrational number. The square roots of all natural numbers which are not perfect squares are irrational and a proof may be found in quadratic irrationals.
 +
 +
===General roots===
 +
The proof above for the square root of two can be generalized using the fundamental theorem of arithmetic. This asserts that every integer has a unique factorization into primes. Using it we can show that if a rational number is not an integer then no integral power of it can be an integer, as in lowest terms there must be a prime in the denominator that does not divide into the numerator whatever power each is raised to. Therefore, if an integer is not an exact {{mvar|k}}th power of another integer, then that first integer's {{mvar|k}}th root is irrational.
 +
 +
=== Logarithms ===
 +
Perhaps the numbers most easy to prove irrational are certain logarithms. Here is a proof by contradiction that log<sub>2</sub>&nbsp;3 is irrational (log<sub>2</sub>&nbsp;3 ≈&nbsp;1.58&nbsp;>&nbsp;0).
 +
 +
Assume log<sub>2</sub>&nbsp;3 is rational. For some positive integers ''m'' and ''n'', we have
 +
 +
: <math>\log_2 3 = \frac{m}{n}.</math>
 +
 +
It follows that
 +
 +
: <math>2^{m/n}=3</math>
 +
 +
: <math>(2^{m/n})^n = 3^n</math>
 +
 +
: <math>2^m=3^n.</math>
 +
 +
However, the number 2 raised to any positive integer power must be even (because it is divisible by&nbsp;2) and the number&nbsp;3 raised to any positive integer power must be odd (since none of its prime factors will be&nbsp;2).  Clearly, an integer cannot be both odd and even at the same time: we have a contradiction. The only assumption we made was that log<sub>2</sub>&nbsp;3 is rational (and so expressible as a quotient of integers ''m''/''n'' with ''n''&nbsp;≠&nbsp;0). The contradiction means that this assumption must be false, i.e. log<sub>2</sub>&nbsp;3 is irrational, and can never be expressed as a quotient of integers ''m''/''n'' with ''n''&nbsp;≠&nbsp;0.
 +
 +
Cases such as log<sub>10</sub>&nbsp;2 can be treated similarly.
 +
 +
==Types==
 +
* number theoretic distinction : transcendental/algebraic
 +
* normal/ abnormal (non-normal)
 +
 +
=== Transcendental/algebraic ===
 +
Almost all irrational numbers are transcendental and all real transcendental numbers are irrational (there are also complex transcendental numbers): the article on transcendental numbers lists several examples. So ''e''<sup>&nbsp;''r''</sup> and π<sup>&nbsp;''r''</sup> are irrational for all nonzero rational&nbsp;''r'', and, e.g., ''e''<sup>π</sup>&nbsp;is irrational, too.
 +
 +
Irrational numbers can also be found within the countable set of real algebraic numbers (essentially defined  as the real roots of polynomials with integer coefficients), i.e., as real solutions of polynomial equations
 +
 +
:<math>p(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0 = 0\;, </math>
 +
 +
where the coefficients <math>a_i</math> are integers and <math>a_n \ne 0</math>. Any rational root of this polynomial equation must be of the form ''r'' /''s'', where ''r'' is a divisor of ''a''<sub>0</sub> and ''s'' is a divisor of ''a''<sub>''n''</sub>. If a real root <math>x_0</math> of a polynomial <math>p</math> is not among these finitely many possibilities, it must be an irrational algebraic number. An exemplary proof for the existence of such algebraic irrationals is by showing that ''x''<sub>0</sub> &nbsp;=&nbsp;(2<sup>1/2</sup>&nbsp;+&nbsp;1)<sup>1/3</sup> is an irrational root of a polynomial with integer coefficients: it satisfies (''x''<sup>3</sup>&nbsp;−&nbsp;1)<sup>2</sup> = 2 and hence ''x''<sup>6</sup>&nbsp;−&nbsp;2''x''<sup>3</sup>&nbsp;−&nbsp;1&nbsp;=&nbsp;0, and this latter polynomial has no rational roots (the only candidates to check are&nbsp;±1, and&nbsp;''x''<sub>0</sub>, being greater than&nbsp;1, is neither of these), so&nbsp;''x''<sub>0</sub> is an irrational algebraic number.
 +
 +
Because the algebraic numbers form a subfield of the real numbers, many irrational real numbers can be constructed by combining transcendental and algebraic numbers. For example, <math>3 \pi +2</math>, <math> \pi + \sqrt{2} </math> and <math> e \sqrt{3} </math> are irrational (and even transcendental).
 +
 +
==Decimal expansions==
 +
The decimal expansion of an irrational number never repeats or terminates (the latter being equivalent to repeating zeroes), unlike any rational number. The same is true for binary, octal or hexadecimal expansions, and in general for expansions in every positional notation with natural bases.
 +
 +
To show this, suppose we divide integers ''n'' by ''m'' (where ''m'' is nonzero). When long division is applied to the division of ''n'' by ''m'', only ''m'' remainders are possible. If 0 appears as a remainder, the decimal expansion terminates. If 0 never occurs, then the algorithm can run at most ''m'' − 1 steps without using any remainder more than once. After that, a remainder must recur, and then the decimal expansion repeats.
 +
 +
Conversely, suppose we are faced with a repeating decimal, we can prove that it is a fraction of two integers. For example, consider:
 +
 +
:<math>A=0.7\,162\,162\,162\,\ldots</math>
 +
 +
Here the repetend is 162 and the length of the repetend is 3. First, we multiply by an appropriate power of 10 to move the decimal point to the right so that it is just in front of a repetend. In this example we would multiply by 10 to obtain:
 +
 +
:<math>10A = 7.162\,162\,162\,\ldots</math>
 +
 +
Now we multiply this equation by 10<sup>''r''</sup> where ''r'' is the length of the repetend. This has the effect of moving the decimal point to be in front of the "next" repetend. In our example, multiply by 10<sup>3</sup>:
 +
 +
:<math>10,000A=7\,162.162\,162\,\ldots</math>
 +
 +
The result of the two multiplications gives two different expressions with exactly the same "decimal portion", that is, the tail end of 10,000''A'' matches the tail end of 10''A'' exactly. Here, both 10,000''A'' and 10''A'' have .162 162 162 ... after the decimal point.
 +
 +
Therefore, when we subtract the 10''A'' equation from the 10,000''A'' equation, the tail end of 10''A'' cancels out the tail end of 10,000''A'' leaving us with:
 +
 +
:<math>9990A=7155.</math>
 +
 +
Then
 +
 +
:<math>A= \frac{7155}{9990} = \frac{53}{74}</math>
 +
 +
is a ratio of integers and therefore a rational number.
 +
 +
== Irrational powers ==
 +
Dov Jarden gave a simple non-constructive proof that there exist two irrational numbers ''a'' and ''b'', such that ''a''<sup>''b''</sup> is rational:
 +
 +
Consider <math>\sqrt{2}^\sqrt{2}</math>; if this is rational, then take ''a'' = ''b'' = <math>\sqrt{2}</math>.  Otherwise, take ''a'' to be the irrational number <math>\sqrt{2}^\sqrt{2}</math> and ''b'' = <math>\sqrt{2}</math>.  Then <math> a^b = {(\sqrt{2}^\sqrt{2})}^{\sqrt{2}} = \sqrt{2}^{\sqrt{2} \cdot \sqrt{2}} = {\sqrt{2}}^{2} = 2 </math>, which is rational.
 +
 +
Although the above argument does not decide between the two cases, the Gelfond–Schneider theorem shows that \sqrt{2}^\sqrt{2} is transcendental, hence irrational. This theorem states that if ''a'' and ''b'' are both algebraic numbers, and ''a'' is not equal to 0 or 1, and ''b'' is not a rational number, then any value of ''a''<sup>''b''</sup> is a transcendental number (there can be more than one value if complex number exponentiation is used).
 +
 +
An example that provides a simple constructive proof is
 +
 +
:<math>\left(\sqrt{2}\right)^{\log_{\sqrt{2}}3}=3.</math>
 +
 +
The base of the left side is irrational and the right side is rational, so one must prove that the exponent on the left side, <math>\log_{\sqrt{2}}3</math>, is irrational. This is so because, by the formula relating logarithms with different bases,
 +
 +
:<math>\log_{\sqrt{2}}3=\frac{\log_2 3}{\log_2 \sqrt{2}}=\frac{\log_2 3}{1/2} = 2\log_2 3</math>
 +
 +
which we can assume, for the sake of establishing a contradiction, equals a ratio ''m/n'' of positive integers. Then <math>\log_2 3 = m/2n</math> hence <math>2^{\log_2 3}=2^{m/2n}</math> hence <math>3=2^{m/2n}</math> hence <math>3^{2n}=2^m</math>, which is a contradictory pair of prime factorizations and hence violates the fundamental theorem of arithmetic (unique prime factorization).
 +
 +
A stronger result is the following: Every rational number in the interval <math>((1/e)^{1/e}, \infty)</math> can be written either as ''a''<sup>''a''</sup> for some irrational number ''a'' or as ''n''<sup>''n''</sup> for some natural number ''n''. Similarly, every positive rational number can be written either as <math>a^{a^a}</math> for some irrational number ''a'' or as <math>n^{n^n}</math> for some natural number ''n''.
 +
 +
== Open questions ==
 +
It is not known if <math>\pi+e</math> (or <math>\pi-e</math>) is irrational. In fact, there is no pair of non-zero integers <math>m, n</math> for which it is known whether <math>m\pi+ n e</math> is irrational. Moreover, it is not known if the set <math>\{\pi, e\}</math> is algebraically independent over <math>\Q</math>.
 +
 +
It is not known if <math>\pi e,\ \pi/e,\ 2^e,\ \pi^e,\ \pi^\sqrt{2},\ \ln\pi,</math> Catalan's constant, or the Euler–Mascheroni constant <math>\gamma</math> are irrational. It is not known if either of the tetrations <math>^n\pi</math> or <math>^n e</math> is rational for some integer <math>n > 1.</math>{
 +
 +
== Set of all irrationals ==
 +
Since the reals form an uncountable set, of which the rationals are a countable subset, the complementary set of irrationals is uncountable.
 +
 +
Under the usual (Euclidean) distance function d(''x'',&nbsp;''y'') = |''x''&nbsp;&minus;&nbsp;''y''|, the real numbers are a metric space and hence also a topological space.  Restricting the Euclidean distance function gives the irrationals the structure of a metric space.  Since the subspace of irrationals is not closed,
 +
the induced metric is not complete.  However, being a G-delta set&mdash;i.e., a countable intersection of open subsets&mdash;in a complete metric space, the space of irrationals is completely metrizable: that is, there is a metric on the irrationals inducing the same topology as the restriction of the Euclidean metric, but with respect to which the irrationals are complete.  One can see this without knowing the aforementioned fact about G-delta sets: the continued fraction expansion of an irrational number defines a homeomorphism from the space of irrationals to the space of all sequences of positive integers, which is easily seen to be completely metrizable.
 +
 +
Furthermore, the set of all irrationals is a disconnected metrizable space. In fact, the irrationals equipped with the subspace topology have a basis of clopen sets so the space is zero-dimensional.
 +
 +
= Licensing =
 +
Content obtained and/or adapted from:
 +
* [https://en.wikipedia.org/wiki/Rational_number Rational number, Wikipedia] under a CC BY-SA license
 +
* [https://en.wikipedia.org/wiki/Irrational_number Irrational number, Wikipedia] under a CC BY-SA license

Latest revision as of 17:58, 11 December 2021

Rational number

The rational numbers () are included in the real numbers (), while themselves including the integers (), which in turn include the natural numbers ()

In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator p and a non-zero denominator q. For example, is a rational number, as is every integer (e.g. ). The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by a boldface Q ; it was thus denoted in 1895 by Giuseppe Peano after quoziente, Italian for "quotient", and first appeared in Bourbaki's Algèbre.

The decimal expansion of a rational number either terminates after a finite number of digits (example: ), or eventually begins to repeat the same finite sequence of digits over and over (example: ). Conversely, any repeating or terminating decimal represents a rational number. These statements are true in base 10, and in every other integer base (for example, binary or hexadecimal).

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

Rational numbers can be formally defined as equivalence classes of pairs of integers (p, q) with q ≠ 0, using the equivalence relation defined as follows:

The fraction then denotes the equivalence class of (p, q).

Rational numbers together with addition and multiplication form a field which contains the integers, and is contained in any field containing the integers. In other words, the field of rational numbers is a prime field, and a field has characteristic zero if and only if it contains the rational numbers as a subfield. 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 (for more, see Construction of the real numbers).

Terminology

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, "rational" is often used as a noun abbreviating "rational number". The adjective rational sometimes means that the coefficients are rational numbers. For example, a rational point is a point with rational coordinates (i.e., a point whose coordinates are rational numbers); a rational matrix is a matrix of rational numbers; a rational polynomial may be a polynomial with rational coefficients, although the term "polynomial over the rationals" is generally preferred, to avoid confusion between "rational expression" and "rational function" (a polynomial is a rational expression and defines a rational function, even if its coefficients are not rational numbers). However, a rational curve is not a curve defined over the rationals, but a curve which can be parameterized by rational functions.

Etymology

Although nowadays rational numbers are defined in terms of ratios, the term rational is not a derivation of ratio. On the opposite, it is ratio that is derived from rational: the first use of ratio with its modern meaning was attested in English about 1660, while the use of rational for qualifying numbers appeared almost a century earlier, in 1570. This meaning of rational came from the mathematical meaning of irrational, which was first used in 1551, and it was used in "translations of Euclid (following his peculiar use of ἄλογος)".

This unusual history originated in the fact that ancient Greeks "avoided heresy by forbidding themselves from thinking of those [irrational] lengths as numbers". So such lengths were irrational, in the sense of illogical, that is "not to be spoken about" (ἄλογος in Greek).

This etymology is similar to that of imaginary numbers and real numbers.

Arithmetic

Irreducible fraction

Every rational number may be expressed in a unique way as an irreducible fraction , where a and b are coprime integers and b > 0. This is often called the canonical form of the rational number.

Starting from a rational number , its canonical form may be obtained by dividing a and b by their greatest common divisor, and, if b < 0, changing the sign of the resulting numerator and denominator.

Embedding of integers

Any integer n can be expressed as the rational number , which is its canonical form as a rational number.

Equality

if and only if

If both fractions are in canonical form, then:

if and only if and

Ordering

If both denominators are positive (particularly if both fractions are in canonical form):

if and only if

On the other hand, if either denominator is negative, then each fraction with a negative denominator must first be converted into an equivalent form with a positive denominator—by changing the signs of both its numerator and denominator.

Addition

Two fractions are added as follows:

If both fractions are in canonical form, the result is in canonical form if and only if b and d are coprime integers.

Subtraction

If both fractions are in canonical form, the result is in canonical form if and only if b and d are coprime integers.

Multiplication

The rule for multiplication is:

where the result may be a reducible fraction—even if both original fractions are in canonical form.

Inverse

Every rational number has an additive inverse, often called its opposite,

If is in canonical form, the same is true for its opposite.

A nonzero rational number has a multiplicative inverse, also called its reciprocal,

If is in canonical form, then the canonical form of its reciprocal is either or , depending on the sign of a.

Division

If b, c, and d are nonzero, the division rule is

Thus, dividing by is equivalent to multiplying by the reciprocal of :

Exponentiation to integer power

If n is a non-negative integer, then

The result is in canonical form if the same is true for . In particular,

If a ≠ 0, then

If is in canonical form, the canonical form of the result is if a > 0 or n is even. Otherwise, the canonical form of the result is .

Continued fraction representation

A finite continued fraction is an expression such as

where an are integers. Every rational number can be represented as a finite continued fraction, whose coefficients an can be determined by applying the Euclidean algorithm to (a, b).

Other representations

  • common fraction:
  • mixed numeral:
  • repeating decimal using a vinculum:
  • repeating decimal using parentheses: 2.(6)
  • continued fraction using traditional typography:
  • continued fraction in abbreviated notation: [2; 1, 2]
  • Egyptian fraction:
  • prime power decomposition: 23 × 3−1
  • quote notation: 3'6

are different ways to represent the same rational value.

Formal construction

A diagram showing a representation of the equivalent classes of pairs of integers

The rational numbers may be built as equivalence classes of ordered pairs of integers.

More precisely, let (Z × (Z \ {0})) be the set of the pairs (m, n) of integers such n ≠ 0. An equivalence relation is defined on this set by

Addition and multiplication can be defined by the following rules:

This equivalence relation is a congruence relation, which means that it is compatible with the addition and multiplication defined above; the set of rational numbers Q is the defined as the quotient set by this equivalence relation, (Z × (Z \ {0})) / ~, equipped with the addition and the multiplication induced by the above operations. (This construction can be carried out with any integral domain and produces its field of fractions.)

The equivalence class of a pair (m, n) is denoted . Two pairs (m1, n1) and (m2, n2) belong to the same equivalence class (that is are equivalent) if and only if m1n2 = m2n1. This means that if and only m1n2 = m2n1.

Every equivalence class may be represented by infinitely many pairs, since

Each equivalence class contains a unique canonical representative element. The canonical representative is the unique pair (m, n) in the equivalence class such that m and n are coprime, and n > 0. It is called the representation in lowest terms of the rational number.

The integers may be considered to be rational numbers identifying the integer n with the rational number .

A total order may be defined on the rational numbers, that extends the natural order of the integers. One has

if

Properties

Illustration of the countability of the positive rationals

The set Q of all rational numbers, together with the addition and multiplication operations shown above, forms a field.

Q has no field automorphism other than the identity.

With the order defined above, Q is an ordered field that has no subfield other than itself, and is the smallest ordered field, in the sense that every ordered field contains a unique subfield isomorphic to Q.

Q is a prime field, which is a field that has no subfield other than itself. The rationals are the smallest field with characteristic zero. Every field of characteristic zero contains a unique subfield isomorphic to Q.

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

The set of all rational numbers is countable (see the figure), while the set of all real numbers (as well as the set of irrational numbers) is uncountable. Being countable, the set of rational numbers is a null set, that is, almost all real numbers are irrational, in the sense of Lebesgue measure.

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

(where are positive), we have

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

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) = |xy|, 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) = |xy| above.

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 = pn, where pn is the highest power of p dividing a.

In addition set |0|p = 0. For any rational number , we set .

Then dp(x, y) = |xy|p defines a metric on Q.

The metric space (Q, dp) is not complete, and its completion is the p-adic number field Qp. 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.

Irrational number

The number is irrational.

In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers which are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length ("the measure"), no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

Among irrational numbers are the ratio of a circle's circumference to its diameter, Euler's number e, the golden ratio φ, and the square root of two. In fact, all square roots of natural numbers, other than of perfect squares, are irrational.

Like all real numbers, irrational numbers can be expressed in positional notation, notably as a decimal number. In the case of irrational numbers, the decimal expansion does not terminate, nor end with a repeating sequence. For example, the decimal representation of starts with 3.14159, but no finite number of digits can represent exactly, nor does it repeat. Conversely, a decimal expansion that terminates or repeats must be a rational number. These are provable properties of rational numbers and positional number systems, and are not used as definitions in mathematics.

Irrational numbers can also be expressed as non-terminating continued fractions and many other ways.

As a consequence of Cantor's proof that the real numbers are uncountable and the rationals countable, it follows that almost all real numbers are irrational.

Examples

Square roots

The square root of 2 was the first number proved irrational, and that article contains a number of proofs. The golden ratio is another famous quadratic irrational number. The square roots of all natural numbers which are not perfect squares are irrational and a proof may be found in quadratic irrationals.

General roots

The proof above for the square root of two can be generalized using the fundamental theorem of arithmetic. This asserts that every integer has a unique factorization into primes. Using it we can show that if a rational number is not an integer then no integral power of it can be an integer, as in lowest terms there must be a prime in the denominator that does not divide into the numerator whatever power each is raised to. Therefore, if an integer is not an exact kth power of another integer, then that first integer's kth root is irrational.

Logarithms

Perhaps the numbers most easy to prove irrational are certain logarithms. Here is a proof by contradiction that log2 3 is irrational (log2 3 ≈ 1.58 > 0).

Assume log2 3 is rational. For some positive integers m and n, we have

It follows that

However, the number 2 raised to any positive integer power must be even (because it is divisible by 2) and the number 3 raised to any positive integer power must be odd (since none of its prime factors will be 2). Clearly, an integer cannot be both odd and even at the same time: we have a contradiction. The only assumption we made was that log2 3 is rational (and so expressible as a quotient of integers m/n with n ≠ 0). The contradiction means that this assumption must be false, i.e. log2 3 is irrational, and can never be expressed as a quotient of integers m/n with n ≠ 0.

Cases such as log10 2 can be treated similarly.

Types

  • number theoretic distinction : transcendental/algebraic
  • normal/ abnormal (non-normal)

Transcendental/algebraic

Almost all irrational numbers are transcendental and all real transcendental numbers are irrational (there are also complex transcendental numbers): the article on transcendental numbers lists several examples. So e r and π r are irrational for all nonzero rational r, and, e.g., eπ is irrational, too.

Irrational numbers can also be found within the countable set of real algebraic numbers (essentially defined as the real roots of polynomials with integer coefficients), i.e., as real solutions of polynomial equations

where the coefficients are integers and . Any rational root of this polynomial equation must be of the form r /s, where r is a divisor of a0 and s is a divisor of an. If a real root of a polynomial is not among these finitely many possibilities, it must be an irrational algebraic number. An exemplary proof for the existence of such algebraic irrationals is by showing that x0  = (21/2 + 1)1/3 is an irrational root of a polynomial with integer coefficients: it satisfies (x3 − 1)2 = 2 and hence x6 − 2x3 − 1 = 0, and this latter polynomial has no rational roots (the only candidates to check are ±1, and x0, being greater than 1, is neither of these), so x0 is an irrational algebraic number.

Because the algebraic numbers form a subfield of the real numbers, many irrational real numbers can be constructed by combining transcendental and algebraic numbers. For example, , and are irrational (and even transcendental).

Decimal expansions

The decimal expansion of an irrational number never repeats or terminates (the latter being equivalent to repeating zeroes), unlike any rational number. The same is true for binary, octal or hexadecimal expansions, and in general for expansions in every positional notation with natural bases.

To show this, suppose we divide integers n by m (where m is nonzero). When long division is applied to the division of n by m, only m remainders are possible. If 0 appears as a remainder, the decimal expansion terminates. If 0 never occurs, then the algorithm can run at most m − 1 steps without using any remainder more than once. After that, a remainder must recur, and then the decimal expansion repeats.

Conversely, suppose we are faced with a repeating decimal, we can prove that it is a fraction of two integers. For example, consider:

Here the repetend is 162 and the length of the repetend is 3. First, we multiply by an appropriate power of 10 to move the decimal point to the right so that it is just in front of a repetend. In this example we would multiply by 10 to obtain:

Now we multiply this equation by 10r where r is the length of the repetend. This has the effect of moving the decimal point to be in front of the "next" repetend. In our example, multiply by 103:

The result of the two multiplications gives two different expressions with exactly the same "decimal portion", that is, the tail end of 10,000A matches the tail end of 10A exactly. Here, both 10,000A and 10A have .162 162 162 ... after the decimal point.

Therefore, when we subtract the 10A equation from the 10,000A equation, the tail end of 10A cancels out the tail end of 10,000A leaving us with:

Then

is a ratio of integers and therefore a rational number.

Irrational powers

Dov Jarden gave a simple non-constructive proof that there exist two irrational numbers a and b, such that ab is rational:

Consider ; if this is rational, then take a = b = . Otherwise, take a to be the irrational number and b = . Then , which is rational.

Although the above argument does not decide between the two cases, the Gelfond–Schneider theorem shows that \sqrt{2}^\sqrt{2} is transcendental, hence irrational. This theorem states that if a and b are both algebraic numbers, and a is not equal to 0 or 1, and b is not a rational number, then any value of ab is a transcendental number (there can be more than one value if complex number exponentiation is used).

An example that provides a simple constructive proof is

The base of the left side is irrational and the right side is rational, so one must prove that the exponent on the left side, , is irrational. This is so because, by the formula relating logarithms with different bases,

which we can assume, for the sake of establishing a contradiction, equals a ratio m/n of positive integers. Then hence hence hence , which is a contradictory pair of prime factorizations and hence violates the fundamental theorem of arithmetic (unique prime factorization).

A stronger result is the following: Every rational number in the interval can be written either as aa for some irrational number a or as nn for some natural number n. Similarly, every positive rational number can be written either as for some irrational number a or as for some natural number n.

Open questions

It is not known if (or ) is irrational. In fact, there is no pair of non-zero integers for which it is known whether is irrational. Moreover, it is not known if the set is algebraically independent over .

It is not known if Catalan's constant, or the Euler–Mascheroni constant are irrational. It is not known if either of the tetrations or is rational for some integer {

Set of all irrationals

Since the reals form an uncountable set, of which the rationals are a countable subset, the complementary set of irrationals is uncountable.

Under the usual (Euclidean) distance function d(xy) = |x − y|, the real numbers are a metric space and hence also a topological space. Restricting the Euclidean distance function gives the irrationals the structure of a metric space. Since the subspace of irrationals is not closed, the induced metric is not complete. However, being a G-delta set—i.e., a countable intersection of open subsets—in a complete metric space, the space of irrationals is completely metrizable: that is, there is a metric on the irrationals inducing the same topology as the restriction of the Euclidean metric, but with respect to which the irrationals are complete. One can see this without knowing the aforementioned fact about G-delta sets: the continued fraction expansion of an irrational number defines a homeomorphism from the space of irrationals to the space of all sequences of positive integers, which is easily seen to be completely metrizable.

Furthermore, the set of all irrationals is a disconnected metrizable space. In fact, the irrationals equipped with the subspace topology have a basis of clopen sets so the space is zero-dimensional.

Licensing

Content obtained and/or adapted from: