Executive Summary
A cyclic algebra is a field extension with one extra generator bolted on. Start with a cyclic Galois extension of degree , let generate , pick , and adjoin a symbol subject to two relations: , and for . The result is an -algebra of dimension .
Three facts make it useful. It is always simple with centre exactly , so it is a central simple algebra of degree . sits inside as a maximal subfield, self-centralising. And whether it is a division algebra or a matrix ring is decided by arithmetic in : it splits precisely when is a norm from .
Overview
The finite-order case of the twisted Laurent series construction produces a division ring containing a cyclic extension of its centre , with , and central. Dickson's observation in 1906 was that these data — a cyclic extension, its Galois generator, and one central scalar — can be taken as input rather than read off as output.
The definition of . Products are computed by pushing every to the right, applying each time it passes a coefficient, and replacing by .
Consistency is not an accident of the presentation: the algebra can be realised as a quotient of a skew polynomial ring, which supplies associativity for free.
is a central element of , so the ideal it generates is two-sided and the quotient is an -algebra of dimension .
Everything here is the degree- generalisation of a familiar object: taking recovers the generalised quaternion algebras treated on Generalised Quaternion Algebras, and taking , , recovers Hamilton's .
Learning Objectives
- State the defining data and the two relations .
- Verify and identify as a unit.
- Prove simplicity by the minimal-length argument on elements of an ideal.
- Prove , hence and is a maximal subfield.
- Prove the splitting criterion .
- Apply the prime-degree corollary to decide division-algebra status in a concrete case.
Definitions
Let be a cyclic Galois extension — finite, separable and normal, with cyclic of order . Fix and a symbol . Define
as a left -vector space, with multiplication extended distributively from and for . This is an associative -algebra with , and .
- Degree
- . The algebra has dimension , so its degree as a central simple algebra is .
- The norm , a multiplicative map .
- The centraliser .
- The skew polynomial ring of left polynomials with ; a principal left ideal domain.
- Split
- . The opposite extreme from being a division algebra.
- Crossed product
- The generalisation in which is any finite group and the relations are governed by a -cocycle; the cyclic case is the one with cyclic group.
The notation is Lam's. Elsewhere one meets written as a cyclic crossed product, and in degree 2 as a quaternion symbol.
Core Concepts
Why the two relations suffice
Any product of basis elements reduces using only : , and if one writes , legitimate because is central. Associativity is then a finite check, or is inherited for free from the presentation as a quotient of — the polynomial is central there because and .
is a unit, and that is the engine of simplicity
Since , the element is invertible with . Hence every basis element with is a unit. A nonzero ideal that contains a single-term element therefore contains a unit and is everything; the simplicity proof is entirely devoted to shrinking a general element down to a single term.
Distinct powers of act differently
Because generates a Galois group of order exactly , the automorphisms are pairwise distinct as maps . So for there exists with . This tiny observation is used twice: once to shrink ideal elements, once to force centralisers into .
Key Results
Let be cyclic Galois of degree with , let , and set . Then:
- is a simple -algebra with ; in particular is central simple over of dimension .
- .
- is a maximal subfield of .
(1) Simplicity. Let be a two-sided ideal. Among the nonzero elements of choose one with the fewest nonzero coordinates,
Suppose . Since , pick with . The ideal contains both and , hence their difference
Its -coordinate has vanished while its -coordinate is nonzero, so it is a nonzero element of with fewer terms — contradiction. Hence and , a unit; so .
**(2) Centraliser of .** Let centralise . For , comparing coordinates in gives for every . If for some , then for all , i.e. , contradicting . So , and is trivial.
**(3) Maximality of .** If is a subfield of with , then is commutative, so , giving .
Centre. holds by construction. Conversely lies in , and forces ; since , Galois theory gives . Hence .
Take , so and . For both factors are nonzero, so has zero divisors. Simplicity is therefore strictly weaker than being a division algebra — as it must be, since is simple.
With , , , as above and , and with the field norm:
**() Reduce to .** Suppose for some , i.e. . Put . Repeatedly pushing past the coefficients gives , and for we have . Since , the elements form a left -basis, so .
**() The case splits.** Write with . Because the coefficients of lie in the prime field, the factorisation is valid in , so . The left ideal is maximal, since and is a principal left ideal domain in which degree-one factors are irreducible. Hence is a simple left -module with , and the action gives an -algebra map . It is injective because is simple, and both sides have -dimension , so it is an isomorphism.
**().** If then has a simple module of -dimension . Writing , such a module is for a principal left ideal with , and , so . After scaling on the left, with . Then for some ; multiplying out and comparing coefficients from the top down yields successively
and finally, from the constant term, .
Suppose in addition that is a prime number. Then is a division algebra if and only if .
If then by , which is not a division algebra as . Conversely suppose is not a division algebra. is a simple -algebra of dimension , so Wedderburn–Artin gives with a division -algebra and necessarily . Comparing dimensions, , so . As is prime, the square divisors of are and ; since we get and , i.e. and . By , .
When is composite, is no longer sufficient — can be a proper matrix ring over a smaller division algebra. Wedderburn's 1914 sufficient condition asks instead that the image of in the abelian group have order exactly . That refinement, its proof by a norm on , and an example showing it is not necessary are the subject of The Reduced Norm of a Cyclic Algebra.
Proof Techniques and Method
How these proofs work, and which move to reuse.
Shortest element in an ideal
To prove simplicity of a graded-looking algebra, take an ideal element with fewest nonzero components and kill its bottom component by a commutator-style difference. This is the standard proof for crossed products and skew group rings alike.
Separate points with the Galois action
Distinct powers of differ at some . This single fact drives both simplicity and the centraliser computation, and is the reason the Galois group must act faithfully.
Change of generator absorbs a norm
Replacing by multiplies by . So depends on only through its class in — the whole splitting theory in one line.
Move 3 deserves to be stated as a lemma in its own right: for there is an -algebra isomorphism . It reduces every question about the algebra to a question about the class of modulo norms, and it is why the norm group appears at all.
The dimension count in the converse half of is also worth isolating: over a principal left ideal domain that is free of rank over its coefficient field, . Turning module dimensions into polynomial degrees is what makes the norm appear from nothing.
Worked Example
A quadratic example over a rational function field
Let be a field with , let be transcendental over , and set , . The extension is cyclic of degree ; let be the -automorphism with . For we claim
So a single non-square in produces a -dimensional division algebra over .
Because is prime, reduces the claim to: if and only if is a square in .
One direction is immediate. If with then .
The other direction is a degree count. Suppose with . Clear denominators: write , with and . Then
The polynomial has even degree and has odd degree, so no cancellation of leading terms is possible and the degree of the right-hand side is . The left-hand side has even degree , so the maximum must be attained by : thus and, comparing leading coefficients, . Hence , as claimed.
This example is reused inside Lam's construction of a degree- cyclic division algebra , where it identifies a centraliser as a division algebra; it is also the pattern behind most quaternion examples over function fields.
Comparison and Classification
| Choice of | Structure | Why |
|---|---|---|
| , split | ; explicit zero divisors and | |
| for some | , split | ; substitute to reduce to |
| , prime | division algebra | |
| , composite | for some division ; may or may not be a division algebra | Wedderburn–Artin permits |
| image of has order in | division algebra | Wedderburn's theorem |
| (not permitted) | not simple | becomes an ideal; the construction requires |
| simple | maximal subfield | division | |||
|---|---|---|---|---|---|
| finite separable normal | yes | yes | yes | yes | no |
| cyclic, generated by | yes | yes | yes | yes | no |
| (nonzero) | yes | yes | yes | yes | no |
| and prime | yes | yes | yes | yes | yes |
| of order in | yes | yes | yes | yes | yes |
What each hypothesis buys
Is a division algebra?
Relationship Map
Cyclic algebras are the first rung of a ladder that reaches all central simple algebras.
- — what the construction specialises to
- generalised quaternion algebra
- a norm
- trivial class in the Brauer group
- ,
- the finite-order twisted Laurent series division ring
- cyclic Kummer case
- with
- the symbol algebra with
Emmy Noether's crossed products replace by an arbitrary finite Galois group and the single scalar by a -cocycle; every central simple algebra split by a Galois extension is such a crossed product. Whether every division algebra is a cyclic algebra is a much harder question — the answer is no in general, by Amitsur's non-crossed-product examples, though it is yes in degree and and over local and global fields.
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
Space–time block codes
Perfect space–time codes for multiple-antenna channels are built from cyclic division algebras: the algebra's left-regular matrix representation supplies a codebook whose nonzero differences are invertible, giving full diversity. The non-norm condition is exactly the design constraint.
Brauer groups and class field theory
Over a local or global field every central simple algebra is cyclic, and the Brauer group is computed by local invariants. Cyclic algebras are the concrete models on which the Hasse–Brauer–Noether theorem is stated.
Severi–Brauer varieties
A cyclic algebra of degree has an associated Severi–Brauer variety, a form of projective space with a rational point exactly when the algebra splits. Splitting criteria become rational-point questions.
Explicit algebra libraries
Magma and Sage represent cyclic and quaternion algebras by structure constants derived from , and implement splitting tests via norm equations over number fields.
Skew-cyclic and MRD codes
Maximum rank distance codes and skew-cyclic codes over finite fields use and its quotients — the finite-field case of the presentation , where is a Frobenius power.
Symbol algebras and root-of-unity relations
When contains a primitive th root of unity, the cyclic algebra becomes a symbol algebra with — the finite-dimensional relative of the Weyl relation used in quantum tori.
Wireless coding is the clearest case where the division property does engineering work: a code drawn from a division algebra can never have two distinct codewords whose difference is singular, which is precisely full-diversity transmission.
Standards and Notation
Standards here covers notation, symbol and markup standards, and reference implementations, rather than material or design codes.
CyclicAlgebra, QuaternionAlgebra, IsMatrixRingQuaternionAlgebra in Sage; AlgebraByStructureConstants in GAP for general degreeComputational Notes
Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.
A cyclic algebra is finite dimensional and given by structure constants, so all its ring-theoretic invariants are computable once arithmetic in is. The bottleneck is arithmetic in , not in the algebra.
- Multiplication of two general elements costs multiplications in plus evaluations of powers of ; precomputing on a basis of reduces the latter to matrix–vector products.
- Regular representation. The map sending to the matrix of right multiplication on the left -basis embeds into ; this is how a machine stores the algebra and is the source of the reduced norm.
- Splitting test. Deciding is a norm equation. Over a number field this is solvable — by class field theory the norm group is described by local conditions at finitely many places — and Magma implements it. Over a general field there is no algorithm.
- **Degree- shortcut.** For quaternion algebras splitting reduces to solvability of the conic , decidable over by Legendre's theorem plus factorisation of and .
- Zero-divisor search is the wrong algorithm. Searching for zero divisors by brute force is exponential in and settles nothing when none are found; use the norm criterion instead.
Failure Modes and Common Mistakes
- Do not drop separability or normality: without them and the dimension count fails.
- Do not allow : then is a nonzero proper ideal and the algebra is not simple.
- Do not assume is the only maximal subfield. Non-isomorphic maximal subfields coexist; Lam's exercises for §14 exhibit them in Dickson's degree- example.
- Do not confuse the degree with the dimension , or the order of in with the order of the Brauer class.
- Do not expect to force — the algebra sees only modulo .
Historical Notes and Lessons Learned
- 1899Hilbert's twisted seriesThe finite-order case of exhibits, implicitly, the relations later abstracted as .
- 1906Dickson defines cyclic algebrasDickson isolates the data and proves the basic structure theory, launching the systematic construction of division algebras of arbitrary degree.
- 1914Wedderburn's norm criterionA sufficient condition for a cyclic algebra of any degree to be a division algebra, in terms of the order of in .
- 1929Noether's crossed productsEmmy Noether generalises to arbitrary finite Galois groups with a -cocycle, recasting the theory cohomologically.
- 1932Hasse–Brauer–NoetherOver an algebraic number field every central simple algebra is cyclic, and the Brauer group is determined by local invariants.
- 1972Amitsur: non-crossed productsGeneric division algebras of suitable degree are shown not to be crossed products at all, ending the hope that cyclic algebras exhaust the subject.
The lesson is that a construction outlives the classification it was invented for. Cyclic algebras do not exhaust central simple algebras, but they remain the only family in which one can write down a basis, multiply two elements by hand, and decide the division property by an arithmetic condition.
Quick Reference
| Statement | Hypotheses | Reference |
|---|---|---|
| , | cyclic of degree , | (14.5) |
| simple, | same | (14.6)(1) |
| same | (14.6)(2) | |
| is a maximal subfield | same | (14.6)(3) |
| same | (14.7) | |
| division | same, and prime | (14.8) |
Frequently Asked Questions
Why must the Galois group be cyclic?
Because a single adjoined symbol implements a single automorphism by conjugation, and its powers then implement . For a non-cyclic Galois group one needs one symbol per group element together with a -cocycle recording how they multiply — that is Noether's crossed product. The cyclic case is where the cocycle collapses to the single scalar .
How much does the algebra depend on the choice of ?
Only on the class of in . Replacing by for replaces by and gives an isomorphic algebra. This is why the splitting criterion is a statement about norms and not about itself.
Does the choice of generator matter?
Yes. Replacing by with generally gives a different algebra; the standard relation is in the Brauer group. In particular is the opposite algebra of .
Is every division algebra a cyclic algebra?
No. Every central simple algebra of degree or over any field is cyclic, and every central simple algebra over a local or global field is cyclic. But Amitsur produced generic division algebras that are not even crossed products, so cyclicity fails in general.
What does it mean that is a splitting field?
Extending scalars, . Concretely, the left-regular representation of on itself as a -space realises inside , and this embedding becomes an isomorphism after tensoring. Any maximal subfield of a central division algebra splits it.
Why is excluded?
With the element is nilpotent rather than a unit, and is a nonzero proper two-sided ideal. Simplicity fails immediately — for the set is already an ideal.
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §14, (14.5)–(14.8), pp. 231–236.
- L. E. Dickson, Algebras and Their Arithmetics, University of Chicago Press, 1923; and the 1906 papers on linear associative algebras in which cyclic algebras first appear.
- N. Jacobson, Basic Algebra II, 2nd edition, W. H. Freeman, 1989, Chapter 4 (central simple algebras, crossed products, cyclic algebras).
- R. S. Pierce, Associative Algebras, Graduate Texts in Mathematics 88, Springer-Verlag, 1982, Chapters 13–15.
- P. Gille and T. Szamuely, Central Simple Algebras and Galois Cohomology, Cambridge Studies in Advanced Mathematics 101, Cambridge University Press, 2006, Chapter 2.
- S. A. Amitsur, “On central division algebras”, Israel Journal of Mathematics 12 (1972), 408–420.
AI Suggested Questions
- Prove that is Brauer-equivalent to .
- Show that has order dividing in the Brauer group of , and find an example where the order is strictly smaller than .
- Work out the Severi–Brauer variety of a cyclic algebra of degree and its rational points.
- How is a cyclic algebra of degree used to build a full-diversity space–time code, and where does the non-norm condition enter?
- Give an algorithm deciding whether is a norm from a cyclic extension of number fields, and state its complexity.
- Compare cyclic algebras with symbol algebras when contains a primitive th root of unity.
- Describe Amitsur's non-crossed-product division algebras and what degree is needed.
