Learn

有限群论基础习题

整体归纳法和代入法,没啥难度

  • 引入 Rocq 来证明群论习题

ex1.1

如果r = 2

要证明(a1⋅a2)−1=a2−1⋅a1−1就要证明e=a2−1⋅a1−1⋅(a1⋅a2)就要证明a1⋅a2=a1⋅a2恒成立要证明 (a_1 \cdot a_2)^{-1} = a_2^{-1} \cdot a_1^{-1} \\ 就要证明 e = a_2^{-1} \cdot a_1^{-1} \cdot (a_1 \cdot a_2)\\ 就要证明 a_1 \cdot a_2 = a_1 \cdot a_2 \\ 恒成立

如果存在k,k >= 2,有

(a1⋅a2…ak)−1=ak−1…a2−1⋅a1−1(a_1 \cdot a_2 \ldots a_k)^{-1} = a_k^{-1} \ldots a_2^{-1} \cdot a_1^{-1} \\

对于r = k + 1

要证明(a1⋅a2…ak⋅ak+1)−1=ak+1−1⋅ak−1…a2−1⋅a1−1就要证明(a1⋅a2…ak⋅ak+1)−1=ak+1−1⋅(a1⋅a2…ak)−1就要证明a1⋅a2…ak⋅ak+1=a1⋅a2…ak⋅ak+1恒成立要证明 (a_1 \cdot a_2 \ldots a_k \cdot a_{k+1})^{-1} = a_{k+1}^{-1} \cdot a_k^{-1} \ldots a_2^{-1} \cdot a_1^{-1} \\ 就要证明 (a_1 \cdot a_2 \ldots a_k \cdot a_{k+1})^{-1} = a_{k+1}^{-1} \cdot (a_1 \cdot a_2 \ldots a_k)^{-1} \\ 就要证明 a_1 \cdot a_2 \ldots a_k \cdot a_{k+1} = a_1 \cdot a_2 \ldots a_k \cdot a_{k+1} \\ 恒成立

ex1.2

即证明∀a∈G,a2=e  ⟹  ∀a,b∈G,a⋅b=b⋅a就要证明a⋅b⋅a⋅b=b⋅a⋅a⋅b就要证明(a⋅b)2=e恒成立即证明 \forall a \in G,a^2 = e \implies \\ \forall a,b \in G,a \cdot b = b \cdot a \\ 就要证明 a \cdot b \cdot a \cdot b = b \cdot a \cdot a \cdot b \\ 就要证明 (a \cdot b) ^ 2 = e \\ 恒成立

ex1.3

若a,b有1个是无限阶,显然1,2恒成立

假设a,b的有限阶,且分别为oao_a,obo_b

ex1.3.1

化简得a−k=ee=ak由阶的性质得到k=oa(a−1ba)k=e展开得a−1bka=e得到bk=e由阶的性质得到k=ob 化简得 a^{-k} = e \\ e = a^k \\ 由阶的性质得到 k = o_a \\ (a^{-1}ba)^k = e \\ 展开得a^{-1}b^ka = e \\ 得到b^k = e\\ 由阶的性质得到k = o_b

ex1.3.2

ab=a(ba)a−1代入1得恒成立ab = a(ba)a^{-1} \\ 代入1得恒成立

ex1.4

已知an=e要证明am的阶为n/gcd⁡(m,n)设ord(am)=k,则(am)k=e设d=gcd⁡(m,n),n=n1d,m=m1d即证明am的阶为n1(am)n1=am1dn1=(an)m1=e恒成立由阶的性质得到k∣n1由阶的性质得n∣mk即n1∣m1k由条件得gcd⁡(n1,m1)=1则n1∣kk=n1已知a^n = e \\ 要证明a^m的阶为n/\gcd(m,n) \\ 设ord(a^m) = k,则(a^m)^k = e \\ 设d=\gcd(m,n),n = n_1d, m = m_1d \\ 即证明a^m的阶为n_1 \\ (a^m)^{n_1} = a^{m_1dn_1} = (a^n)^{m_1}=e 恒成立 \\ 由阶的性质得到k \mid n_1 \\ 由阶的性质得n \mid mk \\ 即n_1 \mid m_1k \\ 由条件得\gcd(n_1,m_1) = 1 \\ 则 n_1 \mid k \\ k = n_1

