KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesExistence of Separable Maximal SubfieldsEngineering · Engineering MathematicsLesson 446/884← PrevNext →
ArticlePublished 8 Aug 202618 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIExistence of Separable Maximal Subfields

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Advanced Central simple algebras

Separable Maximal Subfields

Every centrally finite division ring has a maximal subfield separable over its centre — and any separable subfield can be grown into one. In characteristic p this is a genuine theorem, since purely inseparable maximal subfields also exist.

Page ID
KEVOS-ENG-MATH-NCR-0118
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(15.12), §15 (pp. 257–258)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

Let D be a division ring finite-dimensional over its centre F. Then D contains a maximal subfield that is separable over F, and more precisely every subfield of D separable over F can be enlarged to such a maximal subfield. In characteristic zero the statement is empty — every algebraic extension is separable — so its content is entirely in characteristic p.

The proof is a two-line contradiction resting on two heavy imports: the Double Centralizer Theorem, which identifies Z(CD(K)) with K, and the Noether–Jacobson theorem, which produces a separable element in any noncommutative algebraic division algebra. If a maximal separable subfield K failed to be a maximal subfield, its centralizer would be a noncommutative division algebra with centre exactly K, and Noether–Jacobson would hand back a separable element outside K.

rDegree of the separable maximal subfield
char pWhere the theorem has content
dimFD<∞Hypothesis that cannot be dropped
Crossed productsMain downstream consequence

02Overview

Maximal subfields exist in profusion — Zorn's Lemma sees to that — but existence alone is not usable. Almost every structural description of a central division algebra requires a maximal subfield with extra properties: separable, so that the primitive element theorem applies; Galois, so that a crossed product presentation exists; cyclic, so that a symbol presentation exists. Each level of demand is strictly harder to satisfy, and the first is exactly what (15.12) delivers.

E⊆D separable over F⟹∃K maximal subfield of D,E⊆K,K/F separable.
(15.12)

The enlargement form of the theorem; taking E=F gives the bare existence statement.

The demand is not vacuous. In characteristic p a central division algebra can perfectly well contain a purely inseparable maximal subfield — the worked example below has one of each — so "pick any maximal subfield" is not a legitimate move in any argument that needs separability.

The one thing to remember

A maximal separable subfield of a centrally finite D is automatically a maximal subfield. The obstruction to enlarging separably vanishes only when there is nothing left to enlarge at all.

The hypothesis of central finiteness enters through the Double Centralizer Theorem, which needs dimFK<∞. Lam records explicitly that it is unclear how to extend the argument to algebraic division algebras, and states that he does not know whether an algebraic division algebra with centre F must contain a maximal subfield separable over F.

03Learning Objectives

  • State (15.12) in both its forms and identify the standing hypothesis.
  • Show that a maximal separable subfield exists, using finite dimensionality.
  • Prove Z(CD(K))=K from the double centralizer identity.
  • Complete the contradiction using the Noether–Jacobson theorem.
  • Verify transitivity of separability at the point where the proof uses it.
  • Construct a degree-p division algebra with both separable and purely inseparable maximal subfields.

04Definitions

Standing hypothesis
D is a division ring with F=Z(D) and dimFD=r2<∞; every subfield mentioned contains F.
Separable over F
A subfield E⊆D with E/F a separable field extension. Every element of E then has a minimal polynomial over F with distinct roots in a splitting field.
Purely inseparable over F
In characteristic p: every a∈E satisfies apn∈F for some n. Such an extension has degree a power of p and admits no nontrivial F-automorphisms.
CD(K)
The centralizer of K in D. When dimFK<∞ it satisfies CD(CD(K))=K and dimFK⋅dimFCD(K)=dimFD.
Maximal separable subfield
A subfield separable over F, maximal among such. It exists by finite dimensionality, and (15.12) says it is in fact a maximal subfield.

Separability is transitive: if M/K and K/F are separable algebraic extensions then so is M/F. This is the step that lets a local improvement inside a centralizer be exported back to the base field.

05Core Concepts

The centre of a centralizer

Let K be a subfield of D containing F, with dimFK<∞, and let L=CD(K). Directly from the definition of a centre,

Z(L)=L∩CD(L)=L∩K=K,
(15.12a)

The middle equality is the Double Centralizer Theorem CD(L)=K; the last uses K⊆L, which holds because K is commutative.

This identity is the engine of the proof. It says that a non-maximal subfield K sits inside a division algebra L as its exact centre, so L is a division algebra centrally finite over K — and it is noncommutative precisely when K fails to be a maximal subfield of D.

Recursion into the centralizer

