Detecting Linkage in an n -Component Brunnian Link (work in - - PowerPoint PPT Presentation

detecting linkage in an n component brunnian link
SMART_READER_LITE
LIVE PREVIEW

Detecting Linkage in an n -Component Brunnian Link (work in - - PowerPoint PPT Presentation

Detecting Linkage in an n -Component Brunnian Link (work in progress) Ron Umble, Barbara Nimershiem, and Merv Fansler Millersville U and Franklin & Marshall College Tetrahedral Geometry/Topology Seminar December 4, 2015 Tetrahedral


slide-1
SLIDE 1

Detecting Linkage in an n-Component Brunnian Link

(work in progress) Ron Umble, Barbara Nimershiem, and Merv Fansler Millersville U and Franklin & Marshall College

Tetrahedral Geometry/Topology Seminar

December 4, 2015

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 1 / 28

slide-2
SLIDE 2

Ultimate Goal of the Project

Computationally detect the linkage in an n-component Brunnian link

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 2 / 28

slide-3
SLIDE 3

Review of Cellular Complexes

Let X be a connected network, surface, or solid embedded in S3

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 3 / 28

slide-4
SLIDE 4

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-5
SLIDE 5

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells) closed intervals (edges or 1-cells)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-6
SLIDE 6

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells) closed intervals (edges or 1-cells) closed disks (faces or 2-cells)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-7
SLIDE 7

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells) closed intervals (edges or 1-cells) closed disks (faces or 2-cells) closed balls (solids or 3-cells) glued together so that the

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-8
SLIDE 8

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells) closed intervals (edges or 1-cells) closed disks (faces or 2-cells) closed balls (solids or 3-cells) glued together so that the non-empty boundary of a k-cell is a union of (k − 1)-cells

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-9
SLIDE 9

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells) closed intervals (edges or 1-cells) closed disks (faces or 2-cells) closed balls (solids or 3-cells) glued together so that the non-empty boundary of a k-cell is a union of (k − 1)-cells non-empty intersection of cells is a cell

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-10
SLIDE 10

Cellular Decompositions

A cellular decomposition of X is a finite collection of discrete points (vertices or 0-cells) closed intervals (edges or 1-cells) closed disks (faces or 2-cells) closed balls (solids or 3-cells) glued together so that the non-empty boundary of a k-cell is a union of (k − 1)-cells non-empty intersection of cells is a cell union of all cells is X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 28

slide-11
SLIDE 11

Example: 2-dim’l Sphere

S2 = D2/∂D2 (Grandma’s draw string bag) Vertex: {v} Edges: ∅ Face: {S2}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 5 / 28

slide-12
SLIDE 12

Example: Torus

T = S1 × S1 Product cells: {v,a} × {v,b} Vertex: {v: = v × v} Edges: {a := a × v, b := v × b} Face: {T := a × b}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 28

slide-13
SLIDE 13

Example: Pinched Sphere

P = T/b Vertex: {v} Edge: {a} Face: {S}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 7 / 28

slide-14
SLIDE 14

Example: Link Complement of Two Unknots

Let UN be the complement of disjoint tubular neighborhoods Ui of two unlinked unknots in S3 ∂ (U1 ∪ U2) is the wedge of two pinched spheres ti sharing a single vertex v and two edges a and b ∂ (U1 ∪ U2) = ∂ (UN)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 8 / 28

slide-15
SLIDE 15

Cellular Structure of UN

∂ (UN) is wedged with the equatorial 2-sphere s ⊂ S3 p = upper hemispherical 3-ball q = lower hemispherical 3-ball (U1 ∪ U2) p and q are attached along s UN = p ∪ q Vertices: {v} Edges: {a, b} Faces: {s, t1, t2} Solids: {p, q}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 9 / 28

slide-16
SLIDE 16

Example: Link Complement of the Hopf Link

Let LN be the complement of disjoint tubular neighborhoods Ui of the Hopf Link in S3 ∂ (U1 ∪ U2) is the union of two linked tori t

i sharing a single vertex v

and two edges a and b ∂ (U1 ∪ U2) = ∂ (LN)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 28

slide-17
SLIDE 17

Cellular Structure of LN

∂ (LN) is wedged with the equatorial 2-sphere s ⊂ S3 p = upper hemispherical 3-ball q = lower hemispherical 3-ball (U1 ∪ U2) p and q are attached along s LN = p ∪ q Vertex: {v} Edges: {a, b} Faces: {s, t

1, t 2}

