Transverse Khovanov-Rozansky Homologies Hao Wu George Washington - - PowerPoint PPT Presentation

transverse khovanov rozansky homologies
SMART_READER_LITE
LIVE PREVIEW

Transverse Khovanov-Rozansky Homologies Hao Wu George Washington - - PowerPoint PPT Presentation

Transverse Khovanov-Rozansky Homologies Hao Wu George Washington University Transverse Links in the Standard Contact S 3 A contact structure on an oriented 3-manifold M is an oriented tangent plane distribution such that there is a 1-form on


slide-1
SLIDE 1

Transverse Khovanov-Rozansky Homologies

Hao Wu

George Washington University

slide-2
SLIDE 2

Transverse Links in the Standard Contact S3

A contact structure ξ on an oriented 3-manifold M is an oriented tangent plane distribution such that there is a 1-form α on M satisfying ξ = ker α, dα|ξ > 0 and α ∧ dα > 0. Such a 1-form is called a contact form for ξ.

slide-3
SLIDE 3

Transverse Links in the Standard Contact S3

A contact structure ξ on an oriented 3-manifold M is an oriented tangent plane distribution such that there is a 1-form α on M satisfying ξ = ker α, dα|ξ > 0 and α ∧ dα > 0. Such a 1-form is called a contact form for ξ. The standard contact structure ξst on S3 is given by the contact form αst = dz − ydx + xdy = dz + r2dθ.

slide-4
SLIDE 4

Transverse Links in the Standard Contact S3

A contact structure ξ on an oriented 3-manifold M is an oriented tangent plane distribution such that there is a 1-form α on M satisfying ξ = ker α, dα|ξ > 0 and α ∧ dα > 0. Such a 1-form is called a contact form for ξ. The standard contact structure ξst on S3 is given by the contact form αst = dz − ydx + xdy = dz + r2dθ. An oriented smooth link L in S3 is called transverse if αst|L > 0.

slide-5
SLIDE 5

Transverse Links in the Standard Contact S3

A contact structure ξ on an oriented 3-manifold M is an oriented tangent plane distribution such that there is a 1-form α on M satisfying ξ = ker α, dα|ξ > 0 and α ∧ dα > 0. Such a 1-form is called a contact form for ξ. The standard contact structure ξst on S3 is given by the contact form αst = dz − ydx + xdy = dz + r2dθ. An oriented smooth link L in S3 is called transverse if αst|L > 0.

Theorem (Bennequin)

Every transverse link in the standard contact S3 is transverse isotopic to a counterclockwise transverse closed braid around the z-axis.

slide-6
SLIDE 6

Transverse Links in the Standard Contact S3

A contact structure ξ on an oriented 3-manifold M is an oriented tangent plane distribution such that there is a 1-form α on M satisfying ξ = ker α, dα|ξ > 0 and α ∧ dα > 0. Such a 1-form is called a contact form for ξ. The standard contact structure ξst on S3 is given by the contact form αst = dz − ydx + xdy = dz + r2dθ. An oriented smooth link L in S3 is called transverse if αst|L > 0.

Theorem (Bennequin)

Every transverse link in the standard contact S3 is transverse isotopic to a counterclockwise transverse closed braid around the z-axis. Clearly, any smooth counterclockwise closed braid around the z-axis can be smoothly isotoped into a transverse closed braid around the z-axis without changing the braid word.

slide-7
SLIDE 7

The Transverse Markov Theorem

Transverse Markov moves:

◮ Braid group relations generated by

◮ σiσ−1

i

= σ−1

i

σi = ∅,

◮ σiσj = σjσi, when |i − j| > 1, ◮ σiσi+1σi = σi+1σiσi+1.

◮ Conjugations: µ η−1µη. ◮ Positive stabilizations and destabilizations:

µ (∈ Bm) µσm (∈ Bm+1).

slide-8
SLIDE 8

The Transverse Markov Theorem

