Skip to content
TheChatArchiveThe Chat Archive
ClaudeClaude Haiku 4.5· anthropicHugging Face Frontier Reasoning Traces

Prove Lagrange's theorem that subgroup order divides group order. Use left cosets to…

  1. 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.

  2. Claude Assistant

    This is a classic proof of Lagrange's theorem using left cosets. Let me structure this carefully and prove:

    1. Left cosets partition the group
    2. All left cosets have the same size as the subgroup
    3. 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:

    1. Define left cosets
    2. Show they partition G
    3. Show all cosets have size |H|
    4. Count elements to get the result

    Let me write this out properly.

    Lagrange's Theorem: Subgroup Order Divides Group Order

    Theorem: If HH is a subgroup of a finite group GG, then ∣H∣|H| divides ∣G∣|G|.

    Proof

    Step 1: Define Left Cosets

    For a subgroup HH of GG and element a∈Ga \in G, the left coset of HH containing aa is: aH={ah:h∈H}aH = \{ah : h \in H\}

    Step 2: Show Left Cosets Have Equal Size

    Claim: Every left coset aHaH has the same size as HH.

    Proof of Claim: Define a map ϕ:H→aH\phi: H \to aH by: ϕ(h)=ah\phi(h) = ah

    ϕ\phi is injective: If ah1=ah2ah_1 = ah_2, then h1=h2h_1 = h_2 (by left cancellation in groups). ✓

    ϕ\phi is surjective: By definition, every element of aHaH has the form ahah for some h∈Hh \in H. ✓

    Therefore ϕ\phi is a bijection, so: ∣aH∣=∣H∣|aH| = |H|

    The bijection is the key: This shows cosets are "copies" of HH, just translated by the group operation.

    Step 3: Show Left Cosets Partition G

    Claim: The distinct left cosets partition GG.

    Proof of Claim:

    1. Cosets cover G: Every g∈Gg \in G belongs to coset gHgH (since g=g⋅eg = g \cdot e where ee is the identity). ✓

    2. Cosets are disjoint: We show that if aH∩bH≠∅aH \cap bH \neq \emptyset, then aH=bHaH = bH.

      • Suppose ah=bh′ah = bh' for some h,h′∈Hh, h' \in H
      • Then b=ah(h′)−1b = ah(h')^{-1}
      • For any x∈Hx \in H: bx=ah(h′)−1x∈aHbx = ah(h')^{-1}x \in aH (since (h′)−1x∈H(h')^{-1}x \in H)
      • Thus bH⊆aHbH \subseteq aH
      • By symmetry, aH⊆bHaH \subseteq bH
      • Therefore aH=bHaH = bH ✓

    So the left cosets partition GG into disjoint sets.

    Step 4: Count Elements

    Let a1,a2,…,aka_1, a_2, \ldots, a_k be representatives of all distinct left cosets of HH in GG.

    Then: G=a1H∪a2H∪⋯∪akHG = a_1H \cup a_2H \cup \cdots \cup a_kH

    where the union is disjoint.

    Therefore: ∣G∣=∣a1H∣+∣a2H∣+⋯+∣akH∣|G| = |a_1H| + |a_2H| + \cdots + |a_kH|

    Since each coset has size ∣H∣|H|: ∣G∣=∣H∣+∣H∣+⋯+∣H∣⏟k times=k∣H∣|G| = \underbrace{|H| + |H| + \cdots + |H|}_{k \text{ times}} = k|H|

    where kk is the number of distinct left cosets. ✓

    Conclusion

    ∣H∣∣∣G∣|H| \mid |G|

    The number of distinct left cosets is called the index of HH in GG, denoted [G:H]=k[G:H] = k, giving us:

    ∣G∣=[G:H]⋅∣H∣\boxed{|G| = [G:H] \cdot |H|}


    Key Insight

    The bijection ϕ(h)=ah\phi(h) = ah between HH and each coset aHaH is the crucial step—it shows that every coset is "as big as" HH, and since cosets partition GG, the size of HH must divide the size of GG.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.