Transcendental Extensions and Transcendence Bases
Handbook guide to transcendental extensions and transcendence bases with core definitions, structural results, reasoning methods and verification checks.
How the topic fits together
Transcendental Extensions
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Core definitions and structural results
The following cards retain the mathematical content of the source while condensing long proofs into verification strategies. Numerical examples are treated as examples, not universal requirements.
Definition
An extension E/F such that at least one α ∈E is not algebraic over F is called transcendental. An idea analogous to that of a basis of an arbitrary vector space V turns out to be profitable in studying transcendental extensions. A basis for V is a subset of V that is linearly independent and spans V .
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Lemma
If S is a subset of E, the following conditions are equivalent. (i) S is a transcendence basis for E/F; (ii) S is a maximal algebraically independent set; (iii) S is a minimal algebraically spanning set. Thus by (ii), S is a transcendence basis for E/F iffS is algebraically independent and E is algebraic over F(S).
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Proposition
Every transcendental extension has a transcendence basis.
Proof / verification strategy: Work through generators and minimal polynomials, use basis/degree information, and track how field automorphisms act on roots and intermediate fields.
Result
The Steinitz Exchange If {x1, . . . , xm} spans E algebraically and S is algebraically independent, then |S| ≤m.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Corollary
Let S and T be transcendence bases of E. Then either S and T are both finite or they are both infinite; in the former case, |S| = |T|.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Proposition
If S and T are arbitrary transcendence bases for E, then |S| = |T|. [The common value is called the transcendence degree of E/F .]
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Example
Let E = F(X1, . . . , Xn) be the field of rational functions in the variables X1, . . . , Xn with coefficients in F. If f(X1, . . . , Xn) = 0, then f is the zero polynomial, so S = {X1, . . . , Xn} is an algebraically independent set. Since E = F(S), E is algebraic over F(S) and therefore S spans E algebraically. Thus S is a transcendence basis.
Proof / verification strategy: Treat this as an illustration of the surrounding definitions. Recompute the stated relations directly and keep the numerical or structural choices local to the example.
Definition
If x1, . . . , xn (n ≥2) are arbitrary elements of a field, the Vandermonde determinant of the xi is det V = ¯¯¯¯¯¯¯¯ 1 1 · · · 1 x1 x2 · · · xn ... xn−1 1 xn−1 2 · · · xn−1 n ¯¯¯¯¯¯¯¯
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Corollary
If f is a polynomial in F [X] with roots x1, . . . , xn in some splitting field over F, then the discriminant of f is (det V )2.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Computation of the Discriminant
Computation of the Discriminant The square of the determinant of V is det(V V t), which is the determinant of 1 1 · · · 1 x1 x2 · · · xn ... xn−1 1 xn−1 2 · · · xn−1 n 1 x1 · · · xn−1 1 1 x2 · · · xn−1 2 ... 1 xn . . . xn−1 n and this in turn is ¯¯¯¯¯¯¯¯ t0 t1 · · · tn−1 t1 t2 · · · tn ... tn−1 tn · · · t2n−2 ¯¯¯¯¯¯¯¯ where the power sums tr are given by t0 = n, tr = n X i=1 xr i , r ≥1. We must express the power sums in terms of the coefficients of the polynomial f. This will involve, improbably, an exercise in differential calculus. One has F(z) = n Y i=1 (1 −xiz) = n X i=0 cizi with c0 = 1; the variable z ranges over real numbers.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Newton’s Identities
Newton’s Identities If f(X) = Pn i=0 aiXi (with an = 1) is a polynomial with roots x1, .. . ,xn, then the power sums ti satisfy tr + an−1tr−1 + · · · + an−r+1t1 + ran−r = 0, r ≤n (3) and tr + an−1tr−1 + · · · + a0tr−n = 0, r > n. (4)
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
The Discriminant of a Cubic
The Discriminant of a Cubic First consider the case where the X2 term is missing, so that f(X) = X3 + pX + q. Then n = t0 = 3, a0 = q, a1 = p, a2 = 0 (a3 = 1). Newton’s identities yield t1 + a2 = 0, t1 = 0; t2 + a2t1 + 2a1 = 0, t2 = −2p; t3 + a2t2 + a1t1 + 3a0 = 0, t3 = −3a0 = −3q; t4 + a2t3 + a1t2 + a0t1 = 0, t4 = −p(−2p) = 2p2 D = ¯¯¯¯¯¯ 3 0 −2p 0 −2p −3q −2p −3q 2p2 ¯¯¯¯¯¯ = −4p3 −27q2.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Quick-reference relationships
Problem-solving workflow
Name the base field and extension
Keep the direction of the extension and any intermediate fields explicit.
Classify the elements involved
Determine whether elements are algebraic, separable, normal, transcendental or generators of the extension.
Use minimal or splitting polynomials
Polynomial factorisation and root structure determine the relevant field construction.
Track extension degree
Apply basis arguments and degree multiplicativity before making claims about possible intermediate fields.
Relate automorphisms to fixed fields
For finite Galois situations, use the subgroup-field correspondence only after the extension hypotheses are satisfied.
Verify by root action
Represent automorphisms through their action on roots and check that all defining algebraic relations are preserved.
Worked-solution emphasis from the supplied source
The supplied worked solutions for this section repeatedly test quotient, polynomial, root, degree, basis, field, automorphism, prime. These checks are used here as verification themes rather than copied as answer text.
Common mistakes and boundary conditions
- Forgetting the coefficient ring when comparing modules.
- Assuming tensor product preserves every exact sequence.
- Confusing direct sum with direct product for infinite families.
- Reading exactness from a diagram without checking image equals kernel.
Verification checklist
- State the ambient algebraic structure and operation before applying a theorem.
- Record every hypothesis that controls the result: finiteness, commutativity, normality, primality, separability, exactness or other section-specific conditions.
- Distinguish a definition from a theorem that follows from it.
- Check whether a map is well-defined before using its kernel, image, inverse or induced map.
- Use a concrete example only as a check; do not promote an illustrative value or pattern to a universal rule.
- When a quotient, localisation or extension is constructed, identify the canonical map and what becomes equal, invertible or fixed.
Source coverage map
| Source section | Subject | PDF pages analysed |
|---|---|---|
| 6.9 | Transcendental Extensions | 123–127 |
Related Mathematics pages
Source note: synthesised from the supplied abstract-algebra PDF. The complete 298-page file, including diagrams and worked solutions, was reviewed. Source-identifying author and bibliographic personal details are intentionally omitted. Formal proofs are condensed; the page does not claim requirements or values not supported by the supplied mathematics.