Transverse Markov moves:

◮ Braid group relations generated by

◮ σiσ−1

i

= σ−1

i

σi = ∅,

◮ σiσj = σjσi, when |i − j| > 1, ◮ σiσi+1σi = σi+1σiσi+1.

◮ Conjugations: µ η−1µη. ◮ Positive stabilizations and destabilizations:

µ (∈ Bm) µσm (∈ Bm+1).

Theorem (Orevkov, Shevchishin and Wrinkle)

Two transverse closed braids are transverse isotopic if and only if the two braid words are related by a finite sequence of transverse Markov moves.

slide-9
SLIDE 9

The Transverse Markov Theorem

Transverse Markov moves:

◮ Braid group relations generated by

◮ σiσ−1

i

= σ−1

i

σi = ∅,

◮ σiσj = σjσi, when |i − j| > 1, ◮ σiσi+1σi = σi+1σiσi+1.

◮ Conjugations: µ η−1µη. ◮ Positive stabilizations and destabilizations:

µ (∈ Bm) µσm (∈ Bm+1).

Theorem (Orevkov, Shevchishin and Wrinkle)

Two transverse closed braids are transverse isotopic if and only if the two braid words are related by a finite sequence of transverse Markov moves. So there is a one-to-one correspondence between transverse isotopy classes of transverse links and closed braids modulo transverse Markov moves.

slide-10
SLIDE 10

Contact Framing

ξst admits a nowhere vanishing basis {∂x + y∂z, ∂y − x∂z}. For each transverse link L, this basis induces a contact framing of L. If two transverse links are transverse isotopic, then they are isotopic as framed links.

slide-11
SLIDE 11

Contact Framing

ξst admits a nowhere vanishing basis {∂x + y∂z, ∂y − x∂z}. For each transverse link L, this basis induces a contact framing of L. If two transverse links are transverse isotopic, then they are isotopic as framed links. For a transverse closed braid B of a knot with writhe w and b strands, its contact framing is determined by its self linking number sl(B) := w − b.

slide-12
SLIDE 12

Contact Framing

ξst admits a nowhere vanishing basis {∂x + y∂z, ∂y − x∂z}. For each transverse link L, this basis induces a contact framing of L. If two transverse links are transverse isotopic, then they are isotopic as framed links. For a transverse closed braid B of a knot with writhe w and b strands, its contact framing is determined by its self linking number sl(B) := w − b. If a smooth link type contains two transverse links that are isotopic as framed links but not as transverse links, then we call this smooth link type “transverse non-simple”.

slide-13
SLIDE 13

Contact Framing

ξst admits a nowhere vanishing basis {∂x + y∂z, ∂y − x∂z}. For each transverse link L, this basis induces a contact framing of L. If two transverse links are transverse isotopic, then they are isotopic as framed links. For a transverse closed braid B of a knot with writhe w and b strands, its contact framing is determined by its self linking number sl(B) := w − b. If a smooth link type contains two transverse links that are isotopic as framed links but not as transverse links, then we call this smooth link type “transverse non-simple”. An invariant for transverse links is called classical if it depends only

  • n the framed link type of the transverse link. Otherwise, it is

called non-classical or effective.

slide-14
SLIDE 14

The Khovanov-Rozansky Homology

Khovanov and Rozansky introduced an approach to construct link homologies using matrix factorizations by:

  • 1. Choose a base ring R and a potential polynomial p(x) ∈ R[x].
  • 2. Define matrix factorizations associated to MOY graphs using

this potential p(x).

  • 3. Define chain complexes of matrix factorizations associated to

link diagrams using the crossing information.

slide-15
SLIDE 15

The Khovanov-Rozansky Homology

Khovanov and Rozansky introduced an approach to construct link homologies using matrix factorizations by:

  • 1. Choose a base ring R and a potential polynomial p(x) ∈ R[x].
  • 2. Define matrix factorizations associated to MOY graphs using

