KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Niven–Jacobson Theorem: Roots over Quaternion AlgebrasEngineering · Engineering MathematicsLesson 454/884← PrevNext →
ArticlePublished 8 Aug 202621 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIThe Niven–Jacobson Theorem: Roots over Quaternion Algebras

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Advanced Polynomial equations

The Niven–Jacobson Theorem

Over the quaternions built on a real-closed field, every nonconstant polynomial has a root — and the root set is always a finite union of isolated points and full conjugacy classes, with a sharp criterion telling the two cases apart.

Page ID
KEVOS-ENG-MATH-NCR-0126
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(16.14), (16.17)–(16.20), §16 (pp. 272–274)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

Let R be a real-closed field and D=R⊕Ri⊕Rj⊕Rk the quaternion division ring over R. The Niven–Jacobson theorem (16.14) says D is right and left algebraically closed: every nonconstant f∈D[t] has a right root, hence splits completely into linear factors.

The proof is a two-line reduction to the commutative case. Quaternionic conjugation is an anti-automorphism, so ff¯ has coefficients in R; a root of that real polynomial lives in the algebraically closed field R(i), and the conjugation rule (16.3) converts it into a root of f itself — or, in the bad case, into a left root, which an induction on degree disposes of.

The remaining results make the root set explicit. (16.18) gives three equivalent tests for infinitely many roots, all reducible to the presence of an irreducible real quadratic right factor; (16.19)–(16.20) isolate the family with a guaranteed finite count, including the equation tn=a, which has exactly n solutions whenever a is not central.

degf≥1Always has a root
2nDegree of ff¯ over R
nSolutions of tn=a, a∉R
1941Niven

02Overview

A field is algebraically closed if every nonconstant polynomial has a root. For a division ring the definition has to pick a side, because roots do: D is right algebraically closed if every nonconstant f∈D[t] has a right root. By the remainder theorem (16.2) this is equivalent to every f∈D[t] splitting into a product of linear factors.

The quaternions over ℝ are the model case, and Niven's 1941 solution of quaternionic polynomial equations is the model proof. Jacobson's contribution places it in the general theory. The converse — that these are the only noncommutative centrally finite examples — is Baer's theorem, treated on Right Algebraically Closed Division Rings.

f∈D[t],degf=n≥1⟹f(t)=an(t−cn)(t−cn−1)⋯(t−c1)for some ci∈D,
(16.14)

R real-closed, D the quaternions over R. The ci are not the roots of f; only c1 is.

The one thing to remember

Multiply by the conjugate. ff¯∈R[t] turns a quaternionic problem into a real one, and (16.3) carries the answer back. Every proof on this page uses that move.

Following Lam, R denotes the real-closed base field throughout this page, not a general ring. F=Z(D)=R.

03Learning Objectives

  • Verify that quaternionic conjugation is an anti-automorphism with fixed set R, and that fg¯=g¯f¯.
  • Show ff¯∈R[t] and use it to find a root of f by induction on degree.
  • Prove the quadratic-class lemma (16.17) and use it in both directions of (16.18).
  • Decide from the coefficients whether a quaternionic polynomial has finitely or infinitely many roots.
  • Prove that tn=a has exactly n solutions for a∈D∖R and explain why a∈R is different.
  • Run Niven's procedure for finding all roots once one root is known.

04Definitions

Definition§16Right and left algebraically closed

A division ring D is right algebraically closed if every nonconstant f∈D[t] has a right root in D; equivalently, by (16.2), every f∈D[t] is a product of linear factors in D[t]. Left algebraically closed is defined by the mirror condition, evaluating with the variable on the left. For centrally finite division rings the two notions coincide.

q¯
For q=a+bi+cj+dk, the conjugate a−bi−cj−dk. Then q1q2¯=q¯2q¯1 and q¯=q exactly when q∈R.
N(q) and tr(q)
The norm q¯q=a2+b2+c2+d2∈R and the trace q+q¯=2a∈R. Every q satisfies q2−tr(q)q+N(q)=0.
f¯
For f=∑rartr, the polynomial ∑ra¯rtr. Then fg¯=g¯f¯ in D[t].
R(i)
The subfield R⊕Ri⊆D; it is the algebraic closure of R by the Artin–Schreier theorem, since R is real-closed.
Quadratic class
A conjugacy class whose minimal polynomial over the centre has degree 2. In D every noncentral class is quadratic.

