11 Basic Axioms and Examples (Groups)

1ad

Question

Determine which of the following binary operations are associative:
a. the operation on Z defined by ab=ab
b. the operation on R defined by ab=a+b+ab
c. the operation on Q defined by ab=a+b5
d. the operation on Z×Z defined by (a,b)(c,d)=(ad+bc,bd)
e. the operation on Q{0} defined by ab=ab

Proof

a.

(ab)c=(ab)c=(ab)cac+b=a(bc)=a(bc)

So we just need an example where (ab)ca(bc)cc so choose a=1,b=1,c=1 as a counterexample. Thus this isn't associative.

d.

((a,b)(c,d))(e,f)=(ad+bc,bd)(e,f)=((ad+bc)f+bde,bdf)=(adf+bcf+bde,bdf)=(adf+b(cf+de),bdf)=(a,b)(cf+de,df)=(a,b)((c,d)(e,f))

So it is associative!

2

Question

Decide which of the binary operations in the preceding exercise are commutative.

Proof

a. Isn't commutative since ab=abba=ba (ex: use a=1,b=0)
b. Is commutative by the commutativity of addition and multiplication on R:

ab=a+b+ab=b+a+ba=ba

c. This is commutative in a similar way to (b):

ab=a+b5=b+a5=ba

d. It's commutative using commutativity of addition and multiplication on Z:

(a,b)(c,d)=(ad+bc,bd)=(cb+da,db)=(c,d)(a,b)

e. Clearly this is commutative since 12=122=21 as a counter-example.

6abcd

Question

Determine which of the following sets are Groups under addition:
a. The set of rational numbers (including 0 = 0/1) in lowest terms whose denominators are odd.
b. The set of rational numbers (including 0 = 0/1) in lowest terms whose denominators are even.
c. The set of rational numbers of absolute value < 1.
d. The set of rational numbers of absolute value 1 together with 0.

Proof

a. This one is a group, since closure is occurring here. Namely, for any two fractions we add in this set it has the following format:

k12m+1+k22n+1=k1(2n+1)+k2(2m+1)4mn+2(n+m)+1

where k1,k2,m,nZ. Notice that the end fraction that comes out is odd on the bottom (since it equals 2(2mn+m+n)+1) and the top we don't care about (since it's definitely even, but the denominator is odd).

For the other properties:

  1. Associativity comes from the associativity from Q
  2. The identity is 0 since any element q in this set follows 0+q=q.
  3. The inverse is just the negative of whatever rational integer, so q has the inverse q.
    Thus the set is a group.

b. This is not a group, because we fail to have closure under our binary operation. Namely, we may add two even-denominator fractions and get an odd one out. For example:

12+12=2211

is not in our set. Thus then this can't be a group.

c. Similar to (b) there isn't closure. For example:

12+12=1

is not in the set since 11.

d. This is the same as the last two:

32+32=0

is not in the set while 32,32 are.

9

Question

Let G={a+b2R|a,bQ}.
a. Prove G is a Group under addition.
b. Prove that the nonzero elements of G are a group under multiplication.

Proof

a. Clearly G is closed under addition via an argument using closure of addition under Q. For the other properties:

  1. Associativity (let x1,x2,x3G):
(x1+x2)+x3=x1+(x2+x3)

since x1,x2,x3R and are commutative under addition there.
2. The identity element is just 0G. For any xG we have x+0=x.
3. The inverse of any x=a+b2G is just ab2G since:

x+(ab2)=(a+b2)+(ab2)=(aa)+(bb)2=0+02=0

b. Clearly G{0} is closed under muliplication via how Q{0} is closed under multiplication. For the other properties:

  1. Associativity. Same argument as the previous part. For x1,x2,x3G{0} then x1x2x3=(x1x2)x3=x1(x2x3) by associativity over R.
  2. The identity element is just 1=1+02G{0}. Notice that for any xG{0} that x1=(a+b2)(1+02)=a+b2=x.
  3. The inverse of any element x=a+b2G{0} depends on the values:
    1. If b=0 then x=a so then x1=1a since xx1=a1a=1 as desired.
    2. If b0 then x1=a2b2a2+b2b2a22 (notice that 2b2a2=02b=a which is false since 2 is irrational. Verifying:
xx1=x1x=(a2b2a2+b2b2a22)(a+b2)=a22b2a2+2b22b2a2+2(baab2b2a2)0=2b2a22b2a2=1

as desired.

11

Question

Find the orders of each element of the additive group Z12Z

Proof

The identity element is 0. So for each element:

12

Question

Find the orders of the following elements of the multiplicative group (Z12Z)×: 1,1,5,7,7,13.

Proof

Again the identity is 1. Thus (here we use to denote an infinite order):

For the 2's it's because the number n21mod12.

25

Question

Prove that if x2=1 for all xG then G is abelian.

Proof

We know that G is already a Group, so let's show that there's commutativity on G. Let a,bG. First notice that x2=xx=1 so then by definition then x=x1 for all xG. Thus:

ab=ab1(b=b1)=a1b1(a=a1)=(ba)1=ba(ba=(ba)1)