Once L is recognised as a noncommutative division algebra with centre K, the Noether–Jacobson theorem applies to L over K: there is an element z∈L∖K separable over K. Separability is transitive, so K(z) is separable over F as well — and it is a subfield of D strictly larger than K. That is the contradiction, provided K was chosen maximal among separable subfields.

K not maximal in D⟹L=CD(K)⊋K⟹Z(L)=K, L noncommutative⟹∃z∈L∖K separable over K⟹K(z)/F separable

Why characteristic p is the only interesting case

If charF=0, or more generally if F is perfect — for instance any finite field, though Wedderburn's little theorem removes that case entirely — every algebraic extension of F is separable, so every maximal subfield already qualifies. In characteristic p with F imperfect, maximal subfields can be purely inseparable, and (15.12) is the guarantee that they are not all of that kind.

One separable element is not enough

Noether–Jacobson gives an element; (15.12) gives a whole subfield of the right size. The gap between them is bridged by the double centralizer identity, which is what allows the argument to be applied again inside the centralizer rather than only once inside D.

06Key Results

Theorem(15.12)Existence of separable maximal subfields

Let D be a centrally finite division ring with centre F. Then:

  1. D has a maximal subfield K which is separable over F;
  2. more precisely, every subfield E⊆D that is separable over F is contained in a maximal subfield K⊆D separable over F.

Such a K has dimFK=r where dimFD=r2, by the degree criterion of (15.8).

Proof

Statement (1) is the case E=F of statement (2), so we prove (2).

**Choice of K.** Among the subfields of D that contain E and are separable over F, choose one, K, of largest F-dimension. This is possible because all such subfields are F-subspaces of the finite-dimensional space D, so their dimensions form a bounded set of positive integers.

**Claim: K is a maximal subfield of D.** Suppose not. Put L:=CD(K). By (15.7), failure of maximality means L⊋K. Since dimFK≤dimFD<∞, the Double Centralizer Theorem (15.4) applies and gives CD(L)=K. Hence

Z(L)=L∩CD(L)=L∩K=K.

In particular L is a division ring whose centre is K, and L≠K=Z(L), so L is noncommutative. Moreover L is finite-dimensional over K, hence certainly algebraic over K.

Apply Noether–Jacobson. By (15.11) applied to the noncommutative division ring L, algebraic over the field K⊆Z(L), there exists z∈L∖K separable over K. Then K(z) is a separable extension of K, and K is separable over F by choice; by transitivity of separability, K(z) is separable over F.

But K(z) is a subfield of D containing E, separable over F, with K(z)⊋K and hence of strictly larger F-dimension. This contradicts the choice of K. Therefore K is a maximal subfield of D, separable over F and containing E.

Corollary—A separable primitive element

Let D be centrally finite of degree r over F. Then there is α∈D with F(α) a maximal subfield, separable of degree r over F; consequently α has a separable minimal polynomial over F of degree exactly r.

Proof. Take K as in (15.12); K/F is finite separable, so the primitive element theorem gives K=F(α), and dimFK=r by (15.8). This corollary is the input to the Brauer–Albert basis theorem (15.16).

Corollary—Splitting by a Galois extension

Let D be centrally finite with centre F. Then D is split by a finite separable extension of F, and hence by a finite Galois extension: if K is a separable maximal subfield then D⊗FK≅Mr(K) by (15.8), and any field containing a splitting field is again a splitting field, so the Galois closure of K/F splits D too.

Consequently the Brauer group of F is the union of the relative Brauer groups Br(M/F) over finite Galois extensions M/F, and every Brauer class is represented by a crossed product algebra. This does not say that D itself is a crossed product — Amitsur constructed central division algebras with no Galois maximal subfield.

Remark—The limits of the argument

Every step past the choice of K consumes finite dimensionality: the Double Centralizer Theorem requires dimFK<∞, and the existence of a maximal separable subfield requires bounded dimensions. For an algebraic — but centrally infinite — division algebra the argument gives nothing, and Lam records the existence of a separable maximal subfield in that generality as an open question.

07Proof Techniques and Method

The reusable moves behind this proof.

Move 1

Maximise the property, then prove maximality

Do not try to build the object directly. Choose something maximal with respect to the desired property — separability — and then show that maximality for the property forces maximality outright.

Move 2

Descend into the centralizer

The centralizer of a subfield is again a division algebra, and the double centralizer identity makes the subfield its exact centre. This converts one problem about (K,D) into the same problem about (Z(L),L), one level down.

Move 3

Export by transitivity

