Khovanov homology is an invariant for oriented links which was introduced by Mikhail Khovanov in 2000 as a categorification of the Jones polynomial [1] .

Khovanov assigned a bigraded chain complex to the oriented link diagram L whose differential was graded of bidegree and whose homotopy type depended only on the isotopy class of L. The bigraded homology group of the chain complex provides an invariant of oriented links, now known as Khovanov homology.

Although Khovanov’s construction is combinatorial from which Khovanov homology is algorithmically computable, we shall follow rather a simple way of Bar-Natan’s, which he introduced in [2] to compute the Khovanov homology.

A link in is a finite collection of disjoint circles smoothly embedded in. These circles are called the components of the link. If an orientation of the components is specified, we say that the link is oriented. A link consisting of only one component is called a knot.

Links are usually studied via projecting them on the plane. A projection with information of over- and under- crossing is called a link diagram. Some link diagrams are given in Figure 1.

Two links are called isotopic (or equivalent) if one of them can be transformed to another by a diffeomorphism of the ambient space onto itself. Two isotopic knots are given in Figure 2.

Remark 1. By a link we shall mean a diagram of its isotopy class.

Reidemeister gave in [3] a fundamental result about the equivalence of two links: Two Links are equivalent if and only if one can be transformed into the other by a finite sequence of ambient isotopies of the plane and the local Reidemeister moves given in Figure 3.

To classify links one needs a link invariant [4] , a functions I: Links ® {numbers or polynomials or colours, etc.} that gives one value for all links in an isotopy class of links and gives different values, but not always, for different classes of links. To check whether a function is a link invariant one has to show that it is invariant under all the Reidemeister moves. This paper is concerned with the link invariants: the Khovanov homology and the Jones polynomial.

An n-strand braid is a set of n non-intersecting smooth paths connecting n points on a horizontal plane to n points exactly below them on another horizontal plane in an arbitrary order [5] . The smooth paths are called strands of the braid. A 2-strand braid is given in Figure 4.

The product ab of two n-strand braids is defined by putting the braid a above the braid b and then gluing their common end points. A braid with only one crossing is called elementary braid. The ith elementary braid x_i on n strands is given in Figure 5.

A useful property of elementary braids is that every braid can be written as a product of elementary braids. For instance, the above 2-strand braid is.

The closure of a braid b is the link obtained by connecting the lower ends of b with the corresponding upper ends, as you can see in Figure 6. An important result by Alexander connecting knots and braids is:

Theorem 1. [6] Each link can be represented as the closure of a braid.

In 1985 V. F. R. Jones revolutionized knot theory by defining the Jones polynomial as a knot invariant via Von Neumann algebras [7] . However, in 1987 L. H. Kauffman introduced a state-sum model construction of the Jones polynomial that was purely combinatorial and remarkably simple [8] .

A Kauffman state s of a link L is obtained by replacing each crossing () of L with the 0-smoothing or the 1-smoothing (so that the result is a disjoint union of circles embedded in the plane). We denote by the set of all Kauffman states of L. A smoothing of trefoil knot is given in Figure 7.

Let s be a state in, the number of circles in the state, and and the numbers of crossings in states 0 and 1. Then the Kauffman bracket for L is defined by the relation

It is well known that the Kauffman bracket satisfies the relations:

This bracket is not invariant under the first Reidemeister move [9] , see, for instance, [4] . To overcome this difficulty, one needs something more: Let us consider that the link diagram L is now oriented. Then each crossing appears either as , which is called the positive crossing or as , which is called the negative crossing. If we denote the number of positive crossings by and the number of negative crossings by, then the unnormalized Jones polynomial is defined by the relation

and its normalized version by the relation

Since this polynomial is invariant under all three Reidemeister moves, it is an invariant for oriented links.

Example 1. It is easy to check that the normalized Jones polynomial of the link: is

Definition 1. A graded vector space W is a decomposition of W into a direct sum of the form

where each is a homogeneous component with degree m of the graded vector space W.

Definition 2. Let V and W be two homogeneous components of graded vector spaces. The degree of the tensor product is the sum of the degrees of V and W.

Definition 3. Let be a graded vector space with homogeneous components. The graded dimension of W is the power series

Definition 4. The degree shift of a graded vector space is defined by, so that.

Definition 5. Bar-Natan discovered in [2] that Khovanov’s idea was to replace the Kauffman bracket what he called the Khovanov bracket, which is a chain complexample of graded vector spaces whose graded Euler characteristic is. Likewise the Kauffman bracket, the Khovanov bracket is defined by the axioms:

and

toremovenumbering (beforeeachequation)

Here V is a graded vector space with graded dimension.

Definition 6. The chain complexample of graded vector spaces (where the grading r is the “height” of a piece of that complexample) is defined as:

The height shift operation on the chain complexample is defined: if, then

Definition 7. The graded Euler characteristics of a chain complexample is defined to be the alternating sum of the graded dimensions of its homology groups, i.e.

