No Quadrilateral/Pentagon Knots: Simple Closed Polygons are Trivial

  • Context: Graduate 
  • Thread starter Thread starter Bacle
  • Start date Start date
  • Tags Tags
    Closed Polygons
Click For Summary
SUMMARY

This discussion centers on the properties of simple polygonal knots in R^2, asserting that every simple polygonal knot is trivial. The participants explore the construction of homeomorphisms between polygonal knots and circles, specifically S^1, and discuss the impossibility of knotted quadrilateral and pentagonal knots. Key definitions include knot equivalence, ambient isotopy, and the characteristics of trivial and polygonal knots, with the conclusion that pentagonal knots can have at most two crossings and hexagonal knots can have at most three alternating crossings.

PREREQUISITES
  • Understanding of knot theory, particularly the concepts of homeomorphism and isotopy.
  • Familiarity with the definitions of trivial knots and polygonal knots.
  • Knowledge of basic topology, especially in relation to embeddings in R^3.
  • Concept of ambient isotopy and its implications for knot equivalence.
NEXT STEPS
  • Research the properties of homeomorphisms in topology.
  • Study the concept of ambient isotopy and its applications in knot theory.
  • Explore the classification of knots based on crossings and their equivalence classes.
  • Investigate the implications of polygonal knots in higher-dimensional spaces.
USEFUL FOR

Mathematicians, topologists, and students studying knot theory, as well as anyone interested in the geometric properties of simple closed polygons and their triviality in R^2.

Bacle
Messages
656
Reaction score
1
Hi, everyone:

I would appreciate any help with the following:

I am trying to refresh my knot theory--it's been a while. I am trying to answer
the following:

1) Every simple polygonal knot P in R^2 is trivial.:

I have tried to actually construct a homeomorphism h:R^3 -->R^3 , with

h|_P = S^1 , i.e., the restriction of the automorphism h to the poly. knot P gives

us S^1

I actually tried going in the opposite direction by creating a homeo. between a

polygonal knot P and S^1 (and seeing if I can extend it to h:R^3 -->R^3 ):

find a circle C going through the vertices of P (So that C an P are coplanar)

and then smoothly deform P to S^1. But I cannot see how to extend this to

an homeo. h:R^3 -->R^3 that restricts to this map.


2) Show there are no knotted quadrilateral nor pentagonal knots.

I have no clue here. Any Ideas.?.

Thanks.
 
Physics news on Phys.org


I don't know anything about knots but if you explain what knot equivalence is and what a polygonal knot and a trivial knot are - maybe we could figure it out.
 


Sorry, Wofsy, I completely missed your reply:

i) A knot is just an embedding of S^1 in R^3 (there are other types of knots, but

these are the ones I am referring to. )*. For this reason, any two knots are

homeomorphic, and ( I think ) isotopic (see below). So we distinguish knots

by using:

ii) Knots K,K' are equivalent if there exists an ambient isotopy between them.

(An isotopy is a homotopy thru isomorphisms, i.e., each of the maps f(s,t)

in a homotopy is not just continuous, but a homeomorphism. )

Assumming the knots are embedded in R^3 , an ambient isotopy is an

isotopy from R^3-->R^3 that restricts to an isotopy from K to K'


iii) A trivial knot is any knot in the equivalence class of the trivial embedding

i:S^1-->R^3 (inclusion.).

iv) A polygonal knot is one that is the union of a finite number of closed

straight-line segments; the endpoints of these segments are the vertices

of the knot.


Like it often happens, I did prove this; I presented my proof to a prof., then

I forgot it.




* More generally, given a pair (A,S) , then A is knotted in S if there are different

classes of isotopic embeddings of A in S.
 


Any projection of a quadrilateral "knot" can have at most one crossing, so that rules them out. And I think that a pentagonal knot could be projected onto a plane perpendicular to one of the segments, and in this projection it would appear to be a quadrilateral knot, and again have only one crossing.
 
Last edited:


Tiny Boss:

Sorry, I wrong said a quadrilateral. I meant a pentagon --maybe kremlin --
or a hexagon. I think I can show a pentagonal knot can have at most two
crossings and a hexagonal can have at most three (alternating ones.) . I
don't know if my argument is correct, but I am basing it on this:

we need to use up two vertices before doing a crossing. After that,
we can do crossings with the third and forth vertices. After that, we
complete the loop (joining the 5th vertex with the 1st vertex), so
we can have at most two crossings. Similarly for the hexagonal knot:
we can have at most three alternating crossings. I know that we cannot
have an unknot with two crossing alone, and I think it should not be
too hard to show that we can unknot a graph with three alternate crossings.


But of course, that is not a proof.
 

Similar threads

  • · Replies 30 ·
2
Replies
30
Views
4K
  • · Replies 5 ·
Replies
5
Views
6K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 69 ·
3
Replies
69
Views
9K
  • · Replies 1 ·
Replies
1
Views
3K