Explore BrainMass
Share

Explore BrainMass

    Subgroup proof

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    If |G|=p^n, where p is a prime, show that G has subgroups G_0, G_1, . . ., G_n with 1= G_0 <= G_1 <= . . . <= G_n =G such that [G_i : G_{i-1}] = p, 1 <= i <= n.

    I need a rigorous, detailed proof of this to study please.

    © BrainMass Inc. brainmass.com October 9, 2019, 10:37 pm ad1c9bdddf
    https://brainmass.com/math/discrete-math/providing-subgroup-proof-226524

    Solution Preview

    Proof:
    We know that if |G| is divisible by p, then G has a subgroup of order p.
    Now |G| = p^n. Let G_n = G.
    Since |G| ...

    Solution Summary

    This provides an example of proving given subgroups.

    $2.19