R real-closed forces charR=0 and makes a2+b2+c2+d2 nonzero for (a,b,c,d)≠0, which is why D is a division ring.

05Core Concepts

Conjugation turns quaternionic polynomials into real ones

Quaternionic conjugation is R-linear and reverses products, and its fixed set is exactly R. Extending it coefficientwise to D[t] gives fg¯=g¯f¯. Applying this to ff¯ shows ff¯¯=ff¯, so all coefficients of ff¯ are fixed by the bar:

ff¯=f¯f∈R[t],deg(ff¯)=2degf.
(16.14a)

The two products agree because both are central in D[t] and D[t] is a domain. The degree is exact because the leading coefficient is N(an)≠0.

f∈D[t]⟹ff¯∈R[t]⟹root α∈R(i)⟹root of f in D

Every noncentral class is quadratic

Each q∈D satisfies q2−tr(q)q+N(q)=0 with tr(q),N(q)∈R. So every element of D is algebraic of degree at most 2 over R, and a noncentral q has minimal polynomial exactly λ(t)=t2−tr(q)t+N(q), irreducible over R because its discriminant tr(q)2−4N(q) is negative in the ordering of R.

Why this makes the root structure so rigid

Because every class is quadratic, a polynomial that meets a class twice is divisible on the right by a real quadratic. Divisibility by a central polynomial is an extremely strong condition, and it is what forces the all-or-nothing behaviour recorded in (16.18).

Geometrically: the noncentral conjugacy classes of D are the spheres {q:tr(q)=2a,N(q)=a2+b2}, and the root set of any nonzero f is a finite union of isolated points and complete spheres.

06Key Results

Theorem(16.14)Niven–Jacobson

Let R be a real-closed field and let D be the division ring of quaternions over R. Then D is right algebraically closed, and also left algebraically closed.

Proof

Induct on n=degf≥1. For n=1, f=a1t+a0 with a1≠0 has the right root −a1−1a0. Let n≥2.

By (16.14a), ff¯∈R[t] has degree 2n≥2. Since R is real-closed, R(i) is algebraically closed, so ff¯ has a root α∈R(i)⊆D.

**Case 1: f¯(α)≠0.** Apply the conjugation rule (16.3) to the factorisation ff¯=f⋅f¯ at d=α, with a=f¯(α). It gives 0=(ff¯)(α)=f(aαa−1)a, so aαa−1 is a right root of f and we are done.

**Case 2: f¯(α)=0.** Write f=∑rartr, so ∑ra¯rαr=0. Applying the anti-automorphism q↦q¯ to this identity reverses each product and gives ∑rα¯rar=0; that is, β:=α¯ is a left root of f. By the left-handed form of (16.2) we may write f(t)=(t−β)g(t) with degg=n−1.

By the inductive hypothesis g has a right root γ∈D. Writing g=∑ibiti, we get f(γ)=∑ibiγi+1−∑iβbiγi=g(γ)γ−βg(γ)=0. So γ is a right root of f. The statement for left roots follows by the mirror argument, or by applying the result to Dop, which is isomorphic to D via quaternionic conjugation.

Lemma(16.17)Two roots in a quadratic class

Let D be a division ring with centre F and let A be a conjugacy class of D whose minimal polynomial λ∈F[t] is quadratic. If f∈D[t] has two distinct roots in A, then f∈D[t]⋅λ and f vanishes identically on A.

Proof

Divide on the right by the monic λ: f=qλ+(at+b) with a,b∈D. By (16.6) the product qλ vanishes on all of A, so at+b vanishes at the two given distinct elements of A. A nonzero polynomial of degree at most 1 over a division ring has at most one root, so a=b=0. Hence f=qλ∈D[t]λ, and f(A)=0 by (16.6) again.

Proposition(16.18)Niven's criteria for infinitely many roots

Let R be real-closed, D the quaternions over R, and f∈D[t] nonzero. The following are equivalent:

  1. f has infinitely many roots in D;
  2. there exist a,b∈R with b≠0 such that f(a+bi)=f(a−bi)=0;
  3. f has a right factor λ∈R[t] which is an irreducible quadratic.

When these hold, f vanishes identically on the conjugacy class of a+bi.

Proof

**(1) ⇒ (3).** By the class bound (16.4) the roots of f lie in at most degf conjugacy classes, so infinitely many roots force some class A to contain two of them. Then A is not a singleton, so it is noncentral and its minimal polynomial λ∈R[t] is an irreducible quadratic. By (16.17), f∈D[t]λ and f(A)=0.

