The VikiD Truth

Knowledge base / Mathematics

Abstract Algebra | ZF Axioms | Math Set Theory | Number Theory | Groups | Quotient Groups | Rings | Commutative Rings | Fields | Group Actions | Modules | Vector Spaces | Linear Operators and Matrices | Inner Product Spaces | Tensors | Exterior Algebras | Theory | Polynomial Rings | Category Theory |

algebra

Group Actions

In Groups I said a group is the mathematics of “doing and undoing”. Here’s the follow-up truth: a group action is when those doings actually do something to something.

A group on its own is a bag of abstract moves. An action lets the moves loose on a set (corners, colourings, points, solutions of an equation) and asks what happens to it.

The core idea, in plain words

An action of a group GG on a set XX assigns to every g∈Gg \in G and x∈Xx \in X a point g⋅x∈Xg \cdot x \in X, such that

  1. Doing nothing does nothing: e⋅x=xe \cdot x = x.
  2. Doing two things is doing their product: g⋅(h⋅x)=(gh)⋅xg \cdot (h \cdot x) = (gh) \cdot x.

From these, every gg shuffles XX without losing or merging points (its inverse undoes it), so an action is the same thing as a homomorphism from GG into the permutations of XX.

Two questions you can ask about a point xx:

And the headline result, the orbit–stabiliser theorem (for finite GG):

∣G∣=∣Orb⁡(x)∣×∣Stab⁡(x)∣ |G| = |\operatorname{Orb}(x)| \times |\operatorname{Stab}(x)|

More precisely, the orbit is in one-to-one correspondence with the cosets of the stabiliser, so ∣Orb⁡(x)∣=[G:Stab⁡(x)]|\operatorname{Orb}(x)| = [G : \operatorname{Stab}(x)].

The group is “rotate the carousel by some number of seats”. The set is the riders. Your orbit is every seat you could end up in. Your stabiliser is the rotations that leave you exactly where you are: only “rotate by zero”. Many moves, every one sends you somewhere different, so the number of moves equals the number of places you can reach. That’s orbit–stabiliser with a stabiliser of size 1.

A small worked example: the square’s symmetries acting on its corners

Label the corners of a square 1, 2, 3, 4 going round. Its symmetry group D4D_4 has 8 elements: 4 rotations (0°, 90°, 180°, 270°) and 4 reflections (2 diagonals, 2 through midpoints of opposite edges).

A bigger one: rotating a cube

The rotations of a cube form a group of order 24. Let’s count it without listing anything, using the action on the 8 vertices:

∣G∣=8×3=24. |G| = 8 \times 3 = 24.

Do it again with faces (orbit 6; stabiliser = 4 quarter-turns about that face’s axis): 6×4=246 \times 4 = 24. And with edges (orbit 12; stabiliser = identity and the 180° flip about the axis through that edge’s midpoint): 12×2=2412 \times 2 = 24. Three different counts, one answer. That’s the theorem doing the arithmetic for you. (Include reflections too and you get the full symmetry group of order 48.)

A picture in words

Imagine the set XX as dots, and draw an arrow x→g⋅xx \to g\cdot x for every move. The dots fall into separate clusters: within a cluster you can reach every dot, between clusters there are no arrows. Those clusters are the orbits. Because “is in the same orbit as” is an equivalence relation (reflexive by the identity, symmetric by inverses, transitive by composition), the orbits partition XX.

graph LR
  subgraph "D4 acting on corners: one orbit"
    c1((1)) --> c2((2)) --> c3((3)) --> c4((4)) --> c1
  end

(Arrows show the 90° rotation; it alone already links all four corners.)

Common misconceptions

How it connects

The truth revealed: a group shows you what it is by what it does. Watch where a point can go and what holds it still, and the size of the whole group falls out.

Last edited · 1 revisions

Tags: #Math