Ivan Shishkin, Birch Grove

Group action

Definition / General algebra / Usable

English
EnglishFrançais
Usable. This concept is clear enough to use, but has not yet been reviewed by another trusted user.

Intuitive definition

A group GG acts on a set XX when every element of GG "moves" the points of XX in a way compatible with the group law. The action creates a two-way dialogue: from GG to XX, it cuts XX into orbits (classification, counting); from XX to GG, it produces natural subgroups (stabilizers, kernel) and embeddings of GG into permutation groups.

Formal definition

Let GG be a group with identity ee and XX a non-empty set. A (left) action of GG on XX is a map
G×X→X,(g,x)↦g⋅xG \times X \to X, \qquad (g, x) \mapsto g \cdot xsatisfying the two axioms:

  1. e⋅x=xe \cdot x = x for all x∈Xx \in X;
  2. g⋅(h⋅x)=(gh)⋅xg \cdot (h \cdot x) = (gh) \cdot x for all g,h∈Gg, h \in G and x∈Xx \in X.

We say that GG acts (or operates) on XX, that XX is a GG-set, and we write G↷XG \curvearrowright X.

Equivalent point of view. Giving an action of GG on XX amounts to giving a group homomorphism
τ:G→S(X),τ(g)(x)=g⋅x,\tau : G \to \mathfrak{S}(X), \qquad \tau(g)(x) = g \cdot x,where S(X)\mathfrak{S}(X) is the group of bijections of XX. Indeed, axiom 2 says τ(gh)=τ(g)∘τ(h)\tau(gh) = \tau(g) \circ \tau(h) and axiom 1 says τ(e)=idX\tau(e) = \mathrm{id}_X; hence each τ(g)\tau(g) is a bijection with inverse τ(g−1)\tau(g^{-1}). The first point of view is the more intuitive one; the second brings out the kernel ker⁡τ\ker \tau and connects actions with permutation groups.

Examples

  1. Natural action of the symmetric group. Sn\mathfrak{S}_n acts on {1,…,n}\{1, \ldots, n\} by σ⋅i=σ(i)\sigma \cdot i = \sigma(i).
  2. Left translation. GG acts on itself by g⋅x=gxg \cdot x = gx. More generally, if HH is a subgroup of GG, then GG acts on the set G/HG/H of left cosets by g⋅(aH)=(ga)Hg \cdot (aH) = (ga)H.
  3. Conjugation. GG acts on itself by g⋅x=gxg−1g \cdot x = g x g^{-1}, and on the set of its subgroups by g⋅H=gHg−1g \cdot H = g H g^{-1}.
  4. Linear actions. GLn(K)\mathrm{GL}_n(K) acts on KnK^n by A⋅v=AvA \cdot v = Av; on Mn(K)M_n(K) by conjugation P⋅A=PAP−1P \cdot A = PAP^{-1}; on symmetric matrices by congruence P⋅S=PSP⊤P \cdot S = P S P^{\top}.
  5. Geometry. The dihedral group D4D_4 of isometries of the square acts on its 44 vertices, on its 44 edges, on its 22 diagonals: one group, very different actions.
  6. Trivial action. g⋅x=xg \cdot x = x for all gg and xx.

Remarks

  • Classical pitfall. One would like Sn\mathfrak{S}_n to act on KnK^n by permuting coordinates, σ⋅(c1,…,cn)=(cσ(1),…,cσ(n))\sigma \cdot (c_1, \ldots, c_n) = (c_{\sigma(1)}, \ldots, c_{\sigma(n)}). This is not a left action: one checks that σ⋅(τ⋅c)=(τσ)⋅c\sigma \cdot (\tau \cdot c) = (\tau\sigma) \cdot c, the order is reversed. The correct formula is σ⋅(c1,…,cn)=(cσ−1(1),…,cσ−1(n))\sigma \cdot (c_1, \ldots, c_n) = (c_{\sigma^{-1}(1)}, \ldots, c_{\sigma^{-1}(n)}).
  • A right action is a map X×G→XX \times G \to X with (x⋅g)⋅h=x⋅(gh)(x \cdot g) \cdot h = x \cdot (gh); it becomes a left action by setting g⋅x=x⋅g−1g \cdot x = x \cdot g^{-1}.
  • Before speaking of an action, check that g⋅xg \cdot x really lies in XX: for instance Sn\mathfrak{S}_n acts on the mm-element subsets of {1,…,n}\{1, \ldots, n\} because a bijection preserves cardinality.
Problems using this concept (0)

No listed problems link to this concept yet.

Problems using this concept (spoiler) (0)

No listed problems use this concept as a spoiler yet.

References

  1. Perrin, Daniel — Cours d’algèbre (Ellipses)
Details

Chap. I

Download: BibTeXJSON