Solids: {p, q}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 11 / 28

slide-18
SLIDE 18

Homeomorphisms

X and Y are homeomorphic if X can be continuously deformed into Y

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 28

slide-19
SLIDE 19

Homeomorphisms

X and Y are homeomorphic if X can be continuously deformed into Y ∃ a bijective bicontinuous h : X → Y , called a homeomorphism

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 28

slide-20
SLIDE 20

Homeomorphisms

X and Y are homeomorphic if X can be continuously deformed into Y ∃ a bijective bicontinuous h : X → Y , called a homeomorphism A square and a circle are homeomorphic

h

− →

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 28

slide-21
SLIDE 21

Homeomorphisms

X and Y are homeomorphic if X can be continuously deformed into Y ∃ a bijective bicontinuous h : X → Y , called a homeomorphism A square and a circle are homeomorphic

h

− → The boundaries of a doughnut and coffee cup are homeomorphic

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 28

slide-22
SLIDE 22

Homeomorphisms

UN and LN are not homeomorphic because...

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 13 / 28

slide-23
SLIDE 23

Homeomorphisms

UN and LN are not homeomorphic because... Shrinking the tubular neighborhood of one component to point

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 13 / 28

slide-24
SLIDE 24

Homeomorphisms

UN and LN are not homeomorphic because... Shrinking the tubular neighborhood of one component to point

shrinks ∂ (UN) to a pinched sphere

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 13 / 28

slide-25
SLIDE 25

Homeomorphisms

UN and LN are not homeomorphic because... Shrinking the tubular neighborhood of one component to point

shrinks ∂ (UN) to a pinched sphere shrinks ∂ (LN) to a 2-sphere

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 13 / 28

slide-26
SLIDE 26

Homeomorphisms

UN and LN are not homeomorphic because... Shrinking the tubular neighborhood of one component to point

shrinks ∂ (UN) to a pinched sphere shrinks ∂ (LN) to a 2-sphere

How do we can detect this computationally?

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 13 / 28

slide-27
SLIDE 27

The Geometric Diagonal

Geometric diagonal ∆X : X → X × X is defined x → (x, x)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 14 / 28

slide-28
SLIDE 28

The Geometric Diagonal

Geometric diagonal ∆X : X → X × X is defined x → (x, x) A homeomorphism h : X → Y respects diagonals ∆Y h = (h × h) ∆X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 14 / 28

slide-29
SLIDE 29

The Geometric Diagonal

Geometric diagonal ∆X : X → X × X is defined x → (x, x) A homeomorphism h : X → Y respects diagonals ∆Y h = (h × h) ∆X Objective: Compute the obstruction to a homeomorphism h : UN → LN

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 14 / 28

slide-30
SLIDE 30

The Geometric Diagonal

Geometric diagonal ∆X : X → X × X is defined x → (x, x) A homeomorphism h : X → Y respects diagonals ∆Y h = (h × h) ∆X Objective: Compute the obstruction to a homeomorphism h : UN → LN Strategy:

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 14 / 28

slide-31
SLIDE 31

The Geometric Diagonal

Geometric diagonal ∆X : X → X × X is defined x → (x, x) A homeomorphism h : X → Y respects diagonals ∆Y h = (h × h) ∆X Objective: Compute the obstruction to a homeomorphism h : UN → LN Strategy:

Assume there is a homeomorphism h

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 14 / 28

slide-32
SLIDE 32

The Geometric Diagonal

Geometric diagonal ∆X : X → X × X is defined x → (x, x) A homeomorphism h : X → Y respects diagonals ∆Y h = (h × h) ∆X Objective: Compute the obstruction to a homeomorphism h : UN → LN Strategy:

Assume there is a homeomorphism h Show that h fails to respect diagonals

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 14 / 28

slide-33
SLIDE 33

The Geometric Diagonal

Problem: Im ∆X is typically not a subcomplex of X × X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 15 / 28

slide-34
SLIDE 34

The Geometric Diagonal

Problem: Im ∆X is typically not a subcomplex of X × X Example: Im ∆I is not a subcomplex of I × I :

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 15 / 28

slide-35
SLIDE 35

Diagonal Approximations

A map ∆ : X → X × X is a diagonal approximation if

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 16 / 28

slide-36
SLIDE 36

Diagonal Approximations