this potential p(x).

  • 3. Define chain complexes of matrix factorizations associated to

link diagrams using the crossing information. This approach has been carried out for the following potential polynomials:

◮ xN+1 ∈ Q[x] (the sl(N) Khovanov-Rozansky homology); ◮ ax ∈ Q[a, x] (the HOMFLYPT homology); ◮ xN+1 + N l=1 λlxl ∈ Q[x] (deformed sl(N)

Khovanov-Rozansky homology);

◮ xN+1 + N l=1 alxl ∈ Q[a1, . . . , aN, x] (the equivariant sl(N)

Khovanov-Rozansky homology).

slide-16
SLIDE 16

Transverse Khovanov-Rozansky Homologies

For N ≥ 1, applying Khovanov and Rozansky’s matrix factorization construction to axN+1 ∈ Q[a, x], one gets a chain complex CN. For each link diagram D, the homology HN(D) of CN(D) is a Z2 ⊕ Z⊕3-graded Q[a]-module.

slide-17
SLIDE 17

Transverse Khovanov-Rozansky Homologies

For N ≥ 1, applying Khovanov and Rozansky’s matrix factorization construction to axN+1 ∈ Q[a, x], one gets a chain complex CN. For each link diagram D, the homology HN(D) of CN(D) is a Z2 ⊕ Z⊕3-graded Q[a]-module.

Theorem (W)

Suppose N ≥ 1. Let B be a closed braid. Every transverse Markov move on B induces an isomorphism of HN(B) preserving the Z2 ⊕ Z⊕3-graded Q[a]-module structure.

slide-18
SLIDE 18

Transverse Khovanov-Rozansky Homologies

For N ≥ 1, applying Khovanov and Rozansky’s matrix factorization construction to axN+1 ∈ Q[a, x], one gets a chain complex CN. For each link diagram D, the homology HN(D) of CN(D) is a Z2 ⊕ Z⊕3-graded Q[a]-module.

Theorem (W)

Suppose N ≥ 1. Let B be a closed braid. Every transverse Markov move on B induces an isomorphism of HN(B) preserving the Z2 ⊕ Z⊕3-graded Q[a]-module structure. Therefore, by the Transverse Markov Theorem, HN is an invariant for transverse links in the standard contact S3.

slide-19
SLIDE 19

Transverse Khovanov-Rozansky Homologies

For N ≥ 1, applying Khovanov and Rozansky’s matrix factorization construction to axN+1 ∈ Q[a, x], one gets a chain complex CN. For each link diagram D, the homology HN(D) of CN(D) is a Z2 ⊕ Z⊕3-graded Q[a]-module.

Theorem (W)

Suppose N ≥ 1. Let B be a closed braid. Every transverse Markov move on B induces an isomorphism of HN(B) preserving the Z2 ⊕ Z⊕3-graded Q[a]-module structure. Therefore, by the Transverse Markov Theorem, HN is an invariant for transverse links in the standard contact S3.

Question

Is HN an effective invariant for transverse links?

slide-20
SLIDE 20

Decategorification

PN(B) :=

  • (ε,i,j,k)∈Z2⊕Z⊕3

(−1)iτ εαjξk dimQ Hε,i,j,k

N

(B) ∈ Z[[α, ξ]][α−1, ξ−1, τ]/(τ 2−1)

slide-21
SLIDE 21

Decategorification

PN(B) :=

  • (ε,i,j,k)∈Z2⊕Z⊕3

(−1)iτ εαjξk dimQ Hε,i,j,k

N

(B) ∈ Z[[α, ξ]][α−1, ξ−1, τ]/(τ 2−1)

Theorem (W)

  • 1. PN is invariant under transverse Markov moves.
  • 2. α−1ξ−NPN(

✒ ■ ) − αξNPN(■✒) = τ(ξ−1 − ξ)PN( ✒ ■ ).

  • 3. PN(U⊔m) = (τα−1[N])m(

1 1−α2 +

  • ταξ−1+ξ−N

ξ−N −ξN

m −1 ταξ−N−1+1

), where U⊔m is the m-strand closed braid with no crossings and [N] := ξ−N−ξN

