There exist infinitely many unknotted winding number one satellite - - PowerPoint PPT Presentation

there exist infinitely many unknotted winding number one
SMART_READER_LITE
LIVE PREVIEW

There exist infinitely many unknotted winding number one satellite - - PowerPoint PPT Presentation

Introduction The satellite construction Main theorem Tools Proofs There exist infinitely many unknotted winding number one satellite operators on knot concordance Arunima Ray Rice University 2013 Lehigh University Geometry and Topology


slide-1
SLIDE 1

Introduction The satellite construction Main theorem Tools Proofs

There exist infinitely many unknotted winding number one satellite operators on knot concordance

Arunima Ray Rice University

2013 Lehigh University Geometry and Topology Conference

May 25, 2013

slide-2
SLIDE 2

Introduction The satellite construction Main theorem Tools Proofs

Preliminaries

Definition A knot is a smooth embedding S1 ֒ → S3 considered upto isotopy.

slide-3
SLIDE 3

Introduction The satellite construction Main theorem Tools Proofs

Preliminaries

Definition A knot is a smooth embedding S1 ֒ → S3 considered upto isotopy.

slide-4
SLIDE 4

Introduction The satellite construction Main theorem Tools Proofs

A 4–dimensional equivalence relation on knots

S3 × [0, 1]

slide-5
SLIDE 5

Introduction The satellite construction Main theorem Tools Proofs

A 4–dimensional equivalence relation on knots

S3 × [0, 1] Definition Two knots K and J are said to be concordant if they cobound a a properly embedded smooth annulus in S3 × [0, 1].

slide-6
SLIDE 6

Introduction The satellite construction Main theorem Tools Proofs

The knot concordance group

Definition Let C = Knots concordance C is a group under the connected-sum operation and is called the knot concordance group.

slide-7
SLIDE 7

Introduction The satellite construction Main theorem Tools Proofs

The knot concordance group

Definition Let C = Knots concordance C is a group under the connected-sum operation and is called the knot concordance group. The identity element in C is the class of the unknot. That is, the class of knots which bound smoothly embedded disks in B4, called slice knots.

slide-8
SLIDE 8

Introduction The satellite construction Main theorem Tools Proofs

Variants of the knot concordance group

Definition Two knots are concordant if they cobound a smoothly embedded annulus in a manifold diffeomorphic to S3 × [0, 1]. Concordance classes

  • f knots form the knot concordance group, denoted C.
slide-9
SLIDE 9

Introduction The satellite construction Main theorem Tools Proofs

Variants of the knot concordance group

Definition Two knots are concordant if they cobound a smoothly embedded annulus in a manifold diffeomorphic to S3 × [0, 1]. Concordance classes

  • f knots form the knot concordance group, denoted C.

Definition Two knots are topologically concordant if they cobound a topologically embedded annulus in a manifold homeomorphic to S3 × [0, 1]. Topological concordance classes of knots form the topological knot concordance group, denoted Ctop.

slide-10
SLIDE 10

Introduction The satellite construction Main theorem Tools Proofs

Variants of the knot concordance group

Definition Two knots are concordant if they cobound a smoothly embedded annulus in a manifold diffeomorphic to S3 × [0, 1]. Concordance classes

  • f knots form the knot concordance group, denoted C.

Definition Two knots are topologically concordant if they cobound a topologically embedded annulus in a manifold homeomorphic to S3 × [0, 1]. Topological concordance classes of knots form the topological knot concordance group, denoted Ctop. Definition Two knots are exotically concordant if they cobound a smoothly embedded annulus in a smooth manifold homeomorphic to S3 × [0, 1]. Exotic concordance classes of knots form the topological knot concordance group, denoted Cex.

slide-11
SLIDE 11

Introduction The satellite construction Main theorem Tools Proofs

Variants of the knot concordance group

Definition Two knots are concordant if they cobound a smoothly embedded annulus in a manifold diffeomorphic to S3 × [0, 1]. Concordance classes

  • f knots form the knot concordance group, denoted C.

Definition Two knots are topologically concordant if they cobound a topologically embedded annulus in a manifold homeomorphic to S3 × [0, 1]. Topological concordance classes of knots form the topological knot concordance group, denoted Ctop. Definition Two knots are exotically concordant if they cobound a smoothly embedded annulus in a smooth manifold homeomorphic to S3 × [0, 1]. Exotic concordance classes of knots form the topological knot concordance group, denoted Cex. If the 4–dimensional (smooth) Poincar´ e Conjecture is true, C = Cex.

