Orbit-Stabilizer Theorem Equation, Derivation & Rearrangements

Core idea

Overview

The Orbit-Stabilizer Theorem establishes a fundamental relationship between a group acting on a set and the symmetry of the elements within that set. It states that the size of the group is equal to the product of the size of an element's orbit and the order of its stabilizer subgroup.

When to use: Use this theorem when you need to calculate the number of unique arrangements under symmetry or determine the size of a symmetry group. It is applicable whenever a finite group G acts on a finite set X.

Why it matters: This theorem is the cornerstone of group theory applications in combinatorics, chemistry (molecular symmetry), and crystallography. It allows mathematicians to simplify complex counting problems by focusing on fixed points and stabilizers.

Symbols

Variables

|G| = |G|

∣ G ∣

|G|

V a r iab l e

Walkthrough

Derivation

Derivation/Understanding of Orbit-Stabilizer Theorem

This derivation establishes the Orbit-Stabilizer Theorem, which states that for a group acting on a set, the size of an element's orbit is equal to the index of its stabilizer subgroup in the group.

Let G be a group acting on a set X.
Let x be an arbitrary element of the set X.

1

Define Orbit and Stabilizer:

We begin by defining the two key concepts of the theorem: the orbit $O_{x}$ , which is the set of all elements in $X$ that $x$ can be mapped to by an action of $G$ , and the stabilizer $G_{x}$ , which is the subgroup of $G$ whose elements fix $x$ .

Let G be a group acting on a set X . For any x \in X, O_{x} = {g \cdot x ∣ g \in G} is the orbit of x . G_{x} = {g \in G ∣ g \cdot x = x} is the stabilizer of x .

2

Construct a Coset Map:

We construct a function $ϕ$ that maps each left coset of the stabilizer $G_{x}$ to an element in the orbit $O_{x}$ . It is crucial to show that this map is well-defined, meaning the choice of representative for a coset does not alter the resulting element in the orbit.

Define a map ϕ : G / G_{x} \to O_{x} by ϕ (g G_{x}) = g \cdot x . This map is well-defined: if g G_{x} = h G_{x}, then h^{- 1} g \in G_{x}, so h^{- 1} g \cdot x = x ⟹ g \cdot x = h \cdot x .

3

Prove Bijectivity of the Map:

We demonstrate that the map $ϕ$ is both surjective (every element in the orbit is the image of some coset) and injective (distinct cosets map to distinct elements in the orbit). This establishes a one-to-one correspondence between the set of left cosets and the orbit.

The map ϕ is surjective: for any y \in O_{x}, there exists g \in G such that y = g \cdot x, so ϕ (g G_{x}) = y . The map ϕ is injective: if ϕ (g G_{x}) = ϕ (h G_{x}), then g \cdot x = h \cdot x ⟹ h^{- 1} g \cdot x = x ⟹ h^{- 1} g \in G_{x} ⟹ g G_{x} = h G_{x} .

4

Conclude the Theorem:

Because a bijection exists between the set of left cosets $G / G_{x}$ and the orbit $O_{x}$ , their cardinalities must be equal. By definition, the cardinality of $G / G_{x}$ is the index $[G : G_{x}]$ , thus proving the Orbit-Stabilizer Theorem.

Since ϕ is a bijection, the number of elements in its domain equals the number of elements in its codomain. Thus, ∣ G / G_{x} ∣ = ∣ O_{x} ∣. By definition, the number of left cosets of G_{x} in G is the index [G : G_{x}] . Therefore, ∣ O_{x} ∣ = [G : G_{x}] .

Result

Since ϕ is a bijection, the number of elements in its domain equals the number of elements in its codomain. Thus, ∣ G / G_{x} ∣ = ∣ O_{x} ∣. By definition, the number of left cosets of G_{x} in G is the index [G : G_{x}] . Therefore, ∣ O_{x} ∣ = [G : G_{x}] .

Source: Dummit, D. S., & Foote, R. M. (2004). Abstract Algebra (3rd ed.). John Wiley & Sons.

Free formulas

Rearrangements

Solve for $G$

Make G the subject

G

Start from the Orbit-Stabilizer Theorem. The theorem directly expresses the order of the group G, making G the conceptual subject without requiring algebraic rearrangement.

Difficulty: 2/5

Solve for $G \cdot x$

Make G x the subject

G \cdot x

Start from the Orbit-Stabilizer Theorem, which relates the order of a group to the size of an orbit and its stabilizer. To make the orbit $G \cdot x$ the subject, isolate the term representing its size, then conceptually identify the orbit itself.

Difficulty: 2/5

Solve for $G_{x}$

Make Gx the subject

G_{x}

Start from the Orbit-Stabilizer Theorem. To make $G_{x}$ the subject, divide both sides by $∣ G \cdot x ∣$ .

Difficulty: 2/5

The static page shows the finished rearrangements. The app keeps the full worked algebra walkthrough.

Visual intuition

Graph

Graph unavailable for this formula.

