A permutation group is a group of bijections of a set, equivalently a subgroup of a symmetric group. Representing an abstract group as a permutation group means choosing a faithful action; different actions expose different subgroups, normal structure, and combinatorial geometry. Transitivity, regularity, primitivity, multiple transitivity, suborbits, and orbital graphs form the basic hierarchy of finite permutation groups. [@isaacs2008]

Definition and permutation representations

An action of \(G\) on \(\Omega\) gives a homomorphism

\[ \rho:G\longrightarrow\operatorname{Sym}(\Omega). \]

The action is faithful exactly when \(\ker\rho=1\). Its kernel is the intersection of all point stabilizers:

\[ \ker\rho=\bigcap_{\alpha\in\Omega}G_\alpha. \]

Cayley's representation is rarely of minimum degree. Finding a minimum faithful permutation degree amounts to finding subgroups whose cores have trivial intersection while minimizing the sum of their indices.

Transitive and coset actions

Finite transitive permutation theory therefore moves freely between the position of a point stabilizer \(H\) in \(G\) and the geometry of the action.

Multiple transitivity

\(S_n\) is \(n\)-transitive, while \(A_n\) is \((n-2)\)-transitive for \(n\geq4\). The affine group \(AGL(1,q)\) is doubly transitive. Groups \(V\rtimes GL(V)\) are usually doubly transitive on \(V\), and over \(\mathbf F_2\) some are triply transitive.

Blocks and primitivity

A transitive action is primitive if it has no nontrivial blocks and imprimitive otherwise. The translates of a nontrivial block form an equal-sized partition called a block system.

In the first case a block size divides the prime degree. In the second, if two points lie in one nontrivial block, transitivity of their point stabilizer on all remaining points forces that block to be all of \(\Omega\).

Orbits of normal subgroups

This is a decisive structural constraint. A minimal normal subgroup of a primitive group is transitive; if it is abelian, it is elementary abelian and regular, placing the group inside an affine group \(V\rtimes GL(V)\).

Regular normal subgroups

If \(N\triangleleft G\) is regular, fixing \(\alpha\) and putting \(H=G_\alpha\) gives

\[ G=N\rtimes H. \]

The conjugation action of \(H\) on \(N\setminus\{1\}\) is permutation-isomorphic to its action on \(\Omega\setminus\{\alpha\}\). Consequently:

  • \(G\) is doubly transitive exactly when \(H\) is transitive on \(N\setminus\{1\}\);
  • \(G\) is Frobenius exactly when \(H\) is semiregular there;
  • if \(H\) is \(k\)-transitive on the nonidentity elements, then \(G\) is \((k+1)\)-transitive on \(\Omega\).

Suborbits and subdegrees

Fix \(\alpha\in\Omega\). The orbits of \(G_\alpha\) on \(\Omega\) are the suborbits, and their sizes are the subdegrees. The trivial suborbit \(\{\alpha\}\) has size \(1\). The number of suborbits is the rank of the action.

Orbitals, suborbits, and subdegrees encode the same data from three viewpoints. The paired orbital reverses ordered pairs and has the same subdegree.

Orbital graphs

A nondiagonal orbital \(\Delta\) defines a directed graph with vertex set \(\Omega\) and arc set \(\Delta\). The group \(G\) acts vertex-transitively by graph automorphisms.

The criterion converts group structure into graph theory. Subdegrees become out-valencies, and primitivity becomes connectivity of every nontrivial orbital graph.

Jordan-type theorems

Similarly, a primitive group containing a \(3\)-cycle is \(A_n\) or \(S_n\). More general Jordan theorems use short prime cycles to force high transitivity. Isaacs, Section 8C uses this route to prove the simplicity of \(A_n\) for \(n\geq5\) and then the simplicity of most groups \(PSL(n,q)\). [@isaacs2008]

Examples across the hierarchy

This article follows the coset model, primitivity theory, Jordan theorems, and orbital graphs of Isaacs, Chapter 8, with definitions, proofs, and affine examples supplied in full. Terminology and general background were cross-checked against a standard permutation-group text and the cited Chinese and English encyclopedia revisions. [@isaacs2008] [@dixon1996] [@wikipedia-permutation-zh] [@wikipedia-permutation-en]