A map ∆ : X → X × X is a diagonal approximation if

∆ is homotopic to ∆X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 16 / 28

slide-37
SLIDE 37

Diagonal Approximations

A map ∆ : X → X × X is a diagonal approximation if

∆ is homotopic to ∆X ∆ (en) is a subcomplex of en × en for every n-cell en ⊆ X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 16 / 28

slide-38
SLIDE 38

Diagonal Approximations

A map ∆ : X → X × X is a diagonal approximation if

∆ is homotopic to ∆X ∆ (en) is a subcomplex of en × en for every n-cell en ⊆ X Geometric boundary ∂ : X → X is a coderivation of ∆ ∆∂ = (∂ × Id + Id ×∂) ∆

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 16 / 28

slide-39
SLIDE 39

Diagonal Approximations

A map ∆ : X → X × X is a diagonal approximation if

∆ is homotopic to ∆X ∆ (en) is a subcomplex of en × en for every n-cell en ⊆ X Geometric boundary ∂ : X → X is a coderivation of ∆ ∆∂ = (∂ × Id + Id ×∂) ∆

Cellular Approximation Theorem There is a diagonal approximation ∆ : X → X × X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 16 / 28

slide-40
SLIDE 40

Diagonal Approximations

Preserve Cellular structure: ∆ (en) ⊆ en × en

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 17 / 28

slide-41
SLIDE 41

Diagonal Approximations

Preserve Cellular structure: ∆ (en) ⊆ en × en Dimension: dim ∆ (en) = dim en

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 17 / 28

slide-42
SLIDE 42

Diagonal Approximations

Preserve Cellular structure: ∆ (en) ⊆ en × en Dimension: dim ∆ (en) = dim en Cartesian products: ∆ (X × Y ) = ∆ (X) × ∆ (Y )

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 17 / 28

slide-43
SLIDE 43

Diagonal Approximations

Preserve Cellular structure: ∆ (en) ⊆ en × en Dimension: dim ∆ (en) = dim en Cartesian products: ∆ (X × Y ) = ∆ (X) × ∆ (Y ) Wedge products: ∆ (X ∨ Y ) = ∆ (X) ∨ ∆ (Y )

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 17 / 28

slide-44
SLIDE 44

Dan Kravatz’s Diagonal Approximation on a Polygon

Given n-gon G, arbitrarily choose vertices v and v (possibly equal)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 18 / 28

slide-45
SLIDE 45

Dan Kravatz’s Diagonal Approximation on a Polygon

Given n-gon G, arbitrarily choose vertices v and v (possibly equal) Edges {e1, . . . , ek} and {ek+1, . . . , en} form paths from v to v (one path {e1, . . . , en} if v = v )

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 18 / 28

slide-46
SLIDE 46

Dan Kravatz’s Diagonal Approximation on a Polygon

Given n-gon G, arbitrarily choose vertices v and v (possibly equal) Edges {e1, . . . , ek} and {ek+1, . . . , en} form paths from v to v (one path {e1, . . . , en} if v = v ) Theorem (Kravatz 2008): There is a diagonal approximation ∆G = v × G + G × v +

k

i=2

(e1 + · · · + ei−1) × ei +

n

j=k+2

(ek+1 + · · · + ej−1) × ej

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 18 / 28

slide-47
SLIDE 47

Example

Think of the pinched sphere t1 ⊂ ∂ (UN) as a 2-gon with vertices identified first, then edges identified ∆t1 = v × t1 + t1 × v ∆ descends to quotients when edge-paths are consistent with identifications

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 19 / 28

slide-48
SLIDE 48

Example

Think of the torus t

1 ⊂ ∂ (LN) as a square with horizontal edges a

identified and vertical edges b identified ∆t

1 = v × t 1 + t 1 × v + a × b + b × a

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 20 / 28

slide-49
SLIDE 49

Cellular Chains

C (X) denotes the Z2-vector space with basis {cells of X}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 21 / 28

slide-50
SLIDE 50

Cellular Chains

C (X) denotes the Z2-vector space with basis {cells of X}

Elements are formal sums called cellular chains of X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 21 / 28

slide-51
SLIDE 51

Cellular Chains

C (X) denotes the Z2-vector space with basis {cells of X}

Elements are formal sums called cellular chains of X

Examples:

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 21 / 28

slide-52
SLIDE 52

Cellular Chains

