For a subgroup of , the left coset represented by isSuppose two left cosets intersect. There are such that , soBecause is a subgroup, . Thus, for every , , proving . Interchanging the two representatives gives the reverse inclusion. Therefore two left cosets are equal or disjoint.
Lagrange's theorem states that if is a subgroup of a finite group , thenwhere the index of a subgroup is the number of distinct left cosets.
Every lies in , since . By i, distinct left cosets are disjoint, so these sets form a partition of a set . Each has cardinality : the function from to is a bijection, with inverse , by cancellation in a group. Counting the elements in this finite partition of a set gives , proving the theorem.
The order of a group element is the smallest positive integer with . Such an integer exists in a finite group: two powers in must agree, and cancellation gives a positive power equal to .
By minimality, are distinct. Every integer power of is one of them, by division of its exponent by . They form the cyclic subgroupApplying Lagrange's theorem to this subgroup gives
For , the element belongs to both and . The assumed equal-or-disjoint property therefore gives .
If , then , so is closed under multiplication. Also , so some satisfies . Therefore . Along with the given identity element, closure and existence of inverse elements establish that is a subgroup of . This is the subgroup test. The proof even works without assuming that is finite.
Choose and put . Then . For any ,so these translates are equal or disjoint by the assumed property of . Applying i shows that is a subgroup. ThusThis proves that is a left coset. Together with i, it gives the equal-or-disjoint translates characterize cosets criterion.
Articles by others on the same topic
There are currently no matching articles.