slide-12
SLIDE 12

Introduction The satellite construction Main theorem Tools Proofs

The satellite construction

Definition A satellite operator, or pattern, is a knot inside a solid torus, considered upto isotopy within the solid torus.

slide-13
SLIDE 13

Introduction The satellite construction Main theorem Tools Proofs

The satellite construction

Definition A satellite operator, or pattern, is a knot inside a solid torus, considered upto isotopy within the solid torus. Definition The winding number of a pattern is the signed count of its intersections with a meridional disk of the solid torus.

slide-14
SLIDE 14

Introduction The satellite construction Main theorem Tools Proofs

The satellite construction

P, the pattern K, a knot in S3

Figure : The satellite operation on knots in S3.

slide-15
SLIDE 15

Introduction The satellite construction Main theorem Tools Proofs

The satellite construction

P, the pattern K, a knot in S3 P(K), the satellite knot

Figure : The satellite operation on knots in S3.

slide-16
SLIDE 16

Introduction The satellite construction Main theorem Tools Proofs

The satellite construction

P, the pattern K, a knot in S3 P(K), the satellite knot

Figure : The satellite operation on knots in S3.

Remark Any satellite operator P gives a function P : C → C.

slide-17
SLIDE 17

Introduction The satellite construction Main theorem Tools Proofs

Strong winding number one operators

P

slide-18
SLIDE 18

Introduction The satellite construction Main theorem Tools Proofs

Strong winding number one operators

P η

slide-19
SLIDE 19

Introduction The satellite construction Main theorem Tools Proofs

Strong winding number one operators

η

  • P

Consider P in S3 instead of the solid torus. Call this P.

slide-20
SLIDE 20

Introduction The satellite construction Main theorem Tools Proofs

Strong winding number one operators

η

  • P

Consider P in S3 instead of the solid torus. Call this P. Definition If η, the meridian of the solid torus, normally generates π1(S3\ P), then P is said to have strong winding number one.

slide-21
SLIDE 21

Introduction The satellite construction Main theorem Tools Proofs

Strong winding number one operators

η

  • P

Consider P in S3 instead of the solid torus. Call this P. Definition If η, the meridian of the solid torus, normally generates π1(S3\ P), then P is said to have strong winding number one. For a P such that P is unknotted, P is strong winding number one if and only if it is winding number one.

slide-22
SLIDE 22

Introduction The satellite construction Main theorem Tools Proofs

Injectivity of satellite operators

Theorem (Cochran–Davis–R.,’12) If P is a strong winding number one pattern, then P : Ctop → Ctop and P : Cex → Cex are injective. That is, for any two knots K and J, P(K) = P(J) ⇔ K = J

slide-23
SLIDE 23

Introduction The satellite construction Main theorem Tools Proofs

Injectivity of satellite operators

Theorem (Cochran–Davis–R.,’12) If P is a strong winding number one pattern, then P : Ctop → Ctop and P : Cex → Cex are injective. That is, for any two knots K and J, P(K) = P(J) ⇔ K = J If the 4–dimensional Poincar´ e Conjecture is true, P : C → C is injective.

slide-24
SLIDE 24

Introduction The satellite construction Main theorem Tools Proofs

Is C a fractal?

A fractal can be defined as a set which ‘exhibits self-similarity on many scales’.

slide-25
SLIDE 25

Introduction The satellite construction Main theorem Tools Proofs

Is C a fractal?

A fractal can be defined as a set which ‘exhibits self-similarity on many scales’. Each strong winding number one satellite operator gives a ‘self-similarity’ of Ctop and Cex (and maybe even of C).

slide-26
SLIDE 26

Introduction The satellite construction Main theorem Tools Proofs

Is C a fractal?

A fractal can be defined as a set which ‘exhibits self-similarity on many scales’. Each strong winding number one satellite operator gives a ‘self-similarity’ of Ctop and Cex (and maybe even of C). Question How many strong winding number one operators are there?

slide-27
SLIDE 27

Introduction The satellite construction Main theorem Tools Proofs

Main theorem

Theorem (R.) There is a strong winding number one satellite operator P and a large family of knots K such that P i(K) = P(P(· · · (P(K)) · · · )) are all distinct in Cex and C. That is, P i(K) = P j(K) for all i = j. Therefore, each P i gives a distinct function on the smooth knot concordance group.