C (X) denotes the Z2-vector space with basis {cells of X}

Elements are formal sums called cellular chains of X

Examples:

C (UN) has basis {v, a, b, s, t1, t2, p, q}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 21 / 28

slide-53
SLIDE 53

Cellular Chains

C (X) denotes the Z2-vector space with basis {cells of X}

Elements are formal sums called cellular chains of X

Examples:

C (UN) has basis {v, a, b, s, t1, t2, p, q} C (LN) has basis {v, a, b, s, t

1, t 2, p, q}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 21 / 28

slide-54
SLIDE 54

Cellular Chains

C (X) denotes the Z2-vector space with basis {cells of X}

Elements are formal sums called cellular chains of X

Examples:

C (UN) has basis {v, a, b, s, t1, t2, p, q} C (LN) has basis {v, a, b, s, t

1, t 2, p, q}

Note that C (UN) ≈ C (LN)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 21 / 28

slide-55
SLIDE 55

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-56
SLIDE 56

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-57
SLIDE 57

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2 ∂ (∂en) = ∂Sn−1 = ∅

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-58
SLIDE 58

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2 ∂ (∂en) = ∂Sn−1 = ∅

Boundary operator ∂ : C (X) → C (X)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-59
SLIDE 59

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2 ∂ (∂en) = ∂Sn−1 = ∅

Boundary operator ∂ : C (X) → C (X)

Induced by the geometric boundary

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-60
SLIDE 60

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2 ∂ (∂en) = ∂Sn−1 = ∅

Boundary operator ∂ : C (X) → C (X)

Induced by the geometric boundary Zero on vertices

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-61
SLIDE 61

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2 ∂ (∂en) = ∂Sn−1 = ∅

Boundary operator ∂ : C (X) → C (X)

Induced by the geometric boundary Zero on vertices Linear on chains

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-62
SLIDE 62

The Boundary Operator

Geometric boundary of an n-cell en is Sn−1

∂v = ∅; ∂e = S0; ∂f = S1; ∂s = S2 ∂ (∂en) = ∂Sn−1 = ∅

Boundary operator ∂ : C (X) → C (X)

Induced by the geometric boundary Zero on vertices Linear on chains A derivation of the Cartesian product ∂ (a × b) = ∂a × b + a × ∂b

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 22 / 28

slide-63
SLIDE 63

Examples

∂ : C (UN) → C (UN) is defined ∂v = ∂a = ∂b = ∂s = ∂t1 = ∂t2 = 0 ∂p = s ∂q = s + t1 + t2

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 23 / 28

slide-64
SLIDE 64

Examples

∂ : C (UN) → C (UN) is defined ∂v = ∂a = ∂b = ∂s = ∂t1 = ∂t2 = 0 ∂p = s ∂q = s + t1 + t2 ∂ : C (LN) → C (LN) is defined ∂v = ∂a = ∂b = ∂s = ∂t

1 = ∂t 2 = 0

∂p = s ∂q = s + t

1 + t 2

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 23 / 28

slide-65
SLIDE 65

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-66
SLIDE 66

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-67
SLIDE 67

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X Elements of H (X) are cosets [c] := c + Im ∂

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-68
SLIDE 68

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X Elements of H (X) are cosets [c] := c + Im ∂ Examples

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-69
SLIDE 69

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X Elements of H (X) are cosets [c] := c + Im ∂ Examples

H (UN) = {[v] , [a] , [b] , [t1] = [t2]}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-70
SLIDE 70

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X Elements of H (X) are cosets [c] := c + Im ∂ Examples

H (UN) = {[v] , [a] , [b] , [t1] = [t2]} H (LN) = {[v] , [a] , [b] , [t

1] = [t 2]}

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-71
SLIDE 71

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X Elements of H (X) are cosets [c] := c + Im ∂ Examples

H (UN) = {[v] , [a] , [b] , [t1] = [t2]} H (LN) = {[v] , [a] , [b] , [t

1] = [t 2]}

Note that H (UN) ≈ H (LN)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-72
SLIDE 72

Cellular Homology

∂ ◦ ∂ = 0 implies Im ∂ ⊆ ker ∂ H (X) := ker ∂/ Im ∂ is the cellular homology of X Elements of H (X) are cosets [c] := c + Im ∂ Examples

H (UN) = {[v] , [a] , [b] , [t1] = [t2]} H (LN) = {[v] , [a] , [b] , [t

1] = [t 2]}

