Algebraic and Transcendental Elements

Consider the number 2+3\sqrt{2} + \sqrt{3}. Is there a polynomial with rational coefficients that vanishes at this number? A little algebra shows the answer is yes. It is a root of x4−10x2+1x^4 - 10x^2 + 1. Now ask the same question of π\pi. No such polynomial exists. This fact was proved by Lindemann in 1882. Its proof is one of the deep theorems of analysis. This contrast is between two kinds of numbers. Some satisfy a polynomial equation over a field. Others satisfy none. This distinction is the starting point of field theory. The distinction matters because it splits every field extension into two fundamentally different kinds of behavior. Elements satisfying a polynomial relation can be studied by purely algebraic means. Their minimal polynomials, degrees, and conjugates give a finite combinatorial handle on otherwise mysterious objects. Elements satisfying no polynomial relation behave differently. From the point of view of the base field, they act exactly like an independent variable. The field they generate is a field of rational functions in one indeterminate. Recognizing which situation you are in is the first move. It matters in almost every argument about field extensions. The big picture is this: a field extension K/FK/F is built from atoms. Each atom is either algebraic (governed by a single polynomial equation) or transcendental (governed by no equation at all, hence "free"). Classical results rest on this distinction. These include the impossibility of squaring the circle, the transcendence of ee and π\pi, the structure of finite fields, and the very existence of splitting fields. All of them rest on being able to say precisely which elements are algebraic and which are not. They also rest on being able to produce, for each algebraic element, the unique polynomial of least degree that kills it. This article gives the formal definition of algebraic and transcendental elements over a field FF. It proves the basic finiteness criterion that characterizes algebraicity. It works through concrete numerical and function-field examples. It sets up, without yet developing, two ideas that follow immediately from this one. These are the Minimal Polynomial of an algebraic element, and the structure of the simple extension F(α)F(\alpha) that this element generates.

Key takeaways
  • Fix a field extension K/FK/F. An element α∈K\alpha \in K is algebraic over FF if it is a root of some nonzero polynomial in F[x]F[x]; otherwise it is transcendental over FF.
  • Algebraicity is a statement about the existence of an annihilating polynomial, not about which specific polynomial you happen to find first.
  • The key finiteness criterion: α\alpha is algebraic over FF if and only if F[α]F[\alpha] (equivalently F(α)F(\alpha)) is finite-dimensional as an FF-vector space.
  • Transcendental elements generate a copy of the rational function field F(x)F(x) inside KK, an infinite-dimensional extension.
  • Whether an element is algebraic depends on the base field: π\pi is transcendental over Q\mathbb{Q} but algebraic (indeed equal to itself) over R\mathbb{R}.
  • Key idea: algebraic means "satisfies a polynomial equation over FF"; this single existence condition is exactly equivalent to the extension it generates being finite-dimensional over FF.

Where this lives today

The algebraic/transcendental dichotomy is the entry point to the entire theory of field extensions: every extension K/FK/F decomposes, element by element, into algebraic and transcendental parts, and the finiteness criterion proved here is the tool used to show finite extensions are algebraic. In Galois theory, algebraic elements with their minimal polynomials are the raw material for constructing splitting fields, computing Galois groups, and proving classical impossibility results (doubling the cube, trisecting the angle, and squaring the circle all reduce to algebraicity/degree arguments). In transcendence theory and Diophantine geometry, showing specific constants (ee, π\pi, values of the Gamma function, periods of elliptic curves) are transcendental over Q\mathbb{Q} remains a central and often extremely hard research question. In algebraic geometry, transcendental elements generalize to transcendence bases and transcendence degree, measuring the "dimension" of a field extension the way a basis measures the dimension of a vector space. In computer algebra and cryptography, algebraic elements of finite fields (roots of irreducible polynomials over Fp\mathbb{F}_p) are used to construct the finite field extensions Fpn\mathbb{F}_{p^n} that underlie elliptic-curve cryptography and error-correcting codes; the finite-dimensionality criterion proved above is exactly what guarantees these constructions produce finite fields at all.

:::quiz[If α\alpha is algebraic over FF via a minimal-degree annihilating polynomial of degree nn, what does the proof show about dim⁡FF[α]\dim_F F[\alpha]?]

  • It is always exactly n2n^2
  • It is infinite
  • It is at most nn, spanned by 1,α,…,αn−11,\alpha,\dots,\alpha^{n-1} ✓
  • It cannot be determined from nn alone

