Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 13 of 33

Turn abstract multiplication into motion of a set

Prove orbit-stabilizer through a coset bijection.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

The symmetries of a square act on its four vertices. A chosen vertex can move to any of the four positions, but some symmetries leave it fixed. These two observations measure different things: the orbit records reachable positions, while the stabilizer records transformations that leave the chosen position unchanged.

There are eight symmetries, four possible positions, and two symmetries fixing one vertex. Predict why these counts multiply rather than add.

Predict

If two group elements move x to the same point, what does their relative product do to x? For a left action, g·x=h·x implies h⁻¹g fixes x. This suggests grouping transformations by left cosets of the stabilizer. The stabilizer need not be normal, because we need a coset set rather than a quotient group.

Experiment

For D₄, label vertices modulo four and use r(i)=i+1,s(i)=−i. The stabilizer of zero is {e,s}.

Coset of stabilizerImage of vertex zero
{e,s}0
{r,rs}1
{r²,r²s}2
{r³,r³s}3

Each pair consists of exactly the transformations giving the same image. Check a representative change explicitly: r and rs both send zero to one. This is the mechanism of the orbit-stabilizer theorem, not a coincidence of the square.

Understand

A left action of G on X assigns g·x∈X with e·x=x and (gh)·x=g·(h·x). Each g acts bijectively, with inverse action by g⁻¹. The orbit G·x is the set of all g·x. The stabilizer G_x is the subgroup of elements fixing x: identity fixes x, and if a,b fix it, then ab⁻¹ does too.

Define gG_x↦g·x. Equal cosets imply h⁻¹g∈G_x, hence equal images. Conversely equal images imply that same membership and equal cosets. The map is onto the orbit by its definition. Thus the orbit is in bijection with the left cosets of the stabilizer. For finite G, |G·x|=|G|/|G_x|.

An action is transitive when X is one orbit. It is faithful when only identity fixes every point, equivalently the associated map G→Sym(X) has trivial kernel. These properties are independent: an action on a singleton is transitive but is not faithful for a nontrivial group. The natural action of Sₙ on its n letters is both faithful and transitive when n≥1.

Every subgroup H gives an action on left cosets by g·aH=gaH. Representative independence follows because aH=bH implies gaH=gbH. An element g fixes every coset exactly when a⁻¹ga∈H for every a. Therefore the action kernel is the intersection of all aHa⁻¹, called the core of H. It is the largest normal subgroup of G contained in H.

Apply

Choose a different square vertex and compute its stabilizer. Compare it with the first stabilizer by conjugation. In a transitive action, stabilizers of different points are conjugate, not necessarily equal. Prove this by checking which transformations fix g·x.

When an orbit count looks wrong, audit whether you counted all group elements or only distinct images. Multiple transformations can have the same effect on one point while differing elsewhere. The practice asks you to make that distinction explicit in both finite calculations and general proofs.

Continue

Conjugation is an action of a group on itself. Its stabilizers are centralizers, and its orbit partition becomes the class equation, a powerful source of divisibility arguments.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

S₄ acts on four letters naturally. What is the stabilizer order of one letter?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

A group of order 60 acts on a set and a point has stabilizer order 12. What is its orbit size?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

State the axioms of a left action and explain why each g acts bijectively.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Prove G/G_x as a set of left cosets is in bijection with the orbit of x.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Show the natural action of S₃ on three letters is faithful and transitive, while its action on a singleton is transitive but not faithful.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Describe the action of G on left cosets of H and identify the kernel.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.