Note that H (UN) ≈ H (LN)

How do diagonal approximations on UN and LN lift to homology?

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 24 / 28

slide-73
SLIDE 73

Key Facts

Homotopic maps of spaces induce the same map on their homologies

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 25 / 28

slide-74
SLIDE 74

Key Facts

Homotopic maps of spaces induce the same map on their homologies Every diagonal approximation ∆ : X → X × X induces the same map ∆2 : H (X) → H (X × X)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 25 / 28

slide-75
SLIDE 75

Key Facts

Homotopic maps of spaces induce the same map on their homologies Every diagonal approximation ∆ : X → X × X induces the same map ∆2 : H (X) → H (X × X) A homeomorphism h : X → Y induces maps h∗ : H (X) → H (Y ) and (h × h)∗ : H (X × X) → H (Y × Y ) such that ∆2h∗ = (h × h)∗ ∆2

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 25 / 28

slide-76
SLIDE 76

Key Facts

Homotopic maps of spaces induce the same map on their homologies Every diagonal approximation ∆ : X → X × X induces the same map ∆2 : H (X) → H (X × X) A homeomorphism h : X → Y induces maps h∗ : H (X) → H (Y ) and (h × h)∗ : H (X × X) → H (Y × Y ) such that ∆2h∗ = (h × h)∗ ∆2 If h : UN → LN is a homeomorphism, inequality is a contradiction

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 25 / 28

slide-77
SLIDE 77

Homology of Cartesian Products

If vector space A has basis {a1, . . . , ak} , the tensor product vector space A ⊗ A has basis {ai ⊗ aj}1≤i,j≤k

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 26 / 28

slide-78
SLIDE 78

Homology of Cartesian Products

If vector space A has basis {a1, . . . , ak} , the tensor product vector space A ⊗ A has basis {ai ⊗ aj}1≤i,j≤k C (X × X) ≈ C (X) ⊗ C (X) via e × e → e ⊗ e

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 26 / 28

slide-79
SLIDE 79

Homology of Cartesian Products

If vector space A has basis {a1, . . . , ak} , the tensor product vector space A ⊗ A has basis {ai ⊗ aj}1≤i,j≤k C (X × X) ≈ C (X) ⊗ C (X) via e × e → e ⊗ e The boundary map ∂ × Id + Id ×∂ : X × X → X × X induces the boundary operator ∂ ⊗ Id + Id ⊗∂ : C (X) ⊗ C (X) → C (X) ⊗ C (X)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 26 / 28

slide-80
SLIDE 80

Homology of Cartesian Products

If vector space A has basis {a1, . . . , ak} , the tensor product vector space A ⊗ A has basis {ai ⊗ aj}1≤i,j≤k C (X × X) ≈ C (X) ⊗ C (X) via e × e → e ⊗ e The boundary map ∂ × Id + Id ×∂ : X × X → X × X induces the boundary operator ∂ ⊗ Id + Id ⊗∂ : C (X) ⊗ C (X) → C (X) ⊗ C (X) Since Z2 is a field, torsion vanishes and H (X × X) ≈ H (X) ⊗ H (X)

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 26 / 28

slide-81
SLIDE 81

Induced Diagonal on H(X)

A diagonal approximation ∆ : X → X × X induces a coproduct ∆2 : H (X) → H (X) ⊗ H (X) defined by ∆2 [c] := [∆c]

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 27 / 28

slide-82
SLIDE 82

Induced Diagonal on H(X)

A diagonal approximation ∆ : X → X × X induces a coproduct ∆2 : H (X) → H (X) ⊗ H (X) defined by ∆2 [c] := [∆c] A class [c] of positive dimension is primitive if ∆2 [c] = [v] ⊗ [c] + [c] ⊗ [v]

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 27 / 28

slide-83
SLIDE 83

Induced Diagonal on H(X)

A diagonal approximation ∆ : X → X × X induces a coproduct ∆2 : H (X) → H (X) ⊗ H (X) defined by ∆2 [c] := [∆c] A class [c] of positive dimension is primitive if ∆2 [c] = [v] ⊗ [c] + [c] ⊗ [v] Examples ∆2 [t1] = [∆t1] = [v] ⊗ [t1] + [t1] ⊗ [v] ∆2

  • t

1

=

  • ∆t

1

= [v] ⊗

  • t

1

+

  • t

1