Ask the tutor: How does the minimal polynomial of an algebraic element get constructed, and why is it automatically irreducible over FF?

DefinitionAlgebraic and transcendental elements

Let K/FK/F be a field extension, meaning FF is a subfield of the field KK. An element α∈K\alpha \in K is called algebraic over FF if there exists a nonzero polynomial

f(x)=anxn+an−1xn−1+⋯+a1x+a0∈F[x],not all ai=0,f(x) = a_n x^n + a_{n-1}x^{n-1} + \cdots + a_1 x + a_0 \in F[x], \qquad \text{not all } a_i = 0,

such that

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

in KK. If no such nonzero polynomial exists, α\alpha is called transcendental over FF. An extension K/FK/F is called an algebraic extension if every element of KK is algebraic over FF. Note that algebraicity is a relative notion: it always refers to a specific base field FF, and the same element can be algebraic over one field and transcendental over another.

Intuition

Think of F[x]F[x], the ring of polynomials with coefficients in FF, as a toolbox of possible "tests" you can apply to an element α\alpha of a bigger field KK. Plugging α\alpha into a polynomial and evaluating gives another element of KK. The element α\alpha is algebraic exactly when some nontrivial test in this toolbox returns zero — when α\alpha satisfies some algebraic law with coefficients drawn from FF. If α\alpha is algebraic, the powers 1,α,α2,α3,…1, \alpha, \alpha^2, \alpha^3, \ldots cannot all be FF-linearly independent, because the relation f(α)=0f(\alpha) = 0 is precisely a nontrivial linear dependence among these powers. Eventually the powers of α\alpha "fold back" onto a finite-dimensional space spanned by 1,α,…,αn−11, \alpha, \dots, \alpha^{n-1}. Geometrically, you can picture the tower of powers of α\alpha collapsing after finitely many steps, like a recursive sequence obeying a finite recurrence. If α\alpha is transcendental, no such collapse ever happens: the powers 1,α,α2,…1, \alpha, \alpha^2, \dots remain linearly independent forever, and α\alpha behaves exactly like a free indeterminate xx. The field F(α)F(\alpha) generated by α\alpha is then indistinguishable, as an abstract field, from the field of rational functions F(x)F(x).

Figure
Powers of α\alpha collapsing under a polynomial relation, versus never collapsing
Algebraic case: α = √2+√3 satisfies x⁴−10x²+1=0 1 α α² α³ α⁴ = 10α²−1 (falls back!) Transcendental case: β = π, no relation ever holds 1 β β² β³ β⁴ β⁵ ⋯ (never repeats)
TheoremFiniteness criterion for algebraicity

Let K/FK/F be a field extension and let α∈K\alpha \in K. Let

F[α]={f(α):f∈F[x]}⊆KF[\alpha] = \{ f(\alpha) : f \in F[x] \} \subseteq K

denote the smallest subring of KK containing FF and α\alpha, and let F(α)⊆KF(\alpha) \subseteq K denote the smallest subfield of KK containing FF and α\alpha. Then the following are equivalent: 1. α\alpha is algebraic over FF. 2. F[α]F[\alpha] is finite-dimensional as an FF-vector space. 3. F[α]=F(α)F[\alpha] = F(\alpha), i.e. F[α]F[\alpha] is already a field. 4. F(α)F(\alpha) is finite-dimensional as an FF-vector space. Moreover, if α\alpha is transcendental over FF, then the evaluation map F[x]→F[α]F[x] \to F[\alpha], f↦f(α)f \mapsto f(\alpha), is a ring isomorphism, and consequently F(α)F(\alpha) is isomorphic as an FF-algebra to the rational function field F(x)F(x).

Proof

We prove (1)⇒(2)⇒(3)⇒(4)⇒(1)(1) \Rightarrow (2) \Rightarrow (3) \Rightarrow (4) \Rightarrow (1), which establishes the equivalence of all four statements, and then prove the final assertion about the transcendental case separately. Throughout, let

φ:F[x]→K,φ(f)=f(α)\varphi: F[x] \to K, \qquad \varphi(f) = f(\alpha)

be the evaluation homomorphism at α\alpha; this is a ring homomorphism because evaluation of polynomials respects addition and multiplication, and its image is exactly F[α]F[\alpha] by definition. This uses only that KK is a commutative ring containing FF, so no circularity arises from prerequisite facts.

