Scribd Logo
Upload

Welcome to Scribd!

  • 281 views

    Orbits Cycles and Alternating Groups

    Uploaded by

    Sergio Año
    This document defines permutations, cycles, orbits, and products of disjoint cycles. It then discusses partitioning groups into cosets of subgroups. It defines left and right cosets and provides examples calculating cosets. It concludes by stating and proving Lagrange's theorem, which says the order of a subgroup divides the order of the group. Exercises are provided asking to find the number of subgroups of certain cyclic groups based on Lagrange's theorem.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Orbits Cycles and Alternating Groups

    Uploaded by

    Sergio Año
    281 views14 pages
    This document defines permutations, cycles, orbits, and products of disjoint cycles. It then discusses partitioning groups into cosets of subgroups. It defines left and right cosets and provides examples calculating cosets. It concludes by stating and proving Lagrange's theorem, which says the order of a subgroup divides the order of the group. Exercises are provided asking to find the number of subgroups of certain cyclic groups based on Lagrange's theorem.

    Original Title

    Orbits-Cycles-and-Alternating-Groups

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document defines permutations, cycles, orbits, and products of disjoint cycles. It then discusses partitioning groups into cosets of subgroups. It defines left and right cosets and provides examples calculating cosets. It concludes by stating and proving Lagrange's theorem, which says the order of a subgroup divides the order of the group. Exercises are provided asking to find the number of subgroups of certain cyclic groups based on Lagrange's theorem.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    281 views14 pages

    Orbits Cycles and Alternating Groups

    Uploaded by

    Sergio Año
    This document defines permutations, cycles, orbits, and products of disjoint cycles. It then discusses partitioning groups into cosets of subgroups. It defines left and right cosets and provides examples calculating cosets. It concludes by stating and proving Lagrange's theorem, which says the order of a subgroup divides the order of the group. Exercises are provided asking to find the number of subgroups of certain cyclic groups based on Lagrange's theorem.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 14

    Def. (Orbits of δ).

    Let δ be a permutation of a
    set A. The equivalence classes in A determined
    by the equivalence relation (1) are the orbits of
    δ.
    Example:
    Find the orbits of permutations
    δ=1 2 3 4 5 6 7 8
    3 8 6 7 4 1 5 2
    Def. (Cycle). A permutation δ ε Sn is a cycle if it
    has one orbit containing more than one
    element.
    example: working with S5
    1 2 3 4 5
    3 2 5 1 4
    =( 1, 3, 5, 4) = ( 3, 5, 4, 1)= (4,1,3,5)
    Using cyclic notation, we see that the
    permutation δ can be written as the
    product of cycles:
    δ=1 2 3 4 5 6 7 8
    3 8 6 7 4 1 5 2
    = ( 1, 3, 6 ) ( 2, 8 ) ( 4 , 7, 5 )
    This cycles are disjoint, meaning that the
    integers is moved by at most one of these
    cycles, thus no one number appears in
    the notations of two different cycles.
     Every permutation δ of a finite set is a
    product of disjoint cycle.
    While permutation in general is not
    commutative it is easily seen that
    multiplication of disjoint cycles is
    commutative.
    Example : 1 2 3 4 5 6
    6 5 2 4 3 1
     Find the orbits, express each of the ff.
    permutation as a product of disjoint cycles.
    a. 1 2 3 4 5 6
    5 1 3 6 2 4
    b. 1 2 3 4 5 6 7 8
    5 6 2 4 8 3 1 7
    c. 1 2 3 4 5 6 7 8
    2 3 5 1 4 6 8 7
    Cosets and Theorem of Lagrange

    Def. (Cosets). Let H be a subgroup of


    a group G .The subset
    aH = ( ah | hεH ) of G is the left
    coset of H containing a.
    While the subset
    Ha = ( ha | hεH ) is the right coset
    of H containing a.
    Example: Exhibit the left and right coset of the
    subgroup 3Z of Z.
    Solution: Our notation here is additive, so the
    left coset of 3Z containing m is m+3z, taking
    m=0.

    3z=( …-9,-6, -3, 0, 3, 6, 9,…)

    1 + 3z = (… -8,-5,-2,1, 4, 7,10)

    2 + 3z = ( …,-7,-4, -1, 2, 5, 8, 11)

    Since Z is abelian, the left coset m+3z and the


    right coset 3z + m are the same so the
    partition of Z into right cosets is the same.
    For a subgroup H of an abelian
    group G, the partition of G into the
    Left Cosets of H and the partition
    into right cosets are the same.
    Example: The group Z6 is abelian.
    Find the partition of Z6 into cosets
    of the subgroup H= ( 0, 3)
    Z6 0 3 1 4 2 5
    0 0 3 1 4 2 5
    3 3 0 4 1 5 2
    1 1 4 2 5 3 0
    4 4 1 5 2 0 3
    2 3 0 4 1
    2 5
    5 0 3 1 4
    5 2
    Example:
    For the symmetric group S3 on three
    letters. Let H be the subgroup (Po,μ1).
    Find the partition of S3 into left cosets
    of H, and the partition into right coset
    of H.
    S3 po μ1 p1 μ3 p2 μ2
    po
    po μ1 ρ1 μ3 p2 μ2
    μ1
    μ1 po μ2 p2 μ3 p1
    p1
    p1 μ3 p2 μ2 po μ1
    μ3
    μ3 p1 μ1 po μ2 p2
    p2
    p2 μ2 po μ1 p1 μ3
    m2
    μ2 p2 μ3 p1 μ1 po
    Workshop # 1
    S4 p0 p1 p2 p3 m1 m2 s1 s2
    p0 p0 p1 p2 p3 m1 m2 s1 s2
    p1 p1 p2 p3 p0 s1 s2 m 2 m1
    p2 p2 p3 p0 p1 m2 m1 s2 s1
    p3 p3 p0 p1 p2 s2 s1 m 1 m2
    m1 m1 s2 m2 s1 p0 p2 p3 p1
    m2 m2 s1 m1 s2 p2 p0 p1 p3
    s1 s1 m1 s2 m2 p1 p3 p0 p2
    LAGRANGE’S THEOREM
    Theorem: Let G be a finite group and let
    H be a subgroup of G. Then, the order of
    h divides the order of G.
    Proof: H induces a partition of G into n
    equivalence classes. Each equivalence
    class gH or Hg has the same number of
    elements as H. Therefore,
    Order(G) = n*order(H) and the theorem
    is proved.
    EXERCISES ON LAGRANGE’S THEOREM
    Consider Zn. We know that every
    divisor of n generates a subgroup of
    Zn. Find the number of subgroups
    of each of the following:
    a. z8 b. z12 c. z15 d. z24

    You might also like