slide-28
SLIDE 28

Introduction The satellite construction Main theorem Tools Proofs

Main theorem

Theorem (R.) There is a strong winding number one satellite operator P and a large family of knots K such that P i(K) = P(P(· · · (P(K)) · · · )) are all distinct in Cex and C. That is, P i(K) = P j(K) for all i = j. Therefore, each P i gives a distinct function on the smooth knot concordance group. Each P i is strong winding number one. So we have infinitely many self-similarities of Cex.

slide-29
SLIDE 29

Introduction The satellite construction Main theorem Tools Proofs

Main theorem

Theorem (R.) There is a strong winding number one satellite operator P and a large family of knots K such that P i(K) = P(P(· · · (P(K)) · · · )) are all distinct in Cex and C. That is, P i(K) = P j(K) for all i = j. Therefore, each P i gives a distinct function on the smooth knot concordance group. Each P i is strong winding number one. So we have infinitely many self-similarities of Cex. We can choose K to be topologically slice and P to be unknotted, in which case the set {P i(K)} is an infinite family of topologically slice knots that are distinct in smooth concordance.

slide-30
SLIDE 30

Introduction The satellite construction Main theorem Tools Proofs

τ–invariant of knots

Definition Ozsv´ ath–Szab´

  • defined the τ–invariant of a knot. This gives

homomorphisms τ : C → Z and τ : Cex → Z.

slide-31
SLIDE 31

Introduction The satellite construction Main theorem Tools Proofs

τ–invariant of knots

Definition Ozsv´ ath–Szab´

  • defined the τ–invariant of a knot. This gives

homomorphisms τ : C → Z and τ : Cex → Z. Proposition (Ozsv´ ath–Szab´

  • )

Start with a knot K+. If K− is the knot obtained by changing a single positive crossing of K+, then τ(K+) − 1 ≤ τ(K−) ≤ τ(K+)

slide-32
SLIDE 32

Introduction The satellite construction Main theorem Tools Proofs

Composition of patterns

* =

Figure : The monoid operation on patterns.

Fact P(Q(K)) = (P ∗ Q)(K)

slide-33
SLIDE 33

Introduction The satellite construction Main theorem Tools Proofs

Legendrian front diagrams

Every knot has a Legendrian front diagram, i.e. a diagram with no vertical tangencies wherein all crossings are of the following type:

slide-34
SLIDE 34

Introduction The satellite construction Main theorem Tools Proofs

Legendrian front diagrams

Every knot has a Legendrian front diagram, i.e. a diagram with no vertical tangencies wherein all crossings are of the following type:

slide-35
SLIDE 35

Introduction The satellite construction Main theorem Tools Proofs

Classical invariants of Legendrian knots

