陪集与拉格朗日定理

陪集与拉格朗日定理

陪集

定义:设 H H H是群 G G G的子群, a ∈ G a\in G aG

(1)集合 a ⋅ H = { a ⋅ h ∣ h ∈ H } a\cdot H = \left\{a\cdot h | h \in H\right\} aH={ahhH}称为 a a a所在的 H H H的左陪集

(2)集合 H ⋅ a = { h ⋅ a ∣ h ∈ H } H\cdot a = \left\{h\cdot a | h \in H\right\} Ha={hahH}称为 a a a所在的 H H H的右陪集

定理1 :设 H H H是群 G G G的子群

(1) R ⊆ G 2 R \subseteq G^2 RG2定义为 ∀ a , b ∈ G \forall a, b \in G a,bG a R b aRb aRb当且仅当 b − 1 ⋅ a ∈ H b^{-1}\cdot a\in H b1aH,则 R R R等价关系

∀ a ∈ G \forall a \in G aG [ a ] R = a ⋅ H \left[a\right]_R = a\cdot H [a]R=aH R R R称为 G G G关于 H H H左陪集关系

(2) R ′ ⊆ G 2 R^{\prime} \subseteq G^2 RG2定义为 ∀ a , b ∈ G \forall a, b \in G a,bG a R ′ b aR^{\prime}b aRb当且仅当 a ⋅ b − 1 ∈ H a\cdot b^{-1}\in H ab1H,则 R ′ R^{\prime} R等价关系

∀ a ∈ G \forall a \in G aG [ a ] R ′ = a ⋅ H \left[a\right]_{R^{\prime}} = a\cdot H [a]R=aH R ′ R^{\prime} R称为 G G G关于 H H H右陪集关系

证明:

(1)

  1. R R R是等价关系, ∀ a ∈ G \forall a \in G aG,因为 a − 1 ⋅ a = e ∈ H a^{-1}\cdot a = e \in H a1a=eH,所以 a R a aRa aRa

∀ a , b ∈ G \forall a,b \in G a,bG,若 a R b aRb aRb,即 b − 1 ⋅ a ∈ H b^{-1}\cdot a \in H b1aH,则 a − 1 ⋅ b = ( b − 1 ⋅ a ) ∈ H a^{-1}\cdot b = \left(b^{-1}\cdot a\right)\in H a1b=(b1a)H,所以 b R a bRa bRa

∀ a , b , c ∈ G \forall a,b,c\in G a,b,cG,若 a R b aRb aRb b R c bRc bRc,即 b − 1 ⋅ a ∈ H b^{-1}\cdot a \in H b1aH c − 1 ⋅ b ∈ H c^{-1}\cdot b\in H c1bH,则 c − 1 ⋅ a = ( c − 1 ⋅ b ) ⋅ ( b − 1 ⋅ a ) ∈ H c^{-1}\cdot a = \left(c^{-1}\cdot b\right)\cdot \left(b^{-1}\cdot a\right)\in H c1a=(c1b)(b1a)H,所以 a R c aRc aRc

  1. ∀ a ∈ G , [ a ] R = a ⋅ H \forall a\in G,\left[a\right]_R = a\cdot H aG,[a]R=aH.首先, ∀ x ∈ [ a ] R , x R a \forall x\in \left[a\right]_R, xRa x[a]R,xRa,即 a − 1 ⋅ x ∈ H a^{-1}\cdot x\in H a1xH,所以 x = a ⋅ ( a − 1 ⋅ x ) ∈ a ⋅ H x=a\cdot \left(a^{-1}\cdot x\right)\in a\cdot H x=a(a1x)aH,故 [ a ] R ⊆ a ⋅ H \left[a\right]_R\subseteq a\cdot H [a]RaH

    其次, ∀ x ∈ a ⋅ H \forall x\in a\cdot H xaH ∃ h ∈ H \exists h \in H hH,是的 x = a ⋅ h x=a\cdot h x=ah,所以 a − 1 ⋅ x = h ∈ H a^{-1}\cdot x = h\in H a1x=hH,所以 x R a xRa xRa x ∈ [ a ] R x\in \left[a\right]_R x[a]R,故 a ⋅ H ⊆ [ a ] R a\cdot H\subseteq \left[a\right]_R aH[a]R,

因此 [ a ] R = a ⋅ H \left[a\right]_R=a\cdot H [a]R=aH

(2)类似

定理2:设 H H H是群 G G G的子群,则 ∀ a ∈ G \forall a \in G aG ∣ a ⋅ H ∣ = ∣ H ⋅ a ∣ = ∣ H ∣ \left|a\cdot H\right| = \left|H\cdot a\right|=\left|H\right| aH=Ha=H

证明:作 f : H → a ⋅ H , h ↦ a ⋅ h f:H\to a\cdot H, h \mapsto a\cdot h f:HaH,hah,以及 g : H → H ⋅ a , h ↦ h ⋅ a g:H\to H\cdot a,h\mapsto h\cdot a g:HHa,hha

易证 f , g f,g f,g双射,故 ∣ a ⋅ H ∣ = ∣ H ⋅ a ∣ = ∣ H ∣ \left|a\cdot H\right| = \left|H\cdot a\right|=\left|H\right| aH=Ha=H

定理3: 设 H H H是群 G G G的子群,则 H H H的左、右陪集数相同

