KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesUnique Factorisation Domains, Content and Primitive PartsEngineering · Engineering MathematicsLesson 760/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin JoginUFDcontentprimitive partGauss lemma
On this page

Ask about this page

KEVOS AIUnique Factorisation Domains, Content and Primitive Parts

KEVOS knowledge first · trusted web sources when needed

Polynomial Arithmetic and GCD

Unique Factorisation Domains, Content and Primitive Parts

Content and primitive part, Gauss's lemma, and why factoring over the rationals reduces to factoring over the integers.

Engineering / MathematicsPolynomial Arithmetic and GCD2 min readKV-MATH-0558

Polynomials over a unique factorisation domain factor uniquely, but the factorisation splits into two parts: a constant content and a primitive polynomial. Separating them is the first step of every integer polynomial algorithm.

Content and primitive part

Content
The GCD of the coefficients, taken with a sign convention — usually positive.
Primitive part
The polynomial divided by its content. Its coefficients have GCD one.
Primitive polynomial
One whose content is one.
f = cont(f) * pp(f)The decomposition is unique up to units.

Gauss's lemma

The product of primitive polynomials is primitive. Equivalently, content is multiplicative.

cont(f g) = cont(f) cont(g)Gauss's lemma, in its computational form.

Key point

This is the result that makes integer polynomial factorisation well posed. Without it, a factorisation over the rationals could not be cleared to one over the integers without introducing spurious constants.

Rational to integer reduction

A polynomial with rational coefficients is factored by clearing denominators, factoring over the integers, and reinstating the rational constant.

Factoring over the rationals

  1. Clear denominatorsMultiply by the least common multiple of the denominators.
  2. Extract contentDivide out the integer content.
  3. Factor the primitive partUsing integer factorisation methods.
  4. ReassembleReinstate the constant factor.

Note

A polynomial is irreducible over the rationals exactly when its primitive part is irreducible over the integers. The two questions are the same question, which is why algorithms are stated for the integer case.

Content over a general UFD

The same decomposition works over any unique factorisation domain, with the coefficient GCD computed in that domain. For multivariate polynomials this is applied recursively, treating a polynomial in several variables as a polynomial in one variable over a ring of polynomials in the rest.

Pitfall

The sign convention for content is a real source of inconsistency. Fixing it — content positive, or leading coefficient of the primitive part positive — is necessary for canonical output, and different systems make different choices.

Why it matters for growth

Cost

Removing content at each step of a polynomial remainder sequence bounds the coefficients — this is the primitive remainder sequence. It works but costs a coefficient GCD at every step. The sub-resultant algorithm achieves nearly the same bound far more cheaply.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 3.2.2-3.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 Polynomial Euclidean Algorithm over a Field
  • Polynomial GCD over a Unique Factorisation Domain

Continue learning

The Polynomial Euclidean Algorithm over a FieldArticle · Engineering MathematicsNEXT LESSON →Polynomial GCD over a Unique Factorisation DomainArticle · Engineering MathematicsPolynomial Division with RemainderArticle · Engineering MathematicsThe Sub-Resultant GCD AlgorithmArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®