Finite Group Databasebeta

Minimal transitive degree

How few points can a group be shuffled on, in one orbit? The minimal faithful transitive degree μt(G) is the least m such that G embeds in Sₘ as a transitive subgroup — one orbit, every point reachable from every other.

One orbit is one coset space

A transitive action of G on m points is the action on the cosets of a point stabilizer H ≤ G, with m = [G : H]; its kernel is the normal core core(H) = ⋂g∈G gHg⁻¹. So the search runs over subgroups, not over actions:

μₜ(G) = min { [G : H]  :  H ≤ G,  core(H) = 1 }.

Such an H is called core-free. The trivial subgroup is always core-free (the regular action), so μt(G) is defined for every finite group, and:

When the regular action is the only option

μt(G) = |G| exactly when the trivial subgroup is the only core-free one — that is, when every nontrivial subgroup contains a nontrivial normal subgroup of G. Two ways this happens:

Contrast D₄, also of order 8: a reflection ⟨s⟩ is core-free of index 4, so μt(D₄) = 4.

Gap to the intransitive minimum

μ(G) = μt(G) whenever G is monolithic — it has a unique minimal normal subgroup. In a faithful family of orbits some member must escape that subgroup, and having escaped the only minimal normal subgroup its core is trivial, so that one orbit is already faithful.

When there are several minimal normal subgroups, splitting into orbits can pay. The extreme case is an abelian group, where μt = |G| always while μ is only the sum of the primary cyclic factors: μt(C₃ × C₃) = 9 against μ(C₃ × C₃) = 6, and μt(C₂ × C₃ × C₅) = 30 against μ = 10.

Values

group|G|μtcore-free stabilizer
Cₙnn1 (regular)
Q₈881 (regular)
D₄84a reflection C₂
Dn (n ≥ 3)2nna reflection C₂
Dicm4m4m1 (regular)
Sₙ (n ≥ 3)n!nSn−1
Aₙ (n ≥ 4)n!/2nAn−1
PSL(2,𝔽7)1687S₄ (Fano plane)

See also