⊗ [v] + [a] ⊗ [b] + [b] ⊗ [a]

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 27 / 28

slide-84
SLIDE 84

Non-Primitivity Detects Linkage

If h : UN → LN is a homeomorphism, (h∗ ⊗ h∗) ∆2 = ∆2h∗

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 28 / 28

slide-85
SLIDE 85

Non-Primitivity Detects Linkage

If h : UN → LN is a homeomorphism, (h∗ ⊗ h∗) ∆2 = ∆2h∗ But h∗ [t1] = [t

1] implies

(h∗ ⊗ h∗) ∆2 [t1] = (h∗ ⊗ h∗) ([v] ⊗ [t1] + [t1] ⊗ [v]) = [v] ⊗

  • t

1

+

  • t

1

⊗ [v] = [v] ⊗

  • t

1

+

  • t

1

⊗ [v] + [a] ⊗ [b] + [b] ⊗ [a] = ∆2

  • t

1

= ∆2h∗ [t1] , which is a contradiction

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 28 / 28

slide-86
SLIDE 86

Non-Primitivity Detects Linkage

If h : UN → LN is a homeomorphism, (h∗ ⊗ h∗) ∆2 = ∆2h∗ But h∗ [t1] = [t

1] implies

(h∗ ⊗ h∗) ∆2 [t1] = (h∗ ⊗ h∗) ([v] ⊗ [t1] + [t1] ⊗ [v]) = [v] ⊗

  • t

1

+

  • t

1

⊗ [v] = [v] ⊗

  • t

1

+

  • t

1

⊗ [v] + [a] ⊗ [b] + [b] ⊗ [a] = ∆2

  • t

1

= ∆2h∗ [t1] , which is a contradiction The non-primitive coproduct has detected the Hopf Link!

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 28 / 28

slide-87
SLIDE 87

Recap

Homology alone cannot distinguish links from unlinks.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-88
SLIDE 88

Recap

Homology alone cannot distinguish links from unlinks. For example, H (UN) = {[v] , [a] , [b] , [t1] = [t2]} and H (LN) = [v] , [a] , [b] ,

  • t′

1

=

  • t′

2

  • ,

so H (UN) ≈ H (LN).

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-89
SLIDE 89

Recap

Homology alone cannot distinguish links from unlinks. For example, H (UN) = {[v] , [a] , [b] , [t1] = [t2]} and H (LN) = [v] , [a] , [b] ,

  • t′

1

=

  • t′

2

  • ,

so H (UN) ≈ H (LN). But perhaps homology with additional structure derived from diagonal approximations can distinguish between links.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-90
SLIDE 90

Recap

Homology alone cannot distinguish links from unlinks. For example, H (UN) = {[v] , [a] , [b] , [t1] = [t2]} and H (LN) = [v] , [a] , [b] ,

  • t′

1

=

  • t′

2

  • ,

so H (UN) ≈ H (LN). But perhaps homology with additional structure derived from diagonal approximations can distinguish between links. For example, the coproducts, ∆2, induced by diagonal approximations are different for UN and LN. ∆2 [t1] = [v] ⊗ [t1] + [t1] ⊗ [v] is primitive. ∆2

  • t′

1

  • =

[v] ⊗

  • t′

1

+

  • t′

1

⊗ [v] + [a] ⊗ [b] + [b] ⊗ [a] is not primitive.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-91
SLIDE 91

Definition

Definition: A nontrivial link is called Brunnian if it has the following property: Removing any component results in an unlink.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 2 / 12

slide-92
SLIDE 92

Definition

Definition: A nontrivial link is called Brunnian if it has the following property: Removing any component results in an unlink. (a non-standard) Example: The Hopf link.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 2 / 12

slide-93
SLIDE 93

Definition

Definition: A nontrivial link is called Brunnian if it has the following property: Removing any component results in an unlink. (a non-standard) Example: The Hopf link. (the most standard) Example: The Borromean rings.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 2 / 12

slide-94
SLIDE 94

Definition

Definition: A nontrivial link is called Brunnian if it has the following property: Removing any component results in an unlink. (a non-standard) Example: The Hopf link. (the most standard) Example: The Borromean rings. Convention: Let BRn denote the complement in S3 of a Brunnian link with n components where n > 3.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 2 / 12

slide-95
SLIDE 95

Conjecture

Conjecture: A diagonal approximation ∆ on C (BRn) induces a primitive diagonal ∆2 : H (BRn) → H (BRn) ⊗ H (BRn),

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 3 / 12

