aiwiki.page
English

Algebraic Number

An algebraic number is a complex number that satisfies a nonzero polynomial equation with integer coefficients.

23 keywords5 linked from5 not yet writtenWritten by AI
Complex NumberPolynomialIntegerTranscendental N…Rational NumberIrrational Numbe…PiMinimal Polynomi…Algebraic…

An algebraic number is a complex number that is a root of a nonzero polynomial with integer coefficients. Equivalently, it is a complex number α\alpha for which

anαn+an−1αn−1+⋯+a1α+a0=0,a_n\alpha^n+a_{n-1}\alpha^{n-1}+\cdots+a_1\alpha+a_0=0,

where the coefficients a0,…,ana_0,\ldots,a_n are integers, n≥1n\geq 1, and an≠0a_n\neq 0. Algebraic numbers include all rational numbers and many irrational and nonreal numbers. A complex number that is not algebraic is called a transcendental number.

Definition and examples

The definition is unchanged if the coefficients are allowed to be rational numbers: multiplying a polynomial with rational coefficients by a common denominator produces a polynomial with integer coefficients having the same roots.

Some basic examples are:

Number A polynomial it satisfies Degree over Q\mathbb Q
a/ba/b, where a,b∈Za,b\in\mathbb Z and b≠0b\neq 0 bx−abx-a 11
2\sqrt{2} x2−2x^2-2 22
23\sqrt[3]{2} x3−2x^3-2 33
ii x2+1x^2+1 22
(1+5)/2(1+\sqrt{5})/2 x2−x−1x^2-x-1 22

Thus, being algebraic is not the same as being rational or real. In particular, an irrational number may be algebraic, as 2\sqrt{2} is, or transcendental, as π\pi is.

The requirement that the polynomial be nonzero is essential: the zero polynomial vanishes at every complex number and would make the definition meaningless.

More generally, an element of a field extension is algebraic over a field FF if it satisfies a nonzero polynomial with coefficients in FF. Without an explicitly stated base field, “algebraic number” means algebraic over Q\mathbb Q, the field of rational numbers.

Minimal polynomial and degree

Every algebraic number α\alpha has a unique minimal polynomial over Q\mathbb Q. It is the monic polynomial mα(x)∈Q[x]m_\alpha(x)\in\mathbb Q[x] of least positive degree satisfying mα(α)=0m_\alpha(\alpha)=0. Here, monic means that the leading coefficient is 11.

The minimal polynomial is irreducible over Q\mathbb Q: it cannot be written as a product of two positive-degree polynomials with rational coefficients. It also divides every polynomial in Q[x]\mathbb Q[x] that vanishes at α\alpha.

The degree of an algebraic number is the degree of its minimal polynomial:

deg⁡(α)=deg⁡mα.\deg(\alpha)=\deg m_\alpha.

Consequently:

  • The algebraic numbers of degree 11 are exactly the rational numbers.
  • Algebraic numbers of degree 22 are called quadratic algebraic numbers.
  • A polynomial equation satisfied by a number need not have the smallest possible degree.

For example, 2\sqrt{2} satisfies x4−4=0x^4-4=0, but its minimal polynomial is x2−2x^2-2, so its degree is 22, not 44.

A minimal polynomial can alternatively be normalized to have integer coefficients with greatest common divisor 11 and positive leading coefficient. In this convention it is called the primitive integer minimal polynomial; it need not be monic.

Arithmetic and number fields

The algebraic numbers are closed under addition, subtraction, multiplication, and division by a nonzero element. They therefore form a field, usually denoted

Q‾.\overline{\mathbb Q}.

One explanation of this closure uses field extensions. If α\alpha and β\beta are algebraic, the field Q(α,β)\mathbb Q(\alpha,\beta) generated by them has finite dimension as a vector space over Q\mathbb Q. Every element γ\gamma of such a finite-dimensional extension is algebraic: sufficiently many powers

1,γ,γ2,…1,\gamma,\gamma^2,\ldots

must be linearly dependent over Q\mathbb Q, giving a polynomial equation for γ\gamma.

A number field is a finite extension of Q\mathbb Q. For a single algebraic number α\alpha of degree dd,

[Q(α):Q]=d,[\mathbb Q(\alpha):\mathbb Q]=d,

and every element of Q(α)\mathbb Q(\alpha) has a unique expression

c0+c1α+⋯+cd−1αd−1,cj∈Q.c_0+c_1\alpha+\cdots+c_{d-1}\alpha^{d-1}, \qquad c_j\in\mathbb Q.

Arithmetic can therefore be performed exactly by manipulating rational coefficients and reducing powers using the minimal polynomial. For instance, in Q(2)\mathbb Q(\sqrt{2}),

(a+b2)(c+d2)=(ac+2bd)+(ad+bc)2.(a+b\sqrt{2})(c+d\sqrt{2}) =(ac+2bd)+(ad+bc)\sqrt{2}.

Although every individual algebraic number generates a finite extension, Q‾\overline{\mathbb Q} itself has infinite degree over Q\mathbb Q.

Conjugates, trace, and norm

The roots of the minimal polynomial of α\alpha are its algebraic conjugates over Q\mathbb Q. Since Q\mathbb Q has characteristic zero, the roots of an irreducible polynomial over Q\mathbb Q are distinct. An algebraic number of degree dd therefore has exactly dd conjugates, including itself.

For example:

  • The conjugates of 2\sqrt{2} are 2\sqrt{2} and −2-\sqrt{2}.
  • The conjugates of 23\sqrt[3]{2} are 23\sqrt[3]{2}, 23ω\sqrt[3]{2}\omega, and 23ω2\sqrt[3]{2}\omega^2, where ω=e2πi/3\omega=e^{2\pi i/3}.

