✦ScienexySCIENCE KNOWLEDGE LIBRARY
concept · INFO-MAT-AALG-103

Orbit-Stabilizer Theorem

The Orbit-Stabilizer Theorem relates the size of an orbit to the size of the stabilizer in a finite group action.

|Orb(x)| = |G| / |Stab(x)|

Explanation

Let a finite group G act on a set X, and let x ∈ X. The Orbit-Stabilizer Theorem states that the number of elements in the orbit of x equals the order of G divided by the order of the stabilizer of x. The theorem follows because the elements of G that send x to the same point form a coset of the stabilizer. Therefore, the group is partitioned into equally sized collections, each corresponding to one element of the orbit. This result is fundamental in counting arguments and helps explain how the amount of symmetry fixing an object affects the number of distinct positions it can occupy.

Variables

SymbolMeaning

G

The finite acting group.

x

An element of the acted-upon set.

Orb(x)

The orbit of x.

Stab(x)

The stabilizer of x.

|G|

The order of G.

Example or application

Description: The rotation group of a square has four elements and acts on its four vertices.
Group Order: |G| = 4.
Stabilizer Order: |Stab(x)| = 1.
Calculation: |Orb(x)| = 4/1 = 4.
Conclusion: Every vertex can be reached from the chosen vertex.

Key Properties

  • The theorem applies to finite groups in its counting form.

  • The stabilizer is a subgroup of G.

  • The orbit size divides the group order.

  • A larger stabilizer produces a smaller orbit when the group is fixed.

  • If the action is transitive on a finite set X, then |X| = |G|/|Stab(x)|.

Applications

  • Counting the number of distinct positions of an object under symmetry.

  • Determining orbit sizes in permutation groups.

  • Studying transitive group actions.

  • Supporting combinatorial counting arguments.

Common Mistakes

  • Dividing by the orbit size instead of the stabilizer size.

  • Using the order of the set X in place of the order of G.

  • Applying the finite counting formula without checking the group is finite.

Related Concepts

  • Orbits and Stabilizers

  • Group Actions on Sets

  • Fixed Points of Group Actions

  • Burnside's Lemma

Learning Guide

Core Idea

The Orbit-Stabilizer Theorem relates the size of an orbit to the size of the stabilizer in a finite group action.

Worked Example

Description: The rotation group of a square has four elements and acts on its four vertices.
Group Order: |G| = 4.
Stabilizer Order: |Stab(x)| = 1.
Calculation: |Orb(x)| = 4/1 = 4.
Conclusion: Every vertex can be reached from the chosen vertex.

How To Study

  • Write the formal definition and identify every object, operation, and hypothesis.

  • Work through the supplied example one step at a time; explain why each step is valid.

  • Check the listed properties and compare the example with at least one common mistake.

  • Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.

Self Check

QuestionAnswer

In your own words, what is orbit-stabilizer theorem?

The Orbit-Stabilizer Theorem relates the size of an orbit to the size of the stabilizer in a finite group action.

What definition, condition, or property should you check first when solving a problem about orbit-stabilizer theorem?

Start by checking the relevant defining properties: The theorem applies to finite groups in its counting form; The stabilizer is a subgroup of G; The orbit size divides the group order; A larger stabilizer produces a smaller orbit when the group is fixed. Verify every required hypothesis before applying a theorem.

How is orbit-stabilizer theorem connected to the wider study of abstract algebra?

It belongs to Group actions and advanced group theory. It connects naturally with Orbits and Stabilizers, Group Actions on Sets, Fixed Points of Group Actions, Burnside's Lemma.

Mastery Checklist

  • I can state the definition of orbit-stabilizer theorem accurately.

  • I can identify the assumptions and notation used in a problem.

  • I can explain at least one example and justify each important step.

  • I can recognize a common mistake and explain why it is incorrect.

Examples

NameDescription

Worked example

Description: The rotation group of a square has four elements and acts on its four vertices.
Group Order: |G| = 4.
Stabilizer Order: |Stab(x)| = 1.
Calculation: |Orb(x)| = 4/1 = 4.
Conclusion: Every vertex can be reached from the chosen vertex.

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Standard abstract-algebra definitions and examples; no specific external reference has been independently verified.

Suggest a correction or source · More in Abstract Algebra