Group orbits partition

https://arbital.com/p/group_orbits_partition

by Patrick Stevens Jun 20 2016

When a group acts on a set, the set falls naturally into distinct pieces, where the group action only permutes elements within any given piece, not between them.


Let G be a Group, acting on the set X. Then the orbits of X under G form a [set_partition partition] of X.

Proof

We need to show that every element of X is in an orbit, and that if xX lies in two orbits then they are the same orbit.

Certainly xX lies in an orbit: it lies in the orbit OrbG(x), since e(x)=x where e is the identity of G. (This follows by the definition of an action.)

Suppose x lies in both OrbG(a) and OrbG(b), where a,bX. Then g(a)=h(b)=x for some g,hG. This tells us that h1g(a)=b, so in fact OrbG(a)=OrbG(b); it is an exercise to prove this formally.

%%hidden(Show solution): Indeed, if rOrbG(b), then r=k(b), say, some kG. Then r=k(h1g(a))=kh1g(a), so rOrbG(a).

Conversely, if rOrbG(a), then r=m(b), say, some mG. Then r=m(g1h(b))=mg1h(b), so rOrbG(b). %%