(1)⇒(2)(1) \Rightarrow (2). Suppose α\alpha is algebraic over FF. Among all nonzero polynomials in F[x]F[x] vanishing at α\alpha, choose one, say

f(x)=anxn+⋯+a1x+a0,an≠0,f(x) = a_n x^n + \cdots + a_1 x + a_0, \qquad a_n \neq 0,

of minimal degree n≥1n \geq 1 (degree 00 is impossible since a nonzero constant polynomial cannot vanish at any point of a field). We claim the set {1,α,α2,…,αn−1}\{1, \alpha, \alpha^2, \dots, \alpha^{n-1}\} spans F[α]F[\alpha] as an FF-vector space; since this is a finite spanning set, F[α]F[\alpha] is finite-dimensional. Let V=span⁡F{1,α,…,αn−1}⊆F[α]V = \operatorname{span}_F\{1,\alpha,\dots,\alpha^{n-1}\} \subseteq F[\alpha]. We show every element g(α)g(\alpha), for g∈F[x]g \in F[x], lies in VV, by strong induction on deg⁡g\deg g. If deg⁡g<n\deg g < n this is immediate. If deg⁡g=m≥n\deg g = m \geq n, write g(x)=q(x)f(x)+r(x)g(x) = q(x) f(x) + r(x) using polynomial division in F[x]F[x] (valid since FF is a field and ff has nonzero leading coefficient ana_n), where deg⁡r<n\deg r < n or r=0r = 0. Evaluating at α\alpha,

g(α)=q(α)f(α)+r(α)=q(α)⋅0+r(α)=r(α),g(\alpha) = q(\alpha) f(\alpha) + r(\alpha) = q(\alpha)\cdot 0 + r(\alpha) = r(\alpha),

using f(α)=0f(\alpha) = 0. Since deg⁡r<n\deg r < n, r(α)∈Vr(\alpha) \in V by the base case, hence g(α)∈Vg(\alpha) \in V. This proves F[α]=VF[\alpha] = V, a finite-dimensional FF-vector space of dimension at most nn.

(2)⇒(3)(2) \Rightarrow (3). Suppose F[α]F[\alpha] is finite-dimensional over FF. We must show every nonzero element of F[α]F[\alpha] has a multiplicative inverse inside F[α]F[\alpha] (it already has one in KK since KK is a field and F[α]⊆K∖{0}F[\alpha]\subseteq K \setminus\{0\} is a set of nonzero elements when we pick β≠0\beta \neq 0; the point is to show the inverse lies in F[α]F[\alpha]). Let β∈F[α]\beta \in F[\alpha], β≠0\beta \neq 0. Consider the FF-linear map

mβ:F[α]→F[α],mβ(γ)=βγ.m_\beta : F[\alpha] \to F[\alpha], \qquad m_\beta(\gamma) = \beta \gamma.

This is well-defined because F[α]F[\alpha] is closed under multiplication (it is a ring). It is FF-linear because multiplication distributes over addition and commutes with scalars from FF. It is injective: if βγ=0\beta\gamma = 0 with β≠0\beta \neq 0, then since F[α]⊆KF[\alpha] \subseteq K and KK is a field (hence an integral domain), γ=0\gamma = 0. Since F[α]F[\alpha] is finite-dimensional over FF by hypothesis, an injective FF-linear endomorphism of a finite-dimensional vector space is automatically surjective (rank–nullity). Hence there exists γ∈F[α]\gamma \in F[\alpha] with mβ(γ)=βγ=1m_\beta(\gamma) = \beta\gamma = 1. Thus β\beta is invertible within F[α]F[\alpha], so F[α]F[\alpha] is a field. Since F[α]F[\alpha] is a subfield of KK containing FF and α\alpha, and F(α)F(\alpha) is by definition the smallest such subfield, we get F(α)⊆F[α]F(\alpha) \subseteq F[\alpha]. The reverse inclusion F[α]⊆F(α)F[\alpha]\subseteq F(\alpha) holds because F(α)F(\alpha) is a ring containing FF and α\alpha, hence contains all polynomial expressions in α\alpha with coefficients in FF. Hence F[α]=F(α)F[\alpha] = F(\alpha).

