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 G≤SnG\le S_n act on Ω\Omega. A nonempty subset B⊆ΩB\subseteq\Omega is a block if each translate gBgB is either equal to BB or disjoint from it. A transitive action is primitive if its only blocks have size 11 or nn.

In a transitive action, translates of a block partition Ω\Omega into subsets of equal size. Hence a transitive action of prime degree is primitive. For an irreducible separable polynomial with root α\alpha, the action is primitive exactly when the root field K(α)K(\alpha) has no proper intermediate field between KK and K(α)K(\alpha). This follows by applying the Galois correspondence to subgroups between a root stabilizer and the whole group.

For a polynomial map, decomposition of f(X)f(X) is related to primitivity of the monodromy action of f(X)−tf(X)-t over a function field. This is a different action from the Galois action on the roots of a fixed polynomial.

References 2

Transpositions

Theorem

A primitive subgroup G≤SnG\le S_n containing a transposition is SnS_n.

Proof

Form a graph on Ω\Omega, joining aa to bb when (a b)∈G(a\ b)\in G. Conjugation by GG 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 SnS_n, which is contained in GG.

Primitivity cannot be replaced by transitivity. The dihedral group ⟨(1234),(13)⟩\langle(1234),(13)\rangle has order eight and contains a transposition, while preserving the block system {{1,3},{2,4}}\{\{1,3\},\{2,4\}\}. It is a proper subgroup of S4S_4, and is the root action of x4−2x^4-2.

References 2

Long prime cycles

Suppose GG is transitive and contains a qq-cycle, with qq prime and q>n/2q\gt n/2. If a nontrivial block system had aa blocks of size bb, then a,b≤n/2<qa,b\le n/2\lt q. The cycle's induced action on the blocks has order dividing qq; since a<qa\lt q, it must fix every block. Its restriction to each block is also trivial because b<qb\lt q. This contradicts the presence of a qq-cycle. Thus GG is primitive.

Taking powers can isolate a cycle under a coprimality condition. If one cycle has length mm coprime to every other cycle length, raising the permutation to the least common multiple of the other lengths eliminates those cycles and preserves an mm-cycle. An element of type (3,3)(3,3) does not yield a single 3-cycle by this argument.

References 2

Double transitivity

Theorem

For n≥3n\ge3, a transitive subgroup G≤SnG\le S_n containing an (n−1)(n-1)-cycle is doubly transitive. If it also contains a transposition, then G=SnG=S_n.

Proof

If the cycle fixes aa, its powers act transitively on the other n−1n-1 points. Thus the stabilizer GaG_a is transitive there. Transitivity of GG 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 SnS_n.

No primality condition on n−1n-1 is needed. In arithmetic applications, a good reduction of factor degrees (1,n−1)(1,n-1) 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 G≤SnG\le S_n contains a qq-cycle with qq prime and q≤n−3q\le n-3, then An⊆GA_n\subseteq G.

Combining this with the preceding argument gives the following criterion: transitivity plus a prime cycle with n/2<q≤n−3n/2\lt q\le n-3 forces AnA_n. A Newton-slope denominator divisible by such a prime qq forces q∣∣G∣q\mid |G|. Cauchy’s theorem then gives an element of order qq; because q>n/2q>n/2, it has exactly one nontrivial cycle.

Theorem (Jones)

A primitive subgroup containing a nontrivial single cycle that fixes at least three points contains AnA_n. 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

Example

Example · x5−4x+2x^5-4x+2

This polynomial is Eisenstein at 22, hence irreducible. Its action has prime degree five and is primitive. Put a=(4/5)1/4a=(4/5)^{1/4}. The derivative 5x4−45x^4-4 vanishes only at −a,a-a,a; the local maximum has value 2+16a/5>02+16a/5\gt 0, and the local minimum has value 2−16a/5<02-16a/5\lt 0, since a>5/8a\gt 5/8. 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 Gal⁡(x5−4x+2 /Q)=S5\operatorname{Gal}(x^5-4x+2\,/\mathbb Q)=S_5.

References 2

Hyperelliptic Jacobians

Large polynomial groups also constrain algebraic curves. Let KK have characteristic zero, let f∈K[x]f\in K[x] be separable of degree n≥5n\ge5, and suppose Gal⁡(f/K)=Sn\operatorname{Gal}(f/K)=S_n or AnA_n. For the smooth projective curve C:y2=f(x)C:y^2=f(x), Zarhin proves

End⁡K‾(Jac⁡C)=Z.\operatorname{End}_{\overline K}(\operatorname{Jac} C)=\mathbb Z.

Thus its Jacobian is absolutely simple. For example, y2=x5−x−1y^2=x^5-x-1 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 ff alone does not give this conclusion. In positive characteristic other than 2, the theorem allows a supersingular exception.

References 1

Superelliptic Jacobians

Let CC be the smooth projective model of yp=f(x)y^p=f(x), where pp is an odd prime. Then the automorphism (x,y)↦(x,ζpy)(x,y)\mapsto(x,\zeta_p y) already produces cyclotomic endomorphisms. Zarhin’s later theorem states that if K⊆CK\subseteq\mathbb C, deg⁡f=n≥5\deg f=n\ge5, and Gal⁡(f/K)=Sn\operatorname{Gal}(f/K)=S_n or AnA_n, then

End⁡C(Jac⁡C)≃Z[ζp].\operatorname{End}_{\mathbb C}(\operatorname{Jac} C)\simeq\mathbb Z[\zeta_p].

The proof relates endomorphisms to central simple representations. The revised proof handles the gap in the earlier argument for degree 55 and p>5p>5. A separate theorem treats other doubly transitive groups with explicit restrictions on subgroup indices and pp.

References 1

Questions

SettledGalois group

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 AnA_n without that assumption. The stronger theorem uses the classification of finite simple groups; the primitivity and fixed-point conditions remain essential.

References 1
Discuss this question →

Related topics

References

  1. Permutation Groups

    Dixon, John D. and Mortimer, Brian. Graduate Texts in Mathematics 163, Springer, 1996.

    Read the source
  2. Galois Theory

    Cox, David A. Edition 2. John Wiley & Sons, 2012.

    Read the source
  3. Recognizing Galois groups S_n and A_n

    Conrad, Keith. Author-hosted expository note.

    Read the source
  4. Primitive permutation groups containing a cycle

    Jones, Gareth A. Bulletin of the Australian Mathematical Society, 89(1), 159–165, 2014.

    Read the source
  5. 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
  6. Fields and Galois Theory

    Milne, James S. Kea Books, 2022.

    Author’s book page
  7. Hyperelliptic Jacobians without complex multiplication

    Zarhin, Yuri G. Mathematical Research Letters, 7(1), 123–132, 2000.

    Read the source
  8. 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