The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008.

Slides:



Advertisements
Similar presentations
Knot Theory Senior Seminar by Tim Wylie December 3, 2002.
Advertisements

Algorithms and Data Structures for Low-Dimensional Topology
Main Menu Main Menu (Click on the topics below) Algebra of Combinations Pascal’s formula More Formulas Click on the picture Sanjay Jain, Lecturer, School.
Let Maths take you Further…
COUNTING AND PROBABILITY
Knot Theory By Aaron Wagner Several complex variables and analytic spaces for infinite-dimensional holomorphy -Knot Theory.
The Kauffman Bracket as an Evaluation of the Tutte Polynomial Whitney Sherman Saint Michael’s College.
To show that the Kauffman Bracket is unchanged under each of the three Reidemeister moves. First explain the basics of knot theory. Then show you what.
An Untangled Introduction to Knot Theory Ana Nora Evans University of Virginia Mathematics 12 February 2010.
Representing Relations Using Matrices
Chapter 9 – Network Theorems
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
Ty Callahan.  Lord Kelvin thought that atoms could be knots  Mathematicians create table of knots  Organization sparks knot theory.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
FUNCTIONS AND MODELS Chapter 1. Preparation for calculus :  The basic ideas concerning functions  Their graphs  Ways of transforming and combining.
Bichromatic and Equichromatic Lines in C 2 and R 2 George B Purdy Justin W Smith 1.
Chapter 11 Polynomial Functions
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Recognizing Strings in NP Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič Presentation by Robert Salazar.
CHAPTER 3 The Church-Turing Thesis
Copyright © Cengage Learning. All rights reserved. 3 Differentiation Rules.
Block Diagram fundamentals & reduction techniques
Dirichlet’s Theorem for Polynomial Rings Lior Bary-Soroker, School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel-Aviv University 1.
DEPARTMENT OF MATHEMATI CS [ YEAR OF ESTABLISHMENT – 1997 ] DEPARTMENT OF MATHEMATICS, CVRCE.
Survey of Mathematical Ideas Math 100 Chapter 1 John Rosson Tuesday January 23, 2007.
5  Systems of Linear Equations: ✦ An Introduction ✦ Unique Solutions ✦ Underdetermined and Overdetermined Systems  Matrices  Multiplication of Matrices.
Applied Discrete Mathematics Week 10: Equivalence Relations
Linear Equations and Functions
Sections 3.1 & 3.2  A collection of equations in the same variables.
1 The subtle relationship between Physics and Mathematics.
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
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.
Copyright © Cengage Learning. All rights reserved. 6 Inverse Functions.
V. Space Curves Types of curves Explicit Implicit Parametric.
Chapter 3 – Set Theory  .
CSE 311 Foundations of Computing I Lecture 8 Proofs and Set Theory Spring
Section 2-8 First Applications of Groebner Bases by Pablo Spivakovsky-Gonzalez We started this chapter with 4 problems: 1.Ideal Description Problem: Does.
By:Elliot Mee.  A knot in mathematics is a closed non-self- intersecting curve in three dimensions  Examples of knots:  Circle (unknot)  Trefoil.
Odd homology of tangles and cobordisms Krzysztof Putyra Jagiellonian University, Kraków XXVII Knots in Washington 10 th January 2009.
1 ENM 503 Block 1 Algebraic Systems Lesson 2 – The Algebra of Sets The Essence of Sets What are they?
Week 11 What is Probability? Quantification of uncertainty. Mathematical model for things that occur randomly. Random – not haphazard, don’t know what.
In section 11.9, we were able to find power series representations for a certain restricted class of functions. Here, we investigate more general problems.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Introduction Course Outline.
Planar Graphs Graph Coloring
Inductive Reasoning 1-2A What do you think are basic geometry figures?
Copyright © Cengage Learning. All rights reserved.
Computing & Information Sciences Kansas State University Lecture 31 of 42CIS 636/736: (Introduction to) Computer Graphics Lecture 32 of 42 Wednesday, 11.
Lesson 2 – 5 Postulates and Paragraph Proofs
Chapter 29 Symmetry and Counting. Consider the task of coloring the vertices of a regular hexagon so that three are black and three are white. There are.
Lots About Knots With a View Towards the Jones Polynomial Anne-Marie Oreskovich Math 495-B, Spring 2000.
The Miracle of Knot 1.Knot Theory 2.Tricolorability.
Basic probability Sep. 16, Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies.
Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison- Wesley Systems of Equations in Three Variables Identifying Solutions Solving Systems.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
A Computational Approach to Knotting in Complete Graphs Dana Rowland and David Toth Merrimack College, North Andover, MA Abstract We are interested in.
MAT 322: LINEAR ALGEBRA.
Discrete Mathematics Graph: Planar Graph Yuan Luo
Knot theory seminar.
Advanced Engineering Mathematics 6th Edition, Concise Edition
5 Systems of Linear Equations and Matrices
Mathematical problems in knot theory
MTH 392A Topics in Knot theory
Intercepts, Symmetry, Even/Odd and intersections
Component 1 – 2A, B, C Binary Logic
Characteristics of knots
Linking number Smallest number of crossing changes that make a link splittable Lk(K)=Tw(K)+Wr(K) Analogous to unknotting no. eqn used in DNA research…
A Survey of Knots and Links
1 FUNCTIONS AND MODELS.
Spin Models and Distance-Regular Graphs
Presentation transcript:

The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008

Outline Introduction –A Brief History of Knot Theory –What is a knot? –Knot Terminology Defining Knots Equivalence and Knot Invariants The Proof

A Brief History of Knot Theory Carl Friedrich Gauss (1777 – 1855) Lord Kelvin, atoms, and the “ether” P.G. Tait first to formally publish a paper on knots in 1877 –Enumerating and tabulating knots Early 20 th century classical knot theory becomes a formal branch of mathematics Knot theory now includes elements of algebra, combinatorics and geometry

What is and what is not a knot? The “string analogy” Any tame mathematical knot can be physically represented by the “string analogy”

What is and what is not a knot? Which of these two figures is a knot?

What is and what is not a knot? A knot!Not a knot! Which of these two figures is a knot?

Some Terminology A knot diagram is defined as a pictorial representation of a knot in R 2 Each diagram of a given knot K is defined as a projection of the knot K. Two projections of the same knot Two knot diagrams &

Some Terminology A crossing is defined as a point in the projection of a knot where the knot intersects or crosses-over itself.

Defining Knots Topological Definition A knot is an embedding of S 1 in R 3 or S 3. Simpler Definition A knot is a defined as a simple, closed curve in R 3 that is isotopic to a simple, closed polygonal curve with a finite vertex set.

Defining Knots Let K be a curve in R 3 and let f: I → R 3 be a continuous function such that f (I) = K. closed – f (0) = f (1) simple – if f (x) = f (y), then either x = y or x,y ε {0,1}

Defining Knots A simple, closed polygonal curve is defined as follows: Let (p 1,…,p n ) be an ordered set of points in R 3 such that no three points lie on a common line Let [p i, p j ] denote the line segment between points p i and p j

Defining Knots Two curves are said to be isotopic if one can be deformed to form the other in R 3 without breaking the curve at any point The simple, closed polygonal curve determined by (a,b,c) and a knot to which it is isotopic.

Equivalence and Invariants How do we know if two different knot diagrams represent different knots? Consider the two diagrams below, are these projections of the same knot? ?

Equivalence and Invariants How do we know if two different knot diagrams represent different knots? Consider the two diagrams below, are these projections of the same knot? √ YES!

Equivalence and Invariants Two projections are equivalent if you can deform one into the other without breaking the knot (“string analogy”) Planar isotopies –deformations that do not change the crossings of a projection

Equivalence and Invariants Reidemeister moves OR TYPE I TYPE II TYPE III

Equivalence and Invariants Alexander and Briggs Theorem If two knot projections are equivalent, then their diagrams are related by a series of Reidemeister moves A knot invariant is defined as a characteristic of a knot which is true for all of its projections Use knot invariants to determine whether two knots are not equivalent

The Proof Consider the three knots with the fewest crossings in their simplest projections –The unknot, O (0 crossings) –The trefoil knot, T (3 crossings) –The figure-eight knot, F (4 crossings) INTRODUCTION

The Proof Sketch of Proof First show T is not equivalent to O or F using the knot invariant Tricolorability Then show O and F are not equivalent using the knot invariant the Jones Polynomial O, T and F are mutually nonequivalent OUTLINE

