On generalization of Khovanov link homologies

Slides:



Advertisements
Similar presentations
The Topology of Graph Configuration Spaces David G.C. Handron Carnegie Mellon University
Advertisements

XXX Knots in Washington 21 st May 2010 Krzysztof Putyra Columbia University, New York.
Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.
Algorithms and Data Structures for Low-Dimensional Topology
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.
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.
The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008.
An Untangled Introduction to Knot Theory Ana Nora Evans University of Virginia Mathematics 12 February 2010.
Parallel Scheduling of Complex DAGs under Uncertainty Grzegorz Malewicz.
Groups TS.Nguyễn Viết Đông.
Mathematical Physics Seminar Notes Lecture 3 Global Analysis and Lie Theory Wayne M. Lawton Department of Mathematics National University of Singapore.
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
Every H-decomposition of K n has a nearly resolvable alternative Wilson: e(H) | n(n-1)/2 and gcd(H) | n-1 n>> then there exists an H-decomposition of K.
Integration in the Complex Plane CHAPTER 18. Ch18_2 Contents  18.1 Contour Integrals 18.1 Contour Integrals  18.2 Cauchy-Goursat Theorem 18.2 Cauchy-Goursat.
2 2.3 © 2012 Pearson Education, Inc. Matrix Algebra CHARACTERIZATIONS OF INVERTIBLE MATRICES.
M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Based on the paper by M. Farber and D. Schütz Presented by Yair.
Crossed Systems and HQFT’s
Computational Geometry Seminar Lecture 1
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
1 Category Theory in a ( E,M ) -category Some aspects of category theory, in particular related to universality, can be developed in any finitely complete.
Quandle Cocycle Invariants for Knots, Knotted Surfaces and Knotted 3-Manifolds Witold Rosicki (Gdańsk)
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
The warping degree and the unknotting number of a spatial graph Akio Kawauchi Osaka City University at East Asian School at Gyeongju January 15, 2009.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
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.
Ch. 10 Vector Integral Calculus.
Introduction to Heegaard Floer Homology Eaman Eftekhary Harvard University Eaman Eftekhary Harvard University.
A 2-category of dotted cobordisms and a universal odd link homology
Chapter 3 – Set Theory  .
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Chap. 6 Linear Transformations
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
Odd homology of tangles and cobordisms Krzysztof Putyra Jagiellonian University, Kraków XXVII Knots in Washington 10 th January 2009.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Gauge Fields, Knots and Gravity Wayne Lawton Department of Mathematics National University of Singapore (65)
The homology groups of a partial monoid action category Ahmet A. Husainov
AMS Meeting, Newark Special Session on Homology Theories for Knots and Skein Modules 22 nd May 2010 Krzysztof Putyra Columbia University, New York.
Maximum density of copies of a graph in the n-cube John Goldwasser Ryan Hansen West Virginia University.
The countable character of uncountable graphs François Laviolette Barbados 2003.
Mathematics.
Lecture 2 Plan: 1. Automatic Boolean Algebras 2. Automatic Linear Orders 3. Automatic Trees 4. Automatic Versions of König’s lemma 5. Intrinsic Regularity.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
1 Symmetry Symmetry Chapter 14 from “Model Checking” by Edmund M. Clarke Jr., Orna Grumberg, and Doron A. Peled presented by Anastasia Braginsky March.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Heegaard Floer Homology and Existence of Incompressible Tori in Three-manifolds Eaman Eftekhary IPM, Tehran, Iran.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
8.5 Equivalence Relations
Chromatic Coloring with a Maximum Color Class Bor-Liang Chen Kuo-Ching Huang Chih-Hung Yen* 30 July, 2009.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Hodge Theory Calculus on Smooth Manifolds. by William M. Faucette Adapted from lectures by Mark Andrea A. Cataldo.
2 2.2 © 2016 Pearson Education, Ltd. Matrix Algebra THE INVERSE OF A MATRIX.
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.
Algebraic Topology Simplicial Homology Wayne Lawton
Mathematical problems in knot theory
Gravity-Khovanov Homology-QFT
The countable character of uncountable graphs François Laviolette Barbados 2003.
MTH 392A Topics in Knot theory
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Higher order Whitehead products in Quillen’s models
Spin Models and Distance-Regular Graphs
Chapter 5: Morse functions and function-induced persistence
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Chapter 3: Simplicial Homology Instructor: Yusu Wang
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Presentation transcript:

On generalization of Khovanov link homologies Krzysztof Putyra Jagiellonian University, Kraków Geometry & Topology of Manifolds Kraków, 4th July 2008

Knots & diagrams f Knot: a smooth embedding f : S1 R3. Knot space: X = {f : S1R3 | f is a knot} Funkcja z okręgu w R^3  „analisys situs” Założenia: gładka (C1), albo PL Równoważność: leżenie w jednej składowej łukowe Diagramy: rzut na płaszczyznę, spełnia pewne warunki Twierdzenie i ruchy Reidemeistera Two knots are equivalent iff they lie in the same path component of the knot space X. In similar way we define links as smooth embeddings of disjoint union of circles..

Knots & diagrams p tunnels bridge This gives us a diagram of a knot/link.

Knots & diagrams unknot trefoil figure-eight knot cinquefoil

Knots & diagrams

Knots & diagrams R1 R2 R3 Kurt Reidemeister Theorem (K. Reidemeister, 1927). Let L1, L2 be links with diagrams D1, D2. Then L1, L2 are equivalent iff D1 can be obtained from D2 by a finite sequence of moves, called Reidemeister moves: Kurt Reidemeister R1 R2 R3 and isotopies of the plane.