ex1.5

即证明: ∀a,b∈G,ab=ba,ord(a)=l,ord(b)=m,⟨a⟩∩⟨b⟩=e  ⟹  ord(ab)=[l,m]\forall a,b \in G, ab = ba, ord(a) = l, ord(b) = m, \langle a \rangle \cap \langle b \rangle = e \implies ord(ab) = [l, m] 成立

证明:

由条件得: (l, m) = 1

假设 (ab)r=e(ab)^r = e

由条件得:

(ab)r=abab⋯ab=arbr=e(ab)^r = abab\cdots ab = a^rb^r = e

因为ar=b−ra^r = b^{-r}

ar∈⟨a⟩a^r \in \langle a \rangle

b−r∈⟨b⟩b^{-r} \in \langle b \rangle

由条件得ar=ea^r = e, b−r=eb^{-r} = e

得l∣r∧m∣rl \mid r \land m \mid r

由阶的性质得r=[l,m]r = [l, m]

ex1.6

(b−1ab)2=b−1eb=e且b−1ab≠e则b−1ab的阶为2由于g中阶为2的元素只有ab−1ab=a得ab=ba(b^{-1}ab)^2 = b^{-1}eb = e \\ 且b^{-1}ab \neq e \\ 则b^{-1}ab的阶为2 \\ 由于g中阶为2的元素只有a\\ b^{-1}ab = a \\ 得ab = ba

ex1.7

即证明∀g,∣g∣=4  ⟹  ∀a,b∈g,ab=ba即证明\forall g,|g| = 4 \implies \\ \forall a,b\in g,ab = ba \\

证明:

假设4阶群gg ∃a,b∈g,ab≠ba\exists a,b \in g, ab \ne ba

设gg中元素为e,a,b,ce, a, b, c

  1. ab=eab = e

    由条件得 ba=cba = c

    变形得

即证明∀g,∣g∣=4  ⟹  ∀a,b∈g,ab=ba即证明\forall g,|g| = 4 \implies \\ \forall a,b\in g,ab = ba \\

证明:

假设4阶群gg ∃a,b∈g,ab≠ba\exists a,b \in g, ab \ne ba