An improvement obtained over K is useless unless it is an improvement over F. Transitivity of separability is the bridge, and it is the only property of separability the proof actually needs.

The same three-step shape recurs whenever one wants a maximal subfield with a prescribed property P: check that P is preserved by composita, that the centralizer construction stays inside the category, and that P is transitive. Galois-ness fails the first test, which is exactly why the Galois analogue of (15.12) is false.

08Worked Example

A degree-p algebra with maximal subfields of both kinds

Let k be a field of characteristic p>0 and F=k(s,t) the rational function field in two independent variables. Let K=F(u) where up−u=s: this is an Artin–Schreier extension, cyclic of degree p over F, with Galois group generated by σ:u↦u+1. Build the cyclic algebra

D=⨁i=0p−1Kvi,vp=t,vav−1=σ(a)(a∈K),so vuv−1=u+1.
(E.1)

A cyclic algebra of degree p over F=k(s,t), of dimension p2 over its centre.

**Why D is a division ring.** A cyclic algebra (K/F,σ,t) is a division algebra exactly when t is not a norm from K. Give F the t-adic valuation vt with vt(t)=1. Because s is a t-adic unit, the Artin–Schreier extension K/F is unramified at vt with residue degree p, so every norm from K has vt-value divisible by p. Since vt(t)=1, t is not a norm, and D is a division algebra of degree p.

Two maximal subfields of the same algebra
SubfieldDefining relationDegree over FTypeMaximal?
F(u)up−u=spseparable, cyclic Galoisyes
F(v)vp=tppurely inseparableyes
F—1trivially separableno

Both have degree p=dimFD, so both are maximal by the degree criterion of (15.8). The first is separable — indeed Galois — over F; the second is purely inseparable, since xp−t is irreducible over F and has v as its only root. So a division algebra can contain maximal subfields of both types simultaneously, and (15.12) is precisely the assurance that the separable type is always available.

Consistency check

CD(F(u))=F(u) and CD(F(v))=F(v), as maximality requires. The dimension formula reads p⋅p=p2=dimFD in both cases, and D⊗FF(u)≅Mp(F(u)) exhibits the separable maximal subfield as a splitting field.

The characteristic-zero case is vacuous

For D=ℍℚ every maximal subfield is a quadratic field, automatically separable over ℚ. The theorem is true but says nothing new. Its real function is to protect arguments in characteristic p, where the automatic step is not available.

09Process and Workflow

Start from what you haveAny subfield E separable over F — possibly just F itself, or a field you need to contain.
Maximise separablyEnlarge E within the separable subfields until the F-dimension can grow no further. Finite dimensionality guarantees this terminates.
Compute the centralizerForm L=CD(K). If L=K, K is already a maximal subfield and you are done.
Recurse if it is notIf L⊋K, then Z(L)=K and L is noncommutative; Noether–Jacobson produces a separable element of L outside K, contradicting maximality. So this branch never occurs.
Read off the degreeThe resulting K has dimFK=r and splits D: D⊗FK≅Mr(K).

You need a maximal subfield with a specific property. Which are available?

Separable over FAlways available for centrally finite D, by (15.12).
Galois over FNot always. Available iff D is a crossed product; Amitsur produced central division algebras where it fails.
Cyclic over FRarer still. Available for degree 2 and 3 by Wedderburn's theorem on algebras of degree three, and over local and global fields, but not in general.
Purely inseparableOnly in characteristic p, and only for special algebras; it is never guaranteed.

10Comparison and Classification

How much structure can be demanded of a maximal subfield
Exists always?Splits DGives a presentation of D
Some maximal subfield●yes●yes○no
Separable over F●yes●yes◐partial
Galois over F○no●yes●yes
Cyclic over F○no●yes●yes
Purely inseparable○no●yes◐partial

How much structure can be demanded of a maximal subfield

The two imported theorems
Imported resultApplied toSuppliesHypothesis consumed
Double Centralizer (15.4)K⊆DCD(CD(K))=K, hence Z(L)=KdimFK<∞
Noether–Jacobson (15.11)L over Ka separable element of L∖KL noncommutative and algebraic over K
Maximal subfield theory (15.7), (15.8)K⊆Dmaximality ⇔ CD(K)=K; degree rdimFD<∞ for the degree statement
Transitivity of separabilityF⊆K⊆K(z)K(z)/F separablenone

11Relationship Map

(15.12) sits at a junction: it consumes the whole centralizer theory of the section and feeds the classification results that follow.