Khovanov Complex 0-smoothing 1-smoothing Mikhail Khovanov

direct sums create the complex Khovanov Complex 3 1 110 101 100 010 001 2 arrows are cobordisms objects are smoothed diagrams 000 – 111 Mikhail Khovanov 011 direct sums create the complex C-3 C-2 C-1 C0 d

direct sums create the complex Odd Khovanov Complex 3 1 110 100 2 arrows are cobordisms objects are smoothed diagrams with arrows 000 111 101 010 Mikhail Khovanov 011 001 direct sums create the complex (applying some edge assignment) C-3 C-2 C-1 C0 d

ORS ‘half-proj.’ functor Khovanov functor see Khovanov: arXiv:math/9908171 FKh: Cob → ℤ-Mod symmetric: Edge assignment is given explicite. ORS ‘half-proj.’ functor see Ozsvath, Rasmussen, Szabo: arXiv:0710.4300 FORS: ArCob → ℤ-Mod not symmetric: Edge assignment is given by homological properties. Category of cobordisms is symmetric:

Main question Fact (Bar-Natan) Invariance of the Khovanov complex can be proved at the level of topology. Question Can Cob be changed to make FORS a functor? Motivation Invariance of the odd Khovanov complex may be proved at the level of topology and new theories may arise. Dror Bar-Natan Anwser Yes: cobordisms with chronology

ChCob: cobordisms with chronology & arrows Chronology τ is a Morse function with exactly one critical point over each critical value. Critical points of index 1 have arrows: τ defines a flow φ on M critical point of τ are fix points φ arrows choose one of the in/outcoming trajectory for a critical point. Chronology isotopy is a smooth homotopy H satisfying: - H0 = τ0 - H1 = τ1 - Ht is a chronology

ChCob: cobordisms with chronology & arrows Chronology is preserved: Critical points do not vanish:

F: ChCob ℤ-Mod Which conditions should a functor satisfy to produce homologies?

Chronology change condition This square needs to be anti-commutative after multiplying some egdes with invertible elements (edge assignment proccess). These two compositions could differ by an invertible element only!

Chronology change condition The coefficient should be well-defined for any change of chronology: α α α α3 = α2β α α β

Chronology change condition The necessary conditions are the following: where X 2 = Y 2 = 1 and Z is invertible. Note (X, Y, Z) → (-X,-Y,-Z) induces an isomorphism on complexes.

Edge assignment P = λrP = λrλf P = ... = Π λiP P = λrP P Proposition For any cube of resolutions C(D) there exists an edge assignment e → φ(e)e making the cube anticommutative. Sketch of proof Each square S corresponds to a change of chronology with some coefficient λ. The cochain ψ(S) = -λ is a cocycle: 6 P = λrP = λrλf P = ... = Π λiP P = λrP P P = λrP = λrλf P i = 1 By the ch. ch. condition: dψ(C) = Π -λi = 1 and by the contractibility of a 3-cube: ψ = dφ 6 i = 1

Edge assignment Proposition For any cube of resolutions C(D) there exists an edge assignment e → φ(e)e making the cube anticommutative. Proposition For any cube of resolutions C(D) different egde assign-ments produce isomorphic complexes. Sketch of proof Let φ1 and φ2 be edge assignments for a cube C(D). Then d(φ1φ2-1) = dφ1dφ2-1 = ψψ-1 = 1 Thus φ1φ2-1 is a cocycle, hence a coboundary. Putting φ1 = dηφ2 we obtain an isomorphism of complexes ηid: C(D,φ1) → C(D,φ2).

Edge assignment Proposition For any cube of resolutions C(D) there exists an edge assignment e → φ(e)e making the cube anticommutative. Proposition For any cube of resolutions C(D) different egde assign-ments produce isomorphic complexes. Corollary Denote by D1 and D2 a link diagram D with different choices of arrows. Then the cubes of resolutions C(D1) and C(D2) are isomorphic. Corollary Upto isomophisms the Khovanov complex C(D) depends only on the link diagram D.

compare with Bar-Natan: arXiv:math/0410495 S / T / 4Tu relations compare with Bar-Natan: arXiv:math/0410495 Theorem The Khovanov complex is invariant under chain homotopies and the following relations: where X, Y and Z are given by the ch.ch.c.

Main result Theorem There exists a functor satisfying ch.ch.c and S/T/4Tu, where FU: ChCob R-Mod R = ℤ[X, Y, Z±1]/(X2 = Y2 = 1) Moreover: If (X,Y,Z) = (1,1,1), then FU is the Khovanov functor If (X,Y,Z) = (1,-1,1), then FU is the ORS functor

Main result M FU (M) Rv+⊕Rv– R = ℤ[X, Y, Z±1]/(X2 = Y2 = 1) 1  v+ v+  + ZY v–  v+  0 v–  1 v+   X v+  v+   Z-1 v– v–  v+ v–   Z v+ v+  v– v–   Y v–  v+   v+ v+   v– v– v–   ZX v– v+ v–   0 v–  v+ v+  v– v– 

(X, Y, Z) → (-X, -Y, -Z) and (X, Y, Z) → (Y, X, Z-1) Further research There exist isomorphisms of complexes (X, Y, Z) → (-X, -Y, -Z) and (X, Y, Z) → (Y, X, Z-1) Hence we have three theories over ℤ: Khovanov, ORS and (-1, -1, 1). Is the last different or not? The proof of independence goes for any functor F: ChCob → R-Mod. Does there exist a transformation between such functors F and G? If so, when is it an equivalence? How powerful is the odd Khovanov complex? Does it detect the unknot? What about tangles?

Thank you for your attention