(3)⇒(4)(3) \Rightarrow (4). Immediate: if F(α)=F[α]F(\alpha) = F[\alpha] and F[α]F[\alpha] is finite-dimensional (which we showed in the previous step, using only the hypothesis F[α]=F(α)F[\alpha]=F(\alpha) together with hypothesis (2) already established as equivalent — but to keep this implication self-contained from statement (3) alone, note directly): assume (3)(3) holds as a standalone hypothesis, i.e. F[α]=F(α)F[\alpha]=F(\alpha). We must independently justify finite-dimensionality is not automatically part of (3); so instead we present the chain as (1)⇒(2)⇒(3)(1)\Rightarrow(2)\Rightarrow(3) and separately (3)⇒(1)(3) \Rightarrow (1), then close the loop with (1)⇔(4)(1)\Leftrightarrow(4) below, avoiding any implicit reuse. Let us restate the logical structure cleanly to remove ambiguity: we prove (1)⇒(2)(1)\Rightarrow(2), (2)⇒(3)(2)\Rightarrow(3), (3)⇒(1)(3)\Rightarrow(1), and (1)⇔(4)(1)\Leftrightarrow(4). This suffices for full equivalence of all four statements. (3)⇒(1)(3) \Rightarrow (1). Suppose F[α]=F(α)F[\alpha] = F(\alpha). If α=0\alpha = 0 it is a root of x∈F[x]x \in F[x], so algebraic; assume α≠0\alpha \neq 0. Since F(α)F(\alpha) is a field containing α≠0\alpha \neq 0, it contains α−1\alpha^{-1}. Since F[α]=F(α)F[\alpha]=F(\alpha), we have α−1∈F[α]\alpha^{-1} \in F[\alpha], so there is a polynomial h∈F[x]h \in F[x] with

α−1=h(α)=bkαk+⋯+b1α+b0.\alpha^{-1} = h(\alpha) = b_k \alpha^k + \cdots + b_1\alpha + b_0.

Multiplying both sides by α\alpha gives

1=bkαk+1+⋯+b1α2+b0α,1 = b_k \alpha^{k+1} + \cdots + b_1 \alpha^2 + b_0 \alpha,

i.e. α\alpha is a root of the nonzero polynomial bkxk+1+⋯+b1x2+b0x−1∈F[x]b_k x^{k+1} + \cdots + b_1 x^2 + b_0 x - 1 \in F[x] (nonzero because its constant term is −1≠0-1 \neq 0). Hence α\alpha is algebraic over FF, proving (1)(1). (1)⇔(4)(1) \Leftrightarrow (4). We already have (1)⇒(2)⇒(3)(1)\Rightarrow(2)\Rightarrow(3), and (3)(3) gives F(α)=F[α]F(\alpha)=F[\alpha] which is finite-dimensional by (2)(2); so (1)⇒(4)(1)\Rightarrow(4). Conversely suppose (4)(4): F(α)F(\alpha) is finite-dimensional over FF. Since F[α]⊆F(α)F[\alpha] \subseteq F(\alpha), F[α]F[\alpha] is also finite-dimensional (a subspace of a finite-dimensional space is finite-dimensional). Then the argument of (2)⇒(3)(2)\Rightarrow(3) applies verbatim to show F[α]F[\alpha] is a field, so F[α]=F(α)F[\alpha] = F(\alpha), and then (3)⇒(1)(3)\Rightarrow(1) gives that α\alpha is algebraic. Hence (4)⇒(1)(4) \Rightarrow (1). This completes the equivalence of (1),(2),(3),(4)(1), (2), (3), (4).

Transcendental case. Now suppose α\alpha is transcendental over FF. Recall φ:F[x]→K\varphi: F[x] \to K, φ(f)=f(α)\varphi(f) = f(\alpha), has image F[α]F[\alpha]. The kernel of φ\varphi consists of all polynomials f∈F[x]f \in F[x] with f(α)=0f(\alpha) = 0; by the definition of transcendence, the only such polynomial is f=0f = 0. Hence ker⁡φ={0}\ker \varphi = \{0\}, so φ\varphi is injective. An injective ring homomorphism is an isomorphism onto its image, so

F[x]≅F[α]F[x] \cong F[\alpha]