tb(K) = (#positive crossings − #negative crossings) − 1

2#cusps

rot(K) = 1

2(#down cusps − #up cusps)

slide-36
SLIDE 36

Introduction The satellite construction Main theorem Tools Proofs

Classical invariants of Legendrian knots

tb(K) = (#positive crossings − #negative crossings) − 1

2#cusps

rot(K) = 1

2(#down cusps − #up cusps)

tb(K) = (3 − 0) − 1

2(4) = 1, rot(K) = 1 2(2 − 2) = 0

slide-37
SLIDE 37

Introduction The satellite construction Main theorem Tools Proofs

Classical invariants for Legendrian patterns

tb(P) = 2 and rot(P) = 0

slide-38
SLIDE 38

Introduction The satellite construction Main theorem Tools Proofs

The Legendrian satellite operation

For a knot K, suppose we have a Legendrian diagram with tb(K) = 0.

slide-39
SLIDE 39

Introduction The satellite construction Main theorem Tools Proofs

The Legendrian satellite operation

For a knot K, suppose we have a Legendrian diagram with tb(K) = 0. We can obtain the satellite knot P(K) by taking parallels of K

slide-40
SLIDE 40

Introduction The satellite construction Main theorem Tools Proofs

The Legendrian satellite operation

For a knot K, suppose we have a Legendrian diagram with tb(K) = 0. We can obtain the satellite knot P(K) by taking parallels of K and then inserting the pattern.

slide-41
SLIDE 41

Introduction The satellite construction Main theorem Tools Proofs

Legendrian patterns and Legendrian satellites

Proposition (Ng) tb(P(K)) = tb(P) + w(P)2tb(K) rot(P(K)) = rot(P) + w(P)rot(K)

slide-42
SLIDE 42

Introduction The satellite construction Main theorem Tools Proofs

Legendrian patterns and Legendrian satellites

Proposition (Ng) tb(P(K)) = tb(P) + w(P)2tb(K) rot(P(K)) = rot(P) + w(P)rot(K) Proposition tb(P ∗ Q) = tb(P) + w(P)2tb(Q) rot(P ∗ Q) = rot(P) + w(P)rot(Q)

slide-43
SLIDE 43

Introduction The satellite construction Main theorem Tools Proofs

The slice–Bennequin inequality

Slice–Bennequin inequality (Rudolph) For any knot K, we have that tb(K) + |rot(K)| ≤ 2τ(K) − 1

slide-44
SLIDE 44

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P) = 0 and rot(P) = 2 Proposition (Cochran–Franklin–Hedden–Horn) For any knot K with tb(K) = 0, rot(K) = 2τ(K) − 1 and τ(K) > 0, P(K) = K in C (and therefore, in Cex). Note: There are large families of such knots K.

slide-45
SLIDE 45

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P) = 0 and rot(P) = 2 Proposition (Cochran–Franklin–Hedden–Horn) For any knot K with tb(K) = 0, rot(K) = 2τ(K) − 1 and τ(K) > 0, P(K) = K in C (and therefore, in Cex). Note: There are large families of such knots K. Proof: tb(P(K)) = tb(P) + tb(K) = 0 and rot(P(K)) = rot(P) + rot(K) = 2 + (2τ(K) − 1) = 2τ(K) + 1

slide-46
SLIDE 46

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P) = 0 and rot(P) = 2 Proposition (Cochran–Franklin–Hedden–Horn) For any knot K with tb(K) = 0, rot(K) = 2τ(K) − 1 and τ(K) > 0, P(K) = K in C (and therefore, in Cex). Note: There are large families of such knots K. Proof: tb(P(K)) = tb(P) + tb(K) = 0 and rot(P(K)) = rot(P) + rot(K) = 2 + (2τ(K) − 1) = 2τ(K) + 1 But tb(P(K)) + |rot(P(K))| ≤ 2τ(P(K)) − 1

slide-47
SLIDE 47

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P) = 0 and rot(P) = 2 Proposition (Cochran–Franklin–Hedden–Horn) For any knot K with tb(K) = 0, rot(K) = 2τ(K) − 1 and τ(K) > 0, P(K) = K in C (and therefore, in Cex). Note: There are large families of such knots K. Proof: tb(P(K)) = tb(P) + tb(K) = 0 and rot(P(K)) = rot(P) + rot(K) = 2 + (2τ(K) − 1) = 2τ(K) + 1 But tb(P(K)) + |rot(P(K))| ≤ 2τ(P(K)) − 1 So 0 + 2τ(K) + 1 ≤ 2τ(P(K)) − 1

slide-48
SLIDE 48

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P) = 0 and rot(P) = 2 Proposition (Cochran–Franklin–Hedden–Horn) For any knot K with tb(K) = 0, rot(K) = 2τ(K) − 1 and τ(K) > 0, P(K) = K in C (and therefore, in Cex). Note: There are large families of such knots K. Proof: tb(P(K)) = tb(P) + tb(K) = 0 and rot(P(K)) = rot(P) + rot(K) = 2 + (2τ(K) − 1) = 2τ(K) + 1 But tb(P(K)) + |rot(P(K))| ≤ 2τ(P(K)) − 1 So 0 + 2τ(K) + 1 ≤ 2τ(P(K)) − 1⇒ τ(K) + 1 ≤ τ(P(K))

slide-49
SLIDE 49

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P) = 0 and rot(P) = 2 Proposition (Cochran–Franklin–Hedden–Horn) For any knot K with tb(K) = 0, rot(K) = 2τ(K) − 1 and τ(K) > 0, P(K) = K in C (and therefore, in Cex). Note: There are large families of such knots K. Proof: tb(P(K)) = tb(P) + tb(K) = 0 and rot(P(K)) = rot(P) + rot(K) = 2 + (2τ(K) − 1) = 2τ(K) + 1 But tb(P(K)) + |rot(P(K))| ≤ 2τ(P(K)) − 1 So 0 + 2τ(K) + 1 ≤ 2τ(P(K)) − 1⇒ τ(K) + 1 ≤ τ(P(K)) ⇒ P(K) = K

slide-50
SLIDE 50

