subgroups

Work in Progress

Summary

Subgroup test

Coset equality

Lagrange’s theorem

Concept

Subgroup

  • subset which is also a group over the same binary operation
  • think of it as a smaller cycling

Generated group

  • set created from repeaded operations on an element

Subgroup test

  • for , necessity follows from closure under inverses and products. Conversely, suppose and for all .

Cosets

  • for and , define the left and right cosets:
  • left cosets are equal or disjoint. If they share an element, then
  • in particular, the equality test is
  • every lies in because and . Thus the distinct left cosets partition . Each has the same size as via the bijection
  • left and right cosets need not be equal. Cosets need not be subgroups: if , then , so is not a subgroup.

Lagrange’s theorem

  • the index is the number of distinct left cosets of in . If is finite, choose one representative from each coset and put .
  • the converse is false in general: a divisor of does not guarantee a subgroup of that size.

(keep

Application

Examples

Cosets in

  • find all cosets of , with addition modulo 12

Testing

  • use the additive subgroup test: nonempty and closed under differences

Possible subgroup sizes when

Find the subgroup sizes allowed by Lagrange’s theorem and their indices.

These are necessary possibilities; Lagrange alone does not establish existence for every listed size. The sizes and always occur, from and .