KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Resolvent Method for Galois GroupsEngineering · Engineering MathematicsLesson 821/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin JoginresolventGalois groupinvariantfactorisation pattern
On this page

Ask about this page

KEVOS AIThe Resolvent Method for Galois Groups

KEVOS knowledge first · trusted web sources when needed

Galois Groups and Field Families

The Resolvent Method for Galois Groups

Constructing resolvent polynomials whose factorisation distinguishes candidate Galois groups, and the practical issues in using them.

Engineering / MathematicsGalois Groups and Field Families2 min readKV-MATH-0619

A resolvent is a polynomial built from the roots whose factorisation pattern depends on the Galois group. Choosing resolvents that separate the candidate groups turns group identification into polynomial factorisation.

The construction

Choose a polynomial function of the roots that is invariant under a candidate subgroup. The resolvent is the product over coset representatives of the linear factors built from the images of that function.

R(X) = product over cosets of ( X - F(roots permuted) )F an invariant of the candidate subgroup H; the product runs over cosets of H.

Key point

The resolvent has rational coefficients even though it is built from the roots, because the full symmetric group permutes its factors. Computing it therefore never requires the roots explicitly — symmetric function methods or resultants suffice.

Reading the result

The resolvent has a rational root exactly when the Galois group is contained in a conjugate of the candidate subgroup. More generally, the degrees of its irreducible factors identify the group among the candidates.

Galois group by resolvents

  1. Compute the discriminantSquare or not — halves the candidate list.
  2. Sample cycle typesFactor modulo several primes to eliminate further candidates.
  3. Choose a resolventOne that separates the remaining possibilities.
  4. Compute itBy resultants or symmetric functions.
  5. Factor itOver the rationals — see integer factorisation.
  6. IdentifyRead the group from the factorisation pattern.

The repeated root problem

Pitfall

A resolvent with repeated roots gives an ambiguous factorisation pattern and the identification fails. The standard fix is a Tschirnhaus transformation — replace the generator by a polynomial in it — and recompute. The transformation changes the resolvent while preserving the field and hence the group.

Note

Tschirnhaus transformations increase coefficient sizes substantially, so a small transformation should be sought. Trying several and keeping the smallest working one is standard practice.

Cost

Where the cost lies in the resolvent method
StageCost driver
DiscriminantOne resultant
Cycle type samplingCheap; factorisation modulo small primes
Resolvent constructionDegree equal to the index of the subgroup; grows quickly
Resolvent factorisationThe dominant cost; large degree with large coefficients

Cost

Resolvent degrees grow rapidly with the index of the subgroup. For degree eight and above, the resolvents needed to separate some candidate pairs have degrees in the hundreds with enormous coefficients, which is why higher degrees are handled by specialised methods rather than by the generic construction.

Numerical shortcuts

Rather than computing a resolvent exactly, its roots can be approximated from numerical roots of the original polynomial and a rational root recognised directly. This is much faster but requires exact verification, exactly as in dependence detection.

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

  • Resultants and Discriminants
  • The Subfield Problem
  • Field Isomorphism and the Normal Closure
  • The Galois Group Computation Problem
  • Galois Groups of Cubic and Quartic Fields

Continue learning

The Galois Group Computation ProblemArticle · Engineering MathematicsNEXT LESSON →Galois Groups of Cubic and Quartic FieldsArticle · Engineering MathematicsThe Buchmann-Lenstra Prime Decomposition MethodArticle · Engineering MathematicsGalois Groups of Quintic FieldsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®