**(3) ⇒ (1).** Let ζ∈R(i) be a root of λ; since λ is irreducible over R, ζ∉R, so ζ is noncentral in D and by Herstein's theorem (13.26) has infinitely many conjugates. All of them are roots of λ, because λ has central coefficients, and hence roots of f=hλ by (16.2).

**(3) ⇒ (2).** The roots of an irreducible quadratic λ∈R[t] inside the algebraically closed field R(i) are a pair a±bi with a,b∈R, b≠0; both are roots of λ, hence of f.

**(2) ⇒ (3).** The elements a+bi and a−bi are distinct and conjugate in D, since j(a+bi)j−1=a−bi. They therefore lie in a common class whose minimal polynomial is λ(t)=t2−2at+(a2+b2), irreducible over R because b≠0. Now (16.17) gives f∈D[t]λ.

Proposition(16.19)Central coefficients except the constant term

Let R be real-closed, D the quaternions over R, and f(t)=∑i=0naiti∈D[t] with an≠0, a1,…,an∈R and a0∈D∖R. Then f has at most n roots in D.

Proof

Let α∈D be a root, so ∑i=1naiαi=−a0. Every ai with i≥1 is central, so the left-hand side is a polynomial expression in α alone and therefore commutes with α. Hence α commutes with a0, i.e. α∈CD(a0).

Since a0∉R=Z(D), the field R(a0) is a maximal subfield of D, of dimension 2 over R, and for the quaternion algebra CD(R(a0))=R(a0) — the double centraliser property for maximal subfields of a centrally finite division ring. So every root of f lies in the field R(a0). But all coefficients of f lie in R(a0) as well, so f may be read as a polynomial of degree n over that field, where it has at most n roots.

Corollary(16.20)Niven: n-th roots of a noncentral quaternion

Let R be real-closed, D the quaternions over R, and a∈D∖R. Then the equation tn=a has exactly n solutions in D, all lying in the field R(a).

Proof

Apply (16.19) to f(t)=tn−a: the coefficients 1,0,…,0 are in R and the constant term −a lies in D∖R. So there are at most n roots and all lie in R(−a)=R(a). That field is R-isomorphic to R(i), hence algebraically closed, and charR=0 makes tn−a separable — its derivative ntn−1 shares no root with it since a≠0. A separable polynomial of degree n over an algebraically closed field has exactly n distinct roots.

07Proof Techniques and Method

How these proofs work, and which move to reuse.

Move 1

Norm down to the centre

Multiplying by the conjugate polynomial produces a central polynomial of twice the degree. This is the polynomial analogue of the reduced norm, and it is the only bridge between D[t] and R[t] available.

Move 2

Trade a left root for a right root

The bad case of the induction produces a left root. Peeling off (t−β) on the left and inducting on the degree converts it into a right root of the original polynomial — a genuinely noncommutative manoeuvre with no field analogue.

Move 3

Centralise using central coefficients

In (16.19) the hypothesis that a1,…,an are central makes every root commute with the constant term, collapsing the search space from D to a single maximal subfield.

Move 3 is the reusable one. Whenever all but one coefficient is central, the equation forces its solutions into the centraliser of the exceptional coefficient, and for a centrally finite division ring that centraliser is a field. The problem then becomes commutative.

The role of real-closedness

Two distinct uses. It makes R(i) algebraically closed, which supplies the root α; and it makes sums of squares nonzero, which makes D a division ring at all. Weakening to formally real keeps the second and destroys the first.

08Worked Example

Square roots of i in ℍ

Take R=ℝ, D=ℍ, a=i∉ℝ, and n=2. By (16.20) the equation t2=i has exactly two solutions, both in ℝ(i)=ℂ. Solving there:

t=±22(1+i),(1+i2)2=1+2i+i22=i.
(E.1)

Exactly two solutions in the whole of ℍ — no quaternionic solutions outside ℂ.

The hypothesis a∉R is doing real work

For a=−1∈ℝ, the equation t2=−1 has an entire two-sphere of solutions. (16.19) does not apply because the constant term is central, and the centralising argument collapses.

Deciding finiteness from a factorisation

