Prove Lagrange's theorem that subgroup order divides group order. Use left cosets to…
- User
Prove Lagrange's theorem that subgroup order divides group order. Use left cosets to show they partition the group with equal size by defining a bijection between the subgroup and any coset.
Assistant
This is a classic proof of Lagrange's theorem using left cosets. Let me structure this carefully and prove:
- Left cosets partition the group
- All left cosets have the same size as the subgroup
- Therefore, the order of the subgroup divides the order of the group
Let me write a clear, detailed proof.
Lagrange's Theorem: If G is a finite group and H is a subgroup of G, then |H| divides |G|.
Proof Structure:
- Define left cosets
- Show they partition G
- Show all cosets have size |H|
- Count elements to get the result
Let me write this out properly.
Lagrange's Theorem: Subgroup Order Divides Group Order
Theorem: If is a subgroup of a finite group , then divides .
Proof
Step 1: Define Left Cosets
For a subgroup of and element , the left coset of containing is:
Step 2: Show Left Cosets Have Equal Size
Claim: Every left coset has the same size as .
Proof of Claim: Define a map by:
is injective: If , then (by left cancellation in groups). ✓
is surjective: By definition, every element of has the form for some . ✓
Therefore is a bijection, so:
The bijection is the key: This shows cosets are "copies" of , just translated by the group operation.
Step 3: Show Left Cosets Partition G
Claim: The distinct left cosets partition .
Proof of Claim:
-
Cosets cover G: Every belongs to coset (since where is the identity). ✓
-
Cosets are disjoint: We show that if , then .
- Suppose for some
- Then
- For any : (since )
- Thus
- By symmetry,
- Therefore ✓
So the left cosets partition into disjoint sets.
Step 4: Count Elements
Let be representatives of all distinct left cosets of in .
Then:
where the union is disjoint.
Therefore:
Since each coset has size :
where is the number of distinct left cosets. ✓
Conclusion
The number of distinct left cosets is called the index of in , denoted , giving us:
Key Insight
The bijection between and each coset is the crucial step—it shows that every coset is "as big as" , and since cosets partition , the size of must divide the size of .
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.