Name Aroosa Fida

Course: Mathematics IV (6449)
Semester: Spring, 2021
Name = Aroosa Fida
Father Name = Fida Muhammad
Roll No = BX614841
Program =B.Ed(SCIENCE)2.5 YEARS

Course Name =Mathematics IV
TUTOR NAME =Mam Sadia Zafar
Assignment No = 2
Q.1 Prove Lagrange Theorem. And explain its applications with examples.
Lagrange theorem is one of the central theorems of abstract algebra. It states that in group theory, for any finite
group say G, the order of subgroup H of group G divides the order of G. The order of the group represents the
number of elements. This theorem was given by Joseph-Louis Lagrange. In this article, let us discuss the
1
statement and proof of Lagrange theorem in Group theory, and also let us have a look at the three lemmas used
to prove this theorem with the examples.
As per the statement, the order of the subgroup H divides the order of the group G. This can be represented as;
|G| = |H|
Before proving the Lagrange theorem, let us discuss the important terminologies and three lemmas that help to
prove this theorem.
In group theory, if G is a finite group, and H is a subgroup of G, and if g is an element of G, then;
gH = { gh: h an element of H } is the left coset of H in G with respect to the element of G
And
Hg = { hg: h an element of H } is the right coset of H in G with respect to the element of G.
Now, let us have a discussion about the lemmas that helps to prove the Lagrange theorem.
Lemma 1: If G is a group with subgroup H, then there is a one to one correspondence between H and any coset
of H.
Lemma 2: If G is a group with subgroup H, then the left coset relation, g1 ∼ g2 if and only if g1 ∗ H = g2 ∗ H
is an equivalence relation.
Lemma 3: Let S be a set and ∼ be an equivalence relation on S. If A and B are two equivalence classes with A
∩ B = ∅, then A = B.
With the help of the above mentioned three lemmas, we can easily prove the Lagrange statement.
Proof of Lagrange Statement:
Let H be any subgroup of the order n of a finite group G of order m. Let us consider the cost breakdown of G
related to H.
Now let us consider each coset of aH comprises n different elements.
Let H = {h1,h2,,hn}, then ah1,ah2,,ahn are the n distinct members of aH.
Suppose, ahi=ahj⇒hi=hj be the cancellation law of G.
Since G is a finite group, the number of discrete left cosets will also be finite, say p. So, the total number of
elements of all cosets is np which is equal to the total number of elements of G. Hence, m=np
p = m/n
This shows that n, the order of H, is a divisor of m, the order of the finite group G. We also see that the index p
is also a divisor of the order of the group.
Hence, proved, |G| = |H|
Corollary 1: If G is a group of finite order m, then the order of any a∈G divides the order of G and in particular
am = e.
Proof: Let p be the order of a, which is the least positive integer, so,
ap = e
2
Then we can say,
a, a2, a3, ., ap-1,ap = e, the elements of group G are all distinct and forms a subgroup.
Since the subgroup is of order p, thus p the order of a divides the group G.
So, we can write,
m = np, where n is a positive integer.
So,
am = anp = (ap)n = e
Hence, proved.
Corollary 2: If the order of finite group G is a prime order, then it has no proper subgroups.
Proof: Let us consider, the prime order of the group G is m. Now, m has only two divisors 1 and m (prime
numbers property). Therefore, the subgroups of G will be {e} and G itself. So, there are no proper subgroups.
Hence, proved.
Corollary 3: A group of prime order (the order has only two divisors) is a cyclic group.
Proof: Suppose, G is the group of prime order of m and a ≠ e∈G.
Since the order of a is a divisor of m, it is either 1 or m.
But the order of a, o(a) ≠ 1, since a ≠ e.
Therefore, the order of o(a) = p, and the cyclic subgroup of G generated by a are also of order m.
It proves that G is the same as the cyclic subgroup formed by a, i.e. G is cyclic.
Q.2 (a) Find the principal value of . Express answers in the form .
3
(b) Using the definition of equality of complex numbers to find all values of z satisfying
?
Question statement is wrong because in any case cosz cannot equal to cos hz. So this is wrong statement then
solution is not possible according to definition of complex number.
Q.3 Show that:
4
(i)
(ii)
5
6
(iii)
= log (z1)-log (z2) = {log|z1|+log|z2|-i (Arg(z1)-Arg(z2)-4kπi| k∈Z }
={log|z1 / z2|-i((Arg(z1)+2kπi)-(Arg(z2)+2kπi)|k∈Z}
= {log|z1 / z2|-i(arg(z1)+arg(z2))|k∈Z}
= {log|z1 / z2|-i(Arg(z1z2)+2kπi)|k∈Z}
= log(z1 / z2)
(iv)
sinh(3z) = sinh(2z + z)
= sinh(2z) cosh z + cosh(2z) sinh z
= (2 sinh z cosh z) cosh z + (cosh2z + sinh2z) sinh z
= 2 sinh z cosh2z + (1 + sinh2z + sinh2z) sinh z
= 2 sinh z (1 + sinh2z) + (1 + 2 sinh2z) sinh z
= 2 sinh z + 2 sinh3z + sinh z + 2 sinh3z
= 3 sinh z + 4 sinh3z
Q.4 Discuss the convergence and divergence, if convergent find the sum
7
1.
2.
Q.5 Apply any appropriate test for convergence or divergence
8
1.
9
10
11
Then, by the root test, the series is convergent.
2.
12
13
14
3.
15
16
17
18
19
20
21

Name Aroosa Fida

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Name Aroosa Fida

Uploaded by

Copyright:

Available Formats

Course: Mathematics IV (6449)

Semester: Spring, 2021

Name = Aroosa Fida

Father Name = Fida Muhammad

Program =B.Ed(SCIENCE)2.5 YEARS

TUTOR NAME =Mam Sadia Zafar

Q.3 Show that:

Q.5 Apply any appropriate test for convergence or divergence

Then, by the root test, the series is convergent.

You might also like