Centrally finite D with centre FdimFD=r2
Maximal subfieldsAll of degree r over F
Separable maximal subfieldsAlways exist, by (15.12)
Galois maximal subfieldsExist iff D is a crossed product — not always
(15.4)→(15.11)→(15.12)→(15.16) Brauer–Albert→Crossed products and Br(F)

12Applications and Industry Use

Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.

Brauer group

Galois cohomology becomes available

Because every class is split by a finite Galois extension, Br(F)≅H2(Gal(Fsep/F),Fsep×). Separability of the splitting field is what allows the Galois group — rather than some inseparable substitute — to appear.

Representation theory

Schur index computations

Determining the Schur index of a character means finding a small splitting field. (15.12) guarantees a separable one exists of degree equal to the index, which is what makes the search a finite problem over separable closures.

Computational algebra

Constructing splitting fields

Algorithms that split a central simple algebra look for an element generating a separable maximal subfield, then factor its minimal polynomial. In characteristic p the theorem guarantees the search is not futile.

Coding theory

Cyclic algebra code constructions

Space–time codes require a cyclic maximal subfield, a stronger demand than separability. (15.12) marks the boundary: separability is free, cyclicity must be engineered by choosing the algebra rather than discovered inside it.

13Computational Notes

Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.

  • For D given by structure constants over a field F of characteristic zero, a random element generates a maximal subfield with high probability: its minimal polynomial has degree r generically, and separability is automatic. One randomised element plus one minimal-polynomial computation therefore suffices.
  • In characteristic p the same random search can repeatedly hit purely inseparable or small-degree elements. (15.12) certifies that separable generators exist, but the proof is non-constructive, so implementations fall back on structured constructions such as symbol algebras.
  • Once a separable maximal subfield K=F(α) is known, the splitting isomorphism D⊗FK≅Mr(K) is computed by writing the left regular representation of D on itself as a right K-space — an r×r matrix computation over K.
  • Deciding whether a given central simple algebra has a Galois maximal subfield is far harder and is not a routine library operation; over number fields it is automatic, since every central division algebra over a number field is cyclic.

Why the number field case is easy

Over a number field, the Albert–Brauer–Hasse–Noether theorem makes every central division algebra cyclic, so a cyclic — hence Galois, hence separable — maximal subfield always exists and can be computed from the local invariants. The difficulty of (15.12) is invisible in that setting.

14Failure Modes and Common Mistakes

Not every maximal subfield is separable

The degree-p symbol algebra above has the purely inseparable maximal subfield F(v) with vp=t. Any argument that picks an arbitrary maximal subfield and then applies the primitive element theorem in the separable form is broken in characteristic p.

Separable does not mean Galois

(15.12) produces a separable maximal subfield, not a Galois one. The passage from separable to Galois requires taking a Galois closure, which leaves D — it splits D but is generally too large to embed. Crossed product presentations need the Galois field inside D, and that can fail.

Central finiteness is used twice

It bounds the dimensions so a maximal separable subfield exists, and it licenses the Double Centralizer Theorem. Dropping it leaves the statement open even for algebraic division algebras, as Lam explicitly notes.

  • Do not apply Noether–Jacobson to D over F and expect a separable *subfield of degree r*; it returns a single element, and the recursion into the centralizer is what turns that into a maximal subfield.
  • Do not forget to check that L is noncommutative before invoking Noether–Jacobson — that hypothesis is exactly what the failure of maximality provides.
  • Do not assume that a subfield separable over F of degree less than r is contained in a unique separable maximal subfield; the enlargement is far from unique.
  • Do not read the Galois-splitting corollary as saying that D is a crossed product; only some matrix ring over D carries that structure.

15Quick Reference

StatementD centrally finite ⇒ D has a maximal subfield separable over F
Stronger formAny separable subfield E extends to a separable maximal subfield
DegreedimFK=r where dimFD=r2
Key identityZ(CD(K))=CD(K)∩K=K
ToolsDouble Centralizer (15.4) and Noether–Jacobson (15.11)
ContentOnly in characteristic p with F imperfect
ConsequenceD is split by a finite Galois extension; Br(F) is a union of relative Brauer groups
Open in generalUnknown for algebraic, centrally infinite division algebras
Proof skeleton in four lines
StepContent
1Choose K⊇E separable over F of maximal F-dimension
2If K is not a maximal subfield, L=CD(K)⊋K and Z(L)=K
3L is noncommutative and algebraic over K, so (15.11) gives z∈L∖K separable over K
4K(z)/F is separable and larger than K — contradiction, so K is maximal

16Frequently Asked Questions

Why does the proof need the centralizer at all — why not apply Noether–Jacobson directly to D over F?

