KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesSquarefree Factorisation of PolynomialsEngineering · Engineering MathematicsLesson 765/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginsquarefreederivativerepeated factorscharacteristic p
On this page

Ask about this page

KEVOS AISquarefree Factorisation of Polynomials

KEVOS knowledge first · trusted web sources when needed

Polynomial Factorisation

Squarefree Factorisation of Polynomials

Separating repeated factors using the derivative, and the modification required in positive characteristic.

Engineering / MathematicsPolynomial Factorisation2 min readKV-MATH-0563

A polynomial is squarefree when no irreducible factor appears more than once. Separating the repeated factors is the cheapest stage of factorisation and the one that every later stage assumes has run.

The characteristic zero case

A repeated factor of a polynomial also divides its derivative. The GCD of the polynomial with its derivative therefore collects exactly the repeated part.

g = gcd(f, f'), squarefree part = f / gOver a field of characteristic zero, or where the characteristic exceeds the degree.

Squarefree decomposition

  1. DifferentiateCompute the formal derivative.
  2. Take the GCDThe GCD collects each repeated factor with multiplicity one less than in f.
  3. DivideThe quotient is the product of the distinct irreducible factors.
  4. RecurseRepeating on the GCD separates factors by their exact multiplicity.

Key point

One GCD computation gives the squarefree part. Recursing gives the full decomposition into products of factors of each multiplicity, which is what the later stages need.

The characteristic p complication

Pitfall

In characteristic p, the derivative of a polynomial in X^p is identically zero. The GCD with the derivative is then the polynomial itself, and the method returns nothing useful.

The repair uses the fact that a polynomial with zero derivative is a p-th power in disguise: every exponent is divisible by p, so the polynomial equals the p-th power of the polynomial obtained by dividing exponents by p and taking p-th roots of coefficients.

Squarefree factorisation in characteristic p

  1. DetectIf the derivative is zero, the polynomial is a p-th power.
  2. Take the p-th rootDivide exponents by p; take p-th roots of coefficients, which over a finite field is the inverse Frobenius.
  3. RecurseFactor the root and raise multiplicities by p.
  4. Handle partial casesA factor may be a p-th power while the whole polynomial is not; handle the two parts separately.

Note

Taking a p-th root of a coefficient in a finite field is applying the inverse of Frobenius, which is raising to the power p to the n - 1 where n is the extension degree. It is a field operation, not a root extraction in any hard sense.

Cost

Cost

One polynomial GCD plus one division for the squarefree part; the full decomposition costs a small number of further GCDs. Negligible against the later stages, which is why it is always run first.

Other uses

Squarefree decomposition also extracts the minimal polynomial from a characteristic polynomial — see the Hessenberg method — and is used in prime decomposition to detect ramification.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 3.4.2. 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

  • Prime Decomposition when p Does Not Divide the Index
  • Polynomial Factorisation: Overall Strategy
  • Distinct Degree Factorisation

Continue learning

Polynomial Factorisation: Overall StrategyArticle · Engineering MathematicsNEXT LESSON →Distinct Degree FactorisationArticle · Engineering MathematicsResultants and DiscriminantsArticle · Engineering MathematicsCantor-Zassenhaus Equal Degree SplittingArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®