Langrange’s Theorem :

If H ≤G , then |H| divides |G|

Proof :
G is a finite with |G|=n
Case 1 : { e } ≤ G∧|{e }|=1, then1∣n
Case 2 :G≤ G∧|G|=n , then n∣n
Case 3 : H <G∧H ≠ { e } , then1∣n
*Construction 1 :
 Pick g1 ∈G not in H
 g1 H={ g1 ∙h for all h ∈ H }
 H and g1 H do not overlap, i.e. H ∩ g1 H =∅
Claim: H and g1 H have no element in common
- Assume there is an element in H and g1 H
- This means g1 ∙h i=h j for some hi andh jin H
g1 ∙h i=h j
( g1 ∙ hi ) ∙ hi−1 =h j ∙ hi−1
g1 ∙ ( hi ∙ hi−1 ) =h j ∙ hi−1
−1
g1 ∙e=h j ∙ hi
−1
g1=h j ∙ hi
Because h j ∙ hi−1 ∈ H , so g1 ∈ H
This contradiction g1 ∉ H
Assumption is wrong, then claim is true.
*Construction 2 :
 Pick g2 ∈G not in H or g1 H
 g2 H={ g2 ∙ h for all h∈ H }
 H and g2 H do not overlap
 g1 H and g2 H do not overlap
Claim: g1 H and g2 H have no element in common
- Assume there is an element in g1 H and g2 H
- This means g1 ∙h i=g2 ∙ h j for some hi andh jin H
g1 ∙h i=g2 ∙ h j
( g1 ∙ hi ) ∙ h j−1=( g2 ∙ h j ) ∙ h j−1
g1 ∙ ( hi ∙ h j−1 )=g 2 ∙ (h j ∙ h j−1 )
g1 ∙ ( hi ∙ h j )=g 2 ∙ e
−1
 g1 ∙ ( hi ∙ h j−1 )=g 2
g1 ∙h k =g2
Because g1 ∙h k ∈ H , so g2 ∈ g1 H
This contradiction g2 ∉ g1 H
Assumption is wrong, then claim is true.

G is split into non-overlapping left cosets: H , g 1 H , g 2 H , … , g n H

Each coset is the same size
Pick a coset gH and suppose it has duplicates
g ∙ h1=g ∙h 2
−1 −1
g ∙ ( g ∙ h1 ) =g ∙ ( g ∙ h2 )
h1 =h2
This contradiction
Each coset has size |H|=d .
G partitioned into cosets
|G|=N ,| H|=d
Let’s call the number of cosets = k
Index of H ∈G=|G : H|=k
So d ∙ k=n ⟹ d∨n
This means |H | divides |G|
Hence langrange’s theorem is proven.