Professional Documents
Culture Documents
Sheet 1
Sheet 1
Reduction of endomorphisms
Exercise 2.
Let G be a group. Is the intersection of two subgroups a group ? How about the
union ?
Exercise 3.
Describe all possible group laws on a set G consisting of three elements.
Exercise 4.
Let (E, ∗) be a set with a composition law ∗ which is associative, has a neutral
element, and such that every element has a left inverse. Show that every element
has a right inverse and that it coincides with its left inverse. Deduce from this that
E is a group.
Exercise 5.
Let (G, ∗) be a group.
1. Show that for any g ∈ G the map ϕg : G → G given by ϕg (x) = g ∗ x is a
bijection,
2. Show Φ : g 7→ ϕg is a homomorphism of groups from (G, ∗) to (Bij(G), ◦).
3. Check that Φ is injective.
Exercise 6.
Let G be a group. An element g ∈ G is said to have (finite) order n > 1 if g n = e
but g m 6= e for all integers 1 6 m < n. If there is no such integer, we say that g
has infinite order. We assume here that G is finite.
1. Show that every element of G has finite order.
2. Assume the cardinality |G| of G (also called the order of G) is even. Show
that G has an element of order two.
Exercise 7.
Let U be the subset of GL2 (R) defined by
1 a
U= , a∈R
0 1
Exercise 10.
Describe all group homomorphisms from Z to Z. Which of them are injective and
which are surjective ?
Exercise 11.
Show that the groups
1. (R, +) and (R>0 , ×) are isomorphic
2. (R∗ , ×) and (C∗ , ×) are not isomorphic
3. (Q, +) and (Q>0 , ×) are not isomorphic
Page 2