as rings (indeed as FF-algebras, since φ\varphi is FF-linear on constants). Since F[x]F[x] is an integral domain that is not a field (e.g. xx has no inverse in F[x]F[x]), and ring isomorphisms preserve the property of being a field, F[α]F[\alpha] is a domain that is not a field. By the equivalence just proved, since α\alpha is not algebraic, F[α]≠F(α)F[\alpha] \neq F(\alpha), consistent with F[α]F[\alpha] failing to be a field. Finally, F(α)F(\alpha) is by definition the smallest subfield of KK containing F[α]F[\alpha] (since any subfield containing FF and α\alpha contains F[α]F[\alpha], and conversely the field of fractions of F[α]F[\alpha] inside KK is a subfield containing FF and α\alpha, hence equals F(α)F(\alpha) by minimality — every element of F(α)F(\alpha) is thus a ratio f(α)/g(α)f(\alpha)/g(\alpha) with f,g∈F[x]f,g \in F[x], g(α)≠0g(\alpha)\neq 0). The isomorphism φ:F[x]≅F[α]\varphi: F[x]\cong F[\alpha] extends to an isomorphism of fields of fractions,

F(x)=Frac⁡(F[x])  ≅  Frac⁡(F[α])=F(α),F(x) = \operatorname{Frac}(F[x]) \;\cong\; \operatorname{Frac}(F[\alpha]) = F(\alpha),

because a ring isomorphism between integral domains always extends uniquely to an isomorphism of their fraction fields (send f/g↦φ(f)/φ(g)f/g \mapsto \varphi(f)/\varphi(g); this is well-defined and bijective by injectivity of φ\varphi and the universal property of fraction fields). This proves the final assertion. ■\blacksquare

∎

Worked examples

Example 1: an algebraic element built from nested radicals. Let F=QF = \mathbb{Q}, K=RK = \mathbb{R}, and α=2+53\alpha = \sqrt{2} + \sqrt[3]{5}. We show α\alpha is algebraic over Q\mathbb{Q} by exhibiting an explicit annihilating polynomial, using the finiteness criterion as a guide rather than guessing blindly. Since 2\sqrt 2 satisfies t2=2t^2 = 2 and 53\sqrt[3]{5} satisfies t3=5t^3=5, set β=α−2=53\beta = \alpha - \sqrt2 = \sqrt[3]{5}, so β3=5\beta^3 = 5. Substitute β=α−2\beta = \alpha - \sqrt2:

(α−2)3=5.(\alpha - \sqrt2)^3 = 5.

Expand using the binomial theorem, treating 2\sqrt2 as a fixed quantity with (2)2=2(\sqrt2)^2 = 2:

α3−3α22+3α(2)2−(2)3=5,\alpha^3 - 3\alpha^2\sqrt2 + 3\alpha(\sqrt2)^2 - (\sqrt2)^3 = 5,
α3−32 α2+6α−22=5.\alpha^3 - 3\sqrt2\,\alpha^2 + 6\alpha - 2\sqrt2 = 5.

Collect the terms with a factor of 2\sqrt2:

α3+6α−5=2 (3α2+2).\alpha^3 + 6\alpha - 5 = \sqrt2\,(3\alpha^2 + 2).

Square both sides (both sides are real numbers, so this is legitimate and reversible given we track signs are irrelevant to squaring):

(α3+6α−5)2=2(3α2+2)2.(\alpha^3 + 6\alpha - 5)^2 = 2(3\alpha^2+2)^2.

Expand the left side:

α6+12α4−10α3+36α2−60α+25,\alpha^6 + 12\alpha^4 - 10\alpha^3 + 36\alpha^2 - 60\alpha + 25,

and the right side:

2(9α4+12α2+4)=18α4+24α2+8.2(9\alpha^4 + 12\alpha^2 + 4) = 18\alpha^4 + 24\alpha^2 + 8.

Setting left minus right to zero:

α6+12α4−18α4−10α3+36α2−24α2−60α+25−8=0,\alpha^6 + 12\alpha^4 - 18\alpha^4 - 10\alpha^3 + 36\alpha^2 - 24\alpha^2 - 60\alpha + 25 - 8 = 0,
α6−6α4−10α3+12α2−60α+17=0.\alpha^6 - 6\alpha^4 - 10\alpha^3 + 12\alpha^2 - 60\alpha + 17 = 0.

So α=2+53\alpha = \sqrt2 + \sqrt[3]{5} is a root of the nonzero polynomial

f(x)=x6−6x4−10x3+12x2−60x+17∈Q[x].f(x) = x^6 - 6x^4 - 10x^3 + 12x^2 - 60x + 17 \in \mathbb{Q}[x].

