Overview
- How can primitivity be proved?
- Why does a primitive group with a transposition equal Sₙ?
- Which single cycles force containment of Aₙ?
Blocks and primitivity
Let act on . A nonempty subset is a block if each translate is either equal to or disjoint from it. A transitive action is primitive if its only blocks have size or .
In a transitive action, translates of a block partition into subsets of equal size. Hence a transitive action of prime degree is primitive. For an irreducible separable polynomial with root , the action is primitive exactly when the root field has no proper intermediate field between and . This follows by applying the Galois correspondence to subgroups between a root stabilizer and the whole group.
For a polynomial map, decomposition of is related to primitivity of the monodromy action of over a function field. This is a different action from the Galois action on the roots of a fixed polynomial.
References 2
- DixonMortimer1996Blocks, stabilizers, and primitive actions.Source
- Cox2012Galois correspondence and the action on conjugates.Source
Transpositions
Theorem
A primitive subgroup containing a transposition is .
Proof
Form a graph on , joining to when . Conjugation by preserves this graph, so its connected components form a block system. There is an edge, and primitivity forces the graph to be connected. The transpositions associated with the edges of a connected graph generate every transposition: along a path, conjugating successive edge transpositions moves an endpoint step by step. They therefore generate , which is contained in .
Primitivity cannot be replaced by transitivity. The dihedral group has order eight and contains a transposition, while preserving the block system . It is a proper subgroup of , and is the root action of .
References 2
- DixonMortimer1996Primitive permutation groups and generation by transpositions.Source
- ConradSnAn · Theorem 2.1A useful sufficient condition for the required primitivity.Source
Long prime cycles
Suppose is transitive and contains a -cycle, with prime and . If a nontrivial block system had blocks of size , then . The cycle's induced action on the blocks has order dividing ; since , it must fix every block. Its restriction to each block is also trivial because . This contradicts the presence of a -cycle. Thus is primitive.
Taking powers can isolate a cycle under a coprimality condition. If one cycle has length coprime to every other cycle length, raising the permutation to the least common multiple of the other lengths eliminates those cycles and preserves an -cycle. An element of type does not yield a single 3-cycle by this argument.
References 2
- ConradSnAn · Theorem 2.1Source
- Jones2014Cycles · Remarks 1.4 and 1.6 (published version, p. 160)Source
Double transitivity
Theorem
For , a transitive subgroup containing an -cycle is doubly transitive. If it also contains a transposition, then .
Proof
If the cycle fixes , its powers act transitively on the other points. Thus the stabilizer is transitive there. Transitivity of now moves any ordered pair of distinct points to any other: first move the first point, then use its stabilizer to move the second. This is double transitivity. Conjugating one transposition by these elements supplies every transposition, which generates .
No primality condition on is needed. In arithmetic applications, a good reduction of factor degrees supplies the long cycle. Irreducibility supplies transitivity. A second squarefree pattern with one 2-cycle and all other cycles of odd lengths supplies a transposition by taking an odd power. The primes need not give compatible labelings of the roots: only the cycle types are used.
References 2
- DixonMortimer1996 · Chapter 1, The Basic IdeasThe stabilizer characterization of double transitivity; the short proof is included here.Source
- ConradSnAn · §1 and Example 2.3Arithmetic cycle-type witnesses and extracting a transposition by taking a power.Source
Jordan's theorem and Jones's extension
Theorem (Jordan)
If a primitive subgroup contains a -cycle with prime and , then .
Combining this with the preceding argument gives the following criterion: transitivity plus a prime cycle with forces . A Newton-slope denominator divisible by such a prime forces . Cauchy’s theorem then gives an element of order ; because , it has exactly one nontrivial cycle.
Theorem (Jones)
A primitive subgroup containing a nontrivial single cycle that fixes at least three points contains . The cycle length need not be prime.
This stronger result follows from the classification in Jones's paper and uses the classification of finite simple groups. The classical prime-cycle theorem does not require that classification. Both theorems assume primitivity.
References 2
- Jordan1871Historical source for primitive-group criteria.Source
- Jones2014Cycles · Theorem 1.1, Theorem 1.2, and Corollary 1.3Source
Example
Example ·
This polynomial is Eisenstein at , hence irreducible. Its action has prime degree five and is primitive. Put . The derivative vanishes only at ; the local maximum has value , and the local minimum has value , since . Monotonicity on the three intervals gives exactly three real roots.
The remaining two roots form one nonreal conjugate pair. Complex conjugation is therefore a transposition. The transposition criterion proves .
References 2
- Milne2022 · Chapter 4, “Examples of polynomials with S_p as Galois group over Q”Author’s book page
- ConradSnAn · Theorem 2.1Source
Hyperelliptic Jacobians
Large polynomial groups also constrain algebraic curves. Let have characteristic zero, let be separable of degree , and suppose or . For the smooth projective curve , Zarhin proves
Thus its Jacobian is absolutely simple. For example, has a genus-two Jacobian with no geometric endomorphisms beyond integer multiplication.
The proof uses the Galois action on the Jacobian’s 2-torsion, which is obtained from the permutation module on the roots. Irreducibility of alone does not give this conclusion. In positive characteristic other than 2, the theorem allows a supersingular exception.
References 1
- Zarhin2000Hyperelliptic · Theorem 2.1, Examples 2.2, and §3 (arXiv v2)Source
Superelliptic Jacobians
Let be the smooth projective model of , where is an odd prime. Then the automorphism already produces cyclotomic endomorphisms. Zarhin’s later theorem states that if , , and or , then
The proof relates endomorphisms to central simple representations. The revised proof handles the gap in the earlier argument for degree and . A separate theorem treats other doubly transitive groups with explicit restrictions on subgroup indices and .
References 1
- Zarhin2026Superelliptic · Theorems 1.2–1.3 and Remark 1.4 (arXiv v4)Source
Questions
Can the prime-length assumption in Jordan’s cycle criterion be removed?
Scope. Primitive finite permutation groups containing a nontrivial cycle with at least three fixed points
Yes: Jones’s Corollary 1.3 gives containment of without that assumption. The stronger theorem uses the classification of finite simple groups; the primitivity and fixed-point conditions remain essential.
References 1
- Jones2014Cycles · Corollary 1.3Source
Related topics
Connected diagrams
- Subgroup index and the smallest defining equation · Classical
- How do two modular factorizations determine S₅? · Classical
- When does a reciprocal polynomial have the full signed group? · Classical
- Catalan sections: factor reflection, resultants, and full symmetric groups · Claimed
- Central-binomial sections: exact groups and prime reductions · Claimed
- Legendre polynomials: irreducibility and all signed permutations · Claimed
- Four Jacobi families: modular forms, symmetric groups, and Jacobians · Claimed
- Negative Laguerre parameters: a complete Galois classification · Published
- Tridiagonal matrices, Galois groups, and spectral uncertainty · Conditional
- Composition, intermediate fields, blocks, and the off-diagonal curve · Published
Newton polygons and Galois groups
Suitable Newton-slope denominators force long prime cycles.
UsesDiscriminants, parity, and ramification
Once A_n is contained, the discriminant decides between A_n and S_n.
Contrasts withComposition and iteration
Polynomial decomposition concerns function-field monodromy; primitivity of a root action concerns intermediate fields.
Contrasts withReciprocal polynomials
Inverse pairs form blocks for the Galois action.
Linked from 14 articles
- Foundations: polynomials, fields, and Galois groups
- The Galois correspondence and intermediate fields
- Newton polygons and Galois groups
- Frobenius and factorization modulo primes
- Discriminants, parity, and ramification
- Ramification and inertia
- Resolvents and subgroup tests
- Trinomials
- Critical points and polynomial monodromy
- Branched covers and rigidity
- Composition and iteration
- Polynomial decomposition
- Irreducibility of iterates
- Arboreal Galois groups
References
- Permutation Groups
Dixon, John D. and Mortimer, Brian. Graduate Texts in Mathematics 163, Springer, 1996.
Read the source - Galois Theory
Cox, David A. Edition 2. John Wiley & Sons, 2012.
Read the source - Recognizing Galois groups S_n and A_n
Conrad, Keith. Author-hosted expository note.
Read the source - Primitive permutation groups containing a cycle
Jones, Gareth A. Bulletin of the Australian Mathematical Society, 89(1), 159–165, 2014.
Read the source - Théorèmes sur les groupes primitifs
Jordan, Camille. Journal de Mathématiques Pures et Appliquées (2), 16, 383–408, 1871.
Read the source - Fields and Galois Theory
Milne, James S. Kea Books, 2022.
Author’s book page - Hyperelliptic Jacobians without complex multiplication
Zarhin, Yuri G. Mathematical Research Letters, 7(1), 123–132, 2000.
Read the source - Superelliptic Jacobians and central simple representations
Zarhin, Yuri G. In Bruin, Nils and Kohel, David and Martindale, Chloe (editors), Arithmetic, Geometry, Cryptography and Coding Theory, American Mathematical Society, Contemporary Mathematics, 832, 175–209, 2026.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.