Math 120: Review of Groups and Fields

I. F. Evidente
IMSP (UPLB)

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1

For every a , b G , a b G . (closure)

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1 2

For every a , b G , a b G . (closure) For every a , b c G , (a b ) c = a (b c ). (associativity)

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1 2 3

For every a , b G , a b G . (closure) For every a , b c G , (a b ) c = a (b c ). (associativity) For every a G , a e = a = e a . (identity)

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1 2 3 4

For every a , b G , a b G . (closure) For every a , b c G , (a b ) c = a (b c ). (associativity) For every a G , a e = a = e a . (identity) For every a G , there exists a 1 G such that a a 1 = e = a 1 a . (inverse)

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1 2 3 4

For every a , b G , a b G . (closure) For every a , b c G , (a b ) c = a (b c ). (associativity) For every a G , a e = a = e a . (identity) For every a G , there exists a 1 G such that a a 1 = e = a 1 a . (inverse) Notation: (G , ).

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1 2 3 4

For every a , b G , a b G . (closure) For every a , b c G , (a b ) c = a (b c ). (associativity) For every a G , a e = a = e a . (identity) For every a G , there exists a 1 G such that a a 1 = e = a 1 a . (inverse) Notation: (G , ). If is commutative, the group G is called

Review of Groups

Denition
A group is a non-empty set G together with a binary operation dened in G such that
1 2 3 4

For every a , b G , a b G . (closure) For every a , b c G , (a b ) c = a (b c ). (associativity) For every a G , a e = a = e a . (identity) For every a G , there exists a 1 G such that a a 1 = e = a 1 a . (inverse) Notation: (G , ). If is commutative, the group G is called an abelian group.

Review of Groups

Examples

Review of Groups

Examples
1

( , +),

Review of Groups

Examples
1

( , +),( , +),

Review of Groups

Examples
1

( , +),( , +),( , +)

Review of Groups

Examples
1

( , +),( , +),( , +)

(groups)

Review of Groups

Examples
1 2

Z R (Z, ),

( , +),( , +),( , +)

(groups)

Review of Groups

Examples
1 2

Z R C (Z, ),(R, )

( , +),( , +),( , +)

(groups)

Review of Groups

Examples
1 2

Z R C (groups) (Z, ),(R, ) (not groups)

( , +),( , +),( , +)

Review of Groups

Examples
1 2 3

Z R C (groups) (Z, ),(R, ) (not groups) (Z2 , +)

( , +),( , +),( , +)

Review of Groups

Examples
1 2 3

Z R C (groups) (Z, ),(R, ) (not groups) (Z2 , +) (group)

( , +),( , +),( , +)

Review of Groups

Examples
1 2 3 4

Z R C (groups) (Z, ),(R, ) (not groups) (Z2 , +) (group) R[x ]: the set of all polynomials with real coecients
( , +),( , +),( , +)

Review of Groups

Examples
1 2 3 4

Z R C (groups) (Z, ),(R, ) (not groups) (Z2 , +) (group) R[x ]: the set of all polynomials with real coecients
( , +),( , +),( , +) +: usual addition of polynomials

Review of Groups

Examples
1 2 3 4

Z R C (groups) (Z, ),(R, ) (not groups) (Z2 , +) (group) R[x ]: the set of all polynomials with real coecients
( , +),( , +),( , +) +: usual addition of polynomials ( [x ], +)

Review of Groups

Examples
1 2 3 4

Z R C (groups) (Z, ),(R, ) (not groups) (Z2 , +) (group) R[x ]: the set of all polynomials with real coecients
( , +),( , +),( , +) +: usual addition of polynomials ( [x ], +) (group)

Review of Fields
Denition
A eld is a non-empty set F ,

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and ,

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1

(F, +) is an abelian group.

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1 2

(F, +) is an abelian group.

For every a , b, c F , (a b ) c = a (b c ). (associativity)

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1 2 3

(F, +) is an abelian group.

For every a , b, c F , (a b ) c = a (b c ). (associativity) For every a , b F , a b = b a . (commutativity)

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1 2 3 4

(F, +) is an abelian group.

For every a , b, c F , (a b ) c = a (b c ). (associativity) For every a , b F , a b = b a . (commutativity) There exists an element 1F in such that a 1F = a = 1F a for every a F . (identity)

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1 2 3 4

(F, +) is an abelian group.

For every a , b, c F , (a b ) c = a (b c ). (associativity) For every a , b F , a b = b a . (commutativity) There exists an element 1F in such that a 1F = a = 1F a for every a F . (identity) For every a F such that a = 0, there exists an element a 1 F such that a a 1 = 1F = a 1 a (inverse)

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1 2 3 4

(F, +) is an abelian group.

For every a , b, c F , (a b ) c = a (b c ). (associativity) For every a , b F , a b = b a . (commutativity) There exists an element 1F in such that a 1F = a = 1F a for every a F . (identity) For every a F such that a = 0, there exists an element a 1 F such that a a 1 = 1F = a 1 a (inverse) For every a , b, c F , a (b + c ) = a b + a c and (a + b ) c = a c + b c (distributivity)

Review of Fields
Denition
A eld is a non-empty set F , together with two binary operations + and , which satises the following conditions:
1 2 3 4

(F, +) is an abelian group.

For every a , b, c F , (a b ) c = a (b c ). (associativity) For every a , b F , a b = b a . (commutativity) There exists an element 1F in such that a 1F = a = 1F a for every a F . (identity) For every a F such that a = 0, there exists an element a 1 F such that a a 1 = 1F = a 1 a (inverse) For every a , b, c F , a (b + c ) = a b + a c and (a + b ) c = a c + b c (distributivity) Notation: (F, +, )

Review of Fields

Examples
1

( , +, )

Review of Fields

Examples
1

( , +, )

(eld)

Review of Fields

Examples
1 2

R (C, +, )

( , +, )

(eld)

Review of Fields

Examples
1 2

R (C, +, )

( , +, )

(eld) (eld)

Review of Fields

Examples
1 2 3

R (C, +, ) (Z, +, )

( , +, )

(eld) (eld)

Review of Fields

Examples
1 2 3

R (C, +, ) (Z, +, )

( , +, )

(eld) (eld) (not a eld)

Review of Fields

Examples
1 2 3 4

R (C, +, ) (Z, +, ) (Z2 , +, )

( , +, )

(eld) (eld) (not a eld)

Review of Fields

Examples
1 2 3 4

R (C, +, ) (Z, +, ) (Z2 , +, )

( , +, )

(eld) (eld) (not a eld) (eld)

Review of Fields

Examples
1 2 3 4 5

R (C, +, ) (Z, +, ) (Z2 , +, ) (R[x ], +, )

( , +, )

(eld) (eld) (not a eld) (eld)

Review of Fields

Examples
1 2 3 4 5

R (C, +, ) (Z, +, ) (Z2 , +, ) (R[x ], +, )

( , +, )

(eld) (eld) (not a eld) (eld) (not a eld)