Scribd
Upload
15 views2 pages

MA267A1

The document presents an assignment on groups and rings, detailing the properties of automorphism groups, cycles in symmetric groups, and the structure of specific algebraic groups. It includes proofs of associativity, identity, and inverses in group operations, as well as discussions on the behavior of cycles based on their lengths. The assignment concludes with a demonstration of subgroup properties through closure, identity, and inverses.

Uploaded by

Venkat Ragavan Srikanth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views2 pages

MA267A1

The document presents an assignment on groups and rings, detailing the properties of automorphism groups, cycles in symmetric groups, and the structure of specific algebraic groups. It includes proofs of associativity, identity, and inverses in group operations, as well as discussions on the behavior of cycles based on their lengths. The assignment concludes with a demonstration of subgroup properties through closure, identity, and inverses.

Uploaded by

Venkat Ragavan Srikanth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MA267 Groups and Rings Assignment I Venkat Srikanth, 5507198, 15/10/24

1 Let the group Aut(G) := ({isomorphisms G → G}, ◦)


Let the isomorphisms G → G be denoted by g : G → G, such that Aut(G) = {g1 , g2 , . . . }

(a) ◦ is always associative, ∀ g1 , g2 , g3 ∈ Aut(G),


(g1 ◦ g2 ◦ g3 )(a) = ((g1 ◦ g2 ) ◦ g3 )(a) = (g1 ◦ (g2 ◦ g3 ))(a), ∀a ∈ G
Therefore ◦ is associative.
Let IdG : G → G be an automorphism such that IdG (a) = a ∀a ∈ G.
Then, ∀g ∈ Aut(G), g ◦ IdG = IdG ◦ g = g.
∴ IdG is the identity of the Automorphic Group of G.
For an arbitrary g ∈ Aut(G), it is found that g is both homomorphic and bijective.
Due to the bijective property of Aut(G), ∃ g −1 ∈ Aut(G) which is the inverse of a given function
g ∈ Aut(G). As g is an isomorphism, this means g −1 is also homomorphic and bijective. ∴ g −1
is an automorphism of G.
Thus, it is proved that Aut(G) is a group under composition.
(b) Firstly, we prove that ϕg is a homomorphism.
Let x, y be some arbitrary elements in G. Then, ϕg (xy) = g(xy)g −1 = (gx)(g −1 )yg −1 =
(gxg −1 )(gyg −1 ) = ϕg (x)ϕg (y).
∴ ϕg is a homomorphism.
Now we prove that ϕg is a bijection by showing that it is both injective and surjective,
∀a, b ∈ G , suppose ϕg (a) = ϕg (b), then gag −1 = gbg −1 and g −1 gag −1 g = g −1 gag −1 g ⇒ a=b .
∴ ϕg is an injection. let a,b ∈ G be an arbitrary element such that, ϕg (a) = b, then,
gag −1 = b , g −1 gag −1 g = g −1 bg ,
Thus, ∀y ∈ G, we can find x = g −1 yg ∈ G , so ϕg is surjective.
Since ϕg is both a homomorphism and a bijection G → G , it is an automorphism of G.
∴ we have proved that ϕg ∈ Aut(G).
(c) If G is abelian, then
ϕg = gxg −1 = (gg −1 )x = IdG (x) = x.

2 (a) Let σ ∈ Sn be a cycle of odd length k, written as σ = (a1 a2 . . . ak ). We show that σ 2 is also a
cycle.
Applying σ 2 shifts each element by two positions:

σ 2 (a1 ) = a3 , σ 2 (a2 ) = a4 , . . . , σ 2 (ak ) = a2 .

Thus,
σ 2 = (a1 a3 a5 . . . ak−2 a2 a4 . . . ak ).
Since k is odd, σ 2 permutes all k elements cyclically without breaking into smaller cycles. Therefore,
σ 2 is a cycle of length k.
∴ σ 2 is a cycle.
(b) Let σ ∈ Sn be a cycle of even length k ≥ 4, written as σ = (a1 a2 . . . ak ). Applying σ 2 shifts each
element by two positions:

σ 2 = (a1 a3 a5 . . . ak−1 )(a2 a4 a6 . . . ak ).

Since σ 2 splits into two disjoint cycles of length k/2, one with even integer indexing and one with
odd, as seen above. It is not a cycle.
∴ σ 2 is not a cycle when σ has even length.
(c) Suppose p divides m, the shift in mapping by σ p periodically goes through the elements and splits
into disjoint cycles. Only if p and m are co primes will the cycle σ p permute through all the
elements without splitting into smaller cycles.

3 (a) To prove the required we show that ∗ is associative, ∃ an identity of the group (D, ∗), and every
element of said group has an inverse:
∀a, b, c ∈ Z and d, e, f ∈ {1, −1}, we have, ((a, d) ∗ (b, e)) ∗ (c, f ) = (a + db, de) ∗ (c, f ) =
(a + db + dec, def ) = (a, d) ∗ (b + ec, ef ) = (a, d) ∗ ((b, e) ∗ (c, f )).
∴ ∗ is associative
Let (i,j) ∈ D be some arbitrary element. Suppose, ∀(x,y) ∈ D, (x,y)∗(i,j) = (x+iy, yj) = (x,y)
= (i,j)∗(x,y), then (i,j) = (0,1) and is the identity of the group (D, ∗).
Suppose ∀ (a,b) ∈ D, ∃ (c,d) ∈ D, such that
(a,b)∗(c,d) = (c,d)∗(a,b) = (0,1), then,
(a,b)∗(c,d) = (a+bc,bd) = (0,1) ⇒ (c,d) = (-a/b,b)=(-ab,b).
Thus, every element has an inverse.
It is so proved that (D, ∗) is indeed a group.
(b) Take (2,1) and (3,1) ∈ Z, (2,1)∗(3,-1) = (2+1·3,1·-1) = (5,-1) whereas (3,-1)∗(2,1) = (3-1·2,-1·1)
= (2,-1). As they are clearly not equatable, (D,∗) is non-abelian.
(c) For elements of the form (x, 1) with x ̸= 0, we compute:

(x, 1)n = (nx, 1).

For (x, 1)n = (0, 1), we would require nx = 0. Since x ̸= 0, no such n exists, so (x, 1) has infinite
order.
For elements of the form (x, −1), we compute:

(x, −1)2 = (x + (−1)x, (−1) · (−1)) = (0, 1).

Therefore, (x, −1) has order 2.

4 We do this by proving closure, existence os identity and inverses:


Closure:
For rik , rjk ∈ H, rik · rjk = r(i+j)k ∈ H (mod n).
For rik m, rjk m ∈ H, rik m · rjk m = r(i−j)k ∈ H.
For rik ∈ H and rjk m ∈ H, rik · rjk m = r(i+j)k m ∈ H.
Identity: The identity element e = r0 ∈ H since r0k = r0 = e.
Inverses:

(a) For rik ∈ H, the inverse is r−ik = r(n/k−i)k ∈ H.


(b) For rik m ∈ H, the inverse is rik m since (rik m)2 = e.

Therefore, H is a subgroup of G.

You might also like