ξ−1−ξ .

  • 4. Parts 1–3 above uniquely determine the value of PN on every closed

braid.

slide-22
SLIDE 22

Decategorification

PN(B) :=

  • (ε,i,j,k)∈Z2⊕Z⊕3

(−1)iτ εαjξk dimQ Hε,i,j,k

N

(B) ∈ Z[[α, ξ]][α−1, ξ−1, τ]/(τ 2−1)

Theorem (W)

  • 1. PN is invariant under transverse Markov moves.
  • 2. α−1ξ−NPN(

✒ ■ ) − αξNPN(■✒) = τ(ξ−1 − ξ)PN( ✒ ■ ).

  • 3. PN(U⊔m) = (τα−1[N])m(

1 1−α2 +

  • ταξ−1+ξ−N

ξ−N −ξN

m −1 ταξ−N−1+1

), where U⊔m is the m-strand closed braid with no crossings and [N] := ξ−N−ξN

ξ−1−ξ .

  • 4. Parts 1–3 above uniquely determine the value of PN on every closed

braid. It is not clear if PN is effective. But PN does not detect flype moves. (µσk

mνσ±1 m µσ±1 m νσk m, where µ, ν ∈ Bm.)

slide-23
SLIDE 23

Module Structure

Theorem (W)

Let HN(B) be the sl(N) Khovanov-Rozansky homology of a closed braid B, and (ε, i, k) ∈ Z2 ⊕ Z⊕2.

  • 1. Hε,i,k

N

(B) ∼ = Hε,i,⋆,k

N

(B)/(a − 1)Hε,i,⋆,k

N

(B).

slide-24
SLIDE 24

Module Structure

Theorem (W)

Let HN(B) be the sl(N) Khovanov-Rozansky homology of a closed braid B, and (ε, i, k) ∈ Z2 ⊕ Z⊕2.

  • 1. Hε,i,k

N

(B) ∼ = Hε,i,⋆,k

N

(B)/(a − 1)Hε,i,⋆,k

N

(B).

  • 2. As a Z-graded Q[a]-module,

Hε,i,⋆,k

N

(B) ∼ = (Q[a]{sl(B)}a)⊕l⊕(Q[a]{sl(B)+2}a)⊕(dimQ Hε,i,k

N

(B)−l)⊕( n

  • q=1

Q[a]/(a){sq}),

where

◮ {s}a means shifting the a-grading by s, ◮ l and n are finite non-negative integers determined by B and the

triple (ε, i, k),

◮ {s1, . . . , sn} ⊂ Z is a sequence determined up to permutation by

B and the triple (ε, i, k),

◮ sl(B) ≤ sq ≤ c+ − c− − 1 and (N − 1)sq ≤ k − 2N + 2c− for

1 ≤ q ≤ n, where c± is the number of ± crossings in B.

slide-25
SLIDE 25

Negative Stabilization

Theorem (W)

Let L be a transverse closed braid, and L− a transverse closed braid obtained from L by a single negative stabilization. Then the chain complex CN(L−){2, 0} is isomorphic to the mapping cone of the standard quotient map π0 : CN(L) → CN(L)/aCN(L).

slide-26
SLIDE 26

Negative Stabilization

Theorem (W)

Let L be a transverse closed braid, and L− a transverse closed braid obtained from L by a single negative stabilization. Then the chain complex CN(L−){2, 0} is isomorphic to the mapping cone of the standard quotient map π0 : CN(L) → CN(L)/aCN(L). Thus, if HN(L) is the homology of CN(L)/aCN(L), there is a long exact sequence

· · · → Hε,i−1

N

(L){−2, 0}

π0

− → H ε,i−1

N

