Group Theory and Rubik’s Cube Hayley Poole. “What was lacking in the usual approach, even at its best was any sense of genuine enquiry, or any stimulus.

Slides:



Advertisements
Similar presentations
Review from this Lesson
Advertisements

Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Tangrams: making shapes
THE MATHEMATICS OF RUBIK’S CUBES Sean Rogers. Possibilities 43,252,003,274,489,856,000 possible states Depends on properties of each face That’s a lot!!
Binary Operations Let S be any given set. A binary operation  on S is a correspondence that associates with each ordered pair (a, b) of elements of S.
Mathematics of Cryptography Part II: Algebraic Structures
Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
Copyright © Cengage Learning. All rights reserved.
Instructor: Hayk Melikya
Part 2.4: Rules that Govern Symmetry 1. Define Group Theory The Rules for Groups Combination Tables Additional Rules/Definitions – Subgroups – Representations.
Symmetries in Nuclei, Tokyo, 2008 Scale invariance Object of which a detail when enlarged becomes (approximately) identical to the object itself. Condition.
Math 344 Winter 07 Group Theory Part 3: Quotient Groups
Math 3121 Abstract Algebra I
Groups TS.Nguyễn Viết Đông.
“The object is a wonderful example of rigourous beauty, the big wealth of natural laws: it is a perfect example of the human mind possibilities to test.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
MULTIPLE INTEGRALS Double Integrals over General Regions MULTIPLE INTEGRALS In this section, we will learn: How to use double integrals to.
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
The Mathematics of the Rubik’s Cube Dr Pamela Docherty School of Mathematics University of Edinburgh.
MATH10001 Project 2 Groups part 1 ugstudies/units/ /level1/MATH10001/
PH0101 UNIT 4 LECTURE 3 CRYSTAL SYMMETRY CENTRE OF SYMMETRY
Scott Vaughen, Professor of Mathematics
Rubik's Cube ‘’Magic cube’’ The Rubik’s Cube is a 3-D mechanical puzzle Originally called the “Magic Cube”
 Created in 1974 by a Professor of architecture named Erno Rubik  This was suppose to be an object that was not possible. It consists of 26 cubes 
By Mariah Sakaeda and Alex Jeppson
Symmetry operation motion of molecule which leaves it indistinguishable from before. Symmetry element plane, line (axis) or point (centre) about which.
Mathematical Modeling
Prelude to Public-Key Cryptography Rocky K. C. Chang, February
Solving ‘Rubik’s Polyhedra’ Using Three-Cycles Jerzy Wieczorek Franklin W. Olin College of Engineering Assisted by Dr. Sarah Spence Wellesley MAA Conference,
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Probability Notes Math 309. Sample spaces, events, axioms Math 309 Chapter 1.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
17. Group Theory 1.Introduction to Group Theory 2.Representation of Groups 3.Symmetry & Physics 4.Discrete Groups 5.Direct Products 6.Symmetric Groups.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas in Computer Science for Some.
The Rubik's Cube From the history to the play. Table of Contents - Outline History - Invention - Inventor Ascent To Glory The Rubik's Cube - 3x3x3 - Other.
An introduction of a Gadget Rubik’s Cube. Introduction of Rubik’s Cube The Rubik’s Cube is a 3-D mechanical puzzle Originally called the “Magic Cube”
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
1 Cube Transformations & Modifcations By Ton Dennenbroek
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 13 Mathematical Systems.
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas In Computer Science Anupam GuptaCS Fall 2006 Lecture 15Oct 17, 2006Carnegie Mellon University Algebraic Structures: Groups,
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Computer Graphics Matrices
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
Great Theoretical Ideas in Computer Science.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Chapter 7 Algebraic Structures
Jordan Abbatiello, Adam Corbett and Shanade Beharry.
Two views Here are two views of the same shape made up of coloured cubes. How many cubes are there in the shape? What’s the minimum number? Maximum number?
Great Theoretical Ideas in Computer Science
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Instructor: Shengyu Zhang
Cryptography Lecture 21.
Great Theoretical Ideas in Computer Science
Great Theoretical Ideas in Computer Science
Algebraic Structures: Group Theory
Cryptography Lecture 17.
Cryptography Lecture 19.
Presentation transcript:

Group Theory and Rubik’s Cube Hayley Poole

“What was lacking in the usual approach, even at its best was any sense of genuine enquiry, or any stimulus to curiosity, or an appeal to the imagination. There was little feeling that one can puzzle out an approach to fresh problems without having to be given detailed instructions.” From “Mathematical Puzzling” by A Gardiner - Aspects of Secondary Education, HMSO, 1979

This presentation will cover… The history of the Rubik’s Cube The history of the Rubik’s Cube Introduction to group theory Introduction to group theory Ideas behind solving the cube Ideas behind solving the cube

