Math 2.0

Group theory and generalizations Proof

Proof of the orbit-stabiliser theorem

Builds on Group actionOrbitStabiliserLeft cosetIndex of a subgroupSubgroup criterion

Proof

We prove that g⋅x=h⋅xg \cdot x = h \cdot x exactly when gGx=hGxg G_x = h G_x. Let ee be the identity of GG, and let H=GxH = G_x be the stabiliser of xx.

The set HH is a subgroup of GG, by the subgroup criterion. First, e⋅x=xe \cdot x = x, so e∈He \in H. If a,b∈Ha, b \in H, then b−1⋅x=b−1⋅(b⋅x)=e⋅x=xb^{-1} \cdot x = b^{-1} \cdot (b \cdot x) = e \cdot x = x. So (ab−1)⋅x=a⋅(b−1⋅x)=x(a b^{-1}) \cdot x = a \cdot (b^{-1} \cdot x) = x, and ab−1∈Ha b^{-1} \in H.

  1. Let g,h∈Gg, h \in G. By the axioms of an action, g⋅x=h⋅xg \cdot x = h \cdot x implies (g−1h)⋅x=g−1⋅(h⋅x)=g−1⋅(g⋅x)=e⋅x=x(g^{-1} h) \cdot x = g^{-1} \cdot (h \cdot x) = g^{-1} \cdot (g \cdot x) = e \cdot x = x. So g−1h∈Hg^{-1} h \in H.
  2. Conversely, if g−1h∈Hg^{-1} h \in H, then h⋅x=(gg−1h)⋅x=g⋅((g−1h)⋅x)=g⋅xh \cdot x = (g g^{-1} h) \cdot x = g \cdot ((g^{-1} h) \cdot x) = g \cdot x. So g⋅x=h⋅xg \cdot x = h \cdot x if and only if g−1h∈Hg^{-1} h \in H.
  3. Next, if g−1h=k∈Hg^{-1} h = k \in H, then h=gkh = g k. Each element of hHh H is gkk′g k k' with k′∈Hk' \in H, and kk′∈Hk k' \in H. So hH⊆gHh H \subseteq g H.
  4. In the same way, h−1g=k−1∈Hh^{-1} g = k^{-1} \in H gives gH⊆hHg H \subseteq h H. So g−1h∈Hg^{-1} h \in H implies gH=hHg H = h H.
  5. Conversely, if gH=hHg H = h H, then h=he∈hH=gHh = h e \in h H = g H. So h=gkh = g k for some k∈Hk \in H, and g−1h=k∈Hg^{-1} h = k \in H.
  6. By steps 2 to 5, g⋅x=h⋅xg \cdot x = h \cdot x if and only if the left cosets gHg H and hHh H are equal.
  7. Define Φ(gH)=g⋅x\Phi(g H) = g \cdot x. By the direction "equal cosets give equal points" of step 6, the value does not depend on the representative gg. So Φ\Phi is well defined.
  8. By the other direction of step 6, Φ(gH)=Φ(hH)\Phi(g H) = \Phi(h H) implies gH=hHg H = h H. So Φ\Phi is injective.
  9. Each point of the orbit G⋅xG \cdot x has the form g⋅x=Φ(gH)g \cdot x = \Phi(g H). So Φ\Phi maps the set of left cosets of HH onto G⋅xG \cdot x.
  10. Hence Φ\Phi is a bijection from the set of left cosets of GxG_x to G⋅xG \cdot x. By the definition of the index, ∣G⋅x∣=[G:Gx]\abs{G \cdot x} = [G : G_x].

Idea

Two group elements move xx to the same point exactly when they differ by an element that fixes xx. That is the same as lying in the same left coset of the stabiliser. So the points of the orbit match the cosets one to one.

Reading path

To understand this page from the ground up, read these 17 pages in order. The foundations come first. The path takes the proofs Proof of the uniqueness of inverses, Proof of the subgroup criterion.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary operation definition
  2. Group concept
  3. Identity element definition
  4. Group homomorphism definition
  5. Subgroup definition
  6. Symmetric group definition
  7. Inverse element definition
  8. Group action definition
  9. Left coset definition
  10. Proof of the uniqueness of inverses proof
  11. Orbit definition
  12. Stabiliser definition
  13. Index of a subgroup definition
  14. Uniqueness of inverses statement
  15. Proof of the subgroup criterion proof
  16. Subgroup criterion statement
  17. Proof of the orbit-stabiliser theorem proof

Where this leads

47 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Group_action, Orbit–stabilizer theorem
About this page
TagK3EHDJ6W5B
URIm2://K3EHDJ6W5B
Kindproof
WritingW0 stub
MSC20B05
ProvesOrbit-stabiliser theorem
UsesGroup action, Orbit, Stabiliser, Left coset, Index of a subgroup, Subgroup criterion
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.