← LibraryCyclic AlgebrasEngineering · Engineering MathematicsLesson 364/812← PrevNext →
ArticlePublished 8 Aug 2026Updated 9 Aug 202623 min readBy KEVOS®
Skip to content

Engineering Mathematics Advanced Classical constructions

Cyclic Algebras

Dickson's construction: from a cyclic Galois extension K/F of degree s with Gal(K/F)=σ and a scalar aF×, build a central simple F-algebra (K/F,σ,a) of dimension s2 — a division algebra exactly when a is far enough from being a norm.

Page ID
KEVOS-ENG-MATH-NCR-0108
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(14.5)–(14.8), §14 (pp. 231–236)
Reviewed
2026-08-08
Version
1.0.0

Executive Summary

A cyclic algebra is a field extension with one extra generator bolted on. Start with a cyclic Galois extension K/F of degree s, let σ generate Gal(K/F), pick aF×, and adjoin a symbol x subject to two relations: xs=a, and xb=σ(b)x for bK. The result (K/F,σ,a) is an F-algebra of dimension s2.

Three facts make it useful. It is always simple with centre exactly F, so it is a central simple algebra of degree s. K sits inside as a maximal subfield, self-centralising. And whether it is a division algebra or a matrix ring is decided by arithmetic in F: it splits precisely when a is a norm from K.

s2dimF(K/F,σ,a)
FCentre
aNK/F(K×)Splits iff
1906Dickson

Overview

The finite-order case of the twisted Laurent series construction produces a division ring D containing a cyclic extension K of its centre F, with D=i<sKxi, xb=σ(b)x and xs 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.

D=K1KxKxs1,xs=aF×,xb=σ(b)x(bK)
(14.5)

The definition of (K/F,σ,a). Products are computed by pushing every x to the right, applying σ each time it passes a coefficient, and replacing xs by a.

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.

(K/F,σ,a)K[t;σ]/(tsa),
(14.5*)

tsa is a central element of K[t;σ], so the ideal it generates is two-sided and the quotient is an F-algebra of dimension s2.

Everything here is the degree-s generalisation of a familiar object: taking s=2 recovers the generalised quaternion algebras treated on Generalised Quaternion Algebras, and taking F=, K=, a=1 recovers Hamilton's .

Learning Objectives

  • State the defining data (K/F,σ,a) and the two relations (14.5).
  • Verify dimF(K/F,σ,a)=s2 and identify x as a unit.
  • Prove simplicity by the minimal-length argument on elements of an ideal.
  • Prove CD(K)=K, hence Z(D)=F and K is a maximal subfield.
  • Prove the splitting criterion DMs(F)aNK/F(K×).
  • Apply the prime-degree corollary to decide division-algebra status in a concrete case.

Definitions

Definition(14.5)The cyclic algebra (K/F,σ,a)

Let K/F be a cyclic Galois extension — finite, separable and normal, with Gal(K/F)=σ cyclic of order s=dimFK. Fix aF× and a symbol x. Define

(K/F,σ,a)=i=0s1Kxi

as a left K-vector space, with multiplication extended distributively from xs=a and xb=σ(b)x for bK. This is an associative F-algebra with dimF=s2, and FZ((K/F,σ,a)).

Degree
s=dimFK=|Gal(K/F)|. The algebra has dimension s2, so its degree as a central simple algebra is s.
NK/F
The norm NK/F(c)=cσ(c)σs1(c)F, a multiplicative map K×F×.
CD(S)
The centraliser {dD:ds=sd for all sS}.
K[t;σ]
The skew polynomial ring of left polynomials biti with tb=σ(b)t; a principal left ideal domain.
Split
DMs(F). The opposite extreme from being a division algebra.
Crossed product
The generalisation in which Gal(K/F) is any finite group and the relations are governed by a 2-cocycle; the cyclic case is the one with cyclic group.

The notation (K/F,σ,a) is Lam's. Elsewhere one meets (K/F,σ,a) 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 (14.5): (bxi)(cxj)=bσi(c)xi+j, and if i+js one writes xi+j=axi+js, legitimate because aF is central. Associativity is then a finite check, or is inherited for free from the presentation (14.5) as a quotient of K[t;σ] — the polynomial tsa is central there because σs=id and σ(a)=a.

