KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Reduced Norm of a Cyclic AlgebraEngineering · Engineering MathematicsLesson 438/884← PrevNext →
ArticlePublished 8 Aug 202624 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIThe Reduced Norm of a Cyclic Algebra

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Advanced Classical constructions

Reduced Norms

A determinant turns the cyclic algebra (K/F,σ,a) into arithmetic: the reduced norm n:D→F detects units, and its polynomial shadow on K[t;σ] proves Wedderburn's criterion that D is a division algebra whenever a has order s modulo norms.

Page ID
KEVOS-ENG-MATH-NCR-0110
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(14.9)–(14.13), §14 (pp. 236–239)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

A cyclic algebra D=(K/F,σ,a) of degree s is a left K-vector space of dimension s with basis 1,x,…,xs−1. Right multiplication by α∈D is a K-linear map of that space; its determinant is the reduced norm n(α), which lands in F and is multiplicative.

The reduced norm does two jobs. It converts invertibility into a determinant condition — α is a unit exactly when n(α)≠0 — and, in a polynomial version over the skew polynomial ring K[t;σ], it proves Wedderburn's criterion: if the class of a in F×/NK/F(K×) has order exactly s, then D is a division algebra. The same matrix also exhibits K as a splitting field, D⊗FK≅Ms(K).

n:D→FReduced norm
n(α)≠0Unit criterion
order sWedderburn's hypothesis on a
1914Wedderburn

02Overview

For prime degree, deciding whether (K/F,σ,a) is a division algebra is easy: it is one exactly when a is not a norm. For composite degree the criterion fails, because Wedderburn–Artin allows intermediate matrix sizes. Wedderburn's 1914 answer replaces "not a norm" by a statement about the order of a in the quotient group F×/NK/F(K×).

a,a2,…,as−1∉NK/F(K×)⟹(K/F,σ,a)is a division algebra.
(14.9)

Note that as=NK/F(a) automatically, so the order of the class of a always divides s; the hypothesis is that it is as large as possible.

The modern proof is cohomological. Lam gives instead the classical argument, following Dickson with simplifications due to Tignol, and its engine is an elementary but non-obvious device: a determinant defined on the skew polynomial ring B=K[t;σ], regarded as a free module of rank s over the central polynomial ring K[z] with z=ts.

The one thing to remember

One determinant does everything. On B=K[t;σ] it converts a factorisation of z−a into a norm equation and proves (14.9). Specialised at z=a it becomes the reduced norm on D, detects units, and realises D inside Ms(K).

This page is the technical heart of the classical treatment. The statements it supports — the splitting criterion, the structure of D, the prime-degree corollary — are on Cyclic Algebras; the degree-2 specialisation, where the reduced norm becomes a quadratic form, is on Generalised Quaternion Algebras.

03Learning Objectives

  • Set up B=K[t;σ] as a free left K[z]-module of rank s, z=ts.
  • Write the matrix of right multiplication and define the polynomial norm n.
  • Prove n(β)∈F[z] and that its constant term is NK/F of the constant term of β0.
  • Prove Wedderburn's theorem (14.9) by applying n to a factorisation of z−a.
  • Specialise to D and prove α∈U(D)⇔n(α)≠0.
  • Deduce D⊗FK≅Ms(K) and read off the explicit matrices for x and for b∈K.
  • Compute the degree-3 reduced norm form and apply it to Dickson's example over ℚ.

04Definitions

Construction(14.9a)The polynomial norm on K[t;σ]

Let K/F be cyclic Galois of degree s with Gal(K/F)=⟨σ⟩, and let B=K[t;σ] with tb=σ(b)t. Put z=ts. Then z∈Z(B), the subring K[z] is a commutative polynomial ring, and B is a free left K[z]-module with basis 1,t,…,ts−1.

Right multiplication Rβ:γ↦γβ is a left K[z]-module endomorphism of B, because left multiplication by K[z] and right multiplication by β commute. Define n(β)=detRβ∈K[z].

Since det is multiplicative and Rββ′=Rβ′∘Rβ, we get n(ββ′)=n(β)n(β′).

Writing β=β0+β1t+⋯+βs−1ts−1 with βi∈K[z], and extending σ to B by σ(t)=t so that tβ=σ(β)t, the matrix of Rβ in the basis 1,t,…,ts−1 is