Consider f1(t)=t2+1 and f2(t)=t2−(1+i)t+i over ℍ.

  • f1 is an irreducible real quadratic, so it is its own right factor and criterion (3) of (16.18) holds: infinitely many roots — the sphere of unit imaginary quaternions. Criterion (2) is visible too: f1(±i)=0 with a=0, b=1.
  • f2=(t−1)(t−i) has roots exactly 1 and i, a finite set, so by (16.18) it has no irreducible real quadratic right factor. Indeed the only candidate would be t2+1, and f2≠t2+1 while both are monic of degree 2.

Applying the theorem to a cubic

Let f(t)=t3−(1+i)t2+it, the Bray–Whaples polynomial for the nodes 0,1,i. Its roots are exactly 0,1,i — three isolated points, no spheres — so by (16.18) it has no irreducible real quadratic right factor. Consistently with (16.14) it does split completely: f(t)=(t−1)(t−i)t, a product of three linear factors, even though only the rightmost supplies a root of f directly.

Sanity check against the class bound

Degree 3, roots in 3 distinct classes — the maximum allowed by (16.4) — and finitely many roots, permitted by (16.12) since |Γ|=3≤3.

09Process and Workflow

Niven's procedure for finding all roots of f∈D[t] once a single root a is known.

A root a of f has been found. What next?

a∈R (central)Write f(t)=g(t)(t−a) and continue with g, whose degree is one lower. No conjugates need to be considered: the class of a is the singleton {a}.
a∉R and some conjugate a′≠a also satisfies f(a′)=0By (16.17), f(t)=h(t)λ(t) with λ the minimal polynomial of a over R. The entire conjugacy class of a consists of roots; deflate by λ and continue with h.
a∉R and f(a′)≠0 for a conjugate a′≠aThe class of a contributes exactly one root, namely a. Deflate by t−a and look for roots in other classes.
Form the real polynomialCompute ff¯∈R[t] of degree 2degf; its roots in R(i) enumerate the candidate conjugacy classes.
Test each candidate classFor a candidate α=a+bi with b≠0, decide whether λ(t)=t2−2at+(a2+b2) right-divides f.
Sphere or pointIf λ divides, the whole class is a root set; if not, (16.3) recovers the single root of that class as f¯(α)αf¯(α)−1.
Deflate and repeatDivide out the linear or quadratic factor found and restart with the quotient, whose degree has dropped by one or two.

10Comparison and Classification

Root behaviour of quaternionic polynomials by coefficient pattern
Polynomial f∈D[t], degf=nRoot setReference
All coefficients in R, no repeated real irreducible quadratic factorreal roots as points, complex conjugate pairs as full spheres(16.18)
Some irreducible quadratic λ∈R[t] right-divides finfinite: contains the whole class of the roots of λ(16.18)
a1,…,an∈R and a0∈D∖Rat most n points, all inside the field R(a0)(16.19)
f(t)=tn−a with a∈D∖Rexactly n points, all in R(a)(16.20)
f a product of linear factors with pairwise nonconjugate rootsexactly n isolated points(16.13)
General nonzero ffinite union of points and spheres; nonempty if n≥1(16.14), (16.4)
Which properties transfer from ℂ to the quaternions over a real-closed field
Algebraically closed fieldQuaternions over real-closed R
Every nonconstant polynomial has a root●yes●yes
Every polynomial splits into linear factors●yes●yes
Factorisation into linear factors is unique●yes○no
At most degf roots●yes○no
Root set is finite●yes○no
Left and right roots coincide●yes○no

Which properties transfer from ℂ to the quaternions over a real-closed field

11Relationship Map

Artin–Schreier: R(i) closed⟹(16.14) Niven–Jacobson⟹(16.15) Baer converse⟹(16.16) classification
  • Right Algebraically Closed Division Rings supplies the converse: a noncommutative centrally finite division ring in which every central polynomial has a root must be of this form.
  • The Gordon–Motzkin Theorem supplies the class bound used at the start of (16.18) and the dichotomy that makes finite or infinite the only options.
  • Vanishing Polynomials supplies (16.6), without which (16.17) has no proof.
  • Generalised Quaternion Algebras gives the structure theory of D itself, including the maximal subfields used in (16.19).
  • The Bray–Whaples Theorem supplies the extremal examples with exactly n isolated roots.

