What do these knots have in common? Hint: Numbers can be categorized as this, also

Factorization of Knots and the Uniqueness of this Process By Lindsay Fox

Comparison to Factorization of Integers Fundamental Theorem of Arithmetic States that every positive integer greater than 1 is either prime or composite Additionally, there is only one way to write the number, meaning that the factorization is unique (up to order) 300 = 2 2 · 3· 5 2 Therefore, 300 is a composite number

Schubert & Factoring Knots 1949, Schubert proves that decomposition of knots is unique up to order. Prime Knot: Cannot be decomposed further It’s factors are itself and the unknot Composite Knot Can be decomposed into nontrivial knots, and this factorization is unique Trivial Knot The unknot is the trivial knot. Not prime; not composite

Examples of Prime Knots Euclid proved that there are an infinite number of prime numbers Euclid proved that there are an infinite number of prime numbers Likewise, there are an infinite number of prime knots. Likewise, there are an infinite number of prime knots. Here are a few Here are a few

How to factor knots? Dissecting sphere system This incorporates a sphere, S, which intersects the knot, K, at precisely 2 points transversely S divides K into two components, one ball on the interior of the sphere, one on the exterior Factoring is the opposite of a connect sum Factoring is the opposite of a connect sum

Dissecting Sphere System Intersection of S and K must be transverse Intersection of S and K must be transverse S  2S balls that are 3-D balls (one on interior; one on exterior of S ) S  2S balls that are 3-D balls (one on interior; one on exterior of S ) Each dss generates S+1 prime factors Each dss generates S+1 prime factors If S>1, more than one ball will determine the same factor If S>1, more than one ball will determine the same factor Picture taken from Sullivan’s “Knot Factoring”

Dissecting Sphere System cont… Each S determines a factor for its region, int(s i ) Each S determines a factor for its region, int(s i ) o Region inside of sphere, but outside of other spheres o Ex: S 2 Picture taken from Sullivan’s “Knot Factoring”

Uniqueness of Factorization Uniqueness: One way to factor knots (disregarding order) We can relate this to the proof of uniqueness for integers (below looks like Euclid’s Theorem): K is a prime knot, then K|L+M implies that K|L or that K|M

Uniqueness of Factorization K can be decomposed in different ways, let’s say by getting the two sequences of factors: K 1, K 2 ….K m and K 1 ’,K 2 ’…K’ n. If we number the two sequences in the same way, then as they go on, m=n, and so K 1 ≈ K 1 ’, K 2 ≈ K 2 ’…K m ≈K m ’

Switching Move Idea: Remove a sphere and draw another sphere that is disjoint from the other spheres o Result: This “switching” of spheres will still result in the same factorization, and thus factorization is unique Things to think about: o Two knots cannot be encompassed in a larger sphere S, if there is no smaller sphere inside of S that separates the two knots Lemma: Suppose S 2 is the sphere to be deleted; S’ 2 is the sphere to be added Once S’ 2 is drawn, if S 2 was the outermost sphere within S’ 2, then if S’ 2 and S determine the same knot, then S’ 2 ~ S

Implications of Schubert’s Discovery Knot theorists can study the primes that compose more complex knots, which simplifies the process drastically o Invariants of primes v. invariants of large knots Can tell what primes make up more complex knots Just as Fundamental Theorem of Arithmetic was fundamental for number theory, so too is Schubert’s discovery of unique factorization of knots fundamental for knot theory

Sources f(second slide) f b/0/04/TrefoilKnot_01.svg/220px-TrefoilKnot_01.svg.png (2) b/0/04/TrefoilKnot_01.svg/220px-TrefoilKnot_01.svg.png (first slide) (trefoil) b/6/6a/Blue_Square_Knot.png/300px- Blue_Square_Knot.png (composite) b/6/6a/Blue_Square_Knot.png/300px- Blue_Square_Knot.png b/3/37/Blue_Unknot.png/150px-Blue_Unknot.png b/3/37/Blue_Unknot.png/150px-Blue_Unknot.png