(β0β1β2⋯βs−1zσ(βs−1)σ(β0)σ(β1)⋯σ(βs−2)zσ2(βs−2)zσ2(βs−1)σ2(β0)⋯σ2(βs−3)⋮⋮⋮⋱⋮zσs−1(β1)zσs−1(β2)zσs−1(β3)⋯σs−1(β0))
(*)

Row i records tiβ=∑jσi(βj)ti+j, with ti+j replaced by zti+j−s whenever i+j≥s.

z
ts, a central element of B=K[t;σ] because σs=id.
n(β)
The determinant of (∗); an element of K[z], and in fact of F[z].
N
NK/F, the field norm c↦cσ(c)⋯σs−1(c).
degt, degz
Degree in t as an element of B; degree in z as a polynomial in K[z].
M(α)
For α∈D, the matrix of right multiplication by α on D in the left K-basis 1,x,…,xs−1.
Reduced norm n(α)
detM(α)∈F. It is the specialisation of the polynomial norm at z=a.

05Core Concepts

Why the determinant lands in F[z]

Two symmetries pin it down. Applying σ entrywise to (∗) produces the matrix of Rσ(β), so n(σ(β))=σ(n(β)). On the other hand tβ=σ(β)t gives n(t)n(β)=n(σ(β))n(t), and n(t)=(−1)s−1z≠0 in the domain K[z], so n(β)=n(σ(β)). Combining, σ(n(β))=n(β): the coefficients are σ-fixed, hence in F.

Why the constant term is a field norm

Set z=0 in (∗). The factor z occurs exactly in the entries strictly below the diagonal, so all of those vanish and what remains is upper triangular, with diagonal entries β0,σ(β0),…,σs−1(β0) evaluated at z=0. If b0 denotes the constant term of β0, the determinant at z=0 is therefore b0σ(b0)⋯σs−1(b0)=N(b0).

The norm was there all along

Restricting n to K⊆B gives exactly NK/F: for β=b∈K the matrix (∗) is diag(b,σ(b),…,σs−1(b)). The polynomial norm is therefore the unique multiplicative extension of the field norm from K to B that the module structure allows.

Specialising z↦a

The surjection B↠D=B/(ts−a) sends t↦x and z↦a. Under it, B as a free K[z]-module of rank s becomes D as a K-vector space of dimension s, and (∗) becomes the matrix M(α) with z replaced by a and βi by bi. This compatibility is the whole content of the commutative diagram Lam draws after (14.10).

F[z]⊆K[z]⊆B=K[t;σ]⟶z↦a,t↦x⟶F⊆K⊆D=⨁iKxi

06Key Results

Lemma(14.10)Properties of the polynomial norm

Let B=K[t;σ], z=ts, and β=β0+β1t+⋯+βs−1ts−1 with βi∈K[z].

  1. n(β)∈F[z], and the constant term of n(β) equals NK/F(b0), where b0 is the constant term of β0. In particular n|K=NK/F.
  2. If moreover every βi lies in K (so β is a polynomial in t of degree d=degtβ≤s−1), then degzn(β)=d, and if β is monic in t the leading coefficient of n(β) is (−1)d(s−1).
Proof

(1). From tβ=σ(β)t and multiplicativity, n(t)n(β)=n(σ(β))n(t). Direct inspection of (∗) for β=t gives n(t)=(−1)s−1z, a nonzero element of the integral domain K[z], so n(β)=n(σ(β)). Applying σ to every entry of (∗) turns it into the matrix for σ(β) — note σ(z)=z — so n(σ(β))=σ(n(β)). Hence n(β) is fixed by σ, i.e. n(β)∈F[z]. Setting z=0 in (∗) leaves a triangular matrix with diagonal β0(0),σ(β0)(0),…,σs−1(β0)(0), whose determinant is N(b0).

(2). With all βi∈K and β monic of degree d, set βd=1 and βi=0 for i>d in (∗). Each entry is either a constant or z times a constant, and the z's occur exactly in the strictly lower-left region. Expanding the determinant, the terms of top degree in z come from the permutation contributions using d of the z-entries, all of which involve the entries carrying βd=1; this yields degzn(β)=d with leading coefficient the sign of the corresponding permutation, namely (−1)d(s−1).

Theorem(14.9)Wedderburn's division criterion

Let K/F be a cyclic Galois extension of degree s with Gal(K/F)=⟨σ⟩, and let a∈F×. Suppose the image of a in the abelian group F×/NK/F(K×) has order exactly s — equivalently, ad∉NK/F(K×) for every d with 1≤d≤s−1. Then D=(K/F,σ,a) is a division F-algebra.