Introduction The satellite construction Main theorem Tools Proofs

Proof

Proposition (R.) P i(K) = K for any i > 0 in C (and therefore, in Cex).

slide-51
SLIDE 51

Introduction The satellite construction Main theorem Tools Proofs

Proof

Proposition (R.) P i(K) = K for any i > 0 in C (and therefore, in Cex).

Proof:

slide-52
SLIDE 52

Introduction The satellite construction Main theorem Tools Proofs

Proof

Proposition (R.) P i(K) = K for any i > 0 in C (and therefore, in Cex).

Proof:

slide-53
SLIDE 53

Introduction The satellite construction Main theorem Tools Proofs

Proof

Proposition (R.) P i(K) = K for any i > 0 in C (and therefore, in Cex).

Proof: Figure : The operator P 2

slide-54
SLIDE 54

Introduction The satellite construction Main theorem Tools Proofs

Proof

Proposition (R.) P i(K) = K for any i > 0 in C (and therefore, in Cex).

Proof: Figure : The operator P 2 tb(P 2) = tb(P)+tb(P) rot(P 2) = rot(P)+rot(P)

slide-55
SLIDE 55

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P i) = 0 and rot(P i) = 2i

slide-56
SLIDE 56

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P i) = 0 and rot(P i) = 2i tb(P i(K)) = 0 and rot(P i(K)) = 2τ(K) − 1 + 2i

slide-57
SLIDE 57

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P i) = 0 and rot(P i) = 2i tb(P i(K)) = 0 and rot(P i(K)) = 2τ(K) − 1 + 2i By the slice–Bennequin inequality, we have that

slide-58
SLIDE 58

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P i) = 0 and rot(P i) = 2i tb(P i(K)) = 0 and rot(P i(K)) = 2τ(K) − 1 + 2i By the slice–Bennequin inequality, we have that tb(P i(K)) + |rot(P i(K))| ≤ 2τ(P i(K)) − 1

slide-59
SLIDE 59

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P i) = 0 and rot(P i) = 2i tb(P i(K)) = 0 and rot(P i(K)) = 2τ(K) − 1 + 2i By the slice–Bennequin inequality, we have that tb(P i(K)) + |rot(P i(K))| ≤ 2τ(P i(K)) − 1 0 + |2τ(K) − 1 + 2i| ≤ 2τ(P i(K)) − 1

slide-60
SLIDE 60

Introduction The satellite construction Main theorem Tools Proofs

Proof

tb(P i) = 0 and rot(P i) = 2i tb(P i(K)) = 0 and rot(P i(K)) = 2τ(K) − 1 + 2i By the slice–Bennequin inequality, we have that tb(P i(K)) + |rot(P i(K))| ≤ 2τ(P i(K)) − 1 0 + |2τ(K) − 1 + 2i| ≤ 2τ(P i(K)) − 1 Therefore, τ(K) + i ≤ τ(P i(K)) and P i(K) = K for i > 0.

slide-61
SLIDE 61

Introduction The satellite construction Main theorem Tools Proofs

Proof

Theorem (R.) P i(K) = P j(K) for any i = j in C (and therefore, in Cex). Additionally, τ(P i(K)) = τ(K) + i for all i ≥ 0

slide-62
SLIDE 62

Introduction The satellite construction Main theorem Tools Proofs

Proof

Theorem (R.) P i(K) = P j(K) for any i = j in C (and therefore, in Cex). Additionally, τ(P i(K)) = τ(K) + i for all i ≥ 0 Proof: We can change P i(K) to P i−1(K) by changing a single positive crossing to a negative crossing. Therefore, we know that τ(P i−1(K)) ≤ τ(P i(K)) ≤ τ(P i−1(K)) + 1

slide-63
SLIDE 63

Introduction The satellite construction Main theorem Tools Proofs

Proof

Theorem (R.) P i(K) = P j(K) for any i = j in C (and therefore, in Cex). Additionally, τ(P i(K)) = τ(K) + i for all i ≥ 0 Proof: We can change P i(K) to P i−1(K) by changing a single positive crossing to a negative crossing. Therefore, we know that τ(P i−1(K)) ≤ τ(P i(K)) ≤ τ(P i−1(K)) + 1 Therefore, τ(P i(K)) ≤ τ(P i−1(K)) + 1 ≤ τ(P i−2(K)) + 2 ≤ · · · ≤ τ(K) + i. ⇒ τ(P i(K)) = τ(K) + i for all i > 0