KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Matrix (Regular) Representation of Algebraic NumbersEngineering · Engineering MathematicsLesson 778/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginmatrix representationregular representationmultiplication matrixtrace
On this page

Ask about this page

KEVOS AIThe Matrix (Regular) Representation of Algebraic Numbers

KEVOS knowledge first · trusted web sources when needed

Number Fields and Algebraic Numbers

The Matrix (Regular) Representation of Algebraic Numbers

Representing a field element by its multiplication matrix, and reading trace, norm and characteristic polynomial off that matrix.

Engineering / MathematicsNumber Fields and Algebraic Numbers2 min readKV-MATH-0576

Every field element acts on the field by multiplication, and that action is a linear map. Its matrix carries all the invariants of the element and converts algebraic questions into linear algebra.

The construction

Fix a basis of the field. Multiply each basis element by the element in question and express the result in the basis; the coefficient vectors are the columns of the matrix.

M(a) = matrix of the map x -> a xAn n by n matrix over the rationals, or over the integers if a is an algebraic integer and the basis is integral.

Key point

The map from field elements to matrices is a ring homomorphism. Sums and products of elements correspond to sums and products of matrices, so the representation is faithful and computations may be carried out on either side.

Reading the invariants

Invariants read from the multiplication matrix
InvariantFrom the matrix
TraceTrace of the matrix
NormDeterminant of the matrix
Characteristic polynomialCharacteristic polynomial of the matrix
Minimal polynomialMinimal polynomial of the matrix
Degree of the elementDegree of the minimal polynomial; a proper divisor of n indicates a subfield

Note

The characteristic polynomial is a power of the minimal polynomial, with exponent the index of the subfield generated by the element. This gives an immediate test for whether an element generates the whole field — see the subfield problem.

Computation

Building the matrix costs n multiplications in the standard representation. The characteristic polynomial is then computed by Hessenberg reduction or modular methods.

Cost

The matrix representation is n times larger than the standard representation and correspondingly more expensive to store and multiply. It is built on demand for invariant computation rather than used as the working representation.

Integrality and the maximal order

Relative to an integral basis, an element is an algebraic integer exactly when its multiplication matrix has integer entries. This gives an effective integrality test and is the criterion used inside the Round 2 algorithm when enlarging an order.

Ideals as modules

The matrix representation also underlies ideal arithmetic: an ideal is a module stable under multiplication by the order, and stability is checked by applying multiplication matrices to the module's basis. See module representation.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.2.3. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • The Characteristic Polynomial and the Hessenberg Method
  • The Standard Representation of Algebraic Numbers
  • The Conjugate Vector Representation

Continue learning

The Standard Representation of Algebraic NumbersArticle · Engineering MathematicsNEXT LESSON →The Conjugate Vector RepresentationArticle · Engineering MathematicsNumber Fields: Definition and Basic PropertiesArticle · Engineering MathematicsTrace, Norm and the Characteristic PolynomialArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®