Hence α\alpha is algebraic over Q\mathbb{Q}, and by the theorem, Q[α]=Q(α)\mathbb{Q}[\alpha] = \mathbb{Q}(\alpha) is a finite-dimensional Q\mathbb{Q}-vector space (of dimension at most 66; one can show it is exactly 66, but that requires irreducibility of ff, a question for the theory of the Minimal Polynomial). This also illustrates that finding an annihilating polynomial by direct elimination, rather than by cleverness, is always possible for such nested radical expressions.

Example 2: a transcendental element in a rational function field. Let FF be any field, let K=F(t)K = F(t) be the field of rational functions in an indeterminate tt over FF, and consider inside KK the element

α=t2t+1∈K.\alpha = \frac{t^2}{t+1} \in K.

We ask: is α\alpha algebraic or transcendental over FF? (Note F(t)F(t) itself is generated by the transcendental element tt; the question here is subtler, since α\alpha is not tt itself but a rational function of it.) Claim: α\alpha is transcendental over FF, and moreover F(α)⊊F(t)F(\alpha) \subsetneq F(t) is a proper subfield, yet F(t)F(t) is a finite-dimensional F(α)F(\alpha)-vector space of dimension 22. Proof of transcendence. Suppose, for contradiction, that α\alpha is algebraic over FF, i.e. there is a nonzero polynomial g(x)∈F[x]g(x) \in F[x] with g(α)=0g(\alpha) = 0. Write g(x)=∑i=0ncixig(x) = \sum_{i=0}^n c_i x^i with ci∈Fc_i \in F, not all zero. Then in K=F(t)K = F(t),

∑i=0nci(t2t+1)i=0.\sum_{i=0}^n c_i \left(\frac{t^2}{t+1}\right)^i = 0.

Multiply through by (t+1)n(t+1)^n (nonzero in F[t]F[t], and in fact F[t]F[t] is an integral domain so no zero divisors are introduced):

∑i=0nci t2i(t+1)n−i=0in F[t].\sum_{i=0}^n c_i\, t^{2i} (t+1)^{n-i} = 0 \quad \text{in } F[t].

This says a specific polynomial identity holds in F[t]F[t], namely that the polynomial P(t):=∑icit2i(t+1)n−iP(t) := \sum_i c_i t^{2i}(t+1)^{n-i} is the zero polynomial. But consider the coefficient of t2nt^{2n} in P(t)P(t): only the i=ni=n term, cnt2n(t+1)0=cnt2nc_n t^{2n}(t+1)^0 = c_n t^{2n}, can contribute a term of degree 2n2n (every other term cit2i(t+1)n−ic_i t^{2i}(t+1)^{n-i} with i<ni<n has degree 2i+(n−i)=n+i<2n2i + (n-i) = n+i < 2n since i<ni < n). So the coefficient of t2nt^{2n} in PP is exactly cnc_n. Since P≡0P \equiv 0, we need cn=0c_n = 0. But then repeat with nn replaced by the largest index ii with ci≠0c_i \neq 0 (such an index exists since not all cic_i vanish): by the same degree-counting argument applied to the truncated sum, the coefficient of t2it^{2i} in the (now shorter) identity is cic_i, forcing ci=0c_i = 0 too — contradiction. Hence no nonzero gg exists, and α=t2/(t+1)\alpha = t^2/(t+1) is transcendental over FF, exactly as tt itself is. Finite degree over F(α)F(\alpha). Although α\alpha is transcendental over the small field FF, the element tt satisfies a genuine polynomial equation over the larger field F(α)F(\alpha): rearranging α=t2/(t+1)\alpha = t^2/(t+1) gives

α(t+1)−t2=0,i.e.t2−αt−α=0,\alpha(t+1) - t^2 = 0, \quad \text{i.e.} \quad t^2 - \alpha t - \alpha = 0,

a quadratic equation for tt with coefficients 1,−α,−α1, -\alpha, -\alpha lying in F(α)F(\alpha). So tt is algebraic over F(α)F(\alpha) (of degree at most 2), even though α\alpha is transcendental over the smaller field FF. This shows vividly that "algebraic" is relative to the base field: the same tower F⊂F(α)⊂F(t)F \subset F(\alpha) \subset F(t) has a transcendental step followed by an algebraic (in fact finite, degree 22) step. This phenomenon — a transcendental generator of a subfield over which the original variable becomes algebraic — is the seed of Simple Extensions and F(alpha) and of transcendence-degree arguments in more advanced field theory.