Proof

Suppose not. Write D=B/(z−a) with B=K[t;σ] and z=ts; note ts−a=z−a is central in B. Since D is simple artinian and not a division ring, it has a nonzero proper left ideal, whose preimage is a left ideal 𝔅 with (z−a)⊊𝔅⊊B.

B is a principal left ideal domain, so 𝔅=Bβ with β monic; scaling, write β=td+bd−1td−1+⋯+b0 with bi∈K. Counting F-dimensions, dimFB/Bβ=d⋅dimFK=ds, and 0<dimFB/𝔅<dimFD=s2 forces 1≤d≤s−1.

Since z−a∈Bβ, there is β′∈B with z−a=β′β. Apply the polynomial norm. Right multiplication by the central element z−a is multiplication by a scalar on a free module of rank s, so n(z−a)=(z−a)s, and therefore

n(β′)n(β)=(z−a)sin F[z].

By (14.10), n(β),n(β′)∈F[z], and n(β) has degree d with leading coefficient (−1)d(s−1). Since F[z] is a unique factorisation domain and z−a is irreducible, n(β) is a constant times a power of z−a; matching degrees and leading coefficients,

n(β)=(−1)d(s−1)(z−a)d.

Compare constant terms. On the left, (14.10)(1) gives N(b0); on the right, (−1)d(s−1)(−a)d=(−1)dsad. Hence N(b0)=(−1)dsad, and since N(−1)=(−1)s,

ad=(−1)dsN(b0)=N((−1)db0)∈NK/F(K×).

This contradicts the hypothesis, because 1≤d≤s−1. Therefore D is a division algebra.

Definition(14.11)The reduced norm on D

For α=b0+b1x+⋯+bs−1xs−1∈D=(K/F,σ,a) with bi∈K, let M(α) be the matrix of the left K-linear map Rα:γ↦γα in the basis 1,x,…,xs−1 — that is, (∗) with z replaced by a and βi by bi:

M(α)=(b0b1⋯bs−1aσ(bs−1)σ(b0)⋯σ(bs−2)⋮⋮⋱⋮aσs−1(b1)aσs−1(b2)⋯σs−1(b0)),n(α)=detM(α).

The same σ-invariance argument as in (14.10)(1) gives n(α)∈F. The map n is the reduced norm of D; it restricts to NK/F on K and satisfies n(x)=(−1)s−1a.

Proposition(14.11a)The reduced norm detects units

With D=(K/F,σ,a) as above, n:D→F is multiplicative, and for α∈D

α∈U(D)⟺n(α)≠0.

Consequently D is a division algebra if and only if the reduced norm vanishes only at 0.

Proof

Multiplicativity is det(Rαα′)=det(Rα′Rα). For the criterion: M(α) is by construction the matrix of the K-linear endomorphism Rα of the s-dimensional K-space D, so n(α)≠0 iff Rα is bijective. If Rα is bijective there is γ with γα=1; then RγRα=Rαγ is also bijective — because Rα is and dimKD<∞ forces Rγ to be bijective too — so αγ is a unit and hence α has a right inverse as well; thus α∈U(D). Conversely if α∈U(D) then Rα has inverse Rα−1, so n(α)n(α−1)=n(1)=1 and n(α)≠0.

Theorem(14.12)–(14.13)K is a splitting field

The map M:D→End(KD)≅Ms(K) is an injective F-algebra homomorphism, described on generators by

M(x)=(010⋯0001⋯0⋮⋱⋮000⋯1a00⋯0),M(b)=(bσ(b)⋱σs−1(b))(b∈K).

Since M(D) commutes elementwise with the scalar matrices K⊆Ms(K), it induces a K-algebra map M⊗1:D⊗FK→Ms(K). Both sides have K-dimension s2, and D⊗FK is a simple K-algebra because D is central simple over F; hence

M⊗1:D⊗FK⟶∼Ms(K).

So K — a maximal subfield of D — is a splitting field for D, and n is the restriction to D of the determinant on Ms(K).

RemarkWedderburn's condition is sufficient, not necessary