slide-96
SLIDE 96

Conjecture

Conjecture: A diagonal approximation ∆ on C (BRn) induces a primitive diagonal ∆2 : H (BRn) → H (BRn) ⊗ H (BRn), trivial k-ary operations ∆k : H (BRn) → H (BRn)⊗k for 3 ≤ k < n, and

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 3 / 12

slide-97
SLIDE 97

Conjecture

Conjecture: A diagonal approximation ∆ on C (BRn) induces a primitive diagonal ∆2 : H (BRn) → H (BRn) ⊗ H (BRn), trivial k-ary operations ∆k : H (BRn) → H (BRn)⊗k for 3 ≤ k < n, and a non-trivial n-ary operation ∆n : H (BR) → H (BR)⊗n.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 3 / 12

slide-98
SLIDE 98

Work to do

Describe an infinite family of Brunnian links, including cell decompositions and diagonal approximations.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 12

slide-99
SLIDE 99

Work to do

Describe an infinite family of Brunnian links, including cell decompositions and diagonal approximations. (computationally) Transfer the differential graded coalgebra structure

  • n the chains to homology.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 12

slide-100
SLIDE 100

Work to do

Describe an infinite family of Brunnian links, including cell decompositions and diagonal approximations. (computationally) Transfer the differential graded coalgebra structure

  • n the chains to homology.

(hopefully) Observe the conjectured results.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 12

slide-101
SLIDE 101

Work to do

Describe an infinite family of Brunnian links, including cell decompositions and diagonal approximations. (computationally) Transfer the differential graded coalgebra structure

  • n the chains to homology.

(hopefully) Observe the conjectured results. Prove them in general.

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 4 / 12

slide-102
SLIDE 102

The Hopf link: A Brunnian link with two components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 5 / 12

slide-103
SLIDE 103

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-104
SLIDE 104

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-105
SLIDE 105

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-106
SLIDE 106

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-107
SLIDE 107

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-108
SLIDE 108

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-109
SLIDE 109

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-110
SLIDE 110

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-111
SLIDE 111

Constructing a Brunnian link with 3 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-112
SLIDE 112

Constructing a Brunnian link with 4 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 7 / 12

slide-113
SLIDE 113

Constructing a Brunnian link with 4 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 7 / 12

slide-114
SLIDE 114

Constructing a Brunnian link with 4 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 7 / 12

slide-115
SLIDE 115

Constructing a Brunnian link with 4 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 7 / 12

slide-116
SLIDE 116

Constructing a Brunnian link with 4 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 7 / 12

slide-117
SLIDE 117

Constructing a Brunnian link with 5 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-118
SLIDE 118

Constructing a Brunnian link with 5 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-119
SLIDE 119

Constructing a Brunnian link with 5 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-120
SLIDE 120

Constructing a Brunnian link with 5 components

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-121
SLIDE 121

And so on . . .

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 9 / 12

slide-122
SLIDE 122

And so on . . .

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 9 / 12

slide-123
SLIDE 123

And so on . . .

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 9 / 12

slide-124
SLIDE 124

And so on . . .

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 9 / 12

slide-125
SLIDE 125

Assume the constructed links are Brunnian for k = n

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-126
SLIDE 126

Assume the constructed links are Brunnian for k = n

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-127
SLIDE 127

Assume the constructed links are Brunnian for k = n

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-128
SLIDE 128

Assume the constructed links are Brunnian for k = n

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-129
SLIDE 129

Assume the constructed links are Brunnian for k = n

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-130
SLIDE 130

Assume the constructed links are Brunnian for k = n

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-131
SLIDE 131

Then the constructed links are Brunnian for k = n + 1

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-132
SLIDE 132

Then the constructed links are Brunnian for k = n + 1

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-133
SLIDE 133

An example of a cell decomposition

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 12

slide-134
SLIDE 134

An example of a cell decomposition

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 12

slide-135
SLIDE 135

An example of a cell decomposition

Tetrahedral Geometry/Topology Seminar ( Tetrahedral Geometry/Topology Seminar ) Detecting Brunnian Linkage December 4, 2015 12 / 12

slide-136
SLIDE 136

Software Components

We require the following software components: parser for reading chain complex C and coproduct definition ∆C

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-137
SLIDE 137

Software Components