(bxi)(cxj)=bσi(c)xi+j,xi+j={xi+j,i+j<s,axi+js,i+js.
(M)

x is a unit, and that is the engine of simplicity

Since xs=aF×, the element x is invertible with x1=a1xs1. Hence every basis element bxi with b0 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 s, the automorphisms id,σ,,σs1 are pairwise distinct as maps KK. So for 0i<js1 there exists bK with σi(b)σj(b). This tiny observation is used twice: once to shrink ideal elements, once to force centralisers into K.

Key Results

Theorem(14.6)Structure of a cyclic algebra

Let K/F be cyclic Galois of degree s with Gal(K/F)=σ, let aF×, and set D=(K/F,σ,a). Then:

  1. D is a simple F-algebra with Z(D)=F; in particular D is central simple over F of dimension s2.
  2. CD(K)=K.
  3. K is a maximal subfield of D.
Proof

(1) Simplicity. Let 𝔄0 be a two-sided ideal. Among the nonzero elements of 𝔄 choose one with the fewest nonzero coordinates,

α=bi1xi1++birxir,0i1<<irs1,bij0.

Suppose r2. Since σi1σir, pick bK with σi1(b)σir(b). The ideal contains both αb=jbijσij(b)xij and σi1(b)α=jσi1(b)bijxij, hence their difference

αbσi1(b)α=j=2rbij(σij(b)σi1(b))xij.

Its xi1-coordinate has vanished while its xir-coordinate bir(σir(b)σi1(b)) is nonzero, so it is a nonzero element of 𝔄 with fewer terms — contradiction. Hence r=1 and α=bi1xi1, a unit; so 𝔄=D.

**(2) Centraliser of K.** Let d=i=0s1bixi centralise K. For bK, comparing coordinates in db=bd gives biσi(b)=bbi for every i. If bi0 for some 1is1, then σi(b)=b for all bK, i.e. σi=id, contradicting |σ|=s. So d=b0K, and KCD(K) is trivial.

**(3) Maximality of K.** If L is a subfield of D with KL, then L is commutative, so LCD(K)=K, giving L=K.

Centre. FZ(D) holds by construction. Conversely bZ(D) lies in CD(K)=K, and bx=xb=σ(b)x forces σ(b)=b; since σ=Gal(K/F), Galois theory gives bF. Hence Z(D)=F.

Example(14.6a)Simple but not a division algebra

Take a=1, so xs=1 and (1x)(1+x++xs1)=0. For s>1 both factors are nonzero, so (K/F,σ,1) has zero divisors. Simplicity is therefore strictly weaker than being a division algebra — as it must be, since Ms(F) is simple.

Theorem(14.7)Splitting criterion

With K/F, σ, s, a as above and D=(K/F,σ,a), and with N=NK/F the field norm:

DMs(F) as F-algebrasaN(K×).
Proof

**() Reduce to a=1.** Suppose a=N(d)1 for some dK×, i.e. N(d)a=1. Put y=dx. Repeatedly pushing x past the coefficients gives ys=dσ(d)σs1(d)xs=N(d)a=1, and for bK we have yb=dxb=dσ(b)x=σ(b)y. Since yiK×xi, the elements 1,y,,ys1 form a left K-basis, so D(K/F,σ,1).

**() The case a=1 splits.** Write D=(K/F,σ,1)=B/(ts1) with B=K[t;σ]. Because the coefficients of ts1=(ts1++t+1)(t1) lie in the prime field, the factorisation is valid in B, so (ts1)B(t1). The left ideal B(t1) is maximal, since dimFB/B(t1)=deg(t1)dimFK=s and B is a principal left ideal domain in which degree-one factors are irreducible. Hence M=B/B(t1) is a simple left D-module with dimFM=s, and the action gives an F-algebra map DEndF(M)Ms(F). It is injective because D is simple, and both sides have F-dimension s2, so it is an isomorphism.

**().** If DMs(F) then D has a simple module of F-dimension s. Writing D=B/(tsa), such a module is B/Bf for a principal left ideal with Bf(tsa), and s=dimFB/Bf=(dimFK)degf=sdegf, so degf=1. After scaling on the left, f=tc with cK. Then tsa=β(tc) for some β=ibitiB; multiplying out and comparing coefficients from the top down yields successively

bs1=1,bs2=σs1(c),bs3=σs1(c)σs2(c),,b0=σs1(c)σ(c),

and finally, from the constant term, a=b0c=σs1(c)σ(c)c=N(c)N(K×).

Corollary(14.8)Prime degree

Suppose in addition that s is a prime number. Then D=(K/F,σ,a) is a division algebra if and only if aNK/F(K×).

Proof

If aN(K×) then DMs(F) by (14.7), which is not a division algebra as s2. Conversely suppose D is not a division algebra. D is a simple F-algebra of dimension s2, so Wedderburn–Artin gives DMr(E) with E a division F-algebra and necessarily r>1. Comparing dimensions, s2=r2dimFE, so r2s2. As s is prime, the square divisors of s2 are 1 and s2; since r>1 we get r=s and dimFE=1, i.e. E=F and DMs(F). By (14.7), aN(K×).

Remark(14.9)Beyond prime degree

When s is composite, aN(K×) is no longer sufficient — D can be a proper matrix ring over a smaller division algebra. Wedderburn's 1914 sufficient condition asks instead that the image of a in the abelian group F×/N(K×) have order exactly s. That refinement, its proof by a norm on K[t;σ], 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.

Move 1

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.

Move 2

Separate points with the Galois action

Distinct powers of σ differ at some bK. This single fact drives both simplicity and the centraliser computation, and is the reason the Galois group must act faithfully.

Move 3

Change of generator absorbs a norm

Replacing x by y=dx multiplies a by N(d). So (K/F,σ,a) depends on a only through its class in F×/N(K×) — the whole splitting theory in one line.

Move 3 deserves to be stated as a lemma in its own right: for dK× there is an F-algebra isomorphism (K/F,σ,a)(K/F,σ,aNK/F(d)). It reduces every question about the algebra to a question about the class of a modulo norms, and it is why the norm group appears at all.

The dimension count in the converse half of (14.7) is also worth isolating: over a principal left ideal domain B that is free of rank deg over its coefficient field, dimFB/Bf=deg(f)dimFK. Turning module dimensions into polynomial degrees is what makes the norm appear from nothing.

Fix a cyclic extensionChoose K/F finite, separable, normal, with cyclic Galois group, and name a generator σ.
Compute the norm groupDetermine NK/F(K×)F× — usually the hardest step, and the only one that is genuinely arithmetic.
Choose a outside itFor prime degree, any aN(K×) works. For composite degree, aim for a whose class has order s.
Assemble the algebraTake i<sKxi with xs=a and xb=σ(b)x, or equivalently K[t;σ]/(tsa).
Verify and record invariantsDegree s, centre F, K a maximal subfield and a splitting field, class in Br(F) of order dividing s.

Worked Example

A quadratic example over a rational function field

Let E be a field with charE2, let t be transcendental over E, and set F=E(t), K=F(t). The extension K/F is cyclic of degree 2; let σ be the F-automorphism with σ(t)=t. For aE× we claim

D=(K/F,σ,a) is a division algebraa(E×)2.
(E.1)

So a single non-square in E produces a 4-dimensional division algebra over E(t).

Because s=2 is prime, (14.8) reduces the claim to: aNK/F(K×) if and only if a is a square in E×.

One direction is immediate. If a=b2 with bE×F× then a=bσ(b)=N(b).

The other direction is a degree count. Suppose a=N(f+tg)=f2tg2 with f,gE(t). Clear denominators: write f=f0/h, g=g0/h with f0,g0,hE[t] and h0. Then

ah(t)2=f0(t)2tg0(t)2.
(E.2)

The polynomial f02 has even degree and tg02 has odd degree, so no cancellation of leading terms is possible and the degree of the right-hand side is max{2degf0,1+2degg0}. The left-hand side has even degree 2degh, so the maximum must be attained by f02: thus degf0=degh and, comparing leading coefficients, a(lch)2=(lcf0)2. Hence a=(lcf0/lch)2(E×)2, as claimed.

This example is reused inside Lam's construction of a degree-4 cyclic division algebra (K/F,σ,1), where it identifies a centraliser as a division algebra; it is also the pattern behind most quaternion examples over function fields.

Comparison and Classification

Behaviour of (K/F,σ,a) as a varies
Choice of aStructureWhy
a=1Ms(F), split1=N(1); explicit zero divisors (1x) and 1+x++xs1
a=N(d) for some dK×Ms(F), split(14.7); substitute y=d1x to reduce to a=1
aN(K×), s primedivision algebra(14.8)
aN(K×), s compositeMr(E) for some division E; may or may not be a division algebraWedderburn–Artin permits 1<r<s
image of a has order s in F×/N(K×)division algebraWedderburn's theorem (14.9)
a=0 (not permitted)not simpleKx becomes an ideal; the construction requires aF×
What each hypothesis buys
dimFD=s2D simpleZ(D)=FK maximal subfieldD division
K/F finite separable normalyesyesyesyesno
Gal(K/F) cyclic, generated by σyesyesyesyesno
aF× (nonzero)yesyesyesyesno
aN(K×) and s primeyesyesyesyesyes
a of order s in F×/N(K×)yesyesyesyesyes

What each hypothesis buys

Is (K/F,σ,a) a division algebra?

aNK/F(K×)No — it is Ms(F), by (14.7). Reduce to a=1 by replacing x with d1x.
s prime and aN(K×)Yes, by (14.8). This settles quaternion algebras and all degree-3 examples.
s composite, class of a of order sYes, by Wedderburn's theorem (14.9) — sufficient but not necessary.
s composite, class of a of smaller orderUndecided by these criteria. Over a number field the converse of (14.9) holds, so the answer is no; over general F examples exist both ways.

Relationship Map

Cyclic algebras are the first rung of a ladder that reaches all central simple algebras.

Cyclic algebra (K/F,σ,a)Crossed product (K/F,G,c)Central simple F-algebraBrauer class in Br(F)
  • (K/F,σ,a) — what the construction specialises to
    • s=2
      • generalised quaternion algebra
      • =(/,conjugation,1)
    • a a norm
      • Ms(F)
      • trivial class in the Brauer group
    • K=k((xs)), F=k0((xs))
      • the finite-order twisted Laurent series division ring
      • a=xs
    • cyclic Kummer case
      • K=F(bs) with ζsF
      • the symbol algebra with xy=ζsyx

Emmy Noether's crossed products replace σ by an arbitrary finite Galois group and the single scalar a by a 2-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 2 and 3 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.

Wireless communications

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.

Number theory

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.

Algebraic geometry

Severi–Brauer varieties

A cyclic algebra of degree s 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.

Symbolic computation

Explicit algebra libraries

Magma and Sage represent cyclic and quaternion algebras by structure constants derived from (14.5), and implement splitting tests via norm equations over number fields.

Coding theory

Skew-cyclic and MRD codes

Maximum rank distance codes and skew-cyclic codes over finite fields use K[t;σ] and its quotients — the finite-field case of the presentation (14.5), where σ is a Frobenius power.

Quantum theory

Symbol algebras and root-of-unity relations

When F contains a primitive sth root of unity, the cyclic algebra becomes a symbol algebra with xy=ζsyx — 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.

Lam's notation(K/F,σ,a)
Crossed-product notation(K/F,G,c) with c a 2-cocycle; the cyclic case is c determined by a
Symbol notation, degree 2(b,aF) or (b,a)F for the quaternion algebra
Symbol notation, degree s(b,a)ζ when ζsF and K=F(bs)
Degree vs dimensionDegree s, dimension s2. Some sources say rank for s2 — check before quoting
MagmaCyclicAlgebra, QuaternionAlgebra, IsMatrixRing
Sage / GAPQuaternionAlgebra in Sage; AlgebraByStructureConstants in GAP for general degree
MarkupPresentation MathML per ISO/IEC 40314; symbols per ISO 80000-2

Computational 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 K is. The bottleneck is arithmetic in F, not in the algebra.

  • Multiplication of two general elements costs O(s2) multiplications in K plus O(s2) evaluations of powers of σ; precomputing σi on a basis of K reduces the latter to matrix–vector products.
  • Regular representation. The map sending d to the matrix of right multiplication on the left K-basis 1,x,,xs1 embeds D into Ms(K); this is how a machine stores the algebra and is the source of the reduced norm.
  • Splitting test. Deciding aNK/F(K×) 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-2 shortcut.** For quaternion algebras splitting reduces to solvability of the conic bu2+av2=w2, decidable over by Legendre's theorem plus factorisation of a and b.
  • Zero-divisor search is the wrong algorithm. Searching for zero divisors by brute force is exponential in dimFD 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 dimFK|Gal(K/F)| and the dimension count s2 fails.
  • Do not allow a=0: then Kx is a nonzero proper ideal and the algebra is not simple.
  • Do not assume K is the only maximal subfield. Non-isomorphic maximal subfields coexist; Lam's exercises for §14 exhibit them in Dickson's degree-3 example.
  • Do not confuse the degree s with the dimension s2, or the order of a in F×/N(K×) with the order of the Brauer class.
  • Do not expect (K/F,σ,a)(K/F,σ,a) to force a=a — the algebra sees a only modulo NK/F(K×).

Historical Notes and Lessons Learned

  • 1899Hilbert's twisted seriesThe finite-order case of k((x;σ)) exhibits, implicitly, the relations later abstracted as (14.5).
  • 1906Dickson defines cyclic algebrasDickson isolates the data (K/F,σ,a) 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 a in F×/N(K×).
  • 1929Noether's crossed productsEmmy Noether generalises to arbitrary finite Galois groups with a 2-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

DataK/F cyclic of degree s, Gal(K/F)=σ, aF×
Relationsxs=a and xb=σ(b)x for bK
PresentationK[t;σ]/(tsa)
DimensiondimFD=s2; degree s
Structuresimple, Z(D)=F, CD(K)=K
Splits iffaNK/F(K×)
Prime degreedivision aNK/F(K×)
Change of generator(K/F,σ,a)(K/F,σ,aNK/F(d))
Results at a glance
StatementHypothesesReference
dimFD=s2, FZ(D)K/F cyclic of degree s, aF×(14.5)
D simple, Z(D)=Fsame(14.6)(1)
CD(K)=Ksame(14.6)(2)
K is a maximal subfieldsame(14.6)(3)
DMs(F)aN(K×)same(14.7)
division aN(K×)same, and s prime(14.8)

Frequently Asked Questions

Why must the Galois group be cyclic?

Because a single adjoined symbol x 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 2-cocycle recording how they multiply — that is Noether's crossed product. The cyclic case is where the cocycle collapses to the single scalar a.

How much does the algebra depend on the choice of a?

Only on the class of a in F×/NK/F(K×). Replacing x by dx for dK× replaces a by aNK/F(d) and gives an isomorphic algebra. This is why the splitting criterion is a statement about norms and not about a itself.

Does the choice of generator σ matter?

Yes. Replacing σ by σj with gcd(j,s)=1 generally gives a different algebra; the standard relation is (K/F,σj,a)(K/F,σ,aj) in the Brauer group. In particular (K/F,σ1,a) is the opposite algebra of (K/F,σ,a).

Is every division algebra a cyclic algebra?

No. Every central simple algebra of degree 2 or 3 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 K is a splitting field?

Extending scalars, DFKMs(K). Concretely, the left-regular representation of D on itself as a K-space realises D inside Ms(K), and this embedding becomes an isomorphism after tensoring. Any maximal subfield of a central division algebra splits it.

Why is a=0 excluded?

With a=0 the element x is nilpotent rather than a unit, and Kx+Kx2+ is a nonzero proper two-sided ideal. Simplicity fails immediately — for s=2 the set Kx is already an ideal.

References

  1. 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.
  2. 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.
  3. N. Jacobson, Basic Algebra II, 2nd edition, W. H. Freeman, 1989, Chapter 4 (central simple algebras, crossed products, cyclic algebras).
  4. R. S. Pierce, Associative Algebras, Graduate Texts in Mathematics 88, Springer-Verlag, 1982, Chapters 13–15.
  5. P. Gille and T. Szamuely, Central Simple Algebras and Galois Cohomology, Cambridge Studies in Advanced Mathematics 101, Cambridge University Press, 2006, Chapter 2.
  6. S. A. Amitsur, “On central division algebras”, Israel Journal of Mathematics 12 (1972), 408–420.

AI Suggested Questions

  • Prove that (K/F,σ,a)F(K/F,σ,a) is Brauer-equivalent to (K/F,σ,aa).
  • Show that (K/F,σ,a) has order dividing s in the Brauer group of F, and find an example where the order is strictly smaller than s.
  • Work out the Severi–Brauer variety of a cyclic algebra of degree 3 and its rational points.
  • How is a cyclic algebra of degree s used to build a full-diversity space–time code, and where does the non-norm condition enter?
  • Give an algorithm deciding whether a is a norm from a cyclic extension of number fields, and state its complexity.
  • Compare cyclic algebras with symbol algebras when F contains a primitive sth root of unity.
  • Describe Amitsur's non-crossed-product division algebras and what degree is needed.
Page
KEVOS-ENG-MATH-NCR-0108
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

Continue learning

Twisted Laurent Series Division RingsArticle · Engineering MathematicsNEXT LESSON →Generalised Quaternion AlgebrasArticle · Engineering MathematicsCentrally Finite and Centrally Infinite Division RingsArticle · Engineering MathematicsThe Reduced Norm of a Cyclic AlgebraArticle · Engineering Mathematics