For composite s the converse of (14.9) fails. Following Brauer and Tignol, Lam constructs a cyclic division algebra D=(K/F,σ,−1) of degree s=4, in which the class of −1 has order at most 2 in F×/N(K×): take K=ℚ(y,z) with σ(y)=z, σ(z)=−y of order 4, and F=K⟨σ⟩. The argument shows first that the centraliser CD(x2) is a quaternion division algebra, then that D itself has no zero divisors by a grading argument. Over an algebraic number field, by contrast, the converse of (14.9) does hold — but that is a theorem of class field theory.

07Proof Techniques and Method

How these proofs work, and which move to reuse.

Assume failureIf D is not a division algebra, it has a proper nonzero left ideal.
Pull back to BB=K[t;σ] is a principal left ideal domain, so the ideal is Bβ with β monic of degree d, 1≤d≤s−1.
Factor the central elementz−a=β′β, an equation between elements of a noncommutative ring.
Apply the determinantn converts the noncommutative factorisation into n(β′)n(β)=(z−a)s in the commutative ring F[z].
Read constant termsUnique factorisation pins n(β)=±(z−a)d; its constant term is a field norm, giving ad∈N(K×) — the contradiction.
Reusable move

Commutativise by determinant

A multiplicative map from a noncommutative ring to a commutative one lets unique factorisation do the work. The trick is to find a module structure over a central subring; here it is K[z] with z=ts.

Reusable move

Degrees and constant terms carry the arithmetic

Degree in z recovers the ideal-theoretic degree d; the constant term recovers a field norm. Two coefficients of one polynomial deliver the whole theorem.

Reusable move

Right multiplication is left linear

Whenever a ring is a module over a subring on one side, multiplication on the other side is module-linear. That is why Rα has a matrix over K at all, and why det is available.

Reusable move

Split by base change to a maximal subfield

The matrix representation M already lives over K; tensoring up and comparing dimensions upgrades an embedding to an isomorphism. This is the standard route to splitting fields.

08Worked Example

The reduced norm in degree three

Let s=3 and α=b0+b1x+b2x2∈(K/F,σ,a). Then

M(α)=(b0b1b2aσ(b2)σ(b0)σ(b1)aσ2(b1)aσ2(b2)σ2(b0))
(E.1)

and expanding the determinant gives the classical cubic norm form

n(α)=N(b0)+aN(b1)+a2N(b2)−a(b0σ(b1)σ2(b2)+b1σ(b2)σ2(b0)+b2σ(b0)σ2(b1)),
(E.2)

Setting b1=b2=0 recovers NK/F(b0); setting b0=b2=0 gives aN(b1), consistent with n(x)=(−1)2a=a.

Dickson's nine-dimensional division algebra over ℚ

Let ζ=e2πi/7 and E=ℚ(ζ), so dimℚE=6 and Gal(E/ℚ)=⟨τ⟩ with τ(ζ)=ζ3. Let K be the unique cubic subfield of E; then K/ℚ is cyclic of degree 3. Setting v=ζ+ζ−1=2cos(2π/7) one finds v3+v2−2v−1=0, and since f(X)=X3+X2−2X−1 is irreducible over ℚ, K=ℚ(v)=E∩ℝ. With σ=τ2|K the conjugates are

v=2cos2π7,σ(v)=v2−2=2cos4π7,σ2(v)=1−v−v2=2cos6π7.
(E.3)

Their sum is −1 and their product is 1, matching the coefficients of f.

For α=p+qv+rv2 with p,q,r∈ℚ, left multiplication by α on K has matrix (in the basis 1,v,v2, using v3=−v2+2v+1 and v4=3v2−v−1)

(prq−rqp+2r2q−rrq−rp−q+3r),N(α)=p3+q3+r3−p2q−2pq2+5p2r+6pr2−q2r−2qr2−pqr.
(E.4)

Claim. If n is an even integer lying in N(K×) then 8∣n. Write n=N((p+qv+rv2)/m) with p,q,r,m∈ℤ and m>0 minimal, so m3n=N(p+qv+rv2). Reducing (E.4) modulo 2 and using u≡u2≡u3 there,

m3n≡p+q+r+pq+pr+qr+pqr≡1+(p+1)(q+1)(r+1)(mod2).
(E.5)

As n is even, the right side is ≡0, forcing p,q,r all even; minimality of m then makes m odd. Writing p=2p0, q=2q0, r=2r0 and using homogeneity of degree 3, m3n=8N(p0+q0v+r0v2)∈8ℤ, and m odd gives 8∣n.

Conclusion

In particular 2∉N(K×) and 4∉N(K×) — they are even but not divisible by 8. Since s=3 is prime, the prime-degree corollary already gives that D=(K/ℚ,σ,2) is a 9-dimensional ℚ-division algebra with Z(D)=ℚ; equally, the class of 2 has order 3 in ℚ×/N(K×), so Wedderburn's theorem applies directly.

K=ℚ(v),D=K⊕Kx⊕Kx2,v3+v2−2v−1=0,x3=2,xv=(v2−2)x.
(14.14)

Dickson's explicit presentation. The reduced norm of b0+b1x+b2x2 is (E.2) with a=2.

09Comparison and Classification

Three norms attached to a cyclic algebra of degree s
NormDomain and codomainDegree as a formRelation
Field norm NK/FK×→F×sthe restriction of n to K
Reduced norm nD→FsdetM(α); n(x)=(−1)s−1a
Regular norm detFD→Fs2determinant of the F-linear regular representation; equals ns
Polynomial norm on BK[t;σ]→F[z]graded by degtspecialises to n at z=a
Which criterion decides the division property
s primes composite, general FF a number field
a∉NK/F(K×)●yes○no○no
class of a has order s●yes◐partial●yes
reduced norm anisotropic●yes●yes●yes
no proper left ideal in B above z−a●yes●yes●yes

Which criterion decides the division property

In the second column, the order condition is sufficient but not necessary, which is what the entry marked partial records.

10Relationship Map

The reduced norm is the bridge between the algebra and the arithmetic of its centre.

α∈D⟼M(α)∈Ms(K)⟼n(α)=detM(α)∈F⟼unit iff nonzero
Downwards

Degree 2

n becomes the quaternion norm form w2−ax2−by2+abz2, and the unit criterion becomes anisotropy of a quadratic form.

Sideways

Crossed products

The same determinant construction works for a crossed product over any Galois group, with End of a free module of rank |G| over the fixed field.

Upwards

Reduced norm on any central simple algebra

For general central simple A of degree n, choose a splitting field L; det on A⊗L≅Mn(L) descends to A, and the cyclic case is the computable instance.

The relation detF=ns between the regular and the reduced norm explains the word reduced: the ordinary determinant of an element acting on the s2-dimensional space D is an s-th power, and n is that root.

11Applications and Industry Use

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

Wireless communications

Coding gain of space–time codes

For a code drawn from a cyclic division algebra, the minimum determinant of codeword differences is a minimum of reduced norms. Non-vanishing determinant designs are engineered by bounding n away from zero on an order of the algebra.

Number theory

Reduced norms and class groups

The reduced norm map on the ideles of a central simple algebra is the input to the Hasse–Schilling–Maass norm theorem and to the computation of class numbers of orders.

Algebraic groups

SL1(D)

The reduced-norm-one elements form an algebraic group, an inner form of SLs. Its rational points are studied through exactly the matrix M(α) on this page.

Symbolic computation

Splitting algorithms

Explicit splitting of a cyclic algebra over a number field is implemented by writing M⊗1 down and solving a norm equation; libraries return the isomorphism D⊗FK≅Ms(K) in this form.

Cryptography

Norm-form hardness

Deciding whether a value is represented by a norm form of degree s in s2 variables is the algebraic core of several proposals; the reduced norm is the canonical such form.

Invariant theory

Generic division algebras

The reduced norm is the fundamental invariant polynomial of a central simple algebra and controls the study of generic matrices and Amitsur's non-crossed products.

The space–time coding application is the one where the determinant is literally the engineering figure of merit: pairwise error probability at high signal-to-noise ratio is governed by the determinant of the difference of two transmitted matrices, and choosing codewords inside a division algebra guarantees that determinant is never zero.

12Standards and Notation

Standards here covers notation, symbol and markup standards, and reference implementations, rather than material or design codes.

This pagen(α) for the reduced norm, following Lam's §14
Common notationNrdD/F, and TrdD/F for the reduced trace
Regular versus reducedND/F=Nrds and trD/F=s⋅Trd
Reduced characteristic polynomialDegree s, with Nrd as constant term up to sign
MagmaReducedNorm, ReducedCharacteristicPolynomial, IsDivisionRing
Sage / Parialgnorm and algtomatrix in Pari/GP for algebras given by a cyclic presentation
MarkupPresentation MathML per ISO/IEC 40314; matrix layout per mtable

Left versus right regular representation

Lam uses right multiplication acting on D as a left K-space, which is why σ appears on the coefficients in (∗) and why M is a homomorphism rather than an anti-homomorphism. Using left multiplication instead gives the opposite algebra and transposes every matrix; the determinant is unchanged, but the intermediate formulas are not.

13Computational Notes

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

  • **Building M(α)** costs O(s2) applications of powers of σ to elements of K; if K is given by a basis over F, each is a fixed dimFK-square matrix, so the total is O(s4) operations in F.
  • **Evaluating n(α)** is one s×s determinant over K, so O(s3) operations in K, that is O(s5) in F with naive arithmetic. For s≤4 the expanded forms are small enough to hardcode, and (E.2) is the degree-3 case.
  • Deciding the division property by Wedderburn's criterion needs the order of a in F×/NK/F(K×) — that is s−1 norm-equation tests. Over a number field each is decidable; over a general field none need be.
  • **Testing anisotropy of n directly** is not a finite computation for infinite F: it asks whether a degree-s form in s2 variables has a nontrivial zero, which is undecidable in general.
  • **Exact arithmetic in D** is best done through M: multiply matrices over K rather than reducing words in x, since the reduction xs↦a is already built into the matrix.

A vanishing reduced norm is a certificate; a nonvanishing one is not a proof

Finding α≠0 with n(α)=0 proves D is not a division algebra, and α is an explicit zero divisor. Failing to find one proves nothing. Positive results must come from the norm-group criterion, or from a valuation or grading argument as in the degree-4 example.

14Failure Modes and Common Mistakes

Wedderburn's condition is sufficient only

(14.9) gives no information when the class of a has order less than s. There are cyclic division algebras of degree 4 with a=−1 of order at most 2 modulo norms. Only over algebraic number fields is the condition also necessary, and that requires class field theory.

n is not the determinant of the regular representation

The F-linear regular representation of D has size s2 and its determinant is ns. Confusing the two inflates degrees by a factor of s and breaks every degree count in the proof of (14.9).

z−a is central, t−c is not

The proof uses centrality of z=ts in an essential way: it is what makes K[z] commutative, what makes (z−a) a two-sided ideal, and what gives n(z−a)=(z−a)s. No analogue holds for a general monic factor, which is precisely why β has to be handled through its degree and constant term instead.

  • Do not omit the bound 1≤d≤s−1; without it the conclusion ad∈N(K×) is vacuous, since as=N(a) always.
  • Do not assume n(β) lies in F[z] without the σ-invariance argument — a priori the determinant only lies in K[z].
  • Do not read (∗) as a matrix over K: its entries lie in K[z], and the specialisation z↦a is a separate step.
  • Do not conclude from D⊗FK≅Ms(K) that D splits over F — a division algebra always splits over its maximal subfields.

15Quick Reference

SettingK/F cyclic of degree s, Gal=⟨σ⟩, a∈F×, D=(K/F,σ,a)
Polynomial normn:K[t;σ]→F[z], z=ts, n(β)=det of (∗)
Key valuesn(t)=(−1)s−1z, n(b)=NK/F(b), n(z−a)=(z−a)s
Reduced normn(α)=detM(α)∈F, multiplicative
Unit testα∈U(D)⇔n(α)≠0
Wedderburnclass of a of order s in F×/N(K×)⇒D division
SplittingD⊗FK≅Ms(K)
Reduced vs regulardetF(α)=n(α)s
Statements and their hypotheses
StatementHypothesesReference
n(β)∈F[z]; constant term N(b0)β∈K[t;σ] written over K[z](14.10)(1)
degzn(β)=degtβ; leading coeff (−1)d(s−1)all coefficients of β in K, β monic(14.10)(2)
D is a division algebraclass of a has order s in F×/N(K×)(14.9)
n(α)∈F, multiplicative, detects unitsD=(K/F,σ,a)(14.11)
M(x) cyclic with corner a; M(b) diagonalsame(14.12)
D⊗FK≅Ms(K)D central simple over F, K maximal subfield(14.13)

16Frequently Asked Questions

Why is the order of a in F×/N(K×) always a divisor of s?

Because σ fixes F pointwise, so for a∈F× the field norm is NK/F(a)=aσ(a)⋯σs−1(a)=as. Hence as is always a norm, and the quotient group has exponent dividing s. Wedderburn's hypothesis is that the order is as large as it can possibly be.

Where does the proof of (14.9) actually use that the ideal is proper?

In the bound 1≤d≤s−1. If d were 0 the ideal would be all of B; if d were s the ideal would be (z−a) itself and the conclusion as∈N(K×) would be true and useless. The whole force of the argument is that a genuine intermediate left ideal produces a genuine intermediate power of a that is a norm.

Is the reduced norm the same as the determinant in a matrix representation?

Yes, once you use a splitting field. Under D⊗FK≅Ms(K), the reduced norm of α is the determinant of the corresponding matrix, and the value happens to lie in F even though the matrix has entries in K. That is exactly why it is well defined independently of the splitting field chosen.

How does this specialise to quaternion algebras?

Take K=F(a) and cyclic parameter b, so that (K/F,σ,b) is the quaternion algebra with i2=a, j2=b. Then M(α)=(b0b1bσ(b1)σ(b0)) and n(α)=N(b0)−bN(b1). Writing b0=w+xa and b1=y+za gives N(b0)=w2−ax2 and N(b1)=y2−az2, so n(α)=w2−ax2−by2+abz2 — the quaternion norm form.

Does a nonzero reduced norm really give a two-sided inverse?

Yes. M(α) is the matrix of right multiplication by α on the finite-dimensional K-space D, so n(α)≠0 makes that map bijective and produces γ with γα=1. In a finite-dimensional algebra a one-sided inverse is two-sided, so α is a unit.

Why does Lam give a non-cohomological proof?

Because §14 is meant to be readable before any Brauer group theory is available. The cohomological proof computes the order of the class of the algebra in Br(F) via 2-cocycles; the determinant proof needs only a principal ideal domain, unique factorisation in F[z], and two coefficients of one polynomial.

17Related KEVOS Topics

Cyclic AlgebrasDickson's construction: from a cyclic Galois extension K/F of degree s with Gal(K/F) = and a scalar a ∈ F^×, build a cenDouble Centralizer TheoremMaking D a module over D ⊗_F K^op turns questions about a division subring K into density-theorem questions, and returnsCentrally Finite Division RingsThe centre F = Z(D) of a division ring is a field, so D is an F-algebra and _F D is defined. Whether that dimension is fTwisted Laurent SeriesHilbert's twist applied to formal Laurent series: for any automorphism of a field k, the ring k((x;)) is a division ringQuaternion 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 is

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §14, (14.9)–(14.14), pp. 236–239.
  2. J. H. M. Wedderburn, “A type of primitive algebra”, Transactions of the American Mathematical Society 15 (1914), 162–166.
  3. L. E. Dickson, Algebren und ihre Zahlentheorie, Orell Füssli, Zürich, 1927; Appendix 1 contains the classical proof Lam follows.
  4. N. Jacobson, Basic Algebra II, 2nd edition, W. H. Freeman, 1989, Chapter 4 (reduced norms and traces of central simple algebras).
  5. R. S. Pierce, Associative Algebras, Graduate Texts in Mathematics 88, Springer-Verlag, 1982, Chapter 16.
  6. P. Gille and T. Szamuely, Central Simple Algebras and Galois Cohomology, Cambridge University Press, 2006, Chapters 2–4.

19AI Suggested Questions

  • Give the cohomological proof of Wedderburn's theorem and compare the two arguments step by step.
  • Prove that the determinant of the regular representation of a central simple algebra of degree s equals the s-th power of the reduced norm.
  • Write out the reduced norm form of a cyclic algebra of degree 4 and analyse its singular locus.
  • For which fields F is Wedderburn's order condition also necessary, and what is the proof over a number field?
  • Describe Brauer's and Tignol's degree-4 example in full and verify that −1 has order 2 modulo norms there.
  • How is the minimum reduced norm of a lattice in a cyclic division algebra bounded below, and why does that matter for space–time codes?
  • Explain how the reduced norm defines the algebraic group SL1(D) and what its rational points look like.
Page
KEVOS-ENG-MATH-NCR-0110
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. Comparison and Classification
  10. Relationship Map
  11. Applications and Industry Use
  12. Standards and Notation
  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

Generalised Quaternion AlgebrasArticle · Engineering MathematicsNEXT LESSON →Well-Ordered Subsets of Ordered GroupsArticle · Engineering MathematicsCyclic AlgebrasArticle · Engineering MathematicsThe Mal’cev–Neumann Construction of Laurent Series RingsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®