Frobenius and factorization modulo primes
Factor degrees modulo a good prime give cycle lengths in the Galois group. Combining these cycles can determine the group.
ArticleDiscriminants, parity, and ramification
The discriminant detects repeated roots. For a separable polynomial in characteristic different from two, its square class determines whether every Galois permutation is even.
ArticleRamification and inertia
Inertia describes the Galois action at ramified primes. An odd prime dividing a monic integer polynomial’s discriminant exactly once gives a transposition.
ArticleTransitivity, primitivity, and cycle criteria
Primitivity and cycle structure give criteria for G ⊇ Aₙ and G = Sₙ.
ArticleResolvents and subgroup tests
Resolvents convert the Galois action on expressions in the roots into factorization tests for subgroups.
ArticleReciprocal polynomials
A reciprocal polynomial of degree reduces to a polynomial of degree in . Its roots then require quadratic extensions.
ArticleReferences
- Théorèmes sur les groupes primitifsJordan, Camille · 1871
Establishes primitive-group results used to prove containment of A_n in polynomial Galois groups. Modern expositions give the prime-cycle criterion in current terminology, including its primitivity hypothesis.
- Permutation GroupsDixon, John D. and Mortimer, Brian · 1996
Treats transitivity, block systems, primitive groups, and Jordan-type criteria for large permutation groups. These criteria apply once modular factorization or local ramification has supplied cycle information.
- Chebotarëv and his density theoremStevenhagen, Peter and Lenstra, Jr., Hendrik W. · 1996
Explains Frobenius conjugacy classes and their relation to splitting modulo primes, with the history and proof of Chebotarev’s theorem. It describes what modular factorization data can establish and what remains undetermined.
- Primitive permutation groups containing a cycleJones, Gareth A. · 2014
Classifies primitive finite permutation groups containing a cycle and strengthens Jordan’s prime-cycle theorem. Theorems 1.1–1.2 and Corollary 1.3 justify the cycle criteria used here. Prefer the published version: Remark 1.9 corrects the older preprint’s distinction between polynomial composition and primitivity of a fixed polynomial’s root action.
- Effective versions of the Chebotarev density theoremLagarias, Jeffrey C. and Odlyzko, Andrew M. · 1977
Gives conditional and unconditional effective Chebotarev estimates. These bound the primes with specified Frobenius conjugacy classes.
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.