Scribd
Upload
15 views

HW Assignment #3

The document provides instructions and three problems for a math homework assignment on abstract algebra. Problem 1 asks to prove that the direct product of two groups forms a group. Problem 2 asks to prove an property about abelian groups. Problem 3 asks to prove a statement using induction about elements in a group.

Uploaded by

Tim Leonardo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

HW Assignment #3

The document provides instructions and three problems for a math homework assignment on abstract algebra. Problem 1 asks to prove that the direct product of two groups forms a group. Problem 2 asks to prove an property about abelian groups. Problem 3 asks to prove a statement using induction about elements in a group.

Uploaded by

Tim Leonardo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ASSIGNMENT 3

MATH 457 - ABSTRACT ALGEBRA


(DUE FRIDAY MARCH 19, 2021 )

TIMOTHY LEONARDO

Instructions: Students are encouraged to discuss and work on homework problems with
their peers. However, work submitted must be the students own. Presenting other’s work as
your own is dishonest and violates University policy. Multiple students handing in identical
work will not receive credit and will be subject to appropriate disciplinary measures.
(Notation):
1) ∈= in, ∈= / not in, ∃= there exist, ∀= for all.
2) ∅ = empty set.
3) R are the real numbers and Z are the integers.
Problem 1 (4 points). Prove that: If (G, ∗) and (H, •) are groups, then (G × H, ) is a
group via

∀g1 , g2 ∈ G textand h1 , h2 ∈ H
define by
(g1 , h1 ) (g2 , h2 ) = (g1 ∗ g2 , h1 • h2 )
Solution 1.
We want to show that (G × H, ) is a group. Let (g1 , h1 )and(g2 , h2 ) ∈ G × H. Be definition
(g1 , h1 ) (g2 , h2 ) = (g1 ∗ g2 , h1 • h2 ).
Since G and H are groups, g1 ∗ g2 ∈ G and h1 • h2 ∈ H. Because * is a binary operation on
G and • is a binary operation on H it follows the sequence (g1 ∗ g2 , h1 • h2 ) ∈ G × H.
So, is a binary operation of G × H.
ASSOCIATIVE PROOF
LEFT HAND SIDE: Let (g1 , h1 ), (g2 , h2 ), (g3 , h3 ) ∈ G × H.
= (g1 ∗ g2 , h1 • h2 ) (g3 , h3 ). We can show that ((g1 ∗ g2 ) ∗ g3 ), ((h1 • h2 ) • h3 ).
RIGHT HAND SIDE: Let (g1 , h1 ), (g2 , h2 ), (g3 , h3 ) ∈ G × H.
(g1 , h1 ) (g2 ∗ g3 , h2 • h3 ) = g1 ∗ (g2 ∗ g3 ), h1 • (h2 • h3 )
∴ Since (g1 ∗ g2 ) ∗ g3 = g1 ∗ (g2 ∗ g3 ) and (h1 • h2 ) • h3 ) = h1 • (h2 • h3 ) We can show that ∗
is associative in G and • is associative in H. So, is associated in G × H.
IDENTITY PROOF
We wish to find (e1 , e2 ) ∈ G × H s.t. (g, h) (e1 , e2 ) = (e1 , e2 ) (g, h) = (g, h) for
∀(g, h) ∈ G × H. (g, h) (e1 , e2 ) = (g ∗ e1 , h • e2 ) = (g, h).
g ∗ e1 = g and h • e2 = h. It follows e1 is the identity of G and e2 is the identity element of
H. If this is true, (e1 , e2 ) (g, h) = (e1 ∗ g, e2 • h) = (g, h). Since (e1 , e2 ) ∈ G × H, (e1 , e2 ) is
the identity element of G × H where e1 is the identity of G and e2 is the identity of H.

Date: March 15, 2021.


1
INVERSE PROOF
Let (g, h) ∈ G × H. We wish to find (g 0 , h0 ) ∈ G × H, s.t (g, h) (g 0 , h0 ) = (g 0 , h0 ) (g, h) =
(eG , eH ). NOTE: (eG , eH ) is notated as the identity.
We will require that g ∗ g 0 = eG and h • h0 = eH . This follows that g’ is the inverse of g in
G and h’ is the inverse of h in H. If this is true, (g 0 , h0 ) (g, h) = (g 0 ∗ g, h0 • h) = (eG , eH ).
Since (g’, h’) is in G × H, (g’, h’) is the inverse of (g, h). This statement provides us that
every element in G × H has an inverse in G × H.
We have proven the associative proof, identity proof and inverse proof of G × H. This shows
the G × H is group under . QED
Problem 2 (3 points). Prove that if G = {a1 , a2 , . . . , an } is an abelian group and x = a1 a2 . . . an ,
then x2 = 1.
Solution 2.
We note that x2 = xx = (a1 a2 ...an )(a1 a2 ...an ). Since G is an abelian group we can order the
products of the elements a1 a2 ...an a1 a2 ...an in any way. Our goal is to pair each element with
its inverse.
Let us order the product above (a1 a2 ...an a1 a2 ...an ) in the following manner. Pair each ai
with its inverse. We can do this because G is abelian and each element has a unique inverse
because G is a group.
So we have x2 = (a1 a−1 −1
1 )(a2 a2 )...(an an )
−1

= 1 · 1 · ... · 1
=1
Therefore, if G = {a1 , a2 , . . . , an } is an abelian group and x = a1 a2 . . . an , then x2 = 1.
QED
Problem 3 (3 points). Prove that if G is a group and a, b ∈ G with aba−1 = bj , then
r
ar ba−r = bj (Hint: induction and note that bj bj = aba−1 aba−1 = abba−1 ).
Solution 3.
We will need to perform the Proof of Induction twice for this example. Let us first prove
that (bj )n = abn a−1
• Base Case: n = 1; bj = aba−1 . With this, base case is satisfied.
• Inductive Hypothesis: Assume abn a−1 = (bj )n when n = t.
• Inductive Step: We wish to examine (bj )t+1
(bj )t+1 = (bj )t bj
= abt a−1 · bj
= abt a−1 · (aba−1 )
= abt a−1 aba−1
= abt ba−1 (because of the identity)
= abt+1 a−1
So, if (bj )t = abt a−1 then (bj )t+1 = abt+1 a−1 . So, if n is an integer (bj )n = (aba−1 )n = abn a−1 .
r
Next we will prove ar ba−r = bj
• Base Case: r = 1; aba−1 = bj . This is true therefore the base case is satisfied for
aba−1 = bj .
r u
• Inductive Hypothesis: Assume ar ba−r = bj for when r = u. So, au ba−u = bj .
• Inductive Step: We wish to examine (bj )u+1 .
(bj )u+1 = ((bj )u )j
2
= (au ba−u )j
Let y = au so (yby −1 )j
= ybj y −1
= au bj a−u
= au aba−1 a−u
= au+1 ba−(u+1)
u u
So, if bj = au ba−u then bj +1 = au+1 ba−(u+1)
r
Hence ar ba−r = bj
r
Therefore, if aba−1 = bj then ar ba−r = bj by order of induction. QED

You might also like