Transcendence Basis
Statement
Let be a field extension. A set is a transcendence basis if:
- is algebraically independent over : no non-zero polynomial in vanishes on any finite tuple from .
- is algebraic over : every element of satisfies a polynomial with coefficients in .
Every field extension has a transcendence basis (by Zorn's Lemma), and all transcendence bases have the same cardinality — the transcendence degree .
In Mathlib: IsTranscendenceBasis F x asserts that the indexed family is a transcendence basis. Existence is exists_isTranscendenceBasis.
Visualization
Transcendence degree 0 — : the extension is algebraic, so is a transcendence basis.
Transcendence degree 1 — (rational functions): is transcendental and is trivially algebraic over .
Transcendence degree 2 — : so .
K = C
| algebraic over Q(B)
F(B) = Q(e, pi, ...) <-- B is a transcendence basis (uncountable)
| purely transcendental
F = Q
Open problem. Are and algebraically independent over ? It is known each is transcendental (Hermite 1873, Lindemann 1882), but whether forms an algebraically independent set is unknown. If yes, ; if no (e.g., for some ) it would equal 1.
Concrete algebraic independence check. The set in is algebraically independent over : if for a polynomial over , then as a polynomial (clear from the construction of the rational function field).
| Extension | Transcendence basis | |
|---|---|---|
| uncountable |
Proof Sketch
- Existence (Zorn's Lemma). The set of algebraically independent subsets of over is partially ordered by inclusion. Every chain has an upper bound (the union). By Zorn's Lemma, a maximal element exists. Maximality implies is algebraic over (else we could adjoin a transcendental element to ).
- Cardinality invariance. If and are both transcendence bases, a standard exchange argument (analogous to linear independence/basis exchange) shows .
- Analogy with linear algebra. Transcendence bases are to algebraic independence as vector space bases are to linear independence: existence by Zorn, uniqueness of cardinality.
Connections
Transcendence bases classify field extensions up to the "purely transcendental + algebraic" factorization: with purely transcendental and algebraic. This decomposition appears in the classification of algebraically closed fields — two algebraically closed fields of the same characteristic are isomorphic iff they have the same transcendence degree (closely related to the Algebraic ClosureAlgebraic ClosureEvery field embeds into an algebraically closed field in which every non-constant polynomial has a rootRead more → uniqueness theorem). The concept also interacts with Separable ExtensionSeparable ExtensionA field extension where every element's minimal polynomial has no repeated rootsRead more →: a separably generated extension has a transcendence basis over which the extension is separable.
Lean4 Proof
/-- Every field extension has a transcendence basis (Zorn's Lemma). -/
theorem field_has_transcendence_basis (F K : Type*) [Field F] [Field K]
[Algebra F K] [FaithfulSMul F K] :
∃ s : Set K, IsTranscendenceBasis F ((↑) : s → K) :=
exists_isTranscendenceBasis F K