Permutation groups and representation theory BEN HYMAN.

Slides:



Advertisements
Similar presentations
Group Theory II.
Advertisements

Quantum One: Lecture 9. Graham Schmidt Orthogonalization.
Part 2.4: Rules that Govern Symmetry 1. Define Group Theory The Rules for Groups Combination Tables Additional Rules/Definitions – Subgroups – Representations.
Lecture 5.
CHEM 515 Spectroscopy Lecture # 10 Matrix Representation of Symmetry Groups.
Weak Formulation ( variational formulation)
Lecture 3.
Math 103 Contemporary Math Tuesday, February 8, 2005.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Lecture 12 APPLICATIONS OF GROUP THEORY 1) Chirality
Review: Applications of Symmetry, cont.
Group theory 101 Suggested reading: Landau & Lifshits, Quantum Mechanics, Ch. 12 Tinkham, Group Theory and Quantum Mechanics Dresselhaus, Dresselhaus,
Week 5 - Wednesday.  What did we talk about last time?  Exam 1!
Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.
A vector space containing infinitely many vectors can be efficiently described by listing a set of vectors that SPAN the space. eg: describe the solutions.
9.6 Symmetry We are going to complete the tessellation first so get out your triangles.
Physical Chemistry 2 nd Edition Thomas Engel, Philip Reid Chapter 27 Molecular Symmetry.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
AN ORTHOGONAL PROJECTION
Chapter 9. Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and.
General Introduction to Symmetry in Crystallography A. Daoud-Aladine (ISIS)
17. Group Theory 1.Introduction to Group Theory 2.Representation of Groups 3.Symmetry & Physics 4.Discrete Groups 5.Direct Products 6.Symmetric Groups.
1 Chapter 3 – Subspaces of R n and Their Dimension Outline 3.1 Image and Kernel of a Linear Transformation 3.2 Subspaces of R n ; Bases and Linear Independence.
Symmetry Properties of Molecules
VECTORS (Ch. 12) Vectors in the plane Definition: A vector v in the Cartesian plane is an ordered pair of real numbers:  a,b . We write v =  a,b  and.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Affine Transformations.
Motivation: Wavelets are building blocks that can quickly decorrelate data 2. each signal written as (possibly infinite) sum 1. what type of data? 3. new.
Reflective Symmetry and Telling the Time Mental Learning Objective I can count in 2s, 5s and 10s and in fractions (½ or ¼ )
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
TRIANGLES SPI: Identify, define or describe geometric shapes given a visual representation or written description of its properties.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
A bc two other rotations Problem: Compute the other four permutations two other reflections Further discussion: there are 24 permutations of the set {a,b,c,d},
4.1 Introduction to Linear Spaces (a.k.a. Vector Spaces)
1/26/2015PHY 7r2 Spring Lecture 51 PHY 752 Solid State Physics 11-11:50 AM MWF Olin 107 Plan for Lecture 5: Reading: Chapter 7.3 in MPM; Brief.
SECTION 8 Groups of Permutations Definition A permutation of a set A is a function  ϕ : A  A that is both one to one and onto. If  and  are both permutations.
4.5: The Dimension of a Vector Space. Theorem 9 If a vector space V has a basis, then any set in V containing more than n vectors must be linearly dependent.
Coordinate Systems Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB.
4. Affine transformations. Reading Required:  Watt, Section 1.1. Further reading:  Foley, et al, Chapter  David F. Rogers and J. Alan Adams,
Set Builder Notation. If you recall, a set is a collection of objects which we write using brackets and name using a capital letter. Remember also that:
Ch. 3 Solving Linear Equations
Relations Chapter 9.
The Basic Concepts of Set Theory
Representation Theory
Copyright © Cengage Learning. All rights reserved.
3.4 Solving Systems of Linear Equations in Three Variables
Lecture 03: Linear Algebra
Quantum One.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Objective: Be able to add and subtract directed numbers.
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
The Basic Concepts of Set Theory
Review of topics in group theory
Chapter 2 The Basic Concepts of Set Theory
Quantum One.
DISCRETE COMPUTATIONAL STRUCTURES
Chapter 2 The Basic Concepts of Set Theory
Quantum Two.
I.4 Polyhedral Theory (NW)
Quantitative Reasoning
Chapter 2 The Basic Concepts of Set Theory
CALCULATE Use numbers given in the question to work out an answer. Always show working.
Linear Algebra Lecture 24.
ICOM 5016 – Introduction to Database Systems
Back to Cone Motivation: From the proof of Affine Minkowski, we can see that if we know generators of a polyhedral cone, they can be used to describe.
Coordinate Systems Prepared by Vince Zaccone
I.4 Polyhedral Theory.
Group theory 101 Suggested reading:
Objective: Be able to add and subtract directed numbers.
Presentation transcript:

Permutation groups and representation theory BEN HYMAN

The group S 3 Group: A set of things, and an operation on that set. For example, “(Integers, +)”, i.e. integers under addition, form a group. In S 3, our elements are permutations of three symbols. So, not the three symbols themselves, but the different ways you can permute those symbols. Example: (1 3)(2).

Group actions (on a space) There’s a lot to this that I’m eliding over … but we can think about this group acting on the Cartesian plane (R 2 ) in a very natural way.

“Symmetries of the equilateral triangle”

S 3 acting on another space Suppose we have a 3-dimensional space, with basis elements e 1 = (1, 0, 0), e 2 = (0, 1, 0), and e 3 = (0, 0, 1). The element (1 2) in S 3 can act on this by sending e 1 to e 2 and e 2 to e 1, and leaving e 3 alone. (1 2) (5e 1 – 3e 2 + e 3 ) = (-3e 1 + 5e 2 + e 3 )

Representation theory Can we describe these group actions in another fashion? That fashion should also preserve structure. Answer: (This is useful if we’re very comfortable with, and/or know a lot about, our alternative description. And that happens here.)

Trivial representation e(1 2)(1 3)(2 3)(1 2 3)(1 3 2) χ1χ1 [1]

S 3 acting on another space Suppose we have a 3-dimensional space, with basis elements e 1 = (1, 0, 0), e 2 = (0, 1, 0), and e 3 = (0, 0, 1). Note that every element in our space can be written as a linear combination of the basis elements. The element (1 2) in S3 can act on this by sending e 1 to e 2 and e 2 to e 1, and leaving e 3 alone. Associate with this (1 2) action a matrix that captures the behavior of (1 2).

“Symmetries of the equilateral triangle”

“Standard representation” e(1 2)(1 3)(2 3)(1 2 3)(1 3 2) χ3χ3

Further questions and explorations All this, for groups other than permutation groups. Finite and infinite. For a given group, can we figure out how many irreducible representations there are? Can we find the representations? What structure do the representations themselves have? (Characters.) What does the representation structure tell us about the original group structure? Irreducible representations.

Neat fact How many irreducible representations of S n are there? P(n), i.e. the partition number for n. (Remember box counting?)