证明:令 S l = { a ⋅ H ∣ a ∈ G } , S r = { H ⋅ a ∣ a ∈ G } S_l=\left\{a\cdot H | a\in G\right\}, S_r = \left\{H\cdot a | a \in G\right\} Sl={aHaG},Sr={HaaG},作
ϕ : S l → S r , a ⋅ H ↦ H ⋅ a − 1 \phi:S_l \to S_r,\quad a\cdot H \mapsto H\cdot a^{-1} ϕ:SlSr,aHHa1
(1) ϕ \phi ϕ是良定的。若 a ⋅ H = b ⋅ H a\cdot H = b\cdot H aH=bH,则 a R b aRb aRb,其中 R R R G G G关于 H H H的左陪集关系,即 b − 1 ⋅ a ∈ H b^{-1}\cdot a\in H b1aH

从而 a − 1 ⋅ ( b − 1 ) − 1 = ( b − 1 ⋅ a ) − 1 ∈ H a^{-1}\cdot \left(b^{-1}\right)^{-1}=\left(b^{-1}\cdot a\right)^{-1}\in H a1(b1)1=(b1a)1H,即 a − 1 R ′ b − 1 a^{-1}R^{\prime}b^{-1} a1Rb1,其中 R ′ R^{\prime} R G G G关于 H H H的右陪集关系,故 H ⋅ a − 1 = H ⋅ b − 1 H\cdot a^{-1}=H\cdot b^{-1} Ha1=Hb1

(2) ϕ \phi ϕ是单射。若 H ⋅ a − 1 = H ⋅ b − 1 H\cdot a^{-1} = H\cdot b^{-1} Ha1=Hb1,则 a − 1 R ′ b − 1 a^{-1}R^{\prime}b^{-1} a1Rb1,即 a − 1 ⋅ ( b − 1 ) − 1 ∈ H a^{-1}\cdot \left(b^{-1}\right)^{-1}\in H a1(b1)1H,所以 b − 1 ⋅ a = ( a − 1 ⋅ b ) − 1 ∈ H b^{-1}\cdot a=\left(a^{-1}\cdot b\right)^{-1}\in H b1a=(a1b)1H,即 a R b aRb aRb,故 a ⋅ H = b ⋅ H a\cdot H = b\cdot H aH=bH

(3) ϕ \phi ϕ是满射。 ∀ H ⋅ a ∈ S r \forall H\cdot a\in S_r HaSr,有 a − 1 ⋅ H ∈ S l a^{-1}\cdot H\in S_l a1HSl,且 ϕ ( a − 1 ⋅ H ) = H ⋅ a \phi\left(a^{-1}\cdot H\right)=H\cdot a ϕ(a1H)=Ha

因此 ϕ \phi ϕ双射, ∣ S l ∣ = ∣ S r ∣ \left|S_l\right| = \left|S_r\right| Sl=Sr

定义:设 H H H是群 G G G的子群,则称 H H H的左(右)陪集数为 H H H G G G中的指数,记为 [ G : H ] \left[G:H\right] [G:H]

拉格朗日定理

拉格朗日定理:设 H H H是有限群 G G G的子群,则 ∣ H ∣ \left|H\right| H整除 ∣ G ∣ \left|G\right| G,且 ∣ G ∣ = ∣ H ∣ [ G : H ] \left|G\right|=\left|H\right|\left[G:H\right] G=H[G:H]

证明:设 [ G : H ] = r \left[G:H\right]=r [G:H]=r,且 S l = { a 1 ⋅ H , a 2 ⋅ H , ⋯   , a r ⋅ H } S_l=\left\{a_1\cdot H, a_2\cdot H, \cdots, a_r\cdot H\right\} Sl={a1H,a2H,,arH}

因为 a i ⋅ H ∩ a j ⋅ H = ∅ , i ≠ j a_i\cdot H\cap a_j \cdot H=\empty, i\neq j aiHajH=,i=j,所以
∣ G ∣ = ∑ i = 1 r ∣ a i ⋅ H ∣ = r ∣ H ∣ = ∣ H ∣ [ G : H ] \left|G\right|=\sum_{i=1}^{r}\left|a_i\cdot H\right|=r\left|H\right|=\left|H\right|\left[G:H\right] G=i=1raiH=rH=H[G:H]
推论:(1)有限群 G G G的每个元素的阶均能整除 G G G的阶

(2)质数阶的群必为循环群

证明:(1) ∀ a ∈ G , ( a ) ≤ G \forall a\in G, \left(a\right)\le G aG,(a)G,所以 ∣ ( a ) ∣ \left|\left(a\right)\right| (a)整除 ∣ G ∣ \left|G\right| G,即 ∣ a ∣ \left|a\right| a整除 ∣ G ∣ \left|G\right| G

(2)设 G G G p p p阶群,其中 p p p是质数,其中 p p p是质数,由(1), ∀ a ∈ G \forall a\in G aG ∣ a ∣ \left|a\right| a整除 p p p

a ≠ e a\neq e a=e,则 ∣ a ∣ ≠ 1 \left|a\right|\neq 1 a=1,所以 ∣ a ∣ = p \left|a\right|=p a=p,故 G = ( a ) G=\left(a\right) G=(a)

参考:
离散数学(刘玉珍)

你可能感兴趣的:(数学,机器学习,算法,线性代数,离散数学)