Rivalry2

HTML Diff

0 added 0 removed

Original 2026-01-01

Modified 2026-02-28

1 According to Lagrange’s theorem, the order<a>of</a>a subgroup H divides the order of the group G. This relationship can be expressed as:

2 |G| = [G :H] .|H|

3 What is Coset?

4 A coset is the<a>set</a>of all products obtained by multiplying a fixed element of the group with each element of a subgroup.

5 In group theory, if g is an element of G, H is a subgroup of G, and G is a finite group, then The left coset of H in G with respect to the element of G is g ∈ H is defined as:

6 gH ={gh \ h ∈ H}. And, The right coset of H in G with respect to the element g ∈ G is the<a>set</a>Hg={gh \ h ∈ H}.

7 Let us now discuss the lemmas that support the Lagrange theorem.

8 Lemma 1:In a group G, every coset of a group H has the same<a></a><a>number</a>of elements as H, and there’s a one to one<a>matching</a>between them.

9 Lemma 2:The left coset<a>relation</a>, g1 ~ g2, is an equivalence relation if and only if, g1*H=g2*H, provided that G is a group with subgroup H.

10 Lemma 3:Assume that S is a set and that ~ is an equivalence relation on S. If A and B are two equivalence classes, then A ∩ B = Ø .

11 Lagrange Theorem Proof

12 The Lagrange statement is easily proven, with the help of the three lemmas. That is listed above. Lagrange statement proof:

13 Let G be a finite group of order m, and let H be any subgroup of order n. Let us look how G can be divided into cosets of H.

14 Let’s now examine how each coset of gH is made up of n distinct elements.

15 Let H = {h1, h2, …, hn}, then ah 1, ah 2,..., ahn are the n different members of aH.

16 Assume that G satisfies the cancellation law: if gh<a>i</a>=ghj, then hi=hj.

17 The number of distinct left cosets, let’s say p, will likewise be finite since G is a finite group. Therefore, np, or the total number of elements of G, is the<a>sum</a>of the elements of all cosets. Thus, m = np p = m/n

18 This shows that m, the order of the finite group G, divides n, the order of H.

19 Additionally, we observe that the index of a subgroup, which is, p divides the order of the group.

20 Thus, it was demonstrated that |G| = |H|

21 Lagrange Theorem Corollary

22 Corollary 1:The orders of any element a ∈ G divides the order of the group G, and in particular, am=e, if G is a group of finite order m.

23 Proof:Since a is the least positive integer and p is its order, ap = e

24 Then we can state, Group G’s elements, a,a2,a3, ..., ap-1, ap = e, are all unique and constitute a subgroup.

25 Since the element a creates a subgroup with p element and the whole group G also has p elements. That means the subgroup is actually the entire group. So, a generates the whole group.

26 Thus, we can write it as, If n is a positive integer, then write it as m=np.

27 Thus, the am=anp=(ap)n = e Thus, it is satisfying.

28 Corollary 2:A finite group G has no proper subgroups if its order is prime order.

29 Proof:Let us assume that group G has prime order m. The prime numbers property states that there are now only two divisors of m: 1 and m. Hence, the subgroups of G itself. As a result, no proper subgroups exist.

30 Corollary 3:A prime order group is cyclic if it has only two divisors.

31 Proof:Assume that a ≠ e ∈ G and that G is the prime order group of m. The order of a is either 1 or m since it is a divisor of m.

32 However, since a ≠ e, the order of a, o(a) ≠ 1.

33 Consequently, the cyclic subgroup of G that is produced by a is of order m, a is the order of o(a)=p. It establishes that G is cyclic, meaning that it is the same as the cyclic subgroup that a forms.