Scribd Logo
Upload

Welcome to Scribd!

  • Math 4340-Lecture 3

    Uploaded by

    Sean Li
    142 views1 page
    The document summarizes key concepts about permutation groups: 1) The permutation group on a set S, denoted P(S), is the set of all bijective maps from S to S under function composition. 2) P(S) forms a group because function composition is associative, the identity function serves as the identity, and each function has an inverse. 3) Permutations can be written as a product of disjoint cycles, where disjoint cycles permute with each other.

    Original Description:

    Notes from lecture. Cornell University, Spring 2013.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes key concepts about permutation groups: 1) The permutation group on a set S, denoted P(S), is the set of all bijective maps from S to S under function composition. 2) P(S) forms a group because function composition is associative, the identity function serves as the identity, and each function has an inverse. 3) Permutations can be written as a product of disjoint cycles, where disjoint cycles permute with each other.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    142 views1 page

    Math 4340-Lecture 3

    Uploaded by

    Sean Li
    The document summarizes key concepts about permutation groups: 1) The permutation group on a set S, denoted P(S), is the set of all bijective maps from S to S under function composition. 2) P(S) forms a group because function composition is associative, the identity function serves as the identity, and each function has an inverse. 3) Permutations can be written as a product of disjoint cycles, where disjoint cycles permute with each other.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Sean Li Math 4340 Notes Spring 2013 Abstract Algebra Lecture 3 1/25/13 Oce Hours.

    s. MWF 10:45 - 11:15, Malott 505. Homework. Due next Friday in class. Found at www.math.cornell.edu/~sen. TA. Christine McMeekin. Permutation Groups. Let S be any set. Then the permutation group on S, denoted by P(S), is dened as the set of 1-1 maps of S onto S, i.e. the set of automorphisms of S, with multiplication given by the composition of functions. Why is this a group? Associativity follows from associativity of composition. Identity follows from the identity function. Inverse follows from the fact that each function is bijective and thus has an inverse. Note on Inverses. Let f : S T be a bijection. Then f 1 (t) = s where f (s) = t. Then f 1 f = IS and f f 1 = IT . If S = T then they are the same. Notation. We write a permutation on n elements as ((1), . . . , (n)). For example, let = (1, 3, 2, 5, 4) and = (4, 2, 5, 1, 3). Then = (1, 3, 2, 5, 4)(4, 2, 5, 1, 3) = (5, 3, 4, 1, 2). Cycle Notation. Consider = (1, 3, 2, 5, 4). We write this in cycle notation as (1)(23)(45). Note (12345) is not the identity, and it satises (12345) = (23451). Every permutation is a product of disjoint cycles. Disjoint cycles permute with each other. Uniqueness up to permuting cycles and cyclic ordering.

    You might also like