← LibraryThe Resolvent Method for Galois GroupsEngineering · MathematicsLesson 322/385← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin JoginresolventGalois groupinvariantfactorisation pattern

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.

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

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

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.

Continue learning

The Galois Group Computation ProblemArticle · MathematicsNEXT LESSON →Galois Groups of Cubic and Quartic FieldsArticle · MathematicsThe Buchmann-Lenstra Prime Decomposition MethodArticle · MathematicsGalois Groups of Quintic FieldsArticle · Mathematics