An algebraic number is a complex number satisfying a nonzero polynomial equation with coefficients in the rational numbers, or equivalently with coefficients in the integers after clearing denominators. For instance, satisfies and satisfies . Every rational number is algebraic, since vanishes at it.[ref]
The monic irreducible polynomial over that vanishes at an algebraic number is its minimal polynomial; its degree measures the number of independent rational coordinates needed in the simple field extension it generates. Thus has basis . An algebraic integer has the stronger requirement of satisfying a monic polynomial with coefficients in the integers: is algebraic but is not an algebraic integer.
The degree of an algebraic number is the degree of a polynomial of its minimal polynomial of an algebraic element over . Equivalently, it is the field extension degree . If that degree is , then form a basis over the rational numbers: higher powers reduce using the minimal polynomial of an algebraic element, while a dependence among these first powers would contradict minimality.[ref]
For , the irreducible polynomial gives degree two and expressions . For , the polynomial is irreducible over because a reducible cubic would have a rational root of a polynomial, which the rational root theorem excludes. Its degree is three. Merely finding a polynomial equation gives an upper bound: also satisfies , but its degree is still two.
The complex algebraic numbers form a field, the algebraic closure of inside . To see closure under the field operations, if are algebraic numbers, the tower law makes a finite-dimensional field extension of . Every element of this extension is an algebraic element, because its successive powers are linearly dependent. In particular it contains , and when .
It is an infinite-degree algebraic extension. A primitive th root of unity has minimal polynomial of an algebraic element of degree for every prime , so the degrees of its finite subextensions are unbounded. Finally a complex root of a polynomial whose coefficients are algebraic numbers is itself algebraic over their finite-degree coefficient field and hence over , again by the tower law. Thus every such polynomial splits in this field, establishing the algebraic closure assertion.
A quadratic irrational number is a real irrational root of a quadratic polynomial with integer coefficients.
For a positive nonsquare integer and positive integers , the integer is nonzero. Therefore . If , the denominator factor is at most ; otherwise the approximation error already exceeds one. This proves that a quadratic irrational of this form is a badly approximable number. For , splitting instead at gives the strict bound .
// Target: analytic-number-theory.bigb
The golden ratio is the positive number
which satisfies and .
The polynomials over the integers form a countable set, because they are finite lists of integers. Every nonzero polynomial has finitely many polynomial roots, by the Lagrange root bound over a field. Each algebraic number is a polynomial root of one of these nonzero polynomials over the integers, so the algebraic numbers form a countable union of finite sets and are countable. They are infinite because they contain all integers. Excluding the zero polynomial is essential to the root-counting step.

Ancestors (4)

  1. Algebra
  2. Area of mathematics
  3. Mathematics
  4. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)