(L){−2, 0} → Hε,i

N (L−) → Hε,i N (L){−2, 0} π0

− → · · ·

slide-27
SLIDE 27

Negative Stabilization (cont’d)

Theorem (W)

Let B be a closed braid and B− a stabilization of B. Set s = sl(B). Then for any (i, k) ∈ Z⊕2, there are a long exact sequence of Z-graded Q[a]-modules

· · ·

Hs−1,i,⋆,k

N

(B−)

Hs,i−1,⋆,k+N+1

N

(B){−1}a

✐✐✐✐✐✐✐✐✐✐✐✐✐✐✐✐✐

Hs,i−1,k+N+1

N

(B) ⊗Q Q[a]{s − 1}a

Hs−1,i+1,⋆,k

N

(B−)

· · ·

and a short exact sequence of Z-graded Q[a]-modules

0 → Hs,i,k

N

(B) ⊗Q Q[a]{s}a → Hs,i,⋆,k

N

(B−) → Hs−1,i−1,⋆,k+N+1

N

(B){−1}a → 0.

slide-28
SLIDE 28

Transverse Unknots

◮ Bennequin’s inequality implies that the highest self linking

number of a transverse unknot is −1, which is attained by the 1-strand transverse closed braid.

slide-29
SLIDE 29

Transverse Unknots

◮ Bennequin’s inequality implies that the highest self linking

number of a transverse unknot is −1, which is attained by the 1-strand transverse closed braid.

◮ Eliashberg and Fraser showed that two transverse unknots are

transverse isotopic if and only if their self linking numbers are equal.

slide-30
SLIDE 30

Transverse Unknots

◮ Bennequin’s inequality implies that the highest self linking

number of a transverse unknot is −1, which is attained by the 1-strand transverse closed braid.

◮ Eliashberg and Fraser showed that two transverse unknots are

transverse isotopic if and only if their self linking numbers are equal.

◮ Denote by U0 the transverse unknot with self linking −1 and

by Um the transverse unknot obtained from U0 by m negative stabilizations.

slide-31
SLIDE 31

Transverse Unknots

◮ Bennequin’s inequality implies that the highest self linking

number of a transverse unknot is −1, which is attained by the 1-strand transverse closed braid.

◮ Eliashberg and Fraser showed that two transverse unknots are

transverse isotopic if and only if their self linking numbers are equal.

◮ Denote by U0 the transverse unknot with self linking −1 and

by Um the transverse unknot obtained from U0 by m negative stabilizations.

◮ Then every transverse unknot is transverse isotopic to Um for

some m ≥ 0.

slide-32
SLIDE 32

Transverse Unknots (cont’d)

F :=

N−1

  • l=0

Q[a] 1 {−1, −N + 1 + 2l}, T :=

  • l=0

Q[a]/(a) 1 {−1, N + 1 + 2l},

slide-33
SLIDE 33

Transverse Unknots (cont’d)

F :=

N−1

  • l=0

Q[a] 1 {−1, −N + 1 + 2l}, T :=

  • l=0

Q[a]/(a) 1 {−1, N + 1 + 2l}, HN(U0) ∼ = F ⊕ T , HN(U1) ∼ = F ⊕ T 1 {−1, −N − 1}1,

slide-34
SLIDE 34

Transverse Unknots (cont’d)

F :=

N−1

  • l=0

Q[a] 1 {−1, −N + 1 + 2l}, T :=

  • l=0

Q[a]/(a) 1 {−1, N + 1 + 2l}, HN(U0) ∼ = F ⊕ T , HN(U1) ∼ = F ⊕ T 1 {−1, −N − 1}1, and, for m ≥ 2, HN(Um) ∼ = F{−2(m − 1), 0} ⊕ T m {−m, −m(N + 1)}m ⊕

m−1

  • l=1

F/aF l {−2m + l, −l(N + 1)}l + 1, where “l” means shifting the homological grading by l.