Skip to Content
Math401Math 401, Notes 1

Node 1

all the materials are recovered after the end of the course. I cannot split my mind away from those materials.

Recap on familiar ideas

Group

A group is a set GG with a binary operation ⋅\cdot that satisfies the following properties:

  1. Closure: For all a,b∈Ga, b \in G, the result of the operation a⋅ba \cdot b is also in GG.
  2. Associativity: For all a,b,c∈Ga, b, c \in G, (a⋅b)⋅c=a⋅(b⋅c)(a \cdot b) \cdot c = a \cdot (b \cdot c).
  3. Identity: There exists an element e∈Ge \in G such that for all a∈Ga \in G, e⋅a=a⋅e=ae \cdot a = a \cdot e = a.
  4. Inverses: For each a∈Ga \in G, there exists an element b∈Gb \in G such that a⋅b=b⋅a=ea \cdot b = b \cdot a = e.

Ring

A ring is a set RR with two binary operations, addition and multiplication, that satisfies the following properties:

  1. Additive Closure: For all a,b∈Ra, b \in R, the result of the addition a+ba + b is also in RR.
  2. Additive Associativity: For all a,b,c∈Ra, b, c \in R, (a+b)+c=a+(b+c)(a + b) + c = a + (b + c).
  3. Additive Identity: There exists an element 0∈R0 \in R such that for all a∈Ra \in R, 0+a=a+0=a0 + a = a + 0 = a.
  4. Additive Inverses: For each a∈Ra \in R, there exists an element −a∈R-a \in R such that a+(−a)=(−a)+a=0a + (-a) = (-a) + a = 0.
  5. Multiplicative Closure: For all a,b∈Ra, b \in R, the result of the multiplication a⋅ba \cdot b is also in RR.
  6. Multiplicative Associativity: For all a,b,c∈Ra, b, c \in R, (a⋅b)⋅c=a⋅(b⋅c)(a \cdot b) \cdot c = a \cdot (b \cdot c).

Others not shown since you don’t need too much.

Symmetric Group

Definition

The symmetric group SnS_n is the group of all permutations of nn elements. Or in other words, the group of all bijections from a set of nn elements to itself.

Example:

e=1,2,3(12)=2,1,3(13)=3,2,1(23)=1,3,2(123)=3,1,2(132)=2,3,1e=1,2,3\\ (12)=2,1,3\\ (13)=3,2,1\\ (23)=1,3,2\\ (123)=3,1,2\\ (132)=2,3,1

(12)(12) means that 1→2,2→1,3→31\to 2, 2\to 1, 3\to 3 we follows the cyclic order for the elements in the set.

S3={e,(12),(13),(23),(123),(132)}S_3 = \{e, (12), (13), (23), (123), (132)\}

The multiplication table of S3S_3 is:

Elemente(12)(13)(23)(123)(132)
ee(12)(13)(23)(123)(132)
(12)(12)e(123)(13)(23)(132)
(13)(13)(132)e(12)(23)(123)
(23)(23)(123)(132)e(12)(13)
(123)(123)(13)(23)(132)e(12)
(132)(132)(23)(12)(123)(13)e

Functions defined on SnS_n

Symmetric Generating Set

Last updated on