:::counterexample[Why the extension K/FK/F (and not just the ring F[x]F[x]) is essential] The definitions of algebraic and transcendental only make sense relative to an ambient field KK containing FF — dropping this and asking "is α\alpha algebraic over FF" with no ambient field specified is meaningless, and conflating F[x]F[x] itself with F[α]F[\alpha] is the trap this example exposes. Consider F=QF = \mathbb{Q} and the indeterminate xx inside the polynomial ring Q[x]\mathbb{Q}[x] versus a root of a polynomial inside a genuine field extension. The symbol xx in Q[x]\mathbb{Q}[x] is not an element of any field extension of Q\mathbb{Q} a priori — Q[x]\mathbb{Q}[x] is a ring, not a field — so the question "is xx algebraic over Q\mathbb{Q}" is not directly one the definition addresses until we embed xx into some field K⊇QK \supseteq \mathbb{Q}. The correct ambient field to use is K=Q(x)K = \mathbb{Q}(x), the field of rational functions, into which Q[x]\mathbb{Q}[x] embeds naturally. Inside this specific KK, xx is transcendental over Q\mathbb{Q}: if f(x)=∑aixif(x) = \sum a_i x^i were a nonzero polynomial with f(x)=0f(x) = 0 as an element of Q(x)\mathbb{Q}(x), this would force every coefficient aia_i to vanish, since two polynomials define the same rational function if and only if they are equal as polynomials (an element of F[x]F[x], viewed inside F(x)F(x), is the zero element of F(x)F(x) if and only if it is the zero polynomial — this is how the ring embeds into its fraction field). So no nonzero relation exists. Now here is the point of the counterexample: if instead we sloppily take KK to be, say, the field F2(y)/(y2+y+1)⋅(…)\mathbb{F}_2(y)/(y^2+y+1)\cdot(\ldots) or any field where a different symbol named "xx" happens to satisfy a relation, we could wrongly "prove" xx algebraic by confusing notation between rings. The moral, stated precisely: algebraicity is not an intrinsic property of an abstract symbol; it is a property of a specific element sitting inside a specific field extension K/FK/F. The same abstract polynomial ring F[x]F[x] can be embedded as a subring of many different fields, and whether the class of xx in that field is a root of a polynomial over FF depends entirely on which embedding — which ambient KK — is used. Without fixing K/FK/F first, the dichotomy algebraic/transcendental has no content.

Scope, edge cases & common traps

SituationAlgebraic?Why
α∈F\alpha \in F itselfYesroot of x−α∈F[x]x - \alpha \in F[x]
α=0\alpha = 0Yesroot of xx
i∈Ci \in \mathbb{C} over F=RF=\mathbb{R}Yesroot of x2+1x^2+1
π\pi over F=QF = \mathbb{Q}NoLindemann's theorem (transcendence, beyond algebra alone)
π\pi over F=RF = \mathbb{R}Yesroot of x−πx - \pi
t∈F(t)t \in F(t) over FFNorational function field, by definition of indeterminate

The mathematician behind it

Origins · 1 minFerdinand von Lindemann and how this was discovered
FV
Ferdinand von Lindemann
1852–1939 · Late 19th-century Germany, analysis and number theory

Lindemann proved in 1882 that π\pi is transcendental over Q\mathbb{Q}, extending Charles Hermite's 1873 proof that ee is transcendental. His theorem settled the millennia-old problem of squaring the circle: since π\pi satisfies no polynomial equation with rational coefficients, it cannot be constructed from a unit length using straightedge and compass, and consequently a square with area equal to a given circle cannot be so constructed. Lindemann's result depends on deep analytic estimates and is not itself an algebraic fact — but it can only even be stated using the algebraic vocabulary of algebraic versus transcendental elements developed by Dedekind, Kronecker, and others in the same era, as they built the modern theory of field extensions.

History
- 1844: Liouville constructs the first explicitly known transcendental numbers, showing transcendental numbers exist without needing a general classification theorem.
- 1873: Hermite proves ee is transcendental over Q\mathbb{Q}.
- 1874: Cantor shows the algebraic numbers are countable while the reals are uncountable, so transcendental numbers are "almost all" real numbers, though this gives no way to name one.
- 1882: Lindemann proves π\pi is transcendental, resolving the ancient squaring-the-circle problem negatively.
- late 1800s–1900s: Dedekind, Kronecker, Steinitz formalize field extensions, algebraic elements, and minimal polynomials into the modern axiomatic framework used today.
What exactly does "annihilating polynomial" mean, and does it need to be irreducible?