Erno Rubik Born 13 th July 1944 in Born 13 th July 1944 in Budapest, Hungary He is an inventor, sculptor and Professor of Architecture. He is an inventor, sculptor and Professor of Architecture.

History of the Rubik’s Cube Invented in 1974 Invented in 1974 Originally called “Buvos Kocka” meaning “magic cube” Originally called “Buvos Kocka” meaning “magic cube” Rubik was intrigued by movements and transformations of shapes in space which lead to his creation of the cube. Rubik was intrigued by movements and transformations of shapes in space which lead to his creation of the cube. Took him 1 month to solve. Took him 1 month to solve. By Autumn of 1974 he had devised full solutions By Autumn of 1974 he had devised full solutions

History continued Applied for it to be patented in January 1975 Applied for it to be patented in January 1975 Cube launched in Hungary in 1977 Cube launched in Hungary in 1977 Launched worldwide in 1980 Launched worldwide in 1980 First world championship took place in 1982 in Budapest, winner solving it in seconds First world championship took place in 1982 in Budapest, winner solving it in seconds TV cartoon created about it in 1983 TV cartoon created about it in 1983

“Rubik, the amazing cube” Shown in America from Shown in America from About four children who discover that their Rubik's cube is alive (when the coloured squares on each of its sides are matched up), and has amazing powers. They befriend the cube, and they use its powers to solve mysteries. About four children who discover that their Rubik's cube is alive (when the coloured squares on each of its sides are matched up), and has amazing powers. They befriend the cube, and they use its powers to solve mysteries.

Number of possible orientations 8 corner cubes each having 3 possible orientations. 8 corner cubes each having 3 possible orientations. 12 edge pieces each having 2 orientations 12 edge pieces each having 2 orientations The centre pieces are fixed. The centre pieces are fixed. This will give rise to a maximum number of positions in the group being: This will give rise to a maximum number of positions in the group being: (8! x 3 8 ) x (12! X 2 12 ) = 519,024,039,293,878,272,000

Some positions in the cube occur from a result of another permutation. Some positions in the cube occur from a result of another permutation. Eg, in order to rotate one corner cube, another must also rotate. Hence, the number of positions is reduced. Eg, in order to rotate one corner cube, another must also rotate. Hence, the number of positions is reduced. This leaves This leaves (8!x3 7 )x(12!x210) = 43,252,003,274,489,856,000 or 4.3x10 19 (8!x3 7 )x(12!x210) = 43,252,003,274,489,856,000 or 4.3x10 19positions.

Other Cubes Pocket Cube: 2x2x2 Pocket Cube: 2x2x2 Rubik’s Revenge: 4x4x4 Rubik’s Revenge: 4x4x4 Professors Cube: 5x5x5 Professors Cube: 5x5x5 Pyraminx: tetrahedron Pyraminx: tetrahedron Megaminx: Dodecahrdron Megaminx: Dodecahrdron

How do we use maths to solve the cube? Every maths problem is a puzzle. Every maths problem is a puzzle. A puzzle is a game, toy or problem designed to test ingenuity or knowledge. A puzzle is a game, toy or problem designed to test ingenuity or knowledge. We use group theory in solving the Rubik’s cube. We use group theory in solving the Rubik’s cube.

Introduction to groups A Group is a set with a binary operation which obeys the following four axioms: A Group is a set with a binary operation which obeys the following four axioms: Closure Closure Associativity Associativity Identity Identity Inverse Inverse

Associativity – The order in which the operation is carried out doesn’t matter. For every g 1,g 2,g 3 Є G, we have g 1 º (g 2 º g 3 )=(g 1 º g 2 ) º g 3 Identity – There must exist an element e in the group such that for every g Є G, we have e º g = g º e = g Closure – If two elements are members of the group (G), then any combination of them must also be a member of the group. For every g 1,g 2 Є G, then g 1 º g 2 Є G Inverse – Every member of the group must have an inverse. For every g Є G, there is an element g -1 Є G such that g º g -1 = g -1 º g = e Groups

Propositions and Proofs The identity element of a group G is unique. The identity element of a group G is unique. The inverse of an element gЄG is unique. The inverse of an element gЄG is unique. If g,h,ЄG and g -1 is the inverse of g and h -1 is the inverse of h then (gh) -1 =h -1 g -1. If g,h,ЄG and g -1 is the inverse of g and h -1 is the inverse of h then (gh) -1 =h -1 g -1.

Basic Group Theory Consider the group {1,2,3,4} under multiplication modulo 5. Consider the group {1,2,3,4} under multiplication modulo 5. The identity is 1. The identity is 1. 2 and 3 generate the group with having order 4. 2 and 3 generate the group with having order 4. 4 has order 2 (4 2 =1). 4 has order 2 (4 2 =1). Elements 1 and 4 form a group by themselves, called a subgroup. Elements 1 and 4 form a group by themselves, called a subgroup. X5X5X5X

