KRISTEN MCGAHAN Knot Groups. Group: A closed algebraic structure that has a law of composition with three properties Associative- (ab)c=a(bc) for all.

Slides:



Advertisements
Similar presentations
BOOLEAN ALGEBRA. A Mathematical notation used to represent the function of the Digital circuit. A notation that allows variables & constants to have only.
Advertisements

Function f Function f-1 Ch. 9.4 Inverse Functions
CSNB143 – Discrete Structure
CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
Counting Chapter 6 With Question/Answer Animations.
Cayley Theorem Every group is isomorphic to a permutation group.
Chapter 4 Systems of Linear Equations; Matrices Section 6 Matrix Equations and Systems of Linear Equations.
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.
Ty Callahan.  Lord Kelvin thought that atoms could be knots  Mathematicians create table of knots  Organization sparks knot theory.
Permutations and Inverses. Definition Let A be a set. If f : A  A is a 1-1 correspondence then f is called a permutation of A. Notation: S(A): the set.
Is ℤ 6 a cyclic group? (a) Yes (b) No. How many generators are there of ℤ 6 ?
Matrix Operations. Matrix Notation Example Equality of Matrices.
Algebraic Properties: The Rules of Algebra Be Cool - Follow The Rules!
8.4 Matrix Operations Day 1 Thurs May 7 Do Now Solve X – 2y = -6 3x + 4y = 7.
259 Lecture 14 Elementary Matrix Theory. 2 Matrix Definition  A matrix is a rectangular array of elements (usually numbers) written in rows and columns.
Solving Quadratic Equations by FACTORING
Sets and Expressions Number Sets
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Rev.S08 MAC 1140 Module 10 System of Equations and Inequalities II.
Matrix Algebra. Quick Review Quick Review Solutions.
Matrix Representations of Knot and Link Groups Jess May 2006 Knot Theory Knot Theory is the study of mathematical knots. A knot is a simple closed polygonal.
Gems of Algebra: The secret life of the symmetric group
Chapter 5.7 Properties of Matrices. Basic Definitions It is necessary to use capital letters to name matrices. Also, subscript notation is often used.
1 C ollege A lgebra Systems and Matrices (Chapter5) 1.
Chapter 4 – Matrix CSNB 143 Discrete Mathematical Structures.
Identity and Equality Properties. Properties refer to rules that indicate a standard procedure or method to be followed. A proof is a demonstration of.
Honors Geometry Intro. to Deductive Reasoning. Reasoning based on observing patterns, as we did in the first section of Unit I, is called inductive reasoning.
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
Discrete Mathematical Structures 4 th Edition Kolman, Busby, Ross © 2000 by Prentice-Hall, Inc. ISBN
Section 1.4 Inverses; Rules of Matrix Arithmetic.
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.1 Algebraic Expressions, Mathematical.
2.3 Diagrams and 2.4 Algebraic Reasoning. You will hand this in P. 88, 23.
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
Chapter 2 … part1 Matrices Linear Algebra S 1. Ch2_2 2.1 Addition, Scalar Multiplication, and Multiplication of Matrices Definition A matrix is a rectangular.
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.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Multivariate Statistics Matrix Algebra I Exercises Alle proofs veranderen in show by example W. M. van der Veld University of Amsterdam.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Matrices and Determinants
Math 3121 Abstract Algebra I Lecture 14 Sections
4.4 Clock Arithmetic and Modular Systems. 12-hour Clock System  Based on an ordinary clock face  12 replaced with a zero  Minute hand is left off.
Matrices Presentation by : Miss Matkar Pallavi. P.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
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.
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Section 2.2 Day 1. A) Algebraic Properties of Equality Let a, b, and c be real numbers: 1) Addition Property – If a = b, then a + c = b + c Use them 2)
Chapter 7 Algebraic Structures
Elementary Matrix Theory
Dr. Ameria Eldosoky Discrete mathematics
Linear Algebraic Equations and Matrices
Relations Chapter 9.
Unit 2 Boolean Algebra.
Logic Gates and Boolean Algebra
Chapter Notes: Properties and Algebraic Proofs
PROGRAMME 4 DETERMINANTS.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Matrix Algebra.
Matrix Algebra.
Sec P.1 Cont Sec, P.1 cont..
PROGRAMME 4 DETERMINANTS.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Matrix Algebra.
Solving Linear Equations
2-3 Equations With Variables on Both Sides
2-1 Relations & Functions
Presentation transcript:

KRISTEN MCGAHAN Knot Groups

Group: A closed algebraic structure that has a law of composition with three properties Associative- (ab)c=a(bc) for all a,b,c in G Identity- G contains identity element I such that aI=Ia=a for all a in G Inverse- every element a in G has an inverse, another element b such that ab=I and ba=I and b is also in G

Symmetric Group Set of all permutations  Ex. The group S 3 the set of all permutations of the set (1,2,3)  = ( (), (1 2)(3), (1 3)(2), (2 3)(1), (1 2 3), (1 3 2)) Each permutation can be written in cyclic notation If f(1)=3, f(2)=1, f(3)=2  this permutation is written as (1 3 2) “A set of permutations is said to generate the symmetric group if every element in the group can be written as a product of elements from the set”

Labeling Knots Consistent- the labels of the arcs on the crossing are g, h, and k, then right hand crossings must satisfy gkg-1=h and left hand crossings ghg -1 =k Generate- labels we choose for each arc of the knot diagram must generate the group

Labeling trefoil knot with elements from S 3 (1 2) (2 3) (1 3)

Theorem: If a diagram for a knot can be labeled with elements from a group G, then any diagram of the knot can be so labeled with elements from that group, regardless of the choice of orientation.

Proof of Theorem using Reidemeister Moves x y y x x yxy -1

Proof cont. x y y x x yxy -1

LABELING FUNDAMENTAL GROUPS WIRTINGER PRESENTATION Group Presentations of the Trefoil Knot

Labeling Words- combination of variables and their inverses by examining each arc Equations- formed by setting the words equal to 1  give the defining relations of the group Trefoil knot

Fundamental Group The knot group is the fundamental group of the knot complement (R 3- K) The fundamental group is the set of the product of homotopy classes (loops that have the same base point and there is a path that maps one loop to the other) Each arc in a knot diagram can be mapped to a path in the fundamental group that goes around that specific arc

Wirtinger Presentation G(K)= (arc labels: cross relations) Start at a point near the crossing and move counterclockwise around a rectangle At each arc write down the variable if the arc is entering the crossing and the inverse of the variable if it is leaving the crossing This give us the defining relations Each relation corresponds to a loop off the knot (in the fundamental group) Trefoil knot

Conclusions- connections between fundamental group and algebra For each arc in a knot diagram there is an element in the fundamental group This element is represented by the loop that goes around the arc Therefore, there is a map between the labelings of a knot diagram and the fundamental group of the knot complement Knot groups are useful because they are considered invariants and therefore can distinguish between knots