Scribd
Upload
112 views

Split 71

This document provides solutions to 15 problems about group theory concepts. Some key points covered include: 1) The properties of monoids, semigroups and groups under different binary operations like multiplication and addition. 2) Finding the order of elements and identifying all subgroups of a given group. 3) Properties of the special linear group of matrices and conditions for matrices to have multiplicative inverses. 4) Relations between the orders of elements in direct products of groups. 5) Using prime factorizations to find the least common multiple of orders, which relates to the existence of elements of maximum order.

Uploaded by

Lakshya Vij
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
112 views

Split 71

This document provides solutions to 15 problems about group theory concepts. Some key points covered include: 1) The properties of monoids, semigroups and groups under different binary operations like multiplication and addition. 2) Finding the order of elements and identifying all subgroups of a given group. 3) Properties of the special linear group of matrices and conditions for matrices to have multiplicative inverses. 4) Relations between the orders of elements in direct products of groups. 5) Using prime factorizations to find the least common multiple of orders, which relates to the existence of elements of maximum order.

Uploaded by

Lakshya Vij
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Solutions Chapters 1–5

Section 1.1
1. Under multiplication, the positive integers form a monoid but not a group, and the
positive even integers form a semigroup but not a monoid.
2. With |a| denoting the order of a, we have |0| = 1, |1| = 6, |2| = 3, |3| = 2, |4| = 3,
and |5| = 6.
3. There is a subgroup of order 6/d for each divisor d of 6. We have Z6 itself (d = 1),
{0}(d = 6), {0, 2, 4}(d = 2), and {0, 3}(d = 3).
4. S forms a group under addition. The inverse operation is subtraction, and the zero
matrix is the additive identity.
5. S ∗ does not form a group under multiplication, since a nonzero matrix whose deter-
minant is 0 does not have a multiplicative inverse.
6. If d is the smallest positive integer in H, then H consists of all multiples of d. For if
x ∈ H we have x = qd + r where 0 ≤ r < d. But then r = x − qd ∈ H, so r must be
0.
7. Consider the rationals with addition mod 1, in other words identify rational numbers
that differ by an integer. Thus, for example, 1/3 = 4/3 = 7/3, etc. The group is
infinite, but every element generates a finite subgroup. For example, the subgroup
generated by 1/3 is {1/3, 2/3, 0}.
8. (ab)mn = (am )n (bn )m = 1, so the order of ab divides mn. Thus |ab| = m1 n1 where
m1 divides m and n1 divides n. Consequently,

am1 n1 bm1 n1 = 1 (1)

If m = m1 m2 , raise both sides of (1) to the power m2 to get bmn1 = 1. The order of b,
namely n, must divide mn1 , and since m and n are relatively prime, n must divide
n1 . But n1 divides n, hence n = n1 . Similarly, if n = n1 n2 we raise both sides of (1)
to the power n2 and conclude as above that m = m1 . But then |ab| = m1 n1 = mn,
as asserted.

If c belongs to both a and b then since c is a power of a and also a power of b, we
have cm = cn = 1. But then the order of c divides both m and n, and since m and n are
relatively prime, c has order 1, i.e., c = 1.

1
2

9. Let |a| = m, |b| = n. If [m, n] is the least common multiple, and (m, n) the greatest
common divisor, of m and n, then [m, n] = mn/(m, n). Examine the prime factoriza-
tions of m and n:
· · · pjj ) = r r
t t
m = (pt11 · · · ptii )(pi+1
i+1

· · · pj j ) = s s
u u
n = (pu1 1 · · · pui i )(pi+1
i+1

where tk ≤ uk for 1 ≤ k ≤ i, and tk ≥ uk for i + 1 ≤ k ≤ j.


Now ar has order m/r and bs has order n/s, with m/r (= r ) and n/s (= s ) relatively
prime. By Problem 8, ar bs has order mn/rs = mn/(m, n) = [m, n]. Thus given
elements of orders m and n, we can construct another element whose order is the
least common multiple of m and n. Since the least common multiple of m, n and
q is [[m, n], q], we can inductively find an element whose order is the least common
multiple of the orders of all elements of G.
10. Choose an element a that belongs to H but not K, and an element b that belongs to
K but not H, where H and K are subgroups whose union is G. Then ab must belong
to either H or K, say ab = h ∈ H. But then b = a−1 h ∈ H, a contradiction. If
ab = k ∈ K, then a = kb−1 ∈ K, again a contradiction. To prove the last statement,
note that if H ∪ K is a subgroup, the first result with G replaced by H ∪ K implies
that H = H ∪ K or K = H ∪ K, in other words, K ⊆ H or H ⊆ K.
11. akm = 1 if and only if km is a multiple of n, and the smallest such multiple occurs
when km is the least common multiple of n and k. Thus the order of ak is [n, k]/k.
Examination of the prime factorizations of n and k shows that [n, k]/k = n/(n, k).
12. We have x ∈ Ai iff x is a multiple of pi , and there are exactly n/pi multiples of pi
between 1 and n. Similarly, x belongs to Ai ∩ Aj iff x is divisible by pi pj , and there
are exactly pinpj multiples of pi pj between 1 and n. The same technique works for all
other terms.
13. The set of positive integers in {1, 2, . . . , n} and not relatively prime to n is ∪ri=1 Ai ,
so ϕ(n) = n − | ∪ri=1 Ai |. By the principle of inclusion and exclusion from basic
combinatorics,
r   r  
 
 Ai  = |Ai | − |Ai ∩ Aj | + |Ai ∩ Aj ∩ Ak | − · · · + (−1)r−1 |A1 ∩ A2 ∩ · · · Ar |.
i=1 i=1 i<j i<j<k

By Problem 12,
 r
1  1  1 
ϕ(n) = n 1 − + − + · · · + (−1)r 1p1 p2 · · · pr .
p
i=1 i
pp
i<j i j
pi pj pk
i<j<k
    
Thus ϕ(n) = n 1 − 1
1−
p1 · · · 1 − p1r .
1
p2
14. Let G be cyclic of prime order p. Since the only positive divisors of p are 1 and p, the
only subgroups of G are G and {1}.
15. No. Any non-identity element of G generates a cyclic subgroup H. If H ⊂ G, we
are finished. If H = G, then G is isomorphic to the integers, and therefore has many
nontrivial proper subgroups. (See (1.1.4) and Problem 6 above.)

You might also like