Monoids and groups

Morphisms Algebra Interactive

Algebra 2
Monoids and groups
Morphisms A.M. Cohen, H. Cuypers, H. Sterk

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

1/8

Monoids and groups

Morphisms Algebra Interactive

The standard notion for comparing structures is that of homomorphism.

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

2/8

Monoids and groups

Morphisms Algebra Interactive

Denition

Homomorphism Let S1 and S2 be two structures with ni -ary operations i ,1 and i ,2 , respectively (where i runs through a nite set). A homomorphism between these structures is a map f : S1 S2 respecting all operations, i.e., for all i we have f (i ,1 (a1 , . . ., ani ))=i ,2 (f (a1 ), . . ., f (ani )). If f is bijective, then we call f an isomorphism. In particular, for monoids [M1 , 1 , e1 ] and [M2 , 2 , e2 ] this means the following. A homomorphism between M1 and M2 is a map f : M1 M2 with the following properties. f (e1 )=e2 for all a, b : f (a 1 b )=f (a) 2 f (b )

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

3/8

Monoids and groups

Morphisms Algebra Interactive

Denition

Homomorphism Let S1 and S2 be two structures with ni -ary operations i ,1 and i ,2 , respectively (where i runs through a nite set). A homomorphism between these structures is a map f : S1 S2 respecting all operations, i.e., for all i we have f (i ,1 (a1 , . . ., ani ))=i ,2 (f (a1 ), . . ., f (ani )). If f is bijective, then we call f an isomorphism. In particular, for monoids [M1 , 1 , e1 ] and [M2 , 2 , e2 ] this means the following. A homomorphism between M1 and M2 is a map f : M1 M2 with the following properties. f (e1 )=e2 for all a, b : f (a 1 b )=f (a) 2 f (b )

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

3/8

Monoids and groups

Morphisms Algebra Interactive

Denition

Homomorphism Let S1 and S2 be two structures with ni -ary operations i ,1 and i ,2 , respectively (where i runs through a nite set). A homomorphism between these structures is a map f : S1 S2 respecting all operations, i.e., for all i we have f (i ,1 (a1 , . . ., ani ))=i ,2 (f (a1 ), . . ., f (ani )). If f is bijective, then we call f an isomorphism. In particular, for monoids [M1 , 1 , e1 ] and [M2 , 2 , e2 ] this means the following. A homomorphism between M1 and M2 is a map f : M1 M2 with the following properties. f (e1 )=e2 for all a, b : f (a 1 b )=f (a) 2 f (b )

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

3/8

Monoids and groups

Morphisms Algebra Interactive

If two structures are isomorphic (that is, there is an isomorphism from one to the other), then they are of the same shape (morph = shape). An isomorphism S1 S1 (that is, with both domain and target structure the same) is called an automorphism of S1 .

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

4/8

Monoids and groups

Morphisms Algebra Interactive

Example

Suppose that all elements of the monoid M can be expressed as products of a single element, say c . So M ={c 0 , c , c 2 , c 3 , . . .}. Then the monoid is said to be generated by c . Dene a map f : NM by f (n)=c n . Then we have f (n + m) = c n+m = c n c m = f (n)f (m). Also, f (0)=1. Hence f is a homomorphism of monoids. Clearly, f is surjective. But it need not be injective. If M is a free monoid, then the map f is also injective. Another example of a homomorphism of monoids is the length function for a free monoid. Indeed, if M is a free monoid over an alphabet A, then the length function L from M to N satises L()=0 and L(x y )=L(x ) + L(y ). If A has size 1, this length function is the inverse of the homomorphism f .

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

5/8

Monoids and groups

Morphisms Algebra Interactive

Remark

The notion of homomorphism of semi-groups is similar; the condition about the identity element is dropped, of course. Notions like homomorphisms, isomorphisms, and automorphisms exist for all structures. We shall encounter them again when we discuss rings, groups, and elds.

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

6/8

Monoids and groups

Morphisms Algebra Interactive

Theorem

If f : M1 M2 is an isomorphism of monoids, then

1 2

the cardinalities of M1 and M2 are equal; the inverse map f 1 : M2 M1 is also an isomorphism of monoids.

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

7/8

Monoids and groups

Morphisms Algebra Interactive

Theorem

If f : M1 M2 is an isomorphism of monoids, then

1 2

the cardinalities of M1 and M2 are equal; the inverse map f 1 : M2 M1 is also an isomorphism of monoids.

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

7/8

Monoids and groups

Morphisms Algebra Interactive

Theorem

If f : M1 M2 is an isomorphism of monoids, then

1 2

the cardinalities of M1 and M2 are equal; the inverse map f 1 : M2 M1 is also an isomorphism of monoids.

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

7/8

Monoids and groups

Morphisms Algebra Interactive

Example

Consider the monoids [Monoids]C1,1 and C0,2 , given by the following multiplication tables.
1 a 1 b 1 1 a 1 1 b a a 1 b b b

Both have size 2. But they are not isomorphic. For otherwise, there would be an isomorphism: f : C1,1 C0,2 with f (1)=1. Hence, as f is bijective, also f (a)=a. But then we would have 1 = f (1) = f (a2 ) = f (a2 ) = b 2 = b , a contradiction.

A.M. Cohen, H. Cuypers, H. Sterk

Algebra 2

September 25, 2006

8/8