The left cosets are finitely many pairwise disjoint blocks covering G, each with |H| elements, so counting the disjoint union gives |G| = [G:H]·|H|.
Routine facts about inclusions and disjoint classes are used without comment (Toolkit for AL1).
By Left Cosets Partition a Group and All Have the Same Cardinality (iv), is the quotient of by an equivalence relation, so the canonical projection is a surjective function from onto (Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection (vi)). Since is finite, is finite by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (vi); this is the first assertion of (i).
To count, index the left cosets by themselves: consider the family (Indexed Families of Sets and Their Union, Intersection and Product (i)), whose index set is finite. Its distinct members are disjoint by Left Cosets Partition a Group and All Have the Same Cardinality (i). The subgroup is finite by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iv), so each member is finite with by Left Cosets Partition a Group and All Have the Same Cardinality (iii). The union of the family (Indexed Families of Sets and Their Union, Intersection and Product (ii)) is : every lies in by Left Cosets Partition a Group and All Have the Same Cardinality (i), and every coset is a subset of . Therefore The Number of Elements of a Disjoint Finite Union (ii) gives
by The Order of a Finite Group (i) and Cosets and the Index of a Subgroup (iv). This completes (i).
Since , this identity exhibits as the integer multiple of with , so divides by Divisibility of Integers (i). This is (ii).
Loading…