We prove the primitive three-cycle criterion through supports. First, suppose a subgroup contains , the alternating group on a set of at least three letters, and a three-cycle with support meeting .
If adds one letter, it has two letters in . The group is transitive on unordered pairs of : for three letters its cyclic action permutes the three pairs, and for at least four letters one can adjust the parity of a permutation sending one pair to another while preserving its target pair. Conjugating the new cycle, and using inverses, supplies every three-cycle on two old letters and the new letter. Together with , these generate .
If adds two letters, write its cycle as with . Choose and conjugate within to obtain . ThenThe preceding case first adds ; applying it again to adds . This proves connected triple supports generate an alternating group, by successively merging the intersecting triples of a connected support hypergraph. We used that three-cycles generate alternating groups: pairs of transpositions with a common letter are three-cycles, while a pair of disjoint transpositions is a product of two three-cycles.
Now take all conjugates in of the given three-cycle. Their support hypergraph is -invariant, and its connected components form a block system. Transitivity makes their union the whole set. There is an edge, so a component has more than one vertex. A primitive group action forces a single component. The preceding merging argument proves
For the first family of counterexamples, letIts elements are Möbius transformations , modulo nonzero scalar matrices. Any ordered triple of distinct projective points is the image of under exactly one such transformation: representatives of the first two target lines form a basis, and scaling the two columns sends their sum to the third target line. Thus the action is sharply three-transitive, hence two-transitive and primitive. Its degree is and order . It is divisible by , butso it cannot contain .
For the second example takeThe same projective-line construction over is sharply three-transitive. Its order is divisible by 7 and is less than , so it does not contain . For a concrete field one can use .
Use the displayed formula as a right group action: applying and then gives . It is transitive since sends the identity to . An element fixing every must have by evaluating at the identity, and then for every . Its kernel is therefore , which is trivial by the center of a group hypothesis.
The identity stabilizer subgroup is . For every subgroup containing , setConjugation by diagonal elements makes normal in . Multiplying by shows , soConversely each normal subgroup gives such an . Thus the subgroups strictly between and correspond exactly to proper nontrivial normal subgroups of .
For a transitive action, blocks containing a chosen point correspond to subgroups containing its stabilizer subgroup: a block is the orbit of that point under its setwise stabilizer subgroup, and conversely the orbit under an intermediate subgroup gives a block. Therefore the diagonal action on a centerless group is primitive exactly when is simple. A nontrivial centerless simple group cannot be abelian, because an abelian group's center of a group is the whole group. HenceThis uses the usual nontrivial degree convention. If one allows a one-point action to count as primitive, is the additional degenerate exception.
Articles by others on the same topic
There are currently no matching articles.