The Proof A knot is tricolorable if the pieces of a projection that are not intersected in its diagram can be colored with exactly 3 different colors such that at each crossing in the knot is the meeting of either 3 different colors or the same color. Is the trefoil knot T tricolorable? TRICOLORABILITY

The Proof A knot is tricolorable if the pieces of a projection that are not intersected in its diagram can be colored with exactly 3 different colors such that at each crossing in the knot is the meeting of either 3 different colors or the same color. Is the trefoil knot T tricolorable? YES! TRICOLORABILITY

The Proof Is the unknot O tricolorable? NO! Is the figure-eight knot F tricolorable? NO! TRICOLORABILITY

The Proof Assign a Laurent polynomial to each knot If two projections have different polynomials, they are not equivalent J.W. Alexander [1928] - developed first knot polynomial using matrices & determinants John Conway [1969] - calculate the Alexander polynomial using skein relations Vaughn Jones [1984] developed a way to calculate the Alexander polynomial using the bracket polynomial and skein relations THE JONES POLYNOMIAL

The Proof The Jones polynomial of a knot K is defined as: where: –X(K) is the Jones polynomial of K – denotes the bracket polynomial of K –w(K) denotes the writhe of K –A is the variable of bracket polynomial and A = t -1/4 THE JONES POLYNOMIAL

The Proof There are three rules for computing the bracket polynomial of a knot K THE JONES POLYNOMIAL – THE BRACKET POLYNOMIAL

The Proof By Rule 1, = 1 Computing the bracket polynomial of F is more involved Take the projection of F and enumerate the crossings THE JONES POLYNOMIAL – BRACKET POLYNOMIAL

The Proof Consider crossing 1 By Rule 2, = A + A -1 where F V and F H are derivative knots created by changing crossing 1 from C to C V and C H respectively THE JONES POLYNOMIAL – THE BRACKET POLYNOMIAL

The Proof We must use Rule 2 again with crossing 2 in order to compute both and, giving us four derivative knots,,,, and with: By substituting into the formula for we get: THE JONES POLYNOMIAL – THE BRACKET POLYNOMIAL

The Proof Continue expansion with Rule 2 until all crossings have been eliminated THE JONES POLYNOMIAL – THE BRACKET POLYNOMIAL Clearly F VHHV is planar isotopic to the unknot and since = 1 by Rule 1, = 1

The Proof Now Rules 1 and 3 can be used to compute the values of the resulting 16 derivative knots and have in terms of A After lots of drawing and simplification we ultimately get: THE JONES POLYNOMIAL – THE BRACKET POLYNOMIAL

The Proof The writhe of F, w(F), is computed as follows: THE JONES POLYNOMIAL – WRITHE

The Proof The writhe of F, w(F), is computed as follows: –Give F an orientation THE JONES POLYNOMIAL – WRITHE

The Proof The writhe of F, w(F), is computed as follows: –Give F an orientation –Assign +1 or -1 to the crossings according to its type + 1 crossing– 1 crossing THE JONES POLYNOMIAL – WRITHE

The Proof The writhe of F, w(F), is computed as follows: –Give F an orientation –Assign +1 or -1 to the crossings according to its type –Sum the assignments over all crossings THE JONES POLYNOMIAL – WRITHE

The Proof Substitute the bracket polynomial and writhe of F and O into the original equation and replace A with t -1/4 Clearly X(F) ≠ X(O) THE JONES POLYNOMIAL – COMBINING THE TWO

The Proof CONCLUSION T is not equivalent to O and T is not equivalent to F because T is tricolorable and O and F are not O and F are not equivalent because their Jones polynomials are different Thus O, T and F are mutually nonequivalent □

Thank You I’d like to thank my advisors, Professor Ramin Naimi and Professor Ron Buckmire, and the Occidental Mathematics Department for all their help and support over the last four years. T hank you for coming!

References Adams, Colin C., The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots, (New York, NY: W.H. Freeman and Company, 1994) Kauffman, Louis H., On Knots, (Princeton, NJ: Princeton University Press, 1987) Livingston, Charles, Knot Theory, (Washington, D.C.: Mathematical Association of America, 1993)