We require the following software components: parser for reading chain complex C and coproduct definition ∆C utility to validate ∆C

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-138
SLIDE 138

Software Components

We require the following software components: parser for reading chain complex C and coproduct definition ∆C utility to validate ∆C program to compute homology (H) and a cycle-selecting map g : H → C

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-139
SLIDE 139

Software Components

We require the following software components: parser for reading chain complex C and coproduct definition ∆C utility to validate ∆C program to compute homology (H) and a cycle-selecting map g : H → C program to initialize transfer of coproduct ∆C : C → C ⊗ C to homology ∆2 : H → H ⊗ H

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-140
SLIDE 140

Software Components

We require the following software components: parser for reading chain complex C and coproduct definition ∆C utility to validate ∆C program to compute homology (H) and a cycle-selecting map g : H → C program to initialize transfer of coproduct ∆C : C → C ⊗ C to homology ∆2 : H → H ⊗ H program to inductively compute higher coalgebraic structures in homology (∆n)

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 1 / 12

slide-141
SLIDE 141

Complex Specification (UN)

Used a subset of LaTeX to specify chain complexes Cells Boundary

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 2 / 12

slide-142
SLIDE 142

Complex Specification (UN)

Diagonals

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 3 / 12

slide-143
SLIDE 143

Complex Specification (LN)

For Hopf link, the cells and boundary are identical, Cells Boundary

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 4 / 12

slide-144
SLIDE 144

Complex Specification (LN)

But the diagonals are different, Diagonals

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 5 / 12

slide-145
SLIDE 145

Parser

written in Python uses open-source library PLY (Python Lex-Yacc)

specify tokens specify formal grammar using tokens it generates LR parser

additionally wrote utility to export ChainComplex objects for SageMath

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 6 / 12

slide-146
SLIDE 146

Validating Coproduct Definition

Need to verify that ∆∂ = (1 ⊗ ∂ + ∂ ⊗ 1)∆. We have a script that checks this for all c ∈ C.

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 7 / 12

slide-147
SLIDE 147

Computing Homology

Computational Homology Project software: CHomP

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-148
SLIDE 148

Computing Homology

Computational Homology Project software: CHomP

computes homology from incidence matrices

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-149
SLIDE 149

Computing Homology

Computational Homology Project software: CHomP

computes homology from incidence matrices can return generators

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-150
SLIDE 150

Computing Homology

Computational Homology Project software: CHomP

computes homology from incidence matrices can return generators

we interface with CHomP to obtain H

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-151
SLIDE 151

Computing Homology

Computational Homology Project software: CHomP

computes homology from incidence matrices can return generators

we interface with CHomP to obtain H use generators to construct cycle-selecting function g

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 8 / 12

slide-152
SLIDE 152

Computing ∆2 on UN

We (computationally) confirm that ∆2 on the wedge of two pinched spheres is primitive.

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 9 / 12

slide-153
SLIDE 153

Computing ∆2 on LN

We (computationally) confirm that ∆2 on the Hopf link is non-primitive!

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 10 / 12

slide-154
SLIDE 154

Work in Progress

What is left to be done? finish implementing inductive step for ∆n

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-155
SLIDE 155

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-156
SLIDE 156

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links compute some (hopefully interesting) results

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-157
SLIDE 157

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links compute some (hopefully interesting) results add infrastructure to SageMath to do computations in there

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-158
SLIDE 158

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links compute some (hopefully interesting) results add infrastructure to SageMath to do computations in there

supports chain complexes...

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-159
SLIDE 159

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links compute some (hopefully interesting) results add infrastructure to SageMath to do computations in there

supports chain complexes... but lacks DG-(co)algebra

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-160
SLIDE 160

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links compute some (hopefully interesting) results add infrastructure to SageMath to do computations in there

supports chain complexes... but lacks DG-(co)algebra has polytopes for Associahedron and Multiplihedron...

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-161
SLIDE 161

Work in Progress

What is left to be done? finish implementing inductive step for ∆n generate and validate diagonals of higher component Brunnian links compute some (hopefully interesting) results add infrastructure to SageMath to do computations in there

supports chain complexes... but lacks DG-(co)algebra has polytopes for Associahedron and Multiplihedron... but lacks combinatorics and iterators

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 11 / 12

slide-162
SLIDE 162

The End

Thank you!

Tetrahedral Geometry/Topology Seminar Detecting Brunnian Linkage December 4, 2015 12 / 12