Irrational numbers
Irrational numbers are numbers that cannot be expressed, such as a fraction \frac{m}{n}, where m, n \in\mathbb{Z} and n\not = 0
This property is fulfilled by the real numbers that are not rational
An infinite decimal place (i.e. with infinite figures) aperiodic, as \sqrt{7} = 2,645751311064591 can not be represented as a rational number
Such numbers are called irrational numbers
This designation means the impossibility of represent that number as a ratio of two whole numbers
Are denoted as \mathbb{I}
Irrational numbers most well-known
- Pi number:
reason between the length of a circumference and its diameter, \pi\approx 3,14159\cdots - Euler Number:
e=\lim\limits_{n\to\infty}\left(1+{\frac {1}{n}}\right)^{n}\approx 2,7182\cdots - Aureum number:
\Phi={\frac {1+{\sqrt {5}}}{2}}\approx 1,6180\cdots
Demonstration: Root of 2 is irrational
The value that verifies d^2=2 it is denoted by \sqrt{2} and it is a real number
Consider the set: S=\{x\in\mathbb{R}|x\geq 0, x^2 \leq 2\}
Set S is non empty (1 \in S) and is superiorly bound, as x\in S, x^2\leq 2 < 4 = 2^2, then x < 2
As a non empty set dimensioned above, we will have for the axiom of completeness, which S possesses supreme, that supreme we will denote by v. It cannot happen that v^2 > 2 or v^2 < 2 and, therefore, you have to v^2 = 2; that is, it will be the value we have denoted as \sqrt{2}
Suppose that v^2 > 2, then taking h=min\{v,\frac{(v^2 - 2)}{2\cdot v}\} it would have h > 0, v-h \geq 0 and (v-h)^2=v^2+2\cdot h \cdot v + h^2 \leq v^2 +2\cdot h \cdot v +h \cdot v = v^2 + 3 \cdot h \cdot v \leq v^2 + (2-v^2)=2, that is, v+h\in S
But this is not possible, because v+h > v and change \forall x \in S you have to x \leq v. So, \sqrt{2} it is an irrational number
Gauss's motto
Gauss's motto was published in article 42 of the Disquisitiones Arithmeticae (1801) and says:
Each real root of a polynomial monico with integral coefficients is integer or irrational
Demonstration of Gauss's motto
Be r a real root of the monican polynomial: P(x)=x^n+c_{n-1}\cdot x^{n-1}+\cdots + c_0 where n is a positive integer, and c_0,\cdots,c_{n-1} are integers and suppose that r is rational but not integer
Then there exists a unique integer q such that q < r < q+1. Since r is rational, so will r^2, \cdots, r^{n-1}
Therefore, the set: M=\{m>0| m, m\cdot r, m\cdot r^2, \cdots, m\cdot r^{n-1}\text{ they are integers}\} possesses an element and is not empty
Considering that r is the root of P(x), the identity will be fulfilled: r^n=-(c_{n-1}\cdot r^{n-1}+\cdots +c_0) and in addition \forall m \in M, m(c_{n-1}\cdot r^{n-1}+\cdots +c_0) is an integer, and therefore, m\cdot r^n it is also an integer
Let's look for a contradiction with the principle of good sorting of natural numbers, thus proving that set M has no minimum element; I mean: \forall m \in M, \exists m'\in M \Rightarrow 0 < m' < m
We consider m\in M and we take m'=(r-q)\cdot m. So we have to for every i=0,1,2,\cdots, n-1 we have to m'\cdot r^i=m\cdot r^{i+1}-q\cdot m^i, then it's an integer and it's true that m'\in M and 0 < m' < m because 0 < r-q < 1
Then M can not have an item minimum, and the root r must be integer or irrational