Skip to main content

Section 3.1 Introduction to groups

Definition 3.1.1.

A group is a set G along with a binary algebraic operation that satisfies the following properties:
  1. Closure: For any a,b in G, it follows that ab in G.
  2. Associativity: For any a,b,c in G, it follows that (ab)c=a(bc).
  3. Identity: There is an element (usually denoted) e in G, such that for any a in G, we have that ea=a and ae=a.
  4. Inverses: For any a in G, we there is a a1 in G so that aa1=e.

Problem 3.1.2.

For each of the following, determine if the given set and operation for a group. If they do not, show for which operations precisely they fail.
  1. Positive integers under addition.
  2. Positive integers under multiplication.
  3. Integers under addition.
  4. Integers under multiplication.
  5. Positive reals under addition.
  6. Positive under multiplication.
  7. Reals under addition.
  8. Reals under multiplication.
  9. Polynomials under addition.
  10. Polynomials under composition.
  11. Rock, Paper, Scissors under winner (or tie).
  12. Bijections from {1,2,3}{1,2,3} under composition.

Problem 3.1.3.

Consider the collection of the 8 possible symmetries of a square, 4 rotations (including the 0 degree identity rotation) and the 4 reflections:
Symmetries of a Square
Let composition be the operation.

(f)

Fill out an 8 by 8 “multiplication” table of the possible operations. What patterns do you notice?

(g)

Determine if this set and operation form a group.

(h)

Find two elements of this group, a,b so that each element of this group is some “product” of a,b powers.

Problem 3.1.4.

Let Zn denote the integers modulo n with operation addition. For example Z4 is the set {0,1,2,3} where 2+1=3,3+1=0,3+2=1 etc..

(a)

Pick 4 different n’s at least 2. Show that Zn for your choices for a group.

(b)

Prove that Zn is always a group.

Problem 3.1.5.

Let Dn denote the symmetries of a regular n-sided polygon, with operation composition. For example in Problem 3.1.3 describes the symmetries of a regular 4-gon ie a square.

(a)

Pick 3 different n’s at least 3. Show that Dn for your choices for a group.

(b)

Prove that Dn is always a group.

Problem 3.1.6.

Let Sn denote the bijections from an n element set to itself, with operation composition. For example in Problem 3.1.2 describes S3 at the end.

(a)

Pick 3 different n’s at least 2. Show that Sn for your choices for a group.

(b)

Prove that Sn is always a group.

Problem 3.1.7.

(a)

Prove that identities have to be unique. (What happens if there was a second identity e?)

(b)

Prove that right inverses are left inverses. (If there were b,c so that ab=e and ca=e, what would happen?)

Definition 3.1.8.

A group is said to be abelian if for any a,bG,ab=ba.

Definition 3.1.10.

Given a group G a subset HG is a subgroup of G if H is also a group with the same operation.

Problem 3.1.11.

(a)

Show that even integers are a subgroup of the integers.

(b)

Determine if multiples of three are a subgroup of the integers.

(c)

Determine if odd integers are a subgroup of the integers.

(d)

Find 3 different subgroups of D8

(e)

Given Dn are the collections of rotations a subgroup?

(f)

Given Dn are the collections of reflections a subgroup?

(g)

Label the corners of a square 1,2,3,4. How can this help us find a subgroup of S4 of size 8?

Problem 3.1.12.

Let T(x)=x+1,R(x)=1x,e(x)=x.

(a)

Find k(x) so that =k(R(x))=e(x) and R(k(x))=e(x).

(b)

Let h(x)=R(T(R(T(R(x))))). simplify h(x).

(c)

What are h(T(x)) and T(h(x))

(d)

Show that the set of all possible compositions of T(x),R(x),e(x) form a group.

(e)

Recall you proof in Rational Tangles that each rational numbered may be achieved through the tangling process. Show that any knot corresponding to a tangle can be undone and reverted to the original position.

Definition 3.1.13.

Let φ:GH. If φ is a bijection such that φ(ab)=φ(a)φ(b) we say that φ is a isomorphism and G,H are isomorphic.

Problem 3.1.14.

Show that S3,D3 and the group
G={[100010001],[100001010],[010100001],[001010100],[010001100],[001100010]}
under matrix multiplication are isomorphic. Can you think of a natural reason why they should be?

Problem 3.1.15.

Find all subgroups of D5 which are isomorphic to Z2.

Problem 3.1.16.

Determine if Z2×Z2 is isomorphic to Z4.

Problem 3.1.17.

Find 3 groups of size 4 which are not isomorphic to each other or explain why this is not possible.

Problem 3.1.18.

Consider the group Z3×Z3×Z3×Z3. Recall SET. Let the first entry correspond to number, the second color, the third shading and the fourth shape. Assign a value to each characteristic.
Let a GSET denote a collection of three cards so that their sum is (0,0,0,0).

(a)

Compare GSETS to SETS. What collections of cards are SETS but not GSETS? What are GSETS but not SETS?

(b)

Pick a card which corresponds to (0,0,0,0) pick two other cards a,b which are not inverses of each other. What is the subgroup generated by these two cards and what are their corresponding cards?

(c)

Remember when we conjectured that any 3 cards which don’t form a SET would generate a plane? Now prove it.