12Applications and Industry Use

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

  • Quaternionic root finding. Attitude and orientation computations in robotics and aerospace occasionally require solving quaternionic polynomial equations; (16.18) is the test that decides whether the solution set is a discrete set of orientations or a continuous family, which is a design-relevant distinction.
  • Roots and powers of rotations. (16.20) says a noncentral unit quaternion has exactly n distinct n-th roots, all in the complex line it spans. This is the algebraic content of the fact that a rotation about a fixed axis has exactly n n-th roots about the same axis.
  • Slice-regular function theory. The structure of zero sets — isolated points together with isolated spheres — is inherited by quaternionic slice-regular functions, where the polynomial case treated here is the model.
  • **Numerical linear algebra over ℍ.** Eigenvalue problems for quaternionic matrices have right eigenvalues occurring in full conjugacy classes; the same all-or-nothing phenomenon and the same ff¯ reduction underlie the standard algorithms.

Honest summary: within mathematics the theorem is a classification tool. Outside it, the practical content is (16.18) and (16.20), which are the statements an implementation actually needs.

13Computational Notes

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

  • The ff¯ reduction costs O(n2) quaternion multiplications and turns the problem into finding the 2n complex roots of a real polynomial — a standard numerical task.
  • Each candidate class needs one right-division test by a real quadratic, at cost O(n); the whole algorithm is O(n2) after the complex root finding.
  • Deflation must be right division. Left division by t−c does not preserve the remaining root set.
  • Conditioning: a class contributing a single root is recovered by a conjugation f¯(α)αf¯(α)−1, which is ill-conditioned when f¯(α) is small — precisely when the polynomial is near the sphere case. Implementations should test divisibility with a tolerance rather than trusting the conjugation blindly.
  • Symbolically, Sage and Magma provide quaternion algebras over number fields and can perform the divisibility tests exactly; there is no general routine for arbitrary division rings, and there cannot be one.

The real-closed hypothesis is not checkable numerically

Everything here presumes an exact real-closed base field. Over floating-point approximations to ℝ the dichotomy finite or infinite is not decidable: an isolated root and a sphere differ by an arbitrarily small perturbation of the coefficients.

14Failure Modes and Common Mistakes

Algebraically closed does not mean at most n roots

D is right algebraically closed yet t2+1 has a two-sphere of roots. The property being asserted is the existence of a root, not uniqueness of factorisation or a bound on the root count. Both of the latter fail.

(16.19) requires the constant term to be noncentral

If a0∈R as well, the whole polynomial is central and its root set is a union of full classes — potentially infinite. The proposition's conclusion is false in that case, as t2+1 shows.

Left roots and right roots are different sets

The proof of (16.14) explicitly manufactures a left root in its bad case and then converts it. Do not read left and right algebraically closed as saying the two root sets coincide for a given polynomial; it says both existence statements hold.

  • Do not apply (16.14) to a general quaternion algebra (a,bK); the base field must be real-closed and the algebra the standard (−1,−1) one over it.
  • Do not assume ff¯ and f¯f differ — they are equal and both lie in R[t] — but do keep track of which factor you apply (16.3) to.
  • Do not conclude from f(a)=0 with a∉R that all conjugates of a are roots; that requires a second root in the class, which is exactly the test in (16.18).
  • Do not expect the classification to extend to centrally infinite division rings: the algebraically closed ones there are not understood.

15Quick Reference

SettingR real-closed, D=R⊕Ri⊕Rj⊕Rk, Z(D)=R
Conjugationq1q2¯=q¯2q¯1, fixed set R
Norm polynomialff¯=f¯f∈R[t], degree 2degf
Niven–Jacobsonevery nonconstant f∈D[t] has a right root
Quadratic class lemmatwo roots in a class ⇒f∈D[t]λ
Infinitely many roots⇔ an irreducible λ∈R[t] right-divides f
Finite familya1,…,an∈R, a0∉R ⇒ at most n roots
n-th rootstn=a, a∉R: exactly n solutions, all in R(a)
Statements and hypotheses
ReferenceHypothesesConclusion
(16.14)R real-closed, D quaternions over RD is right and left algebraically closed
(16.17)D any division ring, class A with quadratic minimal polynomial λ, f with two roots in Af∈D[t]λ and f(A)=0
(16.18)R real-closed, D quaternions over R, f≠0infinitely many roots ⇔ two conjugate roots ⇔ irreducible real quadratic right factor
(16.19)a1,…,an∈R, a0∈D∖R, an≠0at most n roots, all in R(a0)
(16.20)a∈D∖Rtn=a has exactly n solutions, all in R(a)

16Frequently Asked Questions