An annihilating polynomial for α\alpha over FF is any nonzero f∈F[x]f \in F[x] with f(α)=0f(\alpha)=0; it need not be irreducible, and it need not be unique. For example both x2−2x^2-2 and x4−4x^4-4 are annihilating polynomials for 2\sqrt2 over Q\mathbb{Q}, since (2)4−4=4−4=0(\sqrt2)^4-4=4-4=0 too. All that the definition of "algebraic" requires is the existence of at least one such nonzero polynomial. Among all annihilating polynomials there is a unique monic one of smallest degree — this special polynomial is the Minimal Polynomial, and it turns out always to be irreducible, but establishing that fact is a separate theorem building on the definition given here.

Is every element of an infinite field extension automatically transcendental?

No. An extension K/FK/F can be infinite-dimensional as a vector space while still consisting entirely of algebraic elements; this happens, for instance, for the field of all algebraic numbers over Q\mathbb{Q}, which is infinite-dimensional over Q\mathbb{Q} yet every single element is algebraic by construction. Infinite dimension of the whole extension K/FK/F says nothing directly about any individual element; the finiteness criterion in this article applies to F(α)F(\alpha) for one element α\alpha at a time, not to all of KK simultaneously. An extension can also mix algebraic and transcendental elements, as in F(t)/FF(t)/F, where tt is transcendental but every element of FF itself remains algebraic.

Why does transcendence of α\alpha force F(α)≅F(x)F(\alpha)\cong F(x), the rational function field?

Because transcendence means exactly that the evaluation map F[x]→KF[x]\to K sending x↦αx \mapsto \alpha has trivial kernel: no nonzero polynomial vanishes at α\alpha. A ring homomorphism with trivial kernel is injective, so it identifies F[x]F[x] with its image F[α]F[\alpha] inside KK. Passing to fields of fractions (which is always possible for integral domains, and preserves isomorphisms) upgrades this to a field isomorphism F(x)≅F(α)F(x) \cong F(\alpha). Intuitively, α\alpha satisfies no hidden algebraic law, so it behaves exactly like a free variable, and the field it generates has exactly the algebraic structure of "rational functions in one free variable."

Can an element be algebraic over FF but transcendental over a subfield of FF?

This question is about the reverse direction and needs care with quantifiers. If E⊆F⊆KE \subseteq F \subseteq K and α∈K\alpha \in K is algebraic over FF, it need not be algebraic over the smaller field EE — and in fact it very often is not. For example, t∈F(t)t \in F(t) is transcendental over FF but tt is trivially algebraic (indeed already an element) over F(t)F(t) itself, showing algebraicity can gained by enlarging the base. The general phenomenon in the worked examples above — α=t2/(t+1)\alpha = t^2/(t+1) transcendental over FF but tt algebraic over F(α)F(\alpha) — shows both directions of behavior can coexist in a single tower of fields.

Does the definition require KK to be algebraically closed or of any particular type?

No. The definition of algebraic/transcendental makes sense for any field extension K/FK/F whatsoever, with no hypothesis on KK beyond being a field containing FF. Algebraic closedness of KK becomes important later, when one asks whether an annihilating polynomial's other roots also lie in KK (this is the content of splitting fields), but it plays no role in the basic definition or in the finiteness criterion proved here, both of which only require KK to be a field extension of FF.

How is this different from asking whether α\alpha satisfies an equation with integer coefficients?

Working over F=QF=\mathbb{Q}, asking for a nonzero f∈Q[x]f \in \mathbb{Q}[x] with f(α)=0f(\alpha)=0 is equivalent to asking for a nonzero g∈Z[x]g \in \mathbb{Z}[x] with g(α)=0g(\alpha)=0, because clearing denominators turns any rational-coefficient annihilating polynomial into an integer-coefficient one without changing its roots. So for F=QF=\mathbb{Q} the two phrasings agree, and this is why classical algebraic number theory often speaks of "satisfying a polynomial with integer coefficients." Over a general field FF, however, there is no analogue of "integer coefficients" unless FF itself has a distinguished subring, so the correct and general formulation is always in terms of F[x]F[x].

Before this

Where this leads