设gg中元素为e,a,b,ce, a, b, c

  1. 设 ab=eab = e

    由条件得 ba=cba = c

    变形得

    {a=b−1a=b−1c\begin{cases} a = b^{-1}\\ a = b^{-1}c \end{cases}

    联立得 b−1=b−1cb^{-1} = b^{-1}c

    c=ec = e

    与条件矛盾

  2. 设ab=cab = c 同1

故假设不成立

ex1.8

1

σ=(1,4,5)(2,6)τ=(1,6,3)(2,4)\sigma = (1,4,5)(2,6)\\ \tau = (1,6,3)(2,4)

2

στ=(1,4,5)(2,6)(1,6,3)(2,4)1→4→22→6→33→14→55→1→66→2→4得(1,2,3)(4,5,6)τσ=(1,6,3)(2,4)(1,4,5)(2,6)1→6→22→4→53→1→44→2→65→16→3得(1,2,5)(3,4,6)σ−1=((1,4,5)(2,6))−1=(2,6)−1(1,4,5)−1=(6,2)(5,4,1)σ2=(1,4,5)(1,4,5)(2,6)(2,6)=(1,5,4)σ3=e⋅(2,6)3=(2,6)τ−1στ=(2,4)−1(1,6,3)−1(1,4,5)(2,6)(1,6,3)(2,4)=(2,4)(1,3,6)(1,4,5)(2,6)(1,6,3)(2,4)1→12→53→44→35→66→2得(2,5,6)(3,4)共轭算法:τ(1)=6τ(4)=2τ(5)=5τ(2)=4τ(6)=3得(6,2,5)(4,3)\begin{aligned} \sigma \tau &= (1,4,5)(2,6)(1,6,3)(2,4) \\ & 1 \to 4 \to 2 \\ & 2 \to 6 \to 3 \\ & 3 \to 1 \\ & 4 \to 5 \\ & 5 \to 1 \to 6 \\ & 6 \to 2 \to 4 \\ &得(1,2,3)(4,5,6) \\ \\ \tau \sigma &= (1,6,3)(2,4)(1,4,5)(2,6) \\ &1 \to 6 \to 2 \\ &2 \to 4 \to 5 \\ &3 \to 1 \to 4 \\ &4 \to 2 \to 6 \\ &5 \to 1 \\ &6 \to 3 \\ &得(1,2,5)(3,4,6) \\ \\ \sigma^{-1} &= ((1,4,5)(2,6))^{-1} \\ &= (2,6)^{-1}(1,4,5)^{-1} \\ &= (6,2)(5,4,1) \\ \\ \sigma^{2} &= (1,4,5)(1,4,5)(2,6)(2,6) \\ &= (1,5,4) \\ \\ \sigma^{3} &= e\cdot(2,6)^3 \\ &= (2,6) \\ \\ \tau^{-1}\sigma\tau &= (2,4)^{-1}(1,6,3)^{-1}(1,4,5)(2,6)(1,6,3)(2,4) \\ &= (2,4)(1,3,6)(1,4,5)(2,6)(1,6,3)(2,4) \\ &1 \to 1 \\ &2 \to 5 \\ &3 \to 4 \\ &4 \to 3 \\ &5 \to 6 \\ &6 \to 2 \\ &得(2,5,6)(3,4) \\ \\ &共轭算法:\\ & \tau(1) = 6 \\ & \tau(4) = 2 \\ & \tau(5) = 5 \\ & \tau(2) = 4 \\ & \tau(6) = 3 \\ &得(6,2,5)(4,3) \\ \end{aligned}

ex1.9

σ=(1,4,2,3)τ=(1,2,3,4)x=σ−1τ=(3,2,4,1)(1,2,3,4)=(1,4)y=τσ−1=(1,2,3,4)(3,2,4,1)=(1,4,3)\begin{aligned} \sigma &= (1,4,2,3) \\ \tau &= (1,2,3,4) \\ \\ x &= \sigma^{-1}\tau \\ &= (3,2,4,1)(1,2,3,4) \\ &= (1,4) \\ \\ y &= \tau \sigma^{-1} \\ &= (1,2,3,4)(3,2,4,1) \\ &= (1,4,3)\\ \end{aligned}

ex1.10

证明:

  1. 假设σ\sigma是对换,即r=2r=2

    不妨设对换σ=(σ1,σ2)\sigma = (\sigma_1, \sigma_2)

    计算τ−1στ\tau^{-1}\sigma\tau

    1. 如果τ\tau和σ\sigma不相交,恒成立

    2. 只相交1个元素,设在位置σ1\sigma_1相交

      1. τ(σ1)⋯σ2\tau(\sigma_1)\cdots \sigma_2
      2. σ2⋯τ(σ1)\sigma_2 \cdots \tau(\sigma_1)

      成立

    3. 相交2个元素

      1. τ(σ1)⋯σ2\tau(\sigma_1)\cdots \sigma_2
      2. σ2⋯τ(σ1)\sigma_2 \cdots \tau(\sigma_1)
      3. τ(σ2)⋯τ(σ1)\tau(\sigma_2) \cdots \tau(\sigma_1)

      成立

  2. 假设k>=2k >=2 , 有τ−1στ=(σ1τ⋯σkτ)\tau^{-1}\sigma\tau=(\sigma_1^{\tau}\cdots \sigma_k^{\tau})

    对于r=k+1r = k + 1

    得(σ1⋯αk,σk+1)=(σ1⋯σk)(σ1,σk+1)(\sigma_1 \cdots \alpha_k,\sigma_{k+1}) = (\sigma_1 \cdots \sigma_k)(\sigma_1,\sigma_{k+1})

    即证明τ−1(σ1…σk+1)τ=τ−1(σ1⋯σk)τ⋅τ−1(σ1,σk+1)τ=(σ1τ⋯σkτ,σk+1τ)\tau^{-1}(\sigma_1 \dots \sigma_{k+1})\tau = \tau^{-1}(\sigma_1 \cdots \sigma_k)\tau \cdot \tau^{-1}(\sigma_1,\sigma_{k+1})\tau = (\sigma_1^{\tau} \cdots \sigma_k^{\tau}, \sigma_{k+1}^{\tau})成立

    由1,递推条件以及 (σ1τ⋯αkτ,σk+1τ)=(σ1τ⋯σkτ)(σ1τ,σk+1τ)(\sigma_1^{\tau} \cdots \alpha_k^{\tau},\sigma_{k+1}^{\tau}) = (\sigma_1^{\tau} \cdots \sigma_k^{\tau})(\sigma_1^{\tau},\sigma_{k+1}^{\tau})

    恒成立

  3. 对于一般置换σ\sigma,我们以mm个不相交的轮换表示:

    Πi=1mσi\Pi_{i=1}^m\sigma_i

    记τ\tau作用到轮换σi\sigma_i为σiτ\sigma_i^{\tau}

    即σiτ=(σi1τ⋯σijτ)\sigma_i^{\tau} = (\sigma_{i1}^{\tau}\cdots\sigma_{ij}^{\tau})

    即证明τ−1στ=∏i=1mσiτ\tau^{-1}\sigma\tau=\prod_{i=1}^m\sigma_i^{\tau}成立

    由2得τ−1σiτ=σiτ\tau^{-1}\sigma_i\tau = \sigma_i^{\tau}

    变形左边τ−1στ=∏i=1mτ−1σiτ=∏i=1mσiτ\tau^{-1}\sigma\tau=\prod_{i=1}^m\tau^{-1}\sigma_i\tau = \prod_{i=1}^m \sigma_i^{\tau}

    恒成立

由1,2,3得恒成立

ex1.11

即证明: ∃a∈Sn,n>2,∀x∈Sn,xa=ax\exists a \in S_n,n \gt 2, \forall x \in S_n, xa = ax 不成立

假设存在a使命题成立

即∀x∈Sn,xa=ax\forall x \in S_n, xa=ax

使用轮换形式:a=∏i=1maia=\prod_{i=1}^ma_i,因为n>2,故m>1

因为n>2,可以构造x=a1′a′x = a_1'a',使得a1′a_1'和a1a_1相交

因为x和a相交,所以无法交换

所以不存在a使命题成立

故证明恒成立

ex1.12

由置换奇偶性的性质

可以得到σ\sigma的奇偶性和∑li−1\sum{l_i - 1}的奇偶性一致

即证明∑i=1sli−1\sum_{i=1}^s{l_i - 1}和∑i=1sli+s\sum_{i=1}^s{l_i} + s奇偶性一致

变形右边得∑i=1sli+1\sum_{i=1}^s{l_i+1}

恒成立

ex1.13

∀H≤G,∀a∈G,ord(a)=n,am∈H,(n,m)=1  ⟹  a∈H\forall H \le G, \forall a\in G, ord(a)=n, a^m \in H, (n, m) = 1 \implies a\in H

证明:

由条件得

∃k,km≡1(modn)\exist k, km \equiv 1 \pmod n

即akm=aa^{km} = a

因为 am∈Ha^m \in H

则 akm=(am)k∈Ha^{km} = (a^m)^k \in H

得 a∈Ha \in H

ex 1.14

由拉格朗日定理,设群GG阶为素数

则∀a∈G,ord(a)=1∨ord(a)=∣G∣\forall a \in G, ord(a) = 1 \lor ord(a) = \mid G \mid

可得除了ee之外的所有元素阶都为∣G∣\mid G \mid

即任取GG中除单位元一个元素aa

⟨a⟩\langle a \rangle的阶为∣G∣\mid G \mid且

∀x∈⟨a⟩,x∈G\forall x \in \langle a \rangle, x \in G

故GG是循环群

ex 1.15

充分性:

假设GG没有非平凡子群

则取GG中任一元素aa

  1. a=ea = e

    ⟨a⟩\langle a \rangle为e,满足条件

  2. a≠ea \ne e

    要让∣⟨a⟩∣=∣G∣\mid \langle a \rangle \mid = \mid G \mid

    则 ord(a)=∣G∣ord(a) = \mid G \mid

    由拉格朗日定理得,∣G∣\mid G \mid为素数,由ex1.14得G为素数阶循环群

必要性:

恒成立

ex1.16

证明:

假设GG有2个qq阶子群

由拉格朗日定理得

对某个qq阶子群HH的指数rr为pp

  1. p = 2

    设子群分别是HH,KK

    但是GG还有子群ee和GG

    也就是说∣H∣≠∣G∣\mid H \mid \ne \mid G \mid

    假设不成立

  2. p > 2 假设不成立

由1,2得假设不成立

得证明成立

ex1.17

即证明

A⊂G,A≠∅,AA⊆A  ⟺  A≤GA \subset G, A \ne \emptyset, AA \subseteq A \iff A \le G

证明:

充分性:

由条件得:

∀a,b∈A,ab∈A\forall a, b \in A, ab \in A

根据子群判定条件必要性,充分性成立

必要性:

由子群判定条件充分性,

∀a,b∈A,ab∈A\forall a, b \in A, ab \in A

得必要性成立

故证明恒成立

ex1.18

即证明A≤G,B≤G,AB=BA  ⟺  AB≤GA \le G, B \le G, AB = BA \iff AB \le G

证明:

由题设得

∀a1,a2∈A,a1a2−1∈A\forall a_1, a_2 \in A, a_1a_2^{-1} \in A

∀b1,b2∈B,b1b2−1∈B\forall b_1, b_2 \in B, b_1b_2^{-1} \in B

充分性:

由条件得:

∀a∈A,∀b∈B,ab∈AB,ba∈AB\forall a \in A, \forall b \in B, ab \in AB, ba \in AB

∀m,n∈AB\forall m, n \in AB

要证明mn−1∈ABmn^{-1} \in AB

不妨令m=a1b1m = a_1b_1, n=a2b2n = a_2b_2

mn−1=a1b1b2−1a2−1mn^{-1} = a_1b_1b_2^{-1}a_2^{-1}

由条件得 b=b1b2−1∈Bb = b_1b_2^{-1} \in B

下面要证明

a1ba2−1∈ABa_1ba_2^{-1} \in AB成立

因为b∈B,a2−1∈Ab\in B, a_2^{-1} \in A

令ba2−1=a3b3ba_2^{-1} = a_3b_3

a1ba2−1=a1a3b3a_1ba_2^{-1} = a_1a_3b_3

a1a3∈Aa_1a_3 \in A b3∈Bb_3 \in B

所以mn−1=a1a3b3∈ABmn^{-1} = a_1a_3b_3 \in AB恒成立

必要性:

由条件得AB≤GAB \le G,即证AB=BAAB = BA

先证BA⊆ABBA \subseteq AB:

任取ba∈BAba \in BA,则a−1b−1∈ABa^{-1}b^{-1} \in AB

因为AB≤GAB \le G,有(a−1b−1)−1∈AB(a^{-1}b^{-1})^{-1} \in AB

即ba∈ABba \in AB

再证AB⊆BAAB \subseteq BA:

任取ab∈ABab \in AB,因为AB≤GAB \le G,有(ab)−1=b−1a−1∈AB(ab)^{-1} = b^{-1}a^{-1} \in AB

设b−1a−1=a′b′b^{-1}a^{-1} = a'b',其中a′∈Aa' \in A,b′∈Bb' \in B

则ab=(a′b′)−1=(b′)−1(a′)−1∈BAab = (a'b')^{-1} = (b')^{-1}(a')^{-1} \in BA

故AB=BAAB = BA

ex 1.19

证明

由条件得A⊆C,B∩C⊆CA \subseteq C, B\cap C \subseteq C

所以A(B∩C)⊆CA(B \cap C) \subseteq C

而B∩C⊆BB \cap C \subseteq B

得A(B∩C)⊆ABA(B \cap C) \subseteq AB

所以A(B∩C)⊆AB∩CA(B \cap C) \subseteq AB \cap C

下面要证明AB∩C⊆A(B∩C)AB \cap C \subseteq A(B \cap C)成立

取a∈A,b∈B,x=ab∈AB∩Ca \in A, b \in B, x = ab \in AB \cap C

a∈A且A∈Ca \in A且A\in C

因为x∈AB∩Cx \in AB \cap C

所以x∈C恒成立x \in C恒成立

b=a−1x∈Cb = a^{-1}x \in C

得b∈B∩Cb \in B \cap C

所以x=ab,a∈A,b∈B∩Cx = ab, a \in A, b \in B \cap C

由集合积的定义得

x∈A(B∩C)x \in A(B \cap C)

即AB∩C⊆A(B∩C)AB \cap C \subseteq A(B \cap C)恒成立

故证明恒成立

ex1.20

由题设得,设h∈H,g∈∁GHh \in H, g \in \complement_G^H

G=Hh∪HgG = Hh \cup Hg

G=hH∪gHG = hH \cup gH

Hh=hH=HHh = hH = H

故Hg=gHHg = gH恒成立

故证明恒成立

ex 1.21

已知 K={e,(1,2)(3,4),(1,3)(2,4),(1,4)(2,3)}≤S4K = \{e, (1,2)(3,4), (1,3)(2,4), (1,4)(2,3)\} \le S_4。

求 S4S_4 关于 KK 的右陪集分解。

解:

因为 ∣S4∣=24\mid S_4 \mid = 24,∣K∣=4\mid K \mid = 4,所以指数为:

∣S4:K∣=244=6\mid S_4 : K \mid = \frac{24}{4} = 6

即 S4S_4 可以分解为 6 个两两不相交的右陪集。

选取保持元素 4 不动的子群(即同构于 S3S_3 的子群)作为代表元候选集合:

H={e,(1,2),(1,3),(2,3),(1,2,3),(1,3,2)}H = \{e, (1,2), (1,3), (2,3), (1,2,3), (1,3,2)\}

有如下性质:

因为HH固定4不动,而KK每个元素都移动了4,所以H∩K={e}H \cap K = \{e\}

  1. ∣H∣=6=∣K ⁣:S4∣\mid H \mid = 6 = \mid K \colon S_4\mid满足拉格朗日定理

  2. ∀h1,h2∈H,h1≠h2,Kh1∩Kh2=∅\forall h_1, h_2 \in H, h_1 \ne h_2, Kh_1 \cap Kh_2 = \emptyset

    假设∃h1,h2∈H,h1≠h2,Kh1=Kh2\exists h_1, h_2 \in H, h_1 \ne h_2, Kh_1 = Kh_2

    由陪集定理得

    h1h2−1∈Kh_1h_2^{-1} \in K

    这与H∩K={e}H \cap K = \{e\}和h1≠h2h_1 \ne h_2矛盾

    故假设不成立

    故条件成立

由1,2得HH的每个元素都是KK的陪集代表

即S4S_4 = ⋃h∈HKh\bigcup_{h \in H} Kh

ex 1.22

四元素群 Q4={e,a,a2,a3,b,ab,a2b,a3b}Q_4 = \{e, a, a^2, a^3, b, ab, a^2b, a^3b\}

设子群HH,由拉格朗日定理: ∣H ⁣:Q4∣=2或4\mid H \colon Q_4 \mid = 2 或 4

观察得子群:

{e,a,a2,a3}\{e, a, a^2, a^3\}

{b,ab,a2b,a3b}\{b, ab, a^2b, a^3b\}

由循环群的素数阶定理,

还有子群⟨a2⟩\langle a^2 \rangle

即

{e,a2}\{e, a^2\}

{b,a2b}\{b, a^2b\}

{a,a3}\{a, a^3\}

{ab,a3b}\{ab, a^3b\}

陪集分解不重复写

ex 1.23

右正则:

σe=e\sigma_e = e

σ(1,2)=(e(1,2)(1,3)(2,3)(1,2)(1,3)(1,2)(2,3)(1,2)e(1,2)(2,3)(1,2)(1,3)(2,3)(1,3))=(1,2)(3,6)(4,5)\begin{aligned} \sigma_{(1,2)} &= \begin{pmatrix} e & (1,2) & (1,3) & (2,3) & (1,2)(1,3) & (1,2)(2,3) \\ (1,2) & e & (1,2)(2,3) & (1,2)(1,3) & (2,3) & (1,3) \end{pmatrix} \\ &= (1,2)(3,6)(4,5) \end{aligned}

σ(1,3)=(e(1,2)(1,3)(2,3)(1,2)(1,3)(1,2)(2,3)(1,3)(1,2)(1,3)e(1,2)(2,3)(1,2)(2,3))=(1,3)(2,5)(4,6)\begin{aligned} \sigma_{(1,3)} &= \begin{pmatrix} e & (1,2) & (1,3) & (2,3) & (1,2)(1,3) & (1,2)(2,3) \\ (1,3) & (1,2)(1,3) & e & (1,2)(2,3) & (1,2) & (2,3) \end{pmatrix} \\ &= (1,3)(2,5)(4,6) \end{aligned}

σ(2,3)=(e(1,2)(1,3)(2,3)(1,2)(1,3)(1,2)(2,3)(2,3)(1,2)(2,3)(1,2)(1,3)e(1,3)(1,2))=(1,4)(2,6)(3,5)\begin{aligned} \sigma_{(2,3)} &= \begin{pmatrix} e & (1,2) & (1,3) & (2,3) & (1,2)(1,3) & (1,2)(2,3) \\ (2,3) & (1,2)(2,3) & (1,2)(1,3) & e & (1,3) & (1,2) \end{pmatrix} \\ &= (1,4)(2,6)(3,5) \end{aligned}

σ(1,2)(1,3)=σ(1,2)σ(1,3)=(1,5,6)(2,3,4)\begin{aligned} \sigma_{(1,2)(1,3)} &= \sigma_{(1,2)}\sigma_{(1,3)} \\ &= (1,5,6)(2,3,4) \end{aligned}

σ(1,2)(2,3)=σ(1,2)σ(2,3)=(1,6,5)(2,4,3)\begin{aligned} \sigma_{(1,2)(2,3)} &= \sigma_{(1,2)}\sigma_{(2,3)} \\ &= (1,6,5)(2,4,3) \end{aligned}

左正则:

τe=e\tau_e = e

τ(1,2)=(e(1,2)(1,3)(2,3)(1,2)(1,3)(1,2)(2,3)(1,2)e(1,2)(1,3)(1,2)(2,3)(1,3)(2,3))=(1,2)(3,5)(4,6)\begin{aligned} \tau_{(1,2)} &= \begin{pmatrix} e & (1,2) & (1,3) & (2,3) & (1,2)(1,3) & (1,2)(2,3) \\ (1,2) & e & (1,2)(1,3) & (1,2)(2,3) & (1,3) & (2,3) \end{pmatrix} \\ &= (1,2)(3,5)(4,6) \end{aligned}

τ(1,3)=(e(1,2)(1,3)(2,3)(1,2)(1,3)(1,2)(2,3)(1,3)(1,2)(2,3)e(1,2)(1,3)(2,3)(1,2))=(1,3)(2,6)(4,5)\begin{aligned} \tau_{(1,3)} &= \begin{pmatrix} e & (1,2) & (1,3) & (2,3) & (1,2)(1,3) & (1,2)(2,3) \\ (1,3) & (1,2)(2,3) & e & (1,2)(1,3) & (2,3) & (1,2) \end{pmatrix} \\ &= (1,3)(2,6)(4,5) \end{aligned}

τ(2,3)=(e(1,2)(1,3)(2,3)(1,2)(1,3)(1,2)(2,3)(2,3)(1,2)(1,3)(1,2)(2,3)e(1,2)(1,3))=(1,4)(2,5)(3,6)\begin{aligned} \tau_{(2,3)} &= \begin{pmatrix} e & (1,2) & (1,3) & (2,3) & (1,2)(1,3) & (1,2)(2,3) \\ (2,3) & (1,2)(1,3) & (1,2)(2,3) & e & (1,2) & (1,3) \end{pmatrix} \\ &= (1,4)(2,5)(3,6) \end{aligned}

τ(1,2)(1,3)=τ(1,2)τ(1,3)=(1,6,5)(2,3,4)\begin{aligned} \tau_{(1,2)(1,3)} &= \tau_{(1,2)}\tau_{(1,3)} \\ &= (1,6,5)(2,3,4) \end{aligned}

τ(1,2)(2,3)=τ(1,2)τ(2,3)=(1,5,6)(2,4,3)\begin{aligned} \tau_{(1,2)(2,3)} &= \tau_{(1,2)}\tau_{(2,3)} \\ &= (1,5,6)(2,4,3) \end{aligned}

ex 1.24

S4S_4对S3S_3的陪集分解:

S4=S3∪S3(1,4)∪S3(2,4)∪(3,4)S_4 = S_3 \cup S_3 (1,4) \cup S_3 (2,4) \cup (3,4)

观察得

1→S3(1,4)1 \to S_3(1,4)

2→S3(2,4)2 \to S_3(2,4)

3→S3(3,4)3 \to S_3(3,4)

4→44 \to 4