Permuations, Lecture Notes - Mathematics - 1, Study notes of Mathematics

Permutation Definition

Typology: Study notes

2010/2011

Uploaded on 09/09/2011

andreasphd
andreasphd 🇬🇧

4.7

(28)

287 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Oxford University Mathematical Institute
Linear Algebra II for Mathematical Moderations
Lecture 1 (Tuesday 18 January 2011): Permutations
Note. These skeletal notes are intended as a sort of ‘handout’. They are
designed to be printed off to form a template for your personal notes. A full text
will be published after the first few lectures have taken place.
Definition. A permutation of a set Sis a bijective (one-to-one and onto)
map SS. The set of all permutations of Swill be denoted Sym(S) or Sym S.
Throughout these lectures the set Swill be finite, usually with nmembers. If
S={1,2, . . . , n}, or if it does not matter what set of size nis under consideration
we write Sym (n) instead of Sym(S) or SymS. Many authors use Snor Σn.
Cauchy’s two-line notation for permutations.
Notation: the image of xSunder the map ρ:SSwill be written .
Composition (multiplication) of permutations.
1
pf3
pf4

Partial preview of the text

Download Permuations, Lecture Notes - Mathematics - 1 and more Study notes Mathematics in PDF only on Docsity!

Oxford University Mathematical Institute

Linear Algebra II for Mathematical Moderations Lecture 1 (Tuesday 18 January 2011): Permutations

Note. These skeletal notes are intended as a sort of ‘handout’. They are designed to be printed off to form a template for your personal notes. A full text will be published after the first few lectures have taken place.

Definition. A permutation of a set S is a bijective (one-to-one and onto) map S → S. The set of all permutations of S will be denoted Sym(S) or SymS.

Throughout these lectures the set S will be finite, usually with n members. If S = { 1 , 2 ,... , n}, or if it does not matter what set of size n is under consideration we write Sym(n) instead of Sym(S) or SymS. Many authors use Sn or Σn.

Cauchy’s two-line notation for permutations.

Notation: the image of x ∈ S under the map ρ : S → S will be written xρ.

Composition (multiplication) of permutations.

Cycles of permutations.

Theorem. Let S be a finite set and let ρ ∈ SymS. Every member of S lies in one and only one cycle of ρ.

Proof to be given in later Mods lecture course An introduction to groups, rings and fields.

Cycle notation.

The cycle-type of a permutation ρ ∈ Sym(n) is a list of the number of m-cycles that occur in ρ for each m.

The fixed-point set and the support of a permutation

Theorem. For ρ ∈ Sym(n), if ρ = τ 1 τ 2 · · · τr = τ 1 ′τ 2 ′ · · · τ (^) s′ , where τ 1 , τ 2 ,

.. ., τr and τ 1 ′ , τ 2 ′ ,.. ., τ (^) s′ are transpositions, then r ≡ s (mod 2).

Proof.

Probable end of Lecture 1