Skip to content

Steinitz Primitive Element Criterion

A finite field extension has a single generator exactly when it has finitely many intermediate fields.

Version
v1 · 2026-10-17 · History
Domain-specific #
14315
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Field Theory → Mathematics
Aliases
Steinitz's theorem (field theory)

Core Idea

A finite field extension has a single generator exactly when it has finitely many intermediate fields. For a finite extension \(L/K\), this means \(L=K(\alpha)\) for some \(\alpha\in L\) if and only if the complete set of fields \(M\) with \(K\subseteq M\subseteq L\) is finite. Separability and normality are not required.[ref-d0102629dbb2][ref-b7f807fa5095]

Scope of Application

The criterion applies to finite field extensions over finite or infinite base fields, including separable and inseparable extensions.[^ref-d0102629dbb2]

  • Separable quadratic extension: \(\mathbb Q(\sqrt2)/\mathbb Q\) is generated by \(\sqrt2\) and has only base and top as intermediate fields.[^ref-d0102629dbb2-3]
  • Purely inseparable prime-degree extension: \(\mathbb F_p(t^{1/p})/\mathbb F_p(t)\) is generated by \(t^{1/p}\) and likewise has only base and top as intermediate fields.[ref-d0102629dbb2-2][ref-d0102629dbb2-3]

Clarity

The two implications have different proofs: a generator constrains intermediate fields through minimal-polynomial factors; the converse uses proper-subspace avoidance over infinite bases and finite-field cyclicity over finite bases.[ref-d0102629dbb2][ref-b7f807fa5095]

Finite degree or a partial list of subfields cannot replace the full test. For \(\mathbb F_p(x,y)/\mathbb F_p(x^p,y^p)\), the degree is \(p^2\) but every element generates at most a degree-\(p\) subextension; hence this finite extension is not simple and has infinitely many intermediate fields. Inseparability alone does not decide the result.[ref-b7f807fa5095][ref-d0102629dbb2]

Manages Complexity

For a given finite extension, the criterion lets a proof move between an explicit single generator and a classification of the whole intermediate-field interval. Either route can establish the other, though neither is guaranteed to be computationally easy. Prime degree makes the interval especially easy to close because the tower law leaves only the endpoints.[ref-d0102629dbb2][ref-d0102629dbb2-3]

Abstract Reasoning

First establish \([L:K]<\infty\). Then prove either that one element generates \(L\), or that the entire interval of intermediate fields is finite. Apply the corresponding direction of the theorem, keeping the finite-base and infinite-base converse arguments distinct. Test a suspected failure of simplicity by bounding \([K(\alpha):K]\) for every possible \(\alpha\), as in the degree-\(p^2\) example.[ref-d0102629dbb2][ref-b7f807fa5095]

Knowledge Transfer

The same check works for the separable quadratic and purely inseparable degree-\(p\) examples: each has a displayed generator and, by prime degree, only two intermediate fields. The degree-\(p^2\) example reverses the result because no element generates the full extension; it cannot inherit the prime-degree shortcut merely from having finite degree.[ref-d0102629dbb2-3][ref-d0102629dbb2-2][^ref-b7f807fa5095]

The theorem presupposes a field extension: a specified embedding of \(K\) into \(L\) makes degree, generation over \(K\), and intermediate \(K\)-fields meaningful. Its internal form is a necessity and sufficiency relation between two predicates on finite extensions. The theorem is a field-specific result, not another type of embedding or a generic logical equivalence.[^ref-d0102629dbb2]

Relationships to Other Abstractions

Local relationship map for Steinitz Primitive Element CriterionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Steinitz PrimitiveElement CriterionDOMAINPrime abstraction: Necessity and Sufficiency — is part ofNecessity andSufficiencyPRIMEDomain-specific abstraction: Field Extension — presupposesField ExtensionDOMAIN

Current abstraction Steinitz Primitive Element Criterion Domain-specific

Parents (2) — more general patterns this builds on

  • Steinitz Primitive Element Criterion presupposes Field Extension Domain-specific

    The theorem requires a specified base-field embedding K into L before generation, degree and intermediate K-fields are defined.

  • Steinitz Primitive Element Criterion is part of Necessity and Sufficiency Prime

    The Steinitz iff theorem contains a two-way necessary-and-sufficient relation between single generation and finite intermediate-field count.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Steinitz Primitive Element Criterion sits in a sparse region of the domain-specific corpus (66th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2721 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-17

References

[^ref-d0102629dbb2]: The Stacks Project Authors, Fields, undated online edition, §9.19, Lemma 9.19.1, theorem and complete proof, https://stacks.math.columbia.edu/tag/09HZ. [^ref-b7f807fa5095]: Zheng, Weizhe (2025), Lectures on Algebra, course notes dated January 10, 2025, Theorem 1.7.4 (Steinitz) and Example 1.7.3, physical PDF pp. 24–25 (viewer zero-based P23–24; printed pp. 18–19), https://server.mcm.ac.cn/~zheng/algebra.pdf. [^ref-d0102629dbb2-2]: The Stacks Project Authors, Fields, undated online edition, §9.14, Lemma 9.14.2, purely inseparable degree-\(p\) construction, https://stacks.math.columbia.edu/tag/09HD. [^ref-d0102629dbb2-3]: The Stacks Project Authors, Fields, undated online edition, §9.7, Example 9.7.6 and Lemma 9.7.7, degree of a simple extension and tower law, https://stacks.math.columbia.edu/download/book.pdf.