KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesTrace, Norm and the Characteristic PolynomialEngineering · Engineering MathematicsLesson 783/887← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Jogintracenormcharacteristic polynomialfield polynomial
On this page

Ask about this page

KEVOS AITrace, Norm and the Characteristic Polynomial

KEVOS knowledge first · trusted web sources when needed

Number Fields and Algebraic Numbers

Trace, Norm and the Characteristic Polynomial

Trace, norm and characteristic polynomial of a field element, their computation, and their use as invariants and cross-checks.

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

Trace and norm are the two most useful scalar invariants of a field element. They are the extreme coefficients of the characteristic polynomial, and both are computable in several ways, which makes them excellent cross-checks.

Definitions

Tr(a) = sum of conjugates, N(a) = product of conjugatesSummed and multiplied over all n embeddings.
Four routes to trace and norm
RouteTraceNorm
Matrix representationTrace of the matrixDeterminant of the matrix
Conjugate vectorSum of entriesProduct of entries
Characteristic polynomialNegative of the second coefficientConstant term, up to sign
ResultantNot directlyResultant of the element's polynomial with the defining polynomial

Key point

Having several independent routes is not redundancy but insurance. Computing the norm both as a determinant and as a product of conjugates catches errors in the embeddings, the basis, or the arithmetic.

Properties

Trace is additive
The trace of a sum is the sum of traces; it is a linear map to the rationals.
Norm is multiplicative
The norm of a product is the product of norms. This is what makes the norm useful for factorisation arguments.
Integrality
For an algebraic integer, both are rational integers.
Units
An algebraic integer is a unit exactly when its norm is plus or minus one.

Key point

The norm criterion for units is the workhorse test. It reduces a question about invertibility in the maximal order to a single integer computation.

Characteristic versus minimal polynomial

The characteristic polynomial of the multiplication matrix always has degree n. It equals the minimal polynomial raised to the power n divided by the degree of the element.

char(a) = min(a)^(n / deg(a))Equal exactly when a generates the whole field.

Note

Because of this, the characteristic polynomial is sometimes called the field polynomial. Extracting the minimal polynomial requires squarefree factorisation, and the exponent found identifies the subfield degree.

The trace form

The bilinear form sending a pair of elements to the trace of their product is non-degenerate for a separable extension. Its matrix relative to a basis is the trace matrix, whose determinant is the discriminant — see discriminants and integral bases.

Key point

The trace form is the bridge from element invariants to field invariants. The discriminant, which measures ramification and controls the maximal order computation, is simply the determinant of this form.

Ideal norms

The norm extends from elements to ideals, where it is defined as the index of the ideal in the maximal order and agrees with the element norm on principal ideals. See ideal norm computation.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.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
  • Ideal Norm Computation
  • The Conjugate Vector Representation
  • Discriminants and Integral Bases

Continue learning

The Conjugate Vector RepresentationGuide · Engineering MathematicsNEXT LESSON →Discriminants and Integral BasesGuide · Engineering MathematicsThe Matrix (Regular) Representation of Algebraic NumbersArticle · Engineering MathematicsThe Polynomial Reduction AlgorithmArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®