How can a division ring be algebraically closed and still have a polynomial with infinitely many roots?

Algebraic closure asserts existence of a root, nothing more. Over a field, existence plus the degree bound gives the familiar picture; over D the degree bound fails because noncentral conjugacy classes are infinite. So t2+1 has a root — in fact a two-sphere of them — and both facts are consistent.

Why does the proof need to detour through left roots?

Because the root α of ff¯ may happen to kill f¯ rather than f, and then the conjugation rule (16.3) gives no information about f. Conjugating the resulting identity turns f¯(α)=0 into a statement that α¯ is a left root of f, which peels off a left linear factor and lets the induction proceed.

Does the theorem hold for a general quaternion algebra over a general field?

No. Two hypotheses are needed: the base field must be real-closed, so that adjoining a square root of −1 gives an algebraically closed field; and the algebra must be the standard quaternion algebra, which is then a division ring because sums of squares are nonzero. Over ℚ, for instance, the rational quaternions are very far from algebraically closed.

Why does tn=a behave so differently for central and noncentral a?

For noncentral a, every solution must commute with a by (16.19), which confines it to the maximal subfield R(a) — a commutative problem with exactly n answers. For central a the constraint is vacuous, the whole polynomial is central, and its root set is a union of full conjugacy classes, hence typically infinite.

Is the root set of a quaternionic polynomial always a union of points and spheres?

Yes. By (16.4) it meets at most degf conjugacy classes; by (16.17) a class contributing two roots contributes the whole class; and the noncentral classes of D are exactly the spheres tr=c1, N=c2. So each class contributes nothing, one point, or one sphere.

Who proved what?

Niven solved quaternionic polynomial equations over ℝ in 1941, and Eilenberg and Niven gave a topological proof of the fundamental theorem of algebra for quaternions in 1944. Jacobson's contribution is the algebraic formulation over an arbitrary real-closed base. Lam's proof of (16.14) is a simplification of Niven's original argument.

17Related KEVOS Topics

Quaternion AlgebrasFor a,b ∈ F^× with char F ≠ 2, the algebra (a,bF) with i^2=a, j^2=b, ij=-ji is central simple of dimension 4 — and it isAlgebraically Closed Division RingsA noncommutative division ring finite-dimensional over its centre in which every central polynomial has a root must be aPolynomials over Division RingsIn D[t] the indeterminate is central but the coefficients are not, so substituting an element of D for t is no longer a The Gordon–Motzkin TheoremOver a division ring a polynomial of degree n may have infinitely many roots, but those roots always fit inside at most Vanishing PolynomialsA single conjugation-and-subtract argument determines every polynomial that vanishes on a conjugacy class of a division

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §16, (16.14) and (16.17)–(16.20) (pp. 269–274).
  2. I. Niven, “Equations in quaternions”, American Mathematical Monthly 48 (1941), 654–661.
  3. S. Eilenberg and I. Niven, “The fundamental theorem of algebra for quaternions”, Bulletin of the American Mathematical Society 50 (1944), 246–248.
  4. N. Jacobson, The Theory of Rings, Mathematical Surveys 2, American Mathematical Society, 1943.
  5. P. K. Draxl, Skew Fields, London Mathematical Society Lecture Note Series 81, Cambridge University Press, 1983.
  6. N. Jacobson, Basic Algebra I, 2nd edition, W. H. Freeman, 1985, for the Artin–Schreier theory of real-closed fields.

19AI Suggested Questions

  • Compare the algebraic proof of (16.14) with the Eilenberg–Niven topological degree argument, and identify what each needs that the other does not.
  • Compute all roots of a specific quaternionic cubic with one real and one nonreal coefficient.
  • How does (16.18) generalise to octonions, where associativity fails?
  • What is the analogue of (16.20) for the exponential and logarithm of a quaternion?
  • Describe the zero set of a polynomial in two noncommuting quaternionic variables — is there any analogue of the point-or-sphere dichotomy?
  • Give an algorithm that computes the exact root set of f∈ℍ[t] over a number field, with a complexity analysis.
Page
KEVOS-ENG-MATH-NCR-0126
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

The Bray–Whaples Theorem and InterpolationArticle · Engineering MathematicsNEXT LESSON →Right Algebraically Closed Division RingsArticle · Engineering MathematicsWedderburn’s Factorisation TheoremArticle · Engineering MathematicsOrdered Rings and Positive ConesArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®