Lagrange's theorem (group theory)

From TCS Wiki
Revision as of 01:27, 20 March 2017 by 173.73.183.30 (talk) (Added some applications, and explained what |H| meant.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Orphan

Lagrange's theorem in group theory states if G is a finite group and H is a subgroup of G, then |H| (how many elements are in H, called the order of H) divides |G|. Moreover, the number of distinct left (right) cosets of H in G is |G|/|H|.

Applications

  • For any g in a group G, [math]\displaystyle{ g^k=e }[/math] for some k that divides the |G|
  • Any group of prime order cyclic (Any element in G can be created by a single element) and simple (no normal subgroups that aren't trivial)


Template:Math-stub