The graph is a straight line passing through the origin, showing that the output increases proportionally as the group size grows. For a student, this linear relationship means that doubling the group size directly doubles the product of the orbit and stabilizer sizes. Large values of x represent larger group structures, while small values indicate more restricted algebraic systems. The most important feature is the constant slope, which confirms that the ratio between the group size and its components remains perf

Graph type: linear

Why it behaves this way

Intuition

Consider a set of items being rearranged by a group of operations. The total number of operations in the group is equal to the number of unique positions a chosen item can end up in, multiplied by the number of

|G|

The total number of elements (or operations) in the group G.

Represents the overall 'size' or 'order' of the group, indicating how many distinct transformations are available.

∣ G \cdot x ∣

The number of distinct elements in the set X that the element x can be mapped to by the action of group G.

This is the 'reach' of x: how many unique positions or forms x can take under the group's transformations.

∣ G_{x} ∣

The number of elements in group G that leave the element x unchanged when applied.

This measures the 'internal symmetry' of x: how many transformations 'fix' x, returning it to its original state.

Free study cues

Insight

Canonical usage

This equation relates the sizes of finite sets (groups, orbits, and stabilizers), which are all dimensionless integer counts.

Common confusion

A common mistake for students new to abstract algebra is attempting to assign physical units to group orders or orbit sizes. These quantities are fundamental mathematical counts, not physical measurements.

Dimension note

All quantities in the Orbit-Stabilizer Theorem (|G|, |G $\cdot$ x|, | $G_{x}$ |) are counts of elements in finite sets (groups, orbits, and subgroups). As such, they are inherently dimensionless positive integers.

Unit systems

$∣ G ∣$ dimensionless · Represents the number of elements (order) in the finite group G.

$∣ G \cdot x ∣$ dimensionless · Represents the number of elements (size) in the orbit of element x under the action of group G.

$∣ G_{x} ∣$ dimensionless · Represents the number of elements (order) in the stabilizer subgroup of element x in group G.

One free problem

Practice Problem

A group G of order 24 acts on a set X. If the stabilizer of an element x has exactly 4 elements, what is the size of the orbit of x?

G_order24

Stab_order4

Solve for: $∣ G ∣$

Hint: The product of the orbit size and the stabilizer size equals the group order.

The full worked solution stays in the interactive walkthrough.

Where it shows up

Real-World Context

Calculating the number of rotational symmetries of a cube by considering the orbit of one face (which has 6 faces) and the stabilizer of that face (which has 4 rotations).

Study smarter

Tips

Ensure the group action is correctly defined on the set.
The stabilizer is always a subgroup of G, so its order must divide the group order.
Picking a representative element with a clear stabilizer often simplifies the calculation.

Avoid these traps

Common Mistakes

Confusing the size of the set X with the size of the orbit of a specific element.
Assuming all elements in the set have the same orbit size.
Mistaking the stabilizer for the centralizer or other subgroups.

Keep going

Related Formulas

Common questions

Frequently Asked Questions

This derivation establishes the Orbit-Stabilizer Theorem, which states that for a group acting on a set, the size of an element's orbit is equal to the index of its stabilizer subgroup in the group.

Use this theorem when you need to calculate the number of unique arrangements under symmetry or determine the size of a symmetry group. It is applicable whenever a finite group G acts on a finite set X.

This theorem is the cornerstone of group theory applications in combinatorics, chemistry (molecular symmetry), and crystallography. It allows mathematicians to simplify complex counting problems by focusing on fixed points and stabilizers.

Confusing the size of the set X with the size of the orbit of a specific element. Assuming all elements in the set have the same orbit size. Mistaking the stabilizer for the centralizer or other subgroups.

Calculating the number of rotational symmetries of a cube by considering the orbit of one face (which has 6 faces) and the stabilizer of that face (which has 4 rotations).

Ensure the group action is correctly defined on the set. The stabilizer is always a subgroup of G, so its order must divide the group order. Picking a representative element with a clear stabilizer often simplifies the calculation.

References

Sources

Dummit and Foote, Abstract Algebra
Herstein, Topics in Algebra
Wikipedia: Orbit-stabilizer theorem
Dummit, David S., and Richard M. Foote. Abstract Algebra. 3rd ed. John Wiley & Sons, 2004.
Gallian, Joseph A. Contemporary Abstract Algebra. 9th ed. Cengage Learning, 2017.
Dummit and Foote Abstract Algebra
Gallian Contemporary Abstract Algebra
Dummit, D. S., & Foote, R. M. (2004). Abstract Algebra (3rd ed.). John Wiley & Sons.

Orbit-Stabilizer Theorem

Overview

Variables

Derivation

Define Orbit and Stabilizer:

Construct a Coset Map:

Prove Bijectivity of the Map:

Conclude the Theorem:

Rearrangements

Graph

Intuition

Insight

Practice Problem

Real-World Context

Tips

Common Mistakes

Related Formulas

Lagrange's Theorem

Fermat's Little Theorem

Euler's Totient Function

Frequently Asked Questions

Sources