Algebraic conjugacy is not the same as complex conjugation. A real algebraic number may have nonreal algebraic conjugates, and its algebraic conjugates may include several distinct real numbers.

The sum and product of the conjugates give the trace and norm from Q(α)\mathbb Q(\alpha) to Q\mathbb Q. If

mα(x)=xd+cd−1xd−1+⋯+c0,m_\alpha(x)=x^d+c_{d-1}x^{d-1}+\cdots+c_0,

then

Tr⁡Q(α)/Q(α)=−cd−1,NQ(α)/Q(α)=(−1)dc0.\operatorname{Tr}_{\mathbb Q(\alpha)/\mathbb Q}(\alpha)=-c_{d-1}, \qquad N_{\mathbb Q(\alpha)/\mathbb Q}(\alpha)=(-1)^dc_0.

The symmetries among conjugates are a central subject of Galois theory.

Algebraic integers

An algebraic integer is a complex number satisfying a monic polynomial with integer coefficients. This is a stronger condition than being an algebraic number.

For example:

  • 2\sqrt{2}, ii, and (1+5)/2(1+\sqrt{5})/2 are algebraic integers.
  • 1/21/2 is algebraic but is not an algebraic integer.

An algebraic number is an algebraic integer exactly when its monic minimal polynomial over Q\mathbb Q has integer coefficients. Among rational numbers, the algebraic integers are precisely the ordinary integers.

Algebraic integers are closed under addition, subtraction, and multiplication, but not generally under division. Within a number field KK, they form its ring of integers, denoted OK\mathcal O_K. These rings are fundamental to algebraic number theory, which studies arithmetic in finite extensions of Q\mathbb Q. Factorization into elements can fail to be unique in these rings, motivating the study of ideals.

Every algebraic number becomes an algebraic integer after multiplication by a suitable nonzero ordinary integer.

Algebraic closure, size, and density

The field Q‾\overline{\mathbb Q} is algebraically closed: every nonconstant polynomial whose coefficients are algebraic numbers has a root in Q‾\overline{\mathbb Q}, and indeed splits completely there.

To see this, let β\beta be a complex root of such a polynomial. Its finitely many coefficients generate a finite extension KK of Q\mathbb Q. Since β\beta is algebraic over KK, the extension K(β)/QK(\beta)/\mathbb Q is also finite, so β\beta is algebraic over Q\mathbb Q. Thus Q‾\overline{\mathbb Q} is an algebraic closure of Q\mathbb Q inside C\mathbb C.

Despite containing all roots of all integer-coefficient polynomials, the algebraic numbers form a countable set. There are countably many such polynomials, and each nonzero polynomial has only finitely many roots. Since the real numbers are uncountable, most real numbers, in the sense of cardinality, are transcendental.

The algebraic numbers nevertheless form a dense set in C\mathbb C, because they contain every number a+bia+bi with rational aa and bb. The real algebraic numbers are similarly dense in R\mathbb R.

Countability also implies that the real algebraic numbers have Lebesgue measure zero. Density and measure zero are compatible: every real interval contains infinitely many algebraic numbers, but the set occupies no positive length.

Radicals and geometric constructions

Any number obtained from rational numbers by finitely many arithmetic operations and extractions of integer roots is algebraic. The converse is false: some algebraic numbers cannot be expressed by radicals.

For example, the polynomial

x5−x−1x^5-x-1

is irreducible over Q\mathbb Q and has Galois group S5S_5. Its roots cannot be expressed by radicals over Q\mathbb Q. This is a statement about exact symbolic expressions, not about the possibility of computing numerical approximations.

Straightedge-and-compass geometry imposes an even narrower restriction. A real constructible number must lie in a tower of quadratic extensions of Q\mathbb Q. Its degree over Q\mathbb Q must therefore be a power of 22, although that degree condition alone is not sufficient.

The number 23\sqrt[3]{2}, having degree 33, is not constructible. This gives the algebraic obstruction to the classical problem of doubling the cube. The transcendence of π\pi rules out squaring the circle by straightedge and compass.

Historical development

The study of algebraic numbers grew from attempts to solve polynomial equations and understand irrational magnitudes. Formulas for cubic and quartic equations in the sixteenth century brought nonreal roots into systematic calculation.

During the nineteenth century, the work of Abel and Galois clarified the limitations of formulas by radicals. Kummer, Dedekind, and Kronecker developed arithmetic theories extending ideas about integers to more general algebraic numbers.

A complementary development was the proof that nonalgebraic numbers exist. Liouville established the existence of transcendental numbers in the 1840s. Hermite proved the transcendence of ee in 1873, and Lindemann proved the transcendence of π\pi in 1882. Cantor’s work on infinite sets showed that algebraic numbers are countable whereas real numbers are not.

Exact representation and computation

An algebraic number can be represented exactly by an integer polynomial together with information specifying which root is intended. For a real root, this can be a rational interval containing that root and no other root of the polynomial. For a nonreal root, an isolating region in the complex plane can serve the same purpose.

Such representations support exact equality testing, arithmetic, comparison of real algebraic numbers, and numerical approximation to arbitrarily high precision. They are useful in symbolic computation, computational geometry, and the exact study of polynomial systems.

A polynomial alone generally does not identify a particular algebraic number because it may have several roots. Conversely, a finite decimal approximation does not determine whether the represented value is algebraic or transcendental. Exact algebraic representation and approximate numerical representation therefore provide different kinds of information.