Points about Groups and subgroups The order of an element a is n if a n =e. The order of an element a is n if a n =e. All subgroups must contain the identity element. All subgroups must contain the identity element. The order of a subgroup is always a factor of the order of the group (Lagrange’s Theorem). The order of a subgroup is always a factor of the order of the group (Lagrange’s Theorem). The only element of order 1 is the identity. The only element of order 1 is the identity. Any element of order 2 is self inverse. Any element of order 2 is self inverse. A group of order n is cyclic iff it contains an element of order n. A group of order n is cyclic iff it contains an element of order n.

So what does this have to do with solving Rubik’s cube?

Does Rubik’s Cube form a group? Closure – yes, whatever moves are carried out we still have a cube. Closure – yes, whatever moves are carried out we still have a cube. Associativity – yes (FR)L=F(RL). Associativity – yes (FR)L=F(RL). Identity – yes, by doing nothing. Identity – yes, by doing nothing. Inverse – yes, by doing the moves backwards you get back to the identity, eg Inverse – yes, by doing the moves backwards you get back to the identity, eg (FRBL)(L -1 B -1 R -1 F -1 )=e Therefore we have a group. Therefore we have a group.

Up (U) Down (D) Right (R) Left (L) Back (B) Face (F)

The corner 3-cycle Consider FRF -1 LFR - 1F -1 L -1 Consider FRF -1 LFR - 1F -1 L -1 Three corner pieces out of place – Three corner pieces out of place – permuted cyclicly. Why does a long algorithm have such a simple effect? Why does a long algorithm have such a simple effect?

g and h are two operations g and h are two operations Denote [g,h]=ghg -1 h -1 - Commuter of g and h, as [g,h]=1 iff gh=hg. Denote [g,h]=ghg -1 h -1 - Commuter of g and h, as [g,h]=1 iff gh=hg. Proved easily: multiple [g.h] by hg on right: Proved easily: multiple [g.h] by hg on right: ghg -1 h -1 hg=hg ghg -1 h -1 hg=hg ghg -1 g=hg ghg -1 g=hg gh=hg gh=hg g and h commute if gh=hg. The equation [g,h]=1 says that the commuter is trivial iff g and h commute with each other. g and h commute if gh=hg. The equation [g,h]=1 says that the commuter is trivial iff g and h commute with each other.

g is an operation on the cube, the support of g denoted supp(g) is the set of pieces which are changed by g. Similarly for h. g is an operation on the cube, the support of g denoted supp(g) is the set of pieces which are changed by g. Similarly for h. If g and h have disjoint support, ie no overlap then they commute. If g and h have disjoint support, ie no overlap then they commute. Consider the R and L movement of the cube. The support of R consists of the 9 cubes on the right and the support of L consists of the 9 cubes on the left. Moving R doesn’t affect L. Consider the R and L movement of the cube. The support of R consists of the 9 cubes on the right and the support of L consists of the 9 cubes on the left. Moving R doesn’t affect L. Therefore LR=RL Therefore LR=RL

Now if g and h are two operations whose supports have only a small amount of overlap, then g and h will almost commute. Now if g and h are two operations whose supports have only a small amount of overlap, then g and h will almost commute. This means [g,h] will be an operation affecting only a small number of pieces. This means [g,h] will be an operation affecting only a small number of pieces. Going back to the initial sequence of moves: Going back to the initial sequence of moves: FRF -1 LFR - 1F -1 L -1, let g=FRF -1

h=L only affects the 9 pieces on the left, and of these, the previous diagram shows that g=FRF -1 only affects a single piece. h=L only affects the 9 pieces on the left, and of these, the previous diagram shows that g=FRF -1 only affects a single piece. Since there is little overlap between the supports of g and h, these operations will almost commute so their commuter is almost trivial. Since there is little overlap between the supports of g and h, these operations will almost commute so their commuter is almost trivial.

Therefore, [g,h]=FRF -1 LFR - 1F -1 L -1 should only affect a small number of pieces, in fact it affects 3. Therefore, [g,h]=FRF -1 LFR - 1F -1 L -1 should only affect a small number of pieces, in fact it affects 3.

Brief Application to school level describing properties of shapes describing properties of shapes nets and how 3D shapes are made nets and how 3D shapes are made Rotation and symmetry Rotation and symmetry Area and volume Area and volume

Conclusions Group Theory is a very versatile area of mathematics. Group Theory is a very versatile area of mathematics. It is not only used in maths but also in chemistry to describe symmetry of molecules. It is not only used in maths but also in chemistry to describe symmetry of molecules. The theory involved in solving the rubik’s cube is very complicated. The theory involved in solving the rubik’s cube is very complicated.