Theorem 2. [2] If the degree of the differential is zero and if all the chain groups are finite dimensional, is also equal to the alternating sum of the graded dimensions of the chain groups, i.e.

Theorem 3. [2] The graded Euler characteristic of is equal to the unnormalized Jones polynomial of L, i.e.

Now we give the graded Euler characteristic of. First, some terminology: By the symbols L, , n, , and we shall mean the oriented link diagram, the set of crossings in L, the number of crossings in L, the number of positive crossings and the number of negative crossings in L, respectively. Let V be the graded vector space with two basis elements whose degrees are respectively, so that. With every vertexample of the cube we associate the graded vector space, where k is the number of cycles in the smoothing of L corresponding to and r is the height of. We then set the rth chain group (for) to be the direct sum of all the vector spaces at height .

Before computing the Khovanov homology, we define two gradings, the homological grading and the quantum grading. The homological grading of the chain complexample is defined as where and is the number of 1-smoothings in the coordinates of V. In case of chain complexample, the quantum grading of the chain groups is and is in case of co-chain complexample. Now onward we shall use the notation for the Khovanov homology, where the first inexample r indicates the homological grading and the second indexample q indicates the quantum grading. We need these gradings to compute the Jones polynomial from the Khovanov homology.

Example 2. Here is the Khovanov homology of: .

1) The n-cube: The 3-cube of the trefoil knot is given in Figure 8.

2) Khovanov Bracket: The Khovanov brackets along with their q-dimensions are given in Table 1.

3) Unnormalized Jones polynomial: The graded Euler characteristic of is

4) Khovanov Homology: In order to compute the Khovanov homology of, we multiply the unnormalized Jones polynomial with the factor, where in our case is

The Khovanov Homology of the link is presented in Table 2.

Remark 2. is actually the unnormalized Jones polynomial of.

This section contains the chain complex, Khovanov bracket, graded Euler characteristic, and Khovanov homology of the braid link.

Proposition 4. The chain complex of the link is

Proof. We proof it by induction on n, using the trick that instead of “®”, we use “+” and that instead of, we use 1 just for first term in the expansion of.

The expansion holds obviously for n = 1, that is

Now, suppose that the result holds for n = k, that is

For n = k + 1, we have

Now, replacing 1 by and “®” by “+”, we receive the desired result.

Theorem 5. The graded Euler characteristic of is

Proof. The proof is simple; just by following the definition. □

Proposition 6. The unnormalized Jones polynomial of is

and the normalized is

Proof. Since the unnormalized Jones polynomial is the alternative sum of Khovanov brackets, we have

Now after cancelation of terms, which behave differently for even and odd n, we receive the desired result.

For instance, see the cases for n = 5, 6:

Theorem 7. (Main theorem) a) If n is even, then

b) If n is odd, then

c) If then

Proof. We prove it using the relation

and establishing a table with the help of the quantum and homological gradings. The homological grading r appears in a row and quantum grading q appears in a column. The homological gradings receive alternating signs, starting positive sign from 0; a term with negative sign appears at an odd r, while the positive sign appears at an even r. The powers of q in the relation represent the quantum grading. Corresponding to each term in the relation, a space appears in the table at the position.

a) In case of even number of crossings we receive a 2-component link; hence, at n^th homological grading, two spaces appear, one at quantum grading 3n and one at quantum grading. Please see Table 3 for the homology of, where n is even.

b) However, in odd number of crossing we always receive a knot; this confirms that at highest homological grading there exists a space against the quantum grading 3n^th. Moreover, at quantum grading one space should appear with positive coefficient in the Equation (4). Thus, a space actually appears at the position. The homology of, where n is odd, is given in Table 4.

c) Since at height 0 we receive the space, at 0^th homological level there exist two spaces, one at and one at n^th quantum gradings. This completes the proof. □

Now we give the graded Euler characteristic of the 3-strand braid (n factors); this sequence contains the powers of Garside element:. We will use Table 5, where X is the canonical form of (i.e. the smallest word in the length-lexicographic order with) and Y is a conjugate of X, suitable for computations. The number of factors in each of the six Y is.

Theorem 8.

1)

2)

3)

4)

5)

6)

Proof. (4) Since there are 6k + 3 crossings in the link, there are vertices in the smoothing cube. The Khovanov brackets along with their q-dimensions are given in Table 6.

The result now follows using the definition and simplifying the expression.

See, for example, the case for k = 1. The figure on the right represent the link of the reduced form of Δ³,

which is. .

For Khovanov brackets and q-dimensions for smoothings of (see Table 7). We ultimately receive. The homology of is presented in Table 8.

The proofs of other parts are similar to the proof of Part 4. □

Abdul Rauf Nizami,Mobeen Munir,Tanweer Sohail,Ammara Usman, (2016) On the Khovanov Homology of 2- and 3-Strand Braid Links. Advances in Pure Mathematics,06,481-491. doi: 10.4236/apm.2016.66034