An action of a group G on a set X is a map φ:G×X→X which satisfies the following two conditions:
- ∀x∈X,φ(e,x)=x (identity)
- ∀g,h∈G,∀x∈X,φ(g,φ(h,x))=φ(gh,x) (associativity)
- for a defined map, we denote φ(g,x)=φg(x)=g⋅x=g.x=gx
If a set X is equipped with an action of a group G, then we will denote G↷X
Let G↷X, denote such action as φ, let x∈X:
- ∀g∈G the map φg:X→X is a bijection
- Any action φ uniquely defines a homomorphism ψ:G→Perm(X). And vice, versa, every such homomorphism defines an action of G on X.
- The orbit of x is a set Gx:={g.x:g∈G}⊆X
- The stabilizer of x is a set Stabx=Gx:={g∈G:g.x=x}⊆G and is a subgroup of G
- Define relation ∼ where x∼Gy⟺y=gx,g∈G. Orbits are the equivalence classes respect to ∼
- φ is faithful if the kernel of the respective homomorphism φ:G→Perm(X) is trivial. Equivalently, ∀x∈X,∃g∈G,g.x=x
- φ is transitive if φ admits only one orbit which coincides with X. Equivalently, ∀x,y∈X,∃g∈G,s.t.,g.x=y
- Furthermore, ∀(x1,…,xn)∈Xn,∀(y1,…,yn)∈Yn,∃g∈G,(g.xi)=(yi)
Some facts:
- φl(g,h)=gh is a transitive and faithful action(prove by associativity) which used to prove Cayley's theorem.
- We define an action via conjugation of G to itself: g.h=ghg−1. This action is not faithful, nor transitive, but can be use to prove Sylow's theorem. The orbits of this action are called conjugacy classes, ∀g∈G the stabilizer of g is the centralizer CG(g)
- the right multiplication does not define an action of non-abelian group to itself
- ∀x∈X, the restriction of the action of its orbit Gx is still an action, as ∀g∈G,y=h.x∈Gx,g.(h.x)=(gh).x∈Gx
Let X,Y be two sets equipped with actions φX,φY of a single group G. φX:X→X∧f:X→Y∧φY:Y→Y⟹f:X→Y is G−equivariant. In other words, ∀x∈X,g∈G we have f((φX)g(x))=(φY)g(f(x)) or f(g.x)=g.f(x).
- f is a bijective map, then we will say that f is an isomorphism of group actions.
Orbit-Stabilizer Theorem: Let G↷X, let x∈X, the map f:Gx→G/Gx where y→{g∈G∣gx=y} is an isomorphism of group actions via left multiplication of G.
- Let X be equipped with an action of a finite group G then ∀x∈X we have ∣Gx∣=∣G∣/∣Gx∣
Burnside's Lemma:: Let X be a finite set, equipped with an action of a finite group G. ∀g∈G let us denote Xg={x∈X:g.x=x}. Als, by X/G we will denote the set of orbits w.r.t. the action of G. Then ∣X/G∣=∣G∣1∑g∈G∣Xg∣