Proving Lagrange Theorem for Finite Group G

  • Context: MHB 
  • Thread starter Thread starter onie mti
  • Start date Start date
  • Tags Tags
    Lagrange Theorem
Click For Summary
SUMMARY

The discussion focuses on proving Lagrange's Theorem for finite groups, specifically stating that if H is a subgroup of a finite group G, then the order of H divides the order of G. The proof involves demonstrating that the left cosets of H partition G into sets of equal size to H, leading to the conclusion that the order of G equals the number of distinct cosets multiplied by the order of H. Key steps include establishing a bijective map from H to Ha for any element a in G and showing that distinct cosets form a partition of G.

PREREQUISITES
  • Understanding of finite groups and subgroup definitions
  • Familiarity with group order and cosets
  • Knowledge of bijective functions and their properties
  • Basic concepts of partitioning sets in mathematics
NEXT STEPS
  • Study the properties of cosets in group theory
  • Learn about bijective mappings and their applications in proofs
  • Explore the implications of Lagrange's Theorem in group theory
  • Investigate examples of finite groups and their subgroups
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone studying group theory, particularly those interested in the properties of finite groups and subgroup relationships.

onie mti
Messages
42
Reaction score
0
given that G is a finite group.

1) if H is a subgroup of G then |H| divides |G|
2) if a in G the ord(a)/|G|

i could prove no 2 using no 1 where i said ord(a)=|<a>| and <a> is a subgroub of G so by 1
ord(a)/|G|how cAN I prove 1
 
Physics news on Phys.org
Re: langrange theorem

onie mti said:
given that G is a finite group.

1) if H is a subgroup of G then |H| divides |G|
2) if a in G the ord(a)/|G|

i could prove no 2 using no 1 where i said ord(a)=|<a>| and <a> is a subgroub of G so by 1
ord(a)/|G|how cAN I prove 1
Very briefly, the (left) cosets of H partition G into a number of sets all having the same size as H. So the order of G is the order of H times the number of cosets.
 
This is what you need to do to prove (1).

Step one:

Show that the map $f:H \to Ha$ for any $a \in G$, given by $f(h) = ha$ is bijective.

Step two:

Conclude that $|H| = |Ha|$ for all $a \in G$.

Step three:

Show that if $x \in Ha \cap Hb$, then $Ha = Hb$.

Step four:

Conclude that the distinct cosets of $H$ form a partition of $G$.

Step five:

Conclude that $G = H \cup Ha_1 \cup \cdots \cup Ha_{k-1}$ for $k$ distinct cosets of $H$ in $G$

(note that this uses the fact that $|G|$ is FINITE).

Step six:

Use steps four and five to conclude that:

$|G| = k\ast|H|$.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
632
  • · Replies 26 ·
Replies
26
Views
959
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 4 ·
Replies
4
Views
634
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K