Section III.1.3

Group actions on sets

[9/56%]
Show
LaTeX
Problem III.1.3.1

Let Φ\Phi and Φ′\Phi^{\prime } be homomorphisms of a group GG into S(Ω)S(\Omega ) and S(Ω′)S\left(\Omega^{\prime }\right), respectively. Then the actions on Ω\Omega and on Ω′\Omega^{\prime } that they define are called equivalent if there exists a bijective map σ:Ω⟶Ω′\sigma : \Omega \longrightarrow \Omega^{\prime }, making the diagram

commutative for all g∈Gg \in G. Thus, Φg′=σΦgσ−1\Phi_{g}^{\prime }=\sigma \Phi_{g} \sigma^{-1}. Prove that every transitive action of a group GG is equivalent to the action of GG on the left cosets with respect to some subgroup HH.

?
Problem III.1.3.2

Relying on Theorem 2, prove that all groups of order p2p^{2} (pp a prime number) are abelian.

?
Problem III.1.3.3

Show that the center of the group PP, given at the end of Example 1, has the form

Z(P)={∥10c010001∥∣c∈Zp} Z(P)=\left\{ \left\Vert \begin{smallmatrix} 1 & 0 & c \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{smallmatrix}\right\Vert \mid c \in Z_{p}\right\}

Find the conjugacy classes of the group PP.

?
Problem III.1.3.4

Let nn be a natural number. Write it as a sum n=n1+n2+…+nmn=n_{1}+n_{2}+\ldots +n_{m} with n1⩾n2⩾…⩾nm⩾1n_{1} \geqslant n_{2} \geqslant \ldots \geqslant n_{m} \geqslant 1. Denote by p(n)p(n) the number of all such partitions with m=1,2,…m=1,2, \ldots, so that p(3)=3,p(4)=5p(3)=3, p(4)=5, etc. The decomposition π=π1π2…πm\pi =\pi_{1} \pi_{2} \ldots \pi_{m} of every permutation π∈Sn\pi \in S_{n} into a product of independent cycles (see [ВА I, Ch. 1, § 8]) uniquely determines a partition of the number nn. Show that the conjugacy classes of the group SnS_{n} are in bijective correspondence with the partitions of the number nn.

?
Problem III.1.3.5

Let a permutation π∈Sn\pi \in S_{n} be written as a product of rr cycles of length 1,s1, s cycles of length 2, tt cycles of length 3, and so on, so that n=r+2s+3t+…n=r+2 s+3 t+\ldots Show that the cardinality of the conjugacy class in SnS_{n} containing the permutation π\pi is given by the formula

∣πSn∣=n!1rr!2ss!3tt!… \left|\pi ^{S_{n}}\right|=\frac{n !}{1^{r} r ! 2^{s} s ! 3^{t} t ! \ldots }
?
Problem III.1.3.6

Let a group GG act on a set Ω\Omega. Let us call a subset Γ⊂Ω\Gamma \subset \Omega invariant with respect to GG (or GG-invariant) if gx∈Γg x \in \Gamma for all g∈Gg \in G and x∈Γx \in \Gamma. For example, invariant sets under the action of SO(2)S O(2) on R2\mathbb {R}^{2} are concentric rings.

Fig. 1

Show that every invariant subset of Ω\Omega is a union of orbits, and that the GG-orbit of any element x∈Ωx \in \Omega is precisely the smallest invariant subset containing xx.

?
Problem III.1.3.7

Show that for a group GG with a subgroup HH, the action H×G⟶GH \times G \longrightarrow G, defined by the shift (h,g)↦hg(h, g) \mapsto h g, gives a partition of GG into right cosets of GG with respect to HH.

?
Problem III.1.3.8

By modifying the proof of Theorem 1, obtain the relation

r(G:Ω)=1∣G∣∑g∈GN(g) r(G: \Omega )=\frac{1}{|G|} \sum _{g \in G} N(g)

where r(G:Ω)r(G: \Omega ) is the number of orbits of a permutation group GG acting on a set Ω\Omega.

?
Problem III.1.3.9

Alongside the centralizer C(a)={x∈G∣xa=ax}C(a)=\left\{ x \in G \mid x a=a x\right\} in a group GG, one also considers the skew centralizer

D(a)={x∈G∣xa=a−1x} D(a)=\left\{ x \in G \mid x a=a^{-1} x\right\}

which occurs in the theory of dynamical systems. In general, D(a)D(a) is not a group.

Prove that:

  1. D(a)D(a) is a group ⟺a2=e\Longleftrightarrow a^{2}=e and D(a)=C(a)D(a)=C(a);

  2. the set E[a]=C(a)∪D(a)\mathbb {E}\left[a\right]=C(a) \cup D(a) is always a group.

?