Jones Polynomial

Jones Polynomial

Introduction

…

Definition 0.1

.

An

N

-

component

link is the image of a

C

∞

embedding

f

:

S

1

×

…

×

S

1

⏟

N

⁢

times

→

ℝ

3

. If

N

=

1

, we call the link a

knot

.

Using links and knots as embeddings is not very convenient, as visualising the bends and curves in

ℝ

3

is very hard. Therefore, we use the notion of a

knot diagram

.

Definition 0.2

.

Given a knot

K

, a knot projection

π

:

ℝ

3

→

ℝ

2

is a linear surjective map that

satisfies

:

1.

π

2

=

π

2.

card

⁢

{

π

-

1

⁢

(

x

)

}

≤

2

,

∀

x

∈

π

⁢

(

K

)

3.

There is a finite number of points in

K

for which

card

⁢

{

π

-

1

⁢

(

x

)

}

=

2

.

A

knot diagram

is the image of a projection of a knot.

Note that there is no

universal

definition of a knot, but this one is the one we use here. Specifically, this definition is used to rule out singular knots, whose projection has an

infinite

number of crossings.

In this way, we have the set

D

of all possible knot diagrams. Here, again one would like to study properties of truly distinct knot diagrams, so naturally we study

D

/

∼

′

, where

∼

′

now represents an

equivalence relation

on

D

, consisting of 2-dimensional

ambient isotopies

and the

Reidemeister moves

.

Necessary is:

Definition 0.3

.

The

writhe (or Tait number)

w

⁢

(

L

)

is the sum of

all

crossing numbers

of a given projection,

w

⁢

(

L

)

=

∑

i

sign

⁢

(

c

i

)

.

Knot invariants

Definition 0.4

.

Given a link projection

D

, let

y

be a crossing, and

y

^

,

y

^

′

be that crossing opened vertically and horizontally. Then there exists a polynomial

P

L

⁢

(

ξ

,

η

,

ψ

)

that satisfies:

1.

P

unknot

=

1

2.

P

y

=

ξ

⁢

P

y

^

+

η

⁢

P

y

^

′

3.

P

L

∪

unknot

=

ψ

⁢

P

L

where

ξ

,

η

,

ψ

∈

ℝ

. This

P

L

is called the

bracket

, also denoted by

[

.

.

]

.

An important remark here is that this definition of the polynomial is through a

recursion

on the number of crossings of a

link diagram

. This means that we can construct the polynomial by performing as many recursions as there are crossings and so this polynomial is well defined, because there are only a finite number of crossings in our knots.

Corollary 0.1

.

From this also follows that

P

L

1

∪

L

2

=

ψ

⁢

P

L

1

⁢

P

L

2

Example 0.1

.

For the

Hopf link

, we see that the

bracket polynomial

[

Hopf

]

=

η

⁢

ξ

+

ξ

2

⁢

ψ

+

η

⁢

ξ

+

η

2

⁢

ψ

.

Conjecture 0.1

.

P

^

L

=

α

⁢

P

L

,

α

∈

ℝ

, is a knot invariant for a suitable chosen

α

.

This is not true (reason will be added, just check the Reidemeister moves), but this is:

Proposition 0.2

.

P

^

L

⁢

(

ξ

)

:=

(

-

ξ

-

3

)

w

⁢

(

L

)

⁢

P

L

⁢

(

ξ

,

ξ

-

1

,

-

ξ

2

-

ξ

-

2

)

is a knot invariant.

Proof.

Since

w

⁢

(

L

)

and

P

L

are

invariant

under

Ω

2

,

Ω

3

,

P

^

L

⁢

(

ξ

)

naturally is invariant under those moves too. Under

Ω

1

, a positive crossing attains an extra term

-

ξ

3

which is compensated by the extra

-

ξ

-

3

of the prefactor, since

Ω

1

changes the writhe by +1. For a negative crossing, the result is analogous. Therefore,

P

^

L

⁢

(

ξ

)

is invariant under

Ω

1

also. Finally, because all projections of a link can be obtained through a finite number of Reidemeister moves,

P

^

L

⁢

(

ξ

)

is a knot invariant.
∎

Now the

Jones polynomial

, first conceived by

Vaughan Jones

in 1984, is exactly

J

L

⁢

(

t

)

:=

P

^

L

⁢

(

t

-

1

4

)

.

Example 0.2

.

For the Hopf link,

w

⁢

(

L

)

=

2

and

P

Hopf

=

ξ

2

⁢

(

-

ξ

2

-

ξ

-

2

)

+

1

+

1

+

ξ

-

2

⁢

(

-

ξ

2

-

ξ

-

2

)

=

-

ξ

4

-

ξ

-

4

. Therefore,

J

Hopf

⁢

(

t

)

=

(

-

(

t

-

1

4

)

-

3

)

2

⁢

(

(

-

(

t

-

1

4

)

4

)

-

(

t

-

1

4

)

-

4

)

=

-

(

t

1

2

+

t

5

2

)

Having defined the Jones polynomial, this allows us once again to classify knots. Notice that the Jones polynomial allows the powers of

t

to be negative. Each knot has a Jones polynomial associated to it and it has been shown that the Jones polynomial distinguishes between more knots than simple knot invariants, such as tricolorability. In this sense, the Jones polynomial is a better invariant to determine nonequivalency between two knots. Although it is known that there are pairs of knots that have the same Jones polynomial, the question whether or not there exists a nontrivial knot which has Jones polynomial 1 (same as the unknot), but is not

equivalent

to the unknot, has still not been answered. Above all, it should be clear that the Jones polynomial still does not suffice to distinguish all possible knots.

Title

Jones Polynomial

Canonical name

JonesPolynomial

Date of creation

2013-03-22 18:51:58

Last modified on

2013-03-22 18:51:58

Owner

Stephaninos (23208)

Last modified by

Stephaninos (23208)

Numerical id

17

Author

Stephaninos (23208)

Entry type

Topic

Classification

msc 57M25

Related topic

KnotTheory

Generated on Sat Feb 10 11:47:33 2018 by

LaTeXML