Algebraic number
Template:Short description Template:Distinguish Template:Use shortened footnotes
In mathematics, an algebraic number is a number that is a root of a non-zero polynomial in one variable with integer (or, equivalently, rational) coefficients. For example, the golden ratio <math>(1 + \sqrt{5})/2</math> is an algebraic number, because it is a root of the polynomial <math>x^2 - x - 1</math>, i.e., a solution to the equation <math>x^2 - x - 1 = 0</math>, and the complex number <math>1 + i</math> is algebraic because it is a root of the polynomial <math>x^4 + 4</math>. Algebraic numbers include all integers, rational numbers, and n-th roots of integers.
Algebraic complex numbers are closed under addition, subtraction, multiplication and division, and hence form a field, denoted <math>\overline{\Q}</math>. The set of algebraic real numbers <math>\overline{\Q} \cap \R</math> is also a field.
Numbers which are not algebraic are called transcendental and include [[pi|Template:Pi]] and Template:Mvar. There are countably infinite algebraic numbers, hence almost all real (or complex) numbers (in the sense of Lebesgue measure) are transcendental.
Examples
- All rational numbers are algebraic. Any rational number, expressed as the quotient of an integer Template:Mvar and a (non-zero) natural number Template:Mvar, satisfies the above definition, because Template:Math is the root of a non-zero polynomial, namely Template:Math.<ref>Some of the following examples come from Template:Harvtxt</ref>
- Quadratic irrational numbers, irrational solutions of a quadratic polynomial Template:Math with integer coefficients Template:Mvar, Template:Mvar, and Template:Mvar, are algebraic numbers. If the quadratic polynomial is monic (Template:Math), the roots are further qualified as quadratic integers.
- Gaussian integers, complex numbers Template:Math for which both Template:Mvar and Template:Mvar are integers, are also quadratic integers. This is because Template:Math and Template:Math are the two roots of the quadratic Template:Math.
- A constructible number can be constructed from a given unit length using a straightedge and compass. It includes all quadratic irrational roots, all rational numbers, and all numbers that can be formed from these using the basic arithmetic operations and the extraction of square roots. (By designating cardinal directions for +1, −1, +Template:Mvar, and −Template:Mvar, complex numbers such as <math>3+i \sqrt{2}</math> are considered constructible.)
- Any expression formed from algebraic numbers using any finite combination of the basic arithmetic operations and extraction of [[nth root|Template:Mvarth roots]] gives another algebraic number.
- Polynomial roots that cannot be expressed in terms of the basic arithmetic operations and extraction of Template:Mvarth roots (such as the roots of Template:Math). That happens with many but not all polynomials of degree 5 or higher.
- Values of trigonometric functions of rational multiples of Template:Pi (except when undefined): for example, Template:Math, Template:Math, and Template:Math satisfy Template:Math. This polynomial is irreducible over the rationals and so the three cosines are conjugate algebraic numbers. Likewise, Template:Math, Template:Math, Template:Math, and Template:Math satisfy the irreducible polynomial Template:Math, and so are conjugate algebraic integers. This is the equivalent of angles which, when measured in degrees, have rational numbers.Template:Sfn
- Some but not all irrational numbers are algebraic:
- The numbers <math>\sqrt{2}</math> and <math>\frac{ \sqrt[3]{3} }{ 2 }</math> are algebraic since they are roots of polynomials Template:Math and Template:Math, respectively.
- The golden ratio Template:Mvar is algebraic since it is a root of the polynomial Template:Math.
- The numbers [[pi|Template:Pi]] and e are not algebraic numbers (see the Lindemann–Weierstrass theorem).<ref>Also, Liouville's theorem can be used to "produce as many examples of transcendental numbers as we please," cf. Template:Harvtxt</ref>
Properties
- If a polynomial with rational coefficients is multiplied through by the least common denominator, the resulting polynomial with integer coefficients has the same roots. This shows that an algebraic number can be equivalently defined as a root of a polynomial with either integer or rational coefficients.
- Given an algebraic number, there is a unique monic polynomial with rational coefficients of least degree that has the number as a root. This polynomial is called its minimal polynomial. If its minimal polynomial has degree Template:Mvar, then the algebraic number is said to be of degree Template:Mvar. For example, all rational numbers have degree 1, and an algebraic number of degree 2 is a quadratic irrational.
- The algebraic numbers are dense in the reals. This follows from the fact they contain the rational numbers, which are dense in the reals themselves.
- The set of algebraic numbers is countable,Template:SfnTemplate:Sfn and therefore its Lebesgue measure as a subset of the complex numbers is 0 (essentially, the algebraic numbers take up no space in the complex numbers). That is to say, "almost all" real and complex numbers are transcendental.
- All algebraic numbers are computable and therefore definable and arithmetical.
- For real numbers Template:Math and Template:Math, the complex number Template:Math is algebraic if and only if both Template:Math and Template:Math are algebraic.Template:Sfn
Degree of simple extensions of the rationals as a criterion to algebraicity
For any Template:Tmath, the simple extension of the rationals by Template:Tmath, denoted by <math>\Q(\alpha)</math> (whose elements are the <math>f(\alpha)</math> for <math>f</math> a rational function with rational coefficients which is defined at <math>\alpha</math>), is of finite degree if and only if Template:Tmath is an algebraic number.
The condition of finite degree means that there is a fixed set of numbers <math>\{a_i\}</math> of finite cardinality Template:Tmath with elements in <math>\Q(\alpha)</math> such that <math>\textstyle \Q(\alpha) = \sum_{i=1}^k a_i \Q</math>; that is, each element of <math>\Q(\alpha)</math> can be written as a sum <math>\textstyle \sum_{i=1}^k a_i q_i</math> for some rational coefficients <math>\{q_i \}</math>.
Since the <math>a_i</math> are themselves members of <math>\Q(\alpha)</math>, each can be expressed as sums of products of rational numbers and powers of Template:Tmath, and therefore this condition is equivalent to the requirement that for some finite <math>n</math>, <math display=block>\Q(\alpha) = \biggl\lbrace \sum_{i=-n}^n \alpha^{i} q_i \mathbin{\bigg|} q_i\in \Q\biggr\rbrace.</math>
The latter condition is equivalent to <math>\alpha^{n+1}</math>, itself a member of <math>\Q(\alpha)</math>, being expressible as <math>\textstyle \sum_{i=-n}^n \alpha^i q_i</math> for some rationals <math>\{q_i\}</math>, so <math>\textstyle \alpha^{2n+1} = \sum_{i=0}^{2n} \alpha^i q_{i-n}</math> or, equivalently, Template:Tmath is a root of <math>\textstyle x^{2n+1}-\sum_{i=0}^{2n} x^i q_{i-n}</math>; that is, an algebraic number with a minimal polynomial of degree not larger than <math>2n+1</math>.
It can similarly be proven that for any finite set of algebraic numbers <math>\alpha_1</math>, <math>\alpha_2</math>... <math>\alpha_n</math>, the field extension <math>\Q(\alpha_1, \alpha_2, ... \alpha_n)</math> has a finite degree.
Field
The sum, difference, product, and quotient (if the denominator is nonzero) of two algebraic numbers is again algebraic:
For any two algebraic numbers Template:Tmath, Template:Tmath, this follows directly from the fact that the simple extension <math>\Q(\gamma)</math>, for <math>\gamma</math> being either <math>\alpha+\beta</math>, <math>\alpha-\beta</math>, <math>\alpha\beta</math> or (for <math>\beta\ne 0</math>) <math>\alpha/\beta</math>, is a linear subspace of the finite-degree field extension <math>\Q(\alpha,\beta)</math>, and therefore has a finite degree itself, from which it follows (as shown above) that <math>\gamma</math> is algebraic.
An alternative way of showing this is constructively, by using the resultant.
Algebraic numbers thus form a fieldTemplate:Sfn <math>\overline{\mathbb{Q}}</math> (sometimes denoted by <math>\mathbb A</math>, but that usually denotes the adele ring).
Algebraic closure
Every root of a polynomial equation whose coefficients are algebraic numbers is again algebraic. That can be rephrased by saying that the field of algebraic numbers is algebraically closed. In fact, it is the smallest algebraically closed field containing the rationals and so it is called the algebraic closure of the rationals.
That the field of algebraic numbers is algebraically closed can be proven as follows: Let Template:Tmath be a root of a polynomial <math> \alpha_0 + \alpha_1 x + \alpha_2 x^2 ... +\alpha_n x^n</math> with coefficients that are algebraic numbers <math>\alpha_0</math>, <math>\alpha_1</math>, <math>\alpha_2</math>... <math>\alpha_n</math>. The field extension <math>\Q^\prime \equiv \Q(\alpha_1, \alpha_2, ... \alpha_n)</math> then has a finite degree with respect to <math>\Q</math>. The simple extension <math>\Q^\prime(\beta)</math> then has a finite degree with respect to <math>\Q^\prime</math> (since all powers of Template:Tmath can be expressed by powers of up to <math>\beta^{n-1}</math>). Therefore, <math>\Q^\prime(\beta) = \Q(\beta, \alpha_1, \alpha_2, ... \alpha_n)</math> also has a finite degree with respect to <math>\Q</math>. Since <math>\Q(\beta)</math> is a linear subspace of <math>\Q^\prime(\beta)</math>, it must also have a finite degree with respect to <math>\Q</math>, so Template:Tmath must be an algebraic number.
Related fields
Numbers defined by radicals
Any number that can be obtained from the integers using a finite number of additions, subtractions, multiplications, divisions, and taking (possibly complex) Template:Mvarth roots where Template:Mvar is a positive integer are algebraic. The converse, however, is not true: there are algebraic numbers that cannot be obtained in this manner. These numbers are roots of polynomials of degree 5 or higher, a result of Galois theory (see Quintic equations and the Abel–Ruffini theorem). For example, the equation:
- <math>x^5-x-1=0</math>
has a unique real root, ≈ 1.1673, that cannot be expressed in terms of only radicals and arithmetic operations.
Closed-form number
Template:Main Algebraic numbers are all numbers that can be defined explicitly or implicitly in terms of polynomials, starting from the rational numbers. One may generalize this to "closed-form numbers", which may be defined in various ways. Most broadly, all numbers that can be defined explicitly or implicitly in terms of polynomials, exponentials, and logarithms are called "elementary numbers", and these include the algebraic numbers, plus some transcendental numbers. Most narrowly, one may consider numbers explicitly defined in terms of polynomials, exponentials, and logarithms – this does not include all algebraic numbers, but does include some simple transcendental numbers such as Template:Mvar or ln 2.
Algebraic integers
Template:Main An algebraic integer is an algebraic number that is a root of a polynomial with integer coefficients with leading coefficient 1 (a monic polynomial). Examples of algebraic integers are <math>5 + 13 \sqrt{2},</math> <math>2 - 6i,</math> and <math display=inline>\frac{1}{2}(1+i\sqrt{3}).</math> Therefore, the algebraic integers constitute a proper superset of the integers, as the latter are the roots of monic polynomials Template:Math for all <math>k \in \mathbb{Z}</math>. In this sense, algebraic integers are to algebraic numbers what integers are to rational numbers.
The sum, difference and product of algebraic integers are again algebraic integers, which means that the algebraic integers form a ring. The name algebraic integer comes from the fact that the only rational numbers that are algebraic integers are the integers, and because the algebraic integers in any number field are in many ways analogous to the integers. If Template:Math is a number field, its ring of integers is the subring of algebraic integers in Template:Math, and is frequently denoted as Template:Math. These are the prototypical examples of Dedekind domains.
Special classes
- Algebraic solution
- Gaussian integer
- Eisenstein integer
- Quadratic irrational number
- Fundamental unit
- Root of unity
- Gaussian period
- Pisot–Vijayaraghavan number
- Salem number
Notes
References
- Template:Citation
- Template:Citation
- Template:Citation
- Template:Citation
- Template:Citation
- Template:Citation
- Template:Citation
Template:Algebraic numbers Template:Number systems Template:Authority control