Applied to D over F it produces one separable element, giving a separable subfield of some degree, with no control on size. To grow that subfield one must know what commutes with it, and the double centralizer identity Z(CD(K))=K is what makes the centralizer a new division algebra with the old subfield as its exact centre, so the same theorem can be applied again one level down.

Does (15.12) hold for algebraic division algebras that are not centrally finite?

It is not known in that generality — Lam states the question explicitly and reports it open. The obstruction is structural: the proof consumes the Double Centralizer Theorem, which needs dimFK<∞, and there is no known substitute.

Can a central division algebra have only purely inseparable maximal subfields?

No, if it is centrally finite — that is exactly what (15.12) forbids. It can certainly have some, as the degree-p symbol algebra shows, but a separable one always coexists with them.

How does this relate to the crossed product problem?

Separable splitting fields make Galois cohomology available and show every Brauer class is represented by a crossed product. Whether the division algebra D itself contains a Galois maximal subfield is a strictly stronger question, answered negatively in general by Amitsur in 1972.

Where is transitivity of separability used, and could it be avoided?

At the final step, to see that K(z) — separable over K, which is separable over F — is separable over F. It cannot be avoided: the recursion produces improvements relative to K, and the maximality hypothesis is relative to F.

Is there an analogue for maximal subfields that are Galois, or cyclic?

No. Both fail: Amitsur's examples have no Galois maximal subfield, and even among crossed products not all are cyclic. The proof method breaks at the first move — being Galois over F is not preserved when a separable element is adjoined inside a centralizer.

17Related KEVOS Topics

Maximal SubfieldsA subfield of a division ring is maximal exactly when it is its own centralizer — and for a centrally finite D this forcThe Brauer–Albert TheoremA central division algebra of degree r has an F-basis of the shape ^i ^j — and after one right multiplication, of the shTensor Products and CentralizersWhen the ground field is exactly the centre of D, the tensor product D ⊗_F D' is completely transparent: the centralizDouble Centralizer TheoremMaking D a module over D ⊗_F K^op turns questions about a division subring K into density-theorem questions, and returnsAlgebraically Closed SubfieldsA noncommutative division ring that contains an algebraically closed field over which it is finite-dimensional is forced

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §15, result (15.12) (pp. 257–258).
  2. T. Y. Lam, A First Course in Noncommutative Rings, §15, results (15.4) and (15.11), the two theorems consumed by the proof.
  3. A. A. Albert, Structure of Algebras, American Mathematical Society Colloquium Publications 24, 1939, Chapter VII.
  4. N. Jacobson, Basic Algebra II, 2nd edition, W. H. Freeman, 1989, Chapter 4 (separable splitting fields and crossed products).
  5. P. K. Draxl, Skew Fields, London Mathematical Society Lecture Note Series 81, Cambridge University Press, 1983, Chapters 11–14.
  6. S. A. Amitsur, “On central division algebras”, Israel Journal of Mathematics 12 (1972), 408–420.

19AI Suggested Questions

  • Give the details of the argument that the cyclic algebra with relations up−u=s, vp=t, vuv−1=u+1 over k(s,t) is a division algebra.
  • Prove transitivity of separability for algebraic field extensions.
  • Show that a maximal subfield of a centrally finite division algebra that is purely inseparable over the centre forces the degree to be a power of the characteristic.
  • Describe Amitsur's construction of central division algebras that are not crossed products.
  • How is Br(F) identified with H2 of the absolute Galois group, and where does the existence of separable splitting fields enter?
  • What is known about maximal subfields of algebraic, centrally infinite division algebras?
  • Design an algorithm that, given structure constants for a central simple algebra in characteristic p, finds a separable maximal subfield.
Page
KEVOS-ENG-MATH-NCR-0118
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

On this page

  1. Executive Summary
  2. Overview
  3. Learning Objectives
  4. Definitions
  5. Core Concepts
  6. Key Results
  7. Proof Techniques and Method
  8. Worked Example
  9. Process and Workflow
  10. Comparison and Classification
  11. Relationship Map
  12. Applications and Industry Use
  13. Computational Notes
  14. Failure Modes and Common Mistakes
  15. Quick Reference
  16. Frequently Asked Questions
  17. Related KEVOS Topics
  18. References
  19. AI Suggested Questions

Continue learning

Division Rings Containing an Algebraically Closed FieldArticle · Engineering MathematicsNEXT LESSON →Radical Extensions and Kaplansky’s TheoremArticle · Engineering MathematicsMaximal Subfields of Division RingsArticle · Engineering MathematicsThe Brauer–Albert Theorem on Conjugate Maximal SubfieldsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®