【离散数学】 SEU - 25 - 2021/06/02 - Group Theory

最新推荐文章于 2021-06-11 11:27:33 发布

Teddy van Jerry

最新推荐文章于 2021-06-11 11:27:33 发布

阅读量147

点赞数 1

分类专栏：【离散数学】文章标签：离散数学 Mathematics 数学

本文链接：https://blog.csdn.net/weixin_50012998/article/details/117461193

版权

【离散数学】专栏收录该内容

43 篇文章 6 订阅

订阅专栏

Discrete Mathematical Structures (6th Edition)
2021/06/02 - Group Theory

Algebraic System

Homomorphism

Like a blurred mirror.

Isomorphism

$f$ is a bijection

Like a clear mirror.

Group Theory

Introduction

Introduction of Group Theory
A semi group is an algebraic system $< G, * >$ , $*$ is a binary operation over $G$ , that satisfies
associativity: $\forall a, b, c \in S, (a * b) * c = a * (b * c)$ .

A monoid is an algebraic system $< G, * >$ , $*$ is a binary operation over $G$ , that satisfies
associativity: $\forall a, b, c \in S, (a * b) * c = a * (b * c)$ ;
identity element: $∃e∈S\text{, s.t. for any }a∈S, a*e=e*a=a$ .

A group is an algebraic system $< G, * >$ , $*$ is a binary operation over $G$ , that satisfies
associativity: $\forall a, b, c \in S, (a * b) * c = a * (b * c)$ ;
identity element: $∃e∈S\text{, s.t. for any }a∈S, a*e=e*a=a$ ;
inverse element: $\text{for }∀a∈S, ∃b∈S\text{, s.t. }a*b=b*a=e$ .

Group Homomorphism

Related Notations

Finite group: the set is finite
Infinite group: the set is infinite
Trivial group: a group with one element
Abelian (Commutative) group: operation is commutative

Definition

The power of an element a in group G is defined as
$a^0=e$ ;
$a^1=a$ ;
$a^n=a^{n-1}a, n>0$ ;
$a^n=(a^{-1})^m, n<0, m=-n$

The order of an element $a$ in group $G$ is defined as the smallest positive integer $k$ , s.t. $a^k=e$ , denoted as $∣ a ∣$ .

If $k$ does not exist, then the element’s order is infinite.

Example: In $Z_6, +_6>, |0|=1, |1|=6, |2|=3, |3|=2, |4|=3, |5|=6$ .

Properties

$a^{-1})^{-1}=1$
$ab)^{-1}=b^{-1}a^{-1}$
$a^na^m=a^{n+m}, (a^n)^m=a^{nm}$

$G$ is a group, $a, b \in G$ , and $ab)^2=a^2 b^2$ . Prove $a b = b a$ .

For group $G$ , $a \in G$ , and $∣ a ∣ = r$ , then for any $k$
(1) $a^k=e$ iff $r ∣ k$ ;
(2) $\left|a^{-1}\right|=|a|$

Proof:
(1)
sufficiency:
since $k = m r$ , for some $m$ , we have $a^k= a^{mr}= (ar)^m= e$ .
necessity:
there exists $m$ and $i$ such that $k = m r + i (0 \leq i \leq r - 1)$ , so $e = a^{mr+i}= a^{mr} a^i= a^i$ .
since the order of $a$ is $r$ and $0 \leq i \leq r - 1$ .
so $i ＝ 0$ and we have $k = m r$ .
(2)
Since $a^{-1})^r = (a^r )^{-1} = e^{-1} = e$ , the order of $a^{-1}$ exists.
Assume $a^{-1} | = t$ , according to (1), $r = m t$ for some $m$
since $a$ is the inverse element of $a^{-1}$ (just switch the location of $a$ and $a^{-1}$ ), we can have $t = n r$ for some $n$ . Thus $r = t$ , i.e., $a^{-1} | =|a|$ .

Review

Review
For group $< G, * >$ , if $H$ is a nonempty set of $G$ , and $< H, * >$ is also a group, then $H$ is a subgroup of $G$ , denoted as $H\leqslant G$ .