Executive Summary
A cyclic algebra of degree is a left -vector space of dimension with basis . Right multiplication by is a -linear map of that space; its determinant is the reduced norm , which lands in and is multiplicative.
The reduced norm does two jobs. It converts invertibility into a determinant condition — is a unit exactly when — and, in a polynomial version over the skew polynomial ring , it proves Wedderburn's criterion: if the class of in has order exactly , then is a division algebra. The same matrix also exhibits as a splitting field, .
Overview
For prime degree, deciding whether is a division algebra is easy: it is one exactly when 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 in the quotient group .
Note that automatically, so the order of the class of always divides ; 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 , regarded as a free module of rank over the central polynomial ring with .
This page is the technical heart of the classical treatment. The statements it supports — the splitting criterion, the structure of , the prime-degree corollary — are on Cyclic Algebras; the degree- specialisation, where the reduced norm becomes a quadratic form, is on Generalised Quaternion Algebras.
Learning Objectives
- Set up as a free left -module of rank , .
- Write the matrix of right multiplication and define the polynomial norm .
- Prove and that its constant term is of the constant term of .
- Prove Wedderburn's theorem by applying to a factorisation of .
- Specialise to and prove .
- Deduce and read off the explicit matrices for and for .
- Compute the degree- reduced norm form and apply it to Dickson's example over .
Definitions
Let be cyclic Galois of degree with , and let with . Put . Then , the subring is a commutative polynomial ring, and is a free left -module with basis .
Right multiplication is a left -module endomorphism of , because left multiplication by and right multiplication by commute. Define .
Since is multiplicative and , we get .
Writing with , and extending to by so that , the matrix of in the basis is
Row records , with replaced by whenever .
- , a central element of because .
- The determinant of ; an element of , and in fact of .
- , the field norm .
- ,
- Degree in as an element of ; degree in as a polynomial in .
- For , the matrix of right multiplication by on in the left -basis .
- Reduced norm
- . It is the specialisation of the polynomial norm at .
Core Concepts
Why the determinant lands in
Two symmetries pin it down. Applying entrywise to produces the matrix of , so . On the other hand gives , and in the domain , so . Combining, : the coefficients are -fixed, hence in .
Why the constant term is a field norm
Set in . The factor occurs exactly in the entries strictly below the diagonal, so all of those vanish and what remains is upper triangular, with diagonal entries evaluated at . If denotes the constant term of , the determinant at is therefore .
Specialising
The surjection sends and . Under it, as a free -module of rank becomes as a -vector space of dimension , and becomes the matrix with replaced by and by . This compatibility is the whole content of the commutative diagram Lam draws after .
Key Results
Let , , and with .
- , and the constant term of equals , where is the constant term of . In particular .
- If moreover every lies in (so is a polynomial in of degree ), then , and if is monic in the leading coefficient of is .
(1). From and multiplicativity, . Direct inspection of for gives , a nonzero element of the integral domain , so . Applying to every entry of turns it into the matrix for — note — so . Hence is fixed by , i.e. . Setting in leaves a triangular matrix with diagonal , whose determinant is .
(2). With all and monic of degree , set and for in . Each entry is either a constant or times a constant, and the 's occur exactly in the strictly lower-left region. Expanding the determinant, the terms of top degree in come from the permutation contributions using of the -entries, all of which involve the entries carrying ; this yields with leading coefficient the sign of the corresponding permutation, namely .
Let be a cyclic Galois extension of degree with , and let . Suppose the image of in the abelian group has order exactly — equivalently, for every with . Then is a division -algebra.
Suppose not. Write with and ; note is central in . Since is simple artinian and not a division ring, it has a nonzero proper left ideal, whose preimage is a left ideal with .
is a principal left ideal domain, so with monic; scaling, write with . Counting -dimensions, , and forces .
Since , there is with . Apply the polynomial norm. Right multiplication by the central element is multiplication by a scalar on a free module of rank , so , and therefore
By , , and has degree with leading coefficient . Since is a unique factorisation domain and is irreducible, is a constant times a power of ; matching degrees and leading coefficients,
Compare constant terms. On the left, gives ; on the right, . Hence , and since ,
This contradicts the hypothesis, because . Therefore is a division algebra.
For with , let be the matrix of the left -linear map in the basis — that is, with replaced by and by :
The same -invariance argument as in gives . The map is the reduced norm of ; it restricts to on and satisfies .
With as above, is multiplicative, and for
Consequently is a division algebra if and only if the reduced norm vanishes only at .
Multiplicativity is . For the criterion: is by construction the matrix of the -linear endomorphism of the -dimensional -space , so iff is bijective. If is bijective there is with ; then is also bijective — because is and forces to be bijective too — so is a unit and hence has a right inverse as well; thus . Conversely if then has inverse , so and .
The map is an injective -algebra homomorphism, described on generators by
Since commutes elementwise with the scalar matrices , it induces a -algebra map . Both sides have -dimension , and is a simple -algebra because is central simple over ; hence
So — a maximal subfield of — is a splitting field for , and is the restriction to of the determinant on .
For composite the converse of fails. Following Brauer and Tignol, Lam constructs a cyclic division algebra of degree , in which the class of has order at most in : take with , of order , and . The argument shows first that the centraliser is a quaternion division algebra, then that itself has no zero divisors by a grading argument. Over an algebraic number field, by contrast, the converse of does hold — but that is a theorem of class field theory.
Proof Techniques and Method
How these proofs work, and which move to reuse.
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 with .
Degrees and constant terms carry the arithmetic
Degree in recovers the ideal-theoretic degree ; the constant term recovers a field norm. Two coefficients of one polynomial deliver the whole theorem.
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 has a matrix over at all, and why is available.
Split by base change to a maximal subfield
The matrix representation already lives over ; tensoring up and comparing dimensions upgrades an embedding to an isomorphism. This is the standard route to splitting fields.
Worked Example
The reduced norm in degree three
Let and . Then
and expanding the determinant gives the classical cubic norm form
Setting recovers ; setting gives , consistent with .
Dickson's nine-dimensional division algebra over
Let and , so and with . Let be the unique cubic subfield of ; then is cyclic of degree . Setting one finds , and since is irreducible over , . With the conjugates are
Their sum is and their product is , matching the coefficients of .
For with , left multiplication by on has matrix (in the basis , using and )
Claim. If is an even integer lying in then . Write with and minimal, so . Reducing modulo and using there,
As is even, the right side is , forcing all even; minimality of then makes odd. Writing , , and using homogeneity of degree , , and odd gives .
Dickson's explicit presentation. The reduced norm of is with .
Comparison and Classification
| Norm | Domain and codomain | Degree as a form | Relation |
|---|---|---|---|
| Field norm | the restriction of to | ||
| Reduced norm | ; | ||
| Regular norm | determinant of the -linear regular representation; equals | ||
| Polynomial norm on | graded by | specialises to at |
| prime | composite, general | a number field | |
|---|---|---|---|
| yes | no | no | |
| class of has order | yes | partial | yes |
| reduced norm anisotropic | yes | yes | yes |
| no proper left ideal in above | 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.
Relationship Map
The reduced norm is the bridge between the algebra and the arithmetic of its centre.
Degree
becomes the quaternion norm form , and the unit criterion becomes anisotropy of a quadratic form.
Crossed products
The same determinant construction works for a crossed product over any Galois group, with of a free module of rank over the fixed field.
Reduced norm on any central simple algebra
For general central simple of degree , choose a splitting field ; on descends to , and the cyclic case is the computable instance.
The relation between the regular and the reduced norm explains the word reduced: the ordinary determinant of an element acting on the -dimensional space is an -th power, and is that root.
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
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 away from zero on an order of the algebra.
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.
The reduced-norm-one elements form an algebraic group, an inner form of . Its rational points are studied through exactly the matrix on this page.
Splitting algorithms
Explicit splitting of a cyclic algebra over a number field is implemented by writing down and solving a norm equation; libraries return the isomorphism in this form.
Norm-form hardness
Deciding whether a value is represented by a norm form of degree in variables is the algebraic core of several proposals; the reduced norm is the canonical such form.
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.
Standards and Notation
Standards here covers notation, symbol and markup standards, and reference implementations, rather than material or design codes.
ReducedNorm, ReducedCharacteristicPolynomial, IsDivisionRingalgnorm and algtomatrix in Pari/GP for algebras given by a cyclic presentationmtableComputational Notes
Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.
- **Building ** costs applications of powers of to elements of ; if is given by a basis over , each is a fixed -square matrix, so the total is operations in .
- **Evaluating ** is one determinant over , so operations in , that is in with naive arithmetic. For the expanded forms are small enough to hardcode, and is the degree- case.
- Deciding the division property by Wedderburn's criterion needs the order of in — that is norm-equation tests. Over a number field each is decidable; over a general field none need be.
- **Testing anisotropy of directly** is not a finite computation for infinite : it asks whether a degree- form in variables has a nontrivial zero, which is undecidable in general.
- **Exact arithmetic in ** is best done through : multiply matrices over rather than reducing words in , since the reduction is already built into the matrix.
Failure Modes and Common Mistakes
- Do not omit the bound ; without it the conclusion is vacuous, since always.
- Do not assume lies in without the -invariance argument — a priori the determinant only lies in .
- Do not read as a matrix over : its entries lie in , and the specialisation is a separate step.
- Do not conclude from that splits over — a division algebra always splits over its maximal subfields.
Quick Reference
| Statement | Hypotheses | Reference |
|---|---|---|
| ; constant term | written over | (14.10)(1) |
| ; leading coeff | all coefficients of in , monic | (14.10)(2) |
| is a division algebra | class of has order in | (14.9) |
| , multiplicative, detects units | (14.11) | |
| cyclic with corner ; diagonal | same | (14.12) |
| central simple over , maximal subfield | (14.13) |
Frequently Asked Questions
Why is the order of in always a divisor of ?
Because fixes pointwise, so for the field norm is . Hence is always a norm, and the quotient group has exponent dividing . Wedderburn's hypothesis is that the order is as large as it can possibly be.
Where does the proof of actually use that the ideal is proper?
In the bound . If were the ideal would be all of ; if were the ideal would be itself and the conclusion would be true and useless. The whole force of the argument is that a genuine intermediate left ideal produces a genuine intermediate power of 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 , the reduced norm of is the determinant of the corresponding matrix, and the value happens to lie in even though the matrix has entries in . That is exactly why it is well defined independently of the splitting field chosen.
How does this specialise to quaternion algebras?
Take and cyclic parameter , so that is the quaternion algebra with , . Then and . Writing and gives and , so — the quaternion norm form.
Does a nonzero reduced norm really give a two-sided inverse?
Yes. is the matrix of right multiplication by on the finite-dimensional -space , so makes that map bijective and produces with . 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 via -cocycles; the determinant proof needs only a principal ideal domain, unique factorisation in , and two coefficients of one polynomial.
References
- 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.
- J. H. M. Wedderburn, “A type of primitive algebra”, Transactions of the American Mathematical Society 15 (1914), 162–166.
- L. E. Dickson, Algebren und ihre Zahlentheorie, Orell Füssli, Zürich, 1927; Appendix 1 contains the classical proof Lam follows.
- N. Jacobson, Basic Algebra II, 2nd edition, W. H. Freeman, 1989, Chapter 4 (reduced norms and traces of central simple algebras).
- R. S. Pierce, Associative Algebras, Graduate Texts in Mathematics 88, Springer-Verlag, 1982, Chapter 16.
- P. Gille and T. Szamuely, Central Simple Algebras and Galois Cohomology, Cambridge University Press, 2006, Chapters 2–4.
AI 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 equals the -th power of the reduced norm.
- Write out the reduced norm form of a cyclic algebra of degree and analyse its singular locus.
- For which fields is Wedderburn's order condition also necessary, and what is the proof over a number field?
- Describe Brauer's